test_extracted_captions/fuExpertRepresentationDesign2013.json

{"CAPTION FIG2.png": "'\\n\\n[MISSING_PAGE_POST]\\n\\n'", "CAPTION TAB2.png": "'\\n\\n\\\\begin{table}\\n\\\\begin{tabular}{l l'", "CAPTION TAB3.png": "'\\n\\n**Table 3 Algorithm structure nodes evaluated by experts during interview**'", "CAPTION FIG4.png": "'\\n\\n## Chapter 4 Algorithm\\n\\n### 4.1 Algorithm\\n\\nThe algorithm is a simple algorithm for the computation of the \\\\(n\\\\)-th order polynomial in \\\\(n\\\\) variables. The algorithm is based on the following algorithm:\\n\\n1. [label=()]\\n\\n[MISSING_PAGE_POST]\\n\\n'", "CAPTION TAB1.png": "'\\n\\n\\\\begin{table}\\n\\\\begin{tabular}{l l} \\\\hline \\\\hline  & \\\\\\\\ \\\\end{tabular}\\n\\\\end{table}\\nTable 1: Correlations between participant and algorithm-generated structures of patents'", "CAPTION TAB6.png": "'\\n\\n## References\\n\\n* [1] A. A. K. K.\\n\\n'", "CAPTION TAB4.png": "'\\n\\n**Table 4 Mean extent reaches to each of the algorithm nodes.**'", "CAPTION TAB5.png": "'\\n\\n## References\\n\\n* [1] A. A. K. K. (1999) The \\\\(\\\\chi\\\\)-function of the \\\\(\\\\chi'", "CAPTION FIG3.png": "'\\n\\n[MISSING_PAGE_POST]\\n\\n'", "CAPTION FIG5.png": "\"\\n\\n## Chapter 4 Hurwitz and Euler's\\n\\n\"", "CAPTION FIG6.png": "'\\n\\n## Appendix A Proof of Theorem 1\\n\\n### Proof of Theorem 1\\n\\nProof of Theorem 1\\n'", "CAPTION FIGAPPB.png": "'* [16] A.\\n\\n'", "CAPTION FIG7.png": "'\\n\\n## Appendix A'", "CAPTION TAB APPA.png": "'\\n\\n## Appendix A\\n\\n45 Patents used in algorithm generated structure'", "CAPTION FIG1.png": "'Figure 1: Planning chain of possible outcomes of study and main possible inference.\\n\\n'"}