{"meta":{"query_hash":"7d8c86881a2d","filters":{"venue":"DCFS"},"cohort_total":15,"direct_labels_cover":0,"predictions_cover":15,"exported":15,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/7d8c86881a2d","api":"https://metacan.xera.ac/api/v1/cohort?venue=DCFS"},"results":[{"id":"W2394530209","doi":"","title":"Template-Guided DNA Recombination.","year":2003,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Saskatchewan","funders":"","keywords":"Recombination; DNA; Gene; Genetics; Process (computing); Computer science; Genome; Computational biology; Biology; Homologous recombination; Theoretical computer science; Evolutionary biology; Programming language","score_opus":0.024802027438084077,"score_gpt":0.2664438342051604,"score_spread":0.2416418067670763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394530209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13075686,0.015089475,0.7509825,0.0012008168,0.00073935534,0.00039082827,0.0007429225,0.0031245027,0.09697269],"genre_scores_gemma":[0.7940464,0.0063044745,0.15041071,0.00047387474,0.00007870874,0.00019962227,0.001504029,0.00022113559,0.04676102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980634,0.000027179556,0.000008146864,0.000052197764,0.000079086574,0.000027031387],"domain_scores_gemma":[0.9997527,0.00008104014,0.00004434446,0.00006205497,0.000024711202,0.00003523872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002380421,0.00024651308,0.0002846859,0.00030711232,0.0003097538,0.00073545123,0.0005560655,0.0006465868,0.0036062736],"category_scores_gemma":[0.0009184631,0.00011956608,0.00034677604,0.00037552806,0.00058201037,0.0006539991,0.0005673,0.00066464266,0.001669917],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015733344,0.00011035344,0.0011209241,0.0006660275,0.000036906145,0.00039643497,0.0002638299,0.011841969,0.20401211,0.5695959,0.009303886,0.20249446],"study_design_scores_gemma":[0.00008521945,0.00035525954,0.0013694904,0.00008792503,0.00004530588,0.0046442067,0.0001833959,0.16401501,0.3198035,0.19972195,0.30961433,0.00007439582],"about_ca_topic_score_codex":0.00050313555,"about_ca_topic_score_gemma":0.0004167155,"teacher_disagreement_score":0.0036062736,"about_ca_system_score_codex":0.00045234582,"about_ca_system_score_gemma":0.0002534822,"threshold_uncertainty_score":0.012064159},"labels":[],"label_agreement":null},{"id":"W2394623614","doi":"","title":"Descriptional Complexity of Block-Synchronization Context-Free Grammars.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Context-sensitive grammar; Tree-adjoining grammar; Symbol (formal); Indexed grammar; Context-free grammar; Abstract family of languages; Synchronization (alternating current); Computer science; L-attributed grammar; Context (archaeology); Rule-based machine translation; Block (permutation group theory); Mathematics; Theoretical computer science; Programming language; Natural language processing; Combinatorics; Second-generation programming language; Topology (electrical circuits)","score_opus":0.05291241192464367,"score_gpt":0.23365970887435047,"score_spread":0.18074729694970681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394623614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5087847,0.00081986125,0.47299892,0.0019144949,0.000035917154,0.00015549606,0.001859868,0.0003932393,0.013037543],"genre_scores_gemma":[0.9286476,0.00052585074,0.06483537,0.00019243252,0.00005044314,0.00025278714,0.0019186874,0.00014906407,0.0034278168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726796,0.00072218,0.00025215873,0.00044884454,0.00095032214,0.00035848867],"domain_scores_gemma":[0.9880795,0.009015081,0.0007713225,0.00096170773,0.0008039439,0.00036857848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002064631,0.00045167303,0.00062265346,0.0014033287,0.00096786435,0.0026755254,0.0012070702,0.00096659776,0.0032302036],"category_scores_gemma":[0.011793859,0.000492275,0.0014297174,0.001553528,0.002423421,0.0072483555,0.0020909829,0.0016853926,0.00033274954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014067745,0.0000620099,0.0042356015,0.00023318193,0.000071465794,0.0003667286,0.0010979942,0.07379334,0.0060056886,0.8886526,0.0015512643,0.023789514],"study_design_scores_gemma":[0.000017733635,0.000025105883,0.00069317524,0.000017394766,0.000027261094,0.00019920415,0.00015690984,0.14441513,0.0034882976,0.84829646,0.0026299316,0.000033346823],"about_ca_topic_score_codex":0.0031904578,"about_ca_topic_score_gemma":0.0020334471,"teacher_disagreement_score":0.0032302036,"about_ca_system_score_codex":0.0027946504,"about_ca_system_score_gemma":0.0014159166,"threshold_uncertainty_score":0.020276725},"labels":[],"label_agreement":null},{"id":"W2395596657","doi":"","title":"Operational State Complexity of Nested Word Automata.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Concatenation (mathematics); Nested word; Quantum finite automata; Finite-state machine; Mathematics; Discrete mathematics; Constant (computer programming); Upper and lower bounds; Automaton; Word (group theory); Deterministic finite automaton; Automata theory; Combinatorics; Computer science; Theoretical computer science; Algorithm","score_opus":0.04680536913484907,"score_gpt":0.24967884068656124,"score_spread":0.20287347155171218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2395596657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14791864,0.0015342181,0.8118414,0.0024931272,0.00027089493,0.0002689204,0.0019699882,0.0015232204,0.032179516],"genre_scores_gemma":[0.84957993,0.0011294269,0.13577023,0.0005268311,0.0003536997,0.00069393567,0.0025774727,0.0006734032,0.008695088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932575,0.0009935761,0.00055125967,0.001450667,0.0025594807,0.0011874415],"domain_scores_gemma":[0.95823485,0.032162838,0.0016451897,0.0045547346,0.0022235122,0.0011789675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003250771,0.0015379076,0.0016411375,0.0019858086,0.0018474769,0.0058026393,0.00412884,0.0017295083,0.013888247],"category_scores_gemma":[0.027160892,0.0010535462,0.0028704458,0.0018946409,0.003752393,0.018100858,0.004365987,0.007750353,0.0018853068],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003866084,0.00029831094,0.0026602354,0.0004682892,0.000098819044,0.00021612467,0.00091530714,0.07368003,0.014883505,0.8610468,0.0044724904,0.04087351],"study_design_scores_gemma":[0.00002241112,0.00006514577,0.00044209202,0.00003529108,0.000055885834,0.00011744346,0.000083066196,0.22395302,0.006725053,0.765282,0.0031834543,0.000035201265],"about_ca_topic_score_codex":0.0028233405,"about_ca_topic_score_gemma":0.0028854308,"teacher_disagreement_score":0.013888247,"about_ca_system_score_codex":0.004447362,"about_ca_system_score_gemma":0.002611753,"threshold_uncertainty_score":0.046460807},"labels":[],"label_agreement":null},{"id":"W2399228482","doi":"","title":"Context Derivation Sets and Context-Free Normal Forms.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Terminal and nonterminal symbols; Context-free grammar; Symbol (formal); Context-sensitive grammar; Tree-adjoining grammar; Mathematics; Grammar; Context (archaeology); Mildly context-sensitive grammar formalism; Computer science; Indexed grammar; Rule-based machine translation; Natural language processing; Linguistics; Generative grammar; Artificial intelligence; Phrase structure rules; Programming language","score_opus":0.01591446828257888,"score_gpt":0.23801898765661814,"score_spread":0.22210451937403924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399228482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008100898,0.0011498681,0.9522653,0.00057937286,0.00018972834,0.00016338081,0.00030824158,0.0017338829,0.035509344],"genre_scores_gemma":[0.18095669,0.0017917677,0.7905689,0.00059131725,0.0003133823,0.000533822,0.0015862378,0.0007676315,0.022890335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99703753,0.00070632267,0.00026704962,0.00062685035,0.001219771,0.0001424793],"domain_scores_gemma":[0.9971349,0.0014638763,0.00015735693,0.0006233358,0.0005167,0.00010371172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017044442,0.0008572045,0.0004837271,0.0019258811,0.0011819719,0.0030630685,0.0013217202,0.0011905766,0.0079431515],"category_scores_gemma":[0.0070999973,0.0006549887,0.0011132965,0.0017293544,0.003764802,0.0060204766,0.0024791486,0.0033017131,0.0035444987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018479699,0.000017599414,0.00013746686,0.00008386944,0.000009630247,0.00013722507,0.000301615,0.0021590271,0.001298973,0.92124176,0.0022098962,0.07238446],"study_design_scores_gemma":[0.000012227328,0.000012614442,0.00007375302,0.0000435595,0.00000998232,0.0002918686,0.000058320747,0.008086578,0.0027155145,0.9518455,0.03683452,0.000015539308],"about_ca_topic_score_codex":0.0013383445,"about_ca_topic_score_gemma":0.0014827633,"teacher_disagreement_score":0.0079431515,"about_ca_system_score_codex":0.0013336291,"about_ca_system_score_gemma":0.0012493761,"threshold_uncertainty_score":0.026572466},"labels":[],"label_agreement":null},{"id":"W2399631585","doi":"","title":"Watson-Crick automata: determinism and state complexity","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Molecular Structure of Nucleic Acids: A Structure for Deoxyribose Nucleic Acid; Automaton; Watson; Unary operation; Determinism; Mathematics; Discrete mathematics; Computer science; Theoretical computer science; Philosophy; DNA; Epistemology; Base pair","score_opus":0.04379430995703225,"score_gpt":0.25591044169363136,"score_spread":0.2121161317365991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399631585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3856324,0.0048183803,0.559808,0.0028874306,0.0001150357,0.00010441347,0.00056601956,0.00029259504,0.045775753],"genre_scores_gemma":[0.9558871,0.0012915474,0.03847955,0.00010184877,0.00010166856,0.0001490922,0.0001924958,0.000036957426,0.0037598114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877447,0.00023619902,0.000085142085,0.00031648186,0.00042416138,0.0001635794],"domain_scores_gemma":[0.99283445,0.0054725823,0.00056536525,0.00046013144,0.00046985803,0.000197638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016939,0.00029205033,0.00053333153,0.000925944,0.00077150785,0.002340648,0.0008450091,0.0010719759,0.0017760145],"category_scores_gemma":[0.008460014,0.00031761054,0.00048345973,0.00084672833,0.0032023264,0.0041154586,0.0011457672,0.0017372452,0.00018914863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004129027,0.000012415619,0.00055654667,0.000062035724,0.000008090979,0.0000611191,0.00021032235,0.022670122,0.002380248,0.9665815,0.00022550764,0.0071908436],"study_design_scores_gemma":[0.0000068336026,0.000014752842,0.00030900526,0.000014277374,0.000005451404,0.00006121955,0.000043297463,0.08249808,0.0019428082,0.91344064,0.0016453025,0.000018287808],"about_ca_topic_score_codex":0.0016387664,"about_ca_topic_score_gemma":0.00091310736,"teacher_disagreement_score":0.002340648,"about_ca_system_score_codex":0.0018325634,"about_ca_system_score_gemma":0.00084227667,"threshold_uncertainty_score":0.013296187},"labels":[],"label_agreement":null},{"id":"W2401586919","doi":"","title":"Restricted sets of trajectories and decidability of shuffle decompositions.","year":2004,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Acadia University","funders":"","keywords":"Decidability; Unary operation; Mathematics; Regular language; Context (archaeology); Set (abstract data type); Discrete mathematics; Combinatorics; Automaton; Computer science; Theoretical computer science; Programming language","score_opus":0.008540758322706883,"score_gpt":0.23902659181847943,"score_spread":0.23048583349577256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401586919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34553754,0.00080944394,0.6336351,0.0017006994,0.000093645,0.00022602003,0.001240399,0.0013054517,0.01545181],"genre_scores_gemma":[0.9126367,0.00045887902,0.0753289,0.0002880289,0.000085907115,0.0003167626,0.002234672,0.000207653,0.008442348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971494,0.0004820912,0.0002863499,0.0009785515,0.00063038175,0.00047330448],"domain_scores_gemma":[0.9857706,0.009794872,0.0010245953,0.0019738246,0.00070233253,0.0007337359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027271293,0.0005623078,0.0006924489,0.0012422813,0.0017517621,0.0035145497,0.0019118068,0.0013929026,0.0041126567],"category_scores_gemma":[0.011032841,0.00084857794,0.0026186933,0.00091301644,0.0041955286,0.010848648,0.0031741688,0.0045040078,0.00046291546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023515629,0.00016450988,0.0029454771,0.00019331957,0.00007556524,0.00051087525,0.0013301602,0.025761392,0.007590591,0.93784994,0.0014035471,0.021939505],"study_design_scores_gemma":[0.00003828153,0.000042709067,0.0004143666,0.000042934327,0.000031069227,0.0002320302,0.00032463841,0.057615116,0.009470557,0.9283595,0.003400602,0.000028216644],"about_ca_topic_score_codex":0.0026670143,"about_ca_topic_score_gemma":0.0022407135,"teacher_disagreement_score":0.0041126567,"about_ca_system_score_codex":0.0023631172,"about_ca_system_score_gemma":0.0016206431,"threshold_uncertainty_score":0.017145693},"labels":[],"label_agreement":null},{"id":"W2401899815","doi":"","title":"A characterization of the arithmetical hierarchy by language equations.","year":2004,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Peano axioms; Arithmetic function; Mathematics; Concatenation (mathematics); Hierarchy; Expressive power; Class (philosophy); Axiom; Second-order arithmetic; Property (philosophy); Characterization (materials science); Analytical hierarchy; Discrete mathematics; Algebra over a field; Arithmetic; Pure mathematics; Computer science; Theoretical computer science; Analytic hierarchy process; Mathematical economics","score_opus":0.00519566250757594,"score_gpt":0.21013662021198726,"score_spread":0.20494095770441131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401899815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21397305,0.0028065806,0.70588803,0.0027385768,0.00023514341,0.00018268646,0.0015224491,0.0006128408,0.072040714],"genre_scores_gemma":[0.81820744,0.0010372818,0.16867423,0.0006030189,0.000371317,0.00020412455,0.0012373598,0.000110688656,0.009554544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.00021979,0.00007459722,0.00022443468,0.00032583938,0.00015887839],"domain_scores_gemma":[0.99772984,0.001315039,0.00023502672,0.00022180441,0.00033837653,0.00015995867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009746389,0.0004032193,0.00046299447,0.0015007277,0.00083654135,0.002500985,0.0008679599,0.0007810363,0.0034403577],"category_scores_gemma":[0.004703068,0.0003818097,0.00086002296,0.0013066137,0.0026128662,0.004756816,0.0018199647,0.002488592,0.000531494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018398177,0.000013943837,0.00032728887,0.000049015558,0.000006860763,0.00007440505,0.00038978487,0.0015175134,0.002445764,0.9872103,0.0010176974,0.006929122],"study_design_scores_gemma":[0.0000155586,0.000024541858,0.00044519294,0.000042120784,0.000014047099,0.00025697987,0.00012186507,0.028301815,0.0013860062,0.95932287,0.010049422,0.000019607272],"about_ca_topic_score_codex":0.0012189774,"about_ca_topic_score_gemma":0.0010971637,"teacher_disagreement_score":0.0034403577,"about_ca_system_score_codex":0.0014298204,"about_ca_system_score_gemma":0.0008002871,"threshold_uncertainty_score":0.01150912},"labels":[],"label_agreement":null},{"id":"W2402932091","doi":"","title":"Regulated RNA rewriting: modelling RNA editing with guided insertion.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"RNA regulation and disease","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"RNA editing; Rewriting; String (physics); RNA; Computer science; Hierarchy; Computational biology; Programming language; Theoretical computer science; Biology; Genetics; Gene; Mathematics","score_opus":0.01292252746455459,"score_gpt":0.22936251004707692,"score_spread":0.21643998258252234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402932091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1671027,0.0007167431,0.7986662,0.00059364754,0.00011950562,0.0001417241,0.0004219449,0.00088159146,0.031355992],"genre_scores_gemma":[0.84235084,0.00053911854,0.1436086,0.00009928668,0.000039539336,0.00026072358,0.00030163265,0.00020887825,0.012591367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975294,0.00008724257,0.000012822806,0.000046439156,0.00006920001,0.00003124007],"domain_scores_gemma":[0.9994168,0.00036200217,0.00008750868,0.00005106975,0.000033009102,0.00004956406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004075702,0.00055587135,0.0005246714,0.00044288693,0.00044372177,0.0009722455,0.0014297318,0.0016912838,0.0026999267],"category_scores_gemma":[0.001251929,0.0003759237,0.001004213,0.00042894116,0.0013154104,0.0008379607,0.0007523212,0.00082804833,0.0004733101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004177877,0.000032878623,0.0003033012,0.000051150262,0.000017955259,0.00020754656,0.00010698702,0.87082434,0.008314588,0.11641811,0.0003271641,0.0033542109],"study_design_scores_gemma":[0.000010765539,0.000015043038,0.000044276017,0.0000024566104,0.0000041151116,0.000035234938,0.00000776956,0.98259145,0.00069034117,0.015506983,0.0010864257,0.000005209361],"about_ca_topic_score_codex":0.004063876,"about_ca_topic_score_gemma":0.002937033,"teacher_disagreement_score":0.004063876,"about_ca_system_score_codex":0.0010046685,"about_ca_system_score_gemma":0.0005410033,"threshold_uncertainty_score":0.00903219},"labels":[],"label_agreement":null},{"id":"W2403784750","doi":"","title":"Transition Complexity of Language Operations.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Manitoba","funders":"","keywords":"Nondeterministic finite automaton; Nondeterministic algorithm; Regular language; Computer science; Deterministic finite automaton; State (computer science); Regular expression; Finite-state machine; Automaton; Mathematics; Theoretical computer science; Programming language; Automata theory","score_opus":0.013856491255630364,"score_gpt":0.233511927603605,"score_spread":0.21965543634797463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2403784750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44793376,0.001342922,0.5181642,0.0021987264,0.00020915896,0.0003571822,0.0021878332,0.0008750176,0.02673121],"genre_scores_gemma":[0.9330035,0.00050738576,0.06043847,0.00018093866,0.00013919485,0.000323827,0.0011471278,0.0002127794,0.0040469496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919234,0.0020158216,0.0008494525,0.0017377734,0.0026688317,0.00080471655],"domain_scores_gemma":[0.90485424,0.077086195,0.005290869,0.0073790224,0.0033083796,0.0020812494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038899896,0.00062239985,0.0010026753,0.001520376,0.0012122823,0.0045003043,0.0017783771,0.0013161283,0.009074363],"category_scores_gemma":[0.043813873,0.00057383784,0.0023005854,0.0014793617,0.00321059,0.013181847,0.0025293722,0.0029304605,0.0006909664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063539454,0.00024100486,0.008566965,0.000575543,0.00018285091,0.00029829048,0.0010159439,0.0914923,0.0118929595,0.8281242,0.0018959466,0.05507852],"study_design_scores_gemma":[0.00004899038,0.00020787607,0.0027276734,0.000041876207,0.0000871505,0.00050927483,0.00028870744,0.19258286,0.010348599,0.78876203,0.0043176566,0.000077333694],"about_ca_topic_score_codex":0.0011447874,"about_ca_topic_score_gemma":0.0010471193,"teacher_disagreement_score":0.009074363,"about_ca_system_score_codex":0.0026753498,"about_ca_system_score_gemma":0.0016646516,"threshold_uncertainty_score":0.030356765},"labels":[],"label_agreement":null},{"id":"W2404946359","doi":"","title":"Repetition Complexity of Words.","year":2002,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Repetition (rhetorical device); De Bruijn sequence; Word (group theory); Mathematics; Logarithm; Computational complexity theory; Iterated function; Time complexity; Complexity class; Combinatorics; Prefix; Discrete mathematics; Morphism; Combinatorics on words; Arithmetic; Algorithm","score_opus":0.048147448014609795,"score_gpt":0.23035284030705733,"score_spread":0.18220539229244753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404946359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15602732,0.004997267,0.78421265,0.0020933033,0.0005225553,0.00029468228,0.0019286182,0.0012660418,0.048657596],"genre_scores_gemma":[0.7221694,0.0023927188,0.24568944,0.0007287498,0.0009695027,0.0006893219,0.0021448417,0.00057834265,0.024637658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970271,0.0004171083,0.0003352133,0.00083253527,0.0010990766,0.00028906605],"domain_scores_gemma":[0.9921172,0.004663631,0.00080302526,0.0013190334,0.000796552,0.0003005363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009736133,0.0007602775,0.00082824804,0.003215726,0.0012248147,0.0034916424,0.0012804728,0.0010246206,0.007971077],"category_scores_gemma":[0.009430016,0.0005126499,0.001628452,0.002504958,0.0030163028,0.008953893,0.00266646,0.0021457064,0.001703303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012001646,0.00004036679,0.0012570819,0.00030233662,0.000035080604,0.00026173264,0.00074681954,0.013526393,0.0065166256,0.9223896,0.003129411,0.051674593],"study_design_scores_gemma":[0.000013477902,0.00006651566,0.0004950982,0.000043087235,0.000024597655,0.0005711109,0.00009651602,0.04071249,0.0042607225,0.9377522,0.01591971,0.00004441598],"about_ca_topic_score_codex":0.0010168134,"about_ca_topic_score_gemma":0.0008097513,"teacher_disagreement_score":0.007971077,"about_ca_system_score_codex":0.0018749196,"about_ca_system_score_gemma":0.00078179175,"threshold_uncertainty_score":0.026665926},"labels":[],"label_agreement":null},{"id":"W2405146722","doi":"","title":"An Infinite Hierarchy Induced by Depth Synchronization.","year":2006,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Saskatchewan; Western University","funders":"","keywords":"Synchronization (alternating current); Measure (data warehouse); Hierarchy; Logarithm; Mathematics; Bounded function; Context (archaeology); Grammar; Constant (computer programming); Discrete mathematics; Computer science; Combinatorics; Topology (electrical circuits); Mathematical analysis; Linguistics; Programming language; Data mining; Geography","score_opus":0.009276167141911087,"score_gpt":0.2451326274002813,"score_spread":0.2358564602583702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405146722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33695677,0.0008427132,0.5986488,0.0010434571,0.00012234242,0.000107691114,0.0011908396,0.001856826,0.0592305],"genre_scores_gemma":[0.88958925,0.00034395617,0.09374828,0.000373828,0.00010491071,0.0001512085,0.0006203546,0.00031236434,0.014755795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983469,0.00022774929,0.00012896965,0.00035655216,0.0006630965,0.0002766497],"domain_scores_gemma":[0.9922998,0.0038070432,0.0007403179,0.0007982055,0.0015018011,0.0008528059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001138758,0.00032076673,0.00044694034,0.0015313807,0.0014727925,0.0021358044,0.00078421785,0.0006853852,0.0039947326],"category_scores_gemma":[0.007412326,0.000553736,0.00070712867,0.0009288516,0.0026844416,0.0038845872,0.0018641957,0.0017478323,0.00081800413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004790406,0.000020388545,0.0010568413,0.00007322527,0.00001052946,0.00023170449,0.00054663385,0.0018895899,0.010762402,0.9700228,0.0010368644,0.014301137],"study_design_scores_gemma":[0.000030311643,0.000046964204,0.0012190925,0.000040393308,0.000023253644,0.00060385035,0.0001535174,0.029084168,0.008571488,0.94621205,0.013971268,0.000043679287],"about_ca_topic_score_codex":0.002095824,"about_ca_topic_score_gemma":0.0020132218,"teacher_disagreement_score":0.0039947326,"about_ca_system_score_codex":0.002081847,"about_ca_system_score_gemma":0.0012786936,"threshold_uncertainty_score":0.01510489},"labels":[],"label_agreement":null},{"id":"W2405494927","doi":"","title":"Non-Uniqueness and Radius of Cyclic Unary NFAs.","year":2004,"lang":"es","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Acadia University","funders":"","keywords":"Unary operation; Nondeterministic algorithm; RADIUS; Mathematics; Uniqueness; Regular language; Diophantine equation; Class (philosophy); Combinatorics; Discrete mathematics; Computer science; Mathematical analysis; Theoretical computer science; Artificial intelligence; Automaton","score_opus":0.006565634247570317,"score_gpt":0.22898488601908956,"score_spread":0.22241925177151925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2405494927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59034646,0.0019510874,0.3840559,0.0005193589,0.000065146516,0.00007906414,0.00019990194,0.00038788037,0.022395235],"genre_scores_gemma":[0.95667976,0.00023839032,0.03957583,0.00006193091,0.00003931248,0.000084786785,0.00008288876,0.00009551279,0.0031416502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978828,0.00052308996,0.0002091102,0.0007299304,0.0004707132,0.00018437482],"domain_scores_gemma":[0.9895191,0.0070564128,0.0013612993,0.00094473746,0.0007624743,0.00035597058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016912081,0.0002451221,0.0006579452,0.0008251455,0.0013402349,0.0015441644,0.000999396,0.0008062357,0.0027136728],"category_scores_gemma":[0.011714111,0.00041094155,0.0007849744,0.00041883643,0.0026472656,0.004075693,0.0013593226,0.0011376922,0.0005122806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017379518,0.000022241751,0.0039120056,0.00026158208,0.00003928803,0.0003976616,0.0014818837,0.008849423,0.029820316,0.9359272,0.00046764122,0.018646987],"study_design_scores_gemma":[0.000033299395,0.0001984746,0.0030003933,0.00006989462,0.00008477639,0.0025860174,0.0008035911,0.08016302,0.040308867,0.8594973,0.013164837,0.000089543675],"about_ca_topic_score_codex":0.00045602545,"about_ca_topic_score_gemma":0.00038008773,"teacher_disagreement_score":0.0027136728,"about_ca_system_score_codex":0.0008777485,"about_ca_system_score_gemma":0.00043606453,"threshold_uncertainty_score":0.009078145},"labels":[],"label_agreement":null},{"id":"W2406034771","doi":"","title":"On the Synchronized Derivation Depth of Context-Free Grammars.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Tree-adjoining grammar; Indexed grammar; Rule-based machine translation; L-attributed grammar; Context-free grammar; Measure (data warehouse); Embedded pushdown automaton; Context (archaeology); Context-sensitive grammar; Mathematics; Synchronization (alternating current); Tree (set theory); Deterministic context-free grammar; Computer science; Combinatorics; Artificial intelligence; Geography; Topology (electrical circuits)","score_opus":0.023048097899154907,"score_gpt":0.228789765466021,"score_spread":0.2057416675668661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406034771","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22684681,0.0029596623,0.7458402,0.0012750952,0.000092324335,0.000181163,0.0005432385,0.0005413998,0.021720087],"genre_scores_gemma":[0.87876856,0.001552674,0.11382586,0.0002690619,0.00025428954,0.00023803079,0.00039639598,0.0003694408,0.0043257466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961551,0.0008802252,0.00022769789,0.0008405374,0.0013085484,0.00058795424],"domain_scores_gemma":[0.92685634,0.061143756,0.003852803,0.0037098671,0.0020731764,0.002364086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004038183,0.0011023969,0.0011150562,0.0032240346,0.0012491881,0.0033510972,0.0021735458,0.0017244682,0.004812949],"category_scores_gemma":[0.032854073,0.00094020594,0.0014060657,0.0025873727,0.004556968,0.013736551,0.004796148,0.003998772,0.0005703198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021152945,0.000078078265,0.0028491737,0.00024605758,0.00006807016,0.00021162974,0.0008829334,0.058644038,0.008019265,0.8969887,0.0010125937,0.030787984],"study_design_scores_gemma":[0.000019359457,0.00008602025,0.0010493302,0.0000474179,0.000038670958,0.000229502,0.00009920766,0.1522776,0.004370736,0.83936465,0.00237106,0.000046383735],"about_ca_topic_score_codex":0.0010922487,"about_ca_topic_score_gemma":0.0010997222,"teacher_disagreement_score":0.004812949,"about_ca_system_score_codex":0.0032552052,"about_ca_system_score_gemma":0.0014058629,"threshold_uncertainty_score":0.02361828},"labels":[],"label_agreement":null},{"id":"W2406664471","doi":"","title":"Estimation of State Complexity of Combined Operations.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Catenation; State (computer science); Alphabet; Upper and lower bounds; Mathematics; Regular language; Computer science; Theoretical computer science; Algorithm; Discrete mathematics; Automaton; Linguistics","score_opus":0.03663116717581648,"score_gpt":0.2526408769094715,"score_spread":0.21600970973365502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406664471","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28645977,0.0009931109,0.6981195,0.00033147325,0.000056554734,0.00017011828,0.0008696547,0.00051541626,0.012484315],"genre_scores_gemma":[0.9142921,0.00038971726,0.08175637,0.000033762895,0.00004185211,0.00020852782,0.001052022,0.00012122707,0.0021044102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979247,0.00032968572,0.00014328635,0.0005149461,0.0008264351,0.00026098252],"domain_scores_gemma":[0.97823685,0.016186288,0.0012301641,0.002668352,0.0012641762,0.00041415892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010855136,0.0006335546,0.00069171685,0.0017606087,0.00067800016,0.0017952167,0.0013843476,0.00085752155,0.005278111],"category_scores_gemma":[0.017031342,0.00044675465,0.0010877402,0.0011349255,0.0013239445,0.006232115,0.0017976502,0.0018045685,0.00070136186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093816157,0.00032453085,0.025103997,0.0010979512,0.00030743197,0.0005246944,0.00082641206,0.43835205,0.055046923,0.31605133,0.0033336421,0.15809289],"study_design_scores_gemma":[0.00001092486,0.00012296354,0.004026638,0.000040618044,0.000052727126,0.00030257844,0.000102075,0.8121631,0.023355765,0.1576426,0.0021222148,0.000057720736],"about_ca_topic_score_codex":0.0012794001,"about_ca_topic_score_gemma":0.0013841215,"teacher_disagreement_score":0.005278111,"about_ca_system_score_codex":0.0014942687,"about_ca_system_score_gemma":0.00094038056,"threshold_uncertainty_score":0.017657042},"labels":[],"label_agreement":null},{"id":"W2407962255","doi":"","title":"State-Complexity Hierarchies of Uniform Languages of Alphabet-Size Length.","year":2008,"lang":"en","type":"article","venue":"DCFS","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; University of Waterloo","funders":"","keywords":"Alphabet; Regular language; Mathematics; Combinatorics; State (computer science); Class (philosophy); Hierarchy; Discrete mathematics; Formal language; Complexity class; Simple (philosophy); Pumping lemma for regular languages; Set (abstract data type); Automaton; Time complexity; Computer science; Theoretical computer science; Algorithm; Linguistics","score_opus":0.021792489354975023,"score_gpt":0.24690518062486091,"score_spread":0.2251126912698859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2407962255","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7997781,0.0011617657,0.16945602,0.0011367407,0.000033578897,0.00011691696,0.0010488153,0.0005583747,0.026709663],"genre_scores_gemma":[0.9715298,0.00025060534,0.024864975,0.00007265049,0.0000445911,0.00011685605,0.00043660606,0.000067995315,0.0026158842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985335,0.00025052542,0.00011785879,0.00028692765,0.0005032045,0.00030801285],"domain_scores_gemma":[0.98598135,0.010080673,0.0015488032,0.00090318493,0.0008007584,0.00068522885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081128854,0.00038539013,0.00048589194,0.0012304216,0.0012787203,0.00296203,0.00085334125,0.00068653416,0.0038988355],"category_scores_gemma":[0.010443554,0.0005626909,0.0009576405,0.0010888953,0.001827975,0.00508347,0.0013493777,0.0014868284,0.00031462777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022064407,0.00010835997,0.007762665,0.00024709737,0.0000516766,0.00030330778,0.0021703497,0.041211423,0.014781548,0.91289526,0.0016390559,0.018608626],"study_design_scores_gemma":[0.00003803773,0.000108647604,0.006082507,0.00004457732,0.00005192284,0.0005503869,0.000399355,0.19518477,0.008431294,0.7814103,0.0076241256,0.00007408961],"about_ca_topic_score_codex":0.0025661625,"about_ca_topic_score_gemma":0.0029161323,"teacher_disagreement_score":0.0038988355,"about_ca_system_score_codex":0.0031666593,"about_ca_system_score_gemma":0.0010552653,"threshold_uncertainty_score":0.022975862},"labels":[],"label_agreement":null}]}