{"meta":{"query_hash":"8b3ede01295f","filters":{"venue":"COMBINATORICA"},"cohort_total":98,"direct_labels_cover":0,"predictions_cover":98,"exported":98,"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/8b3ede01295f","api":"https://metacan.xera.ac/api/v1/cohort?venue=COMBINATORICA"},"results":[{"id":"W1481873605","doi":"10.1007/s00493-009-2178-y","title":"Highly parity linked graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Parity (physics); Disjoint sets; Graph; Joins; Discrete mathematics; Physics; Computer science","score_opus":0.0204968892541353,"score_gpt":0.28604150329798345,"score_spread":0.26554461404384816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1481873605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20214984,0.003528511,0.6424367,0.022553012,0.0038869686,0.0015061651,0.000005494543,0.004412477,0.11952088],"genre_scores_gemma":[0.99290687,0.000046103974,0.006156664,0.00042656655,0.000017931301,0.000009464659,0.0000011333195,0.000006825034,0.00042846688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984078,0.00011497789,0.00018115589,0.00042770282,0.00040198403,0.0004664133],"domain_scores_gemma":[0.9984706,0.00012881037,0.0000554031,0.0010041732,0.00013194722,0.00020908417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003212698,0.00014519141,0.0001823304,0.00018060753,0.00021141146,0.000111548026,0.0016047993,0.000074878764,0.000009348958],"category_scores_gemma":[0.000101609745,0.00013729789,0.00009191812,0.001309801,0.000064689084,0.00045350145,0.00021055985,0.00031140202,0.00014498475],"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.000005571459,0.0001473323,0.00031187793,0.0000023963648,0.0000045995594,0.000027415666,0.00006790883,0.0000026562948,0.00048146312,0.9725773,0.0015553695,0.024816152],"study_design_scores_gemma":[0.00038505896,0.0002474199,0.01010654,0.000005766817,0.0000016989887,0.000006701594,0.0000027811518,0.0008071781,0.001265715,0.97512025,0.011872078,0.0001788194],"about_ca_topic_score_codex":0.0000028410914,"about_ca_topic_score_gemma":2.102292e-7,"teacher_disagreement_score":0.790757,"about_ca_system_score_codex":0.000059423903,"about_ca_system_score_gemma":0.000046839104,"threshold_uncertainty_score":0.55988455},"labels":[],"label_agreement":null},{"id":"W1609788678","doi":"10.1007/s00493-016-3356-3","title":"Density of 5/2-critical graphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph homomorphism; Discrete mathematics; Graph; Homomorphism; Triangle-free graph; Graph power; Line graph","score_opus":0.018925724334806764,"score_gpt":0.2944850513808936,"score_spread":0.2755593270460868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609788678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11592005,0.00023702027,0.874214,0.0033391314,0.00074487744,0.00015222895,0.000002523902,0.00024385627,0.0051463293],"genre_scores_gemma":[0.9951965,0.000014571825,0.0045706276,0.000032506825,0.0000057716707,0.000005723339,6.339018e-8,0.000005747773,0.0001684387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988853,0.000100333804,0.0001495908,0.00026458266,0.00031596213,0.00028426902],"domain_scores_gemma":[0.9982943,0.0006191115,0.000033542266,0.00071298913,0.00021025541,0.00012979671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026892681,0.00008060868,0.00014535814,0.00012164174,0.00006841628,0.000013678276,0.0009231786,0.000041248742,0.00001873348],"category_scores_gemma":[0.0005100616,0.00005510566,0.00006766829,0.0005553107,0.0002823712,0.0003081553,0.00037694984,0.00007732527,0.00006639901],"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.000004978885,0.000094834475,0.002301122,0.00000830526,0.0000038030594,0.000011225914,0.000029458472,4.0981725e-8,0.0058918265,0.97903794,0.00024154701,0.012374916],"study_design_scores_gemma":[0.00026705742,0.00011170554,0.0035329727,0.0000141315495,0.0000014814053,0.000007184576,0.0000026806442,0.000040387327,0.037461996,0.95775527,0.00071725063,0.00008787479],"about_ca_topic_score_codex":0.0000016763822,"about_ca_topic_score_gemma":1.7511233e-7,"teacher_disagreement_score":0.8792765,"about_ca_system_score_codex":0.000031915453,"about_ca_system_score_gemma":0.000037774804,"threshold_uncertainty_score":0.22471435},"labels":[],"label_agreement":null},{"id":"W1660086198","doi":"10.1007/s00493-015-3237-1","title":"Odd circuits in dense binary matroids","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Combinatorics; Lemma (botany); Integer (computer science); Abelian group; Binary number; Discrete mathematics; Simple (philosophy); Arithmetic; Computer science","score_opus":0.07131799654960404,"score_gpt":0.31188509652276625,"score_spread":0.24056709997316222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1660086198","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96107507,0.0005912735,0.000074553565,0.00013453883,0.0011743492,0.00018479972,0.0000023442087,0.00013158425,0.036631487],"genre_scores_gemma":[0.99858767,0.000014085823,0.000417272,0.00009492952,0.000052909112,0.000015312258,0.0000015517778,0.000030401594,0.00078585366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881274,0.00012895523,0.0002757992,0.00021825658,0.0002666442,0.00029758544],"domain_scores_gemma":[0.9990087,0.00020633027,0.000076032105,0.0004726439,0.0000790346,0.00015724784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050523365,0.0001585043,0.00027288275,0.0001625077,0.00008143896,0.00002106376,0.00032121432,0.00011960092,0.00003807882],"category_scores_gemma":[0.00046667198,0.00013820326,0.00007059087,0.0003690442,0.000064142245,0.00008699674,0.00017793679,0.00022938718,0.000035417317],"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.000016177119,0.00016409949,0.005224077,0.00003839024,0.000014059794,0.00010059429,0.0014308799,0.0000017324055,0.000059485694,0.97325724,0.01882155,0.00087169424],"study_design_scores_gemma":[0.00092954765,0.000111987385,0.0022295567,0.000023797294,0.0000121779985,0.00002546615,0.00018560348,0.00004755947,0.00016838998,0.9909545,0.0051231324,0.0001882766],"about_ca_topic_score_codex":0.000008334755,"about_ca_topic_score_gemma":0.0000015806529,"teacher_disagreement_score":0.037512615,"about_ca_system_score_codex":0.00012802449,"about_ca_system_score_gemma":0.000051783714,"threshold_uncertainty_score":0.5635766},"labels":[],"label_agreement":null},{"id":"W1924742230","doi":"10.1007/s00493-015-3003-4","title":"Regular families of forests, antichains and duality pairs of relational structures","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Antichain; Mathematics; Homomorphism; Duality (order theory); Combinatorics; Constraint (computer-aided design); Constraint satisfaction problem; Discrete mathematics; Partially ordered set; Geometry","score_opus":0.020806861208372263,"score_gpt":0.2683903031659259,"score_spread":0.2475834419575536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1924742230","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82757556,0.00060108537,0.17036602,0.0005613302,0.00014455683,0.00015480694,0.000014068604,0.000049851235,0.0005327041],"genre_scores_gemma":[0.9943465,0.00006539734,0.0054771146,0.0000058315754,0.0000049784117,0.0000028702402,5.200342e-7,0.000004727379,0.00009208551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899983,0.000108501954,0.0002045594,0.00021003545,0.00032395605,0.00015312214],"domain_scores_gemma":[0.998782,0.00042323454,0.00011180176,0.00045538283,0.00016945747,0.000058152913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031552368,0.000077585144,0.00016647218,0.00011951039,0.000053796695,0.0000062727386,0.00038521015,0.00004428581,0.000005374415],"category_scores_gemma":[0.000286993,0.000053510223,0.00003866408,0.0003241241,0.0003225184,0.00022729531,0.00027265967,0.000054236436,7.661529e-7],"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.000010207344,0.000026723872,0.0415653,0.000024480227,0.000011683691,0.0000014242582,0.00012979413,0.000002417869,0.0026061612,0.95048827,0.00006425743,0.0050692772],"study_design_scores_gemma":[0.0003780144,0.000097468954,0.15523465,0.00002071741,0.0000020115924,0.0000026578025,0.000013321554,0.00020362168,0.013344208,0.8302829,0.0003545799,0.00006579424],"about_ca_topic_score_codex":0.0000054516145,"about_ca_topic_score_gemma":0.000001387328,"teacher_disagreement_score":0.16677089,"about_ca_system_score_codex":0.000019482395,"about_ca_system_score_gemma":0.000042622105,"threshold_uncertainty_score":0.21820836},"labels":[],"label_agreement":null},{"id":"W1963931974","doi":"10.1007/s00493-006-0034-x","title":"Local Chromatic Number, KY Fan's Theorem, And Circular Colorings","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Brooks' theorem; Chromatic scale; Upper and lower bounds; Chordal graph; Discrete mathematics; Conjecture; Indifference graph; Bipartite graph; Vertex (graph theory); Graph; 1-planar graph","score_opus":0.0060103561267724126,"score_gpt":0.20559387058850803,"score_spread":0.1995835144617356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963931974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2629461,0.0017428555,0.68844515,0.0021718133,0.00045424447,0.00022399913,0.0000062744843,0.0005191928,0.043490373],"genre_scores_gemma":[0.99790627,0.000032342123,0.0013272188,0.00013378363,0.00001853912,0.000010678452,0.00000515647,0.0000049615,0.0005610485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877685,0.000054454722,0.00020812714,0.00039280267,0.00027453975,0.00029323186],"domain_scores_gemma":[0.99914145,0.00015256005,0.00007344606,0.0004746101,0.00004850825,0.000109396235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020114207,0.00014031619,0.00024588153,0.00014670855,0.00015950554,0.00014648236,0.0006728078,0.00007195384,0.00006470035],"category_scores_gemma":[0.00005636137,0.00011154604,0.000070796355,0.0018451958,0.00014627667,0.00025052257,0.00039601704,0.00011223321,0.00016987069],"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.0000010276844,0.0001448172,0.0032347857,0.000013693996,0.00001823357,0.000048403934,0.000020584144,0.000005904228,0.000035853067,0.98480755,0.0018531247,0.00981602],"study_design_scores_gemma":[0.0006938111,0.00014540194,0.03412862,0.000011890101,0.000043486143,0.000065108296,0.000027141657,0.0062404093,0.0008275301,0.90566045,0.051737715,0.00041844582],"about_ca_topic_score_codex":0.00018856292,"about_ca_topic_score_gemma":0.000001130704,"teacher_disagreement_score":0.73496014,"about_ca_system_score_codex":0.00005200079,"about_ca_system_score_gemma":0.000017153694,"threshold_uncertainty_score":0.45487157},"labels":[],"label_agreement":null},{"id":"W1964031838","doi":"10.1007/s00493-011-1687-5","title":"Packing directed circuits exactly","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disjoint sets; Cardinality (data modeling); Combinatorics; Mathematics; Set (abstract data type); Electronic circuit; Characterization (materials science); Property (philosophy); Discrete mathematics; Minor (academic); Computer science; Law","score_opus":0.05387108488223161,"score_gpt":0.27160837928300036,"score_spread":0.21773729440076875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964031838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07820483,0.0012078129,0.5640001,0.0002869735,0.002690321,0.0006933578,0.0000024542746,0.003890947,0.34902316],"genre_scores_gemma":[0.9951135,0.000017453962,0.0042626727,0.00006843783,0.000015549718,0.00002201878,5.526029e-7,0.000015804611,0.0004840041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853796,0.00012571325,0.00016008374,0.0004004733,0.00032171168,0.0004540519],"domain_scores_gemma":[0.99860764,0.00012963818,0.00006294737,0.0008734551,0.00014836408,0.00017797858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027994148,0.00013387651,0.00015544934,0.00016959678,0.00017080088,0.000059283437,0.0014453032,0.000055730427,0.000061984945],"category_scores_gemma":[0.00014745371,0.00012933323,0.000059669335,0.0011014988,0.000067129535,0.00050316803,0.00039539282,0.0002198878,0.00022662252],"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.0000034230377,0.00015110975,0.0023989102,0.000007732951,0.000014904294,0.000068947826,0.0009741467,2.99589e-7,0.0008604564,0.9518486,0.0005081789,0.04316328],"study_design_scores_gemma":[0.0005542566,0.0001971175,0.021435533,0.00002234295,0.0000040771406,0.000023663697,0.000025679346,0.00107131,0.017070226,0.952495,0.006709779,0.00039105647],"about_ca_topic_score_codex":0.000009467503,"about_ca_topic_score_gemma":4.600065e-7,"teacher_disagreement_score":0.9169087,"about_ca_system_score_codex":0.00006578334,"about_ca_system_score_gemma":0.000048552083,"threshold_uncertainty_score":0.5274056},"labels":[],"label_agreement":null},{"id":"W1965966420","doi":"10.1007/s00493-010-2329-1","title":"Type-II matrices and combinatorial structures","year":2010,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Mathematics; Combinatorics; Type (biology); Connection (principal bundle); Class (philosophy); Combinatorial analysis; Combinatorial proof; Discrete mathematics; Geometry; Computer science","score_opus":0.018614966392392716,"score_gpt":0.282572723573241,"score_spread":0.26395775718084824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965966420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97954077,0.00028089772,0.00001845299,0.00020524385,0.013866852,0.00028003173,0.00000287655,0.00024718652,0.005557707],"genre_scores_gemma":[0.9980436,0.000038026228,0.0009974808,0.000059192735,0.00053428963,0.000014293378,0.000003350718,0.000054302014,0.0002554773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983184,0.000050250266,0.0003522188,0.00044332136,0.0004177519,0.00041806325],"domain_scores_gemma":[0.99847573,0.00031147018,0.00017794824,0.0006050179,0.00019142356,0.0002383855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021536887,0.00032673567,0.0004249656,0.000115697076,0.00050181674,0.00010822453,0.00045088664,0.0003161229,0.00030601118],"category_scores_gemma":[0.0005049754,0.00027995472,0.000084407664,0.00037751228,0.00015138685,0.00016593203,0.00036885377,0.0006357385,0.000010610009],"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.000036755606,0.00008627736,0.00056279136,0.000034733766,0.00003557343,0.0000061093315,0.0002337127,8.371006e-8,0.0006061599,0.99258786,0.0048628123,0.0009471243],"study_design_scores_gemma":[0.0011898717,0.00022703221,0.0009306525,0.000007971814,0.00005378778,0.000032157834,0.000034370525,0.000021527383,0.0011078496,0.9799829,0.016067343,0.00034452017],"about_ca_topic_score_codex":0.000027692293,"about_ca_topic_score_gemma":0.0000027803624,"teacher_disagreement_score":0.018502835,"about_ca_system_score_codex":0.00003098888,"about_ca_system_score_gemma":0.00007395186,"threshold_uncertainty_score":0.99996525},"labels":[],"label_agreement":null},{"id":"W1966530078","doi":"10.1007/s00493-011-2545-3","title":"On the threshold for k-regular subgraphs of random graphs","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Factor-critical graph; Random regular graph; Random graph; Discrete mathematics; Line graph; Graph power; Pathwidth; Vertex (graph theory)","score_opus":0.0697965727121189,"score_gpt":0.27221612325454037,"score_spread":0.20241955054242144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966530078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94533676,0.00036920045,0.0010279622,0.00011118952,0.0011190054,0.001138781,0.000017955947,0.0000982879,0.050780844],"genre_scores_gemma":[0.9990052,0.000019404863,0.0005911689,0.00010453406,0.000013737808,0.00007458477,9.983086e-7,0.00002767927,0.00016269555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990417,0.00007058044,0.00027783087,0.00018142084,0.00020933463,0.00021916526],"domain_scores_gemma":[0.9978274,0.0011585288,0.00016072375,0.0006965437,0.00010861823,0.000048180318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005923474,0.00016212554,0.00029558202,0.00009517038,0.00024012238,0.000007634235,0.00048982084,0.00009141781,0.000099682555],"category_scores_gemma":[0.00035294986,0.00009368257,0.00030191784,0.00022899672,0.00019309562,0.00003115204,0.000067435474,0.00013143745,0.0000015781546],"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.0002249967,0.00015147447,0.00028590302,0.00004553322,0.00008471284,9.616763e-7,0.00090994104,8.732374e-8,0.00005780858,0.991059,0.0070336973,0.00014590344],"study_design_scores_gemma":[0.0013497489,0.00023618208,0.00023160363,0.00002494899,0.000060971186,0.0000014146494,0.00008031487,0.000014954458,0.007924106,0.9894232,0.0005314196,0.00012113041],"about_ca_topic_score_codex":0.000003037962,"about_ca_topic_score_gemma":4.5871744e-7,"teacher_disagreement_score":0.05366842,"about_ca_system_score_codex":0.000010681173,"about_ca_system_score_gemma":0.000011494641,"threshold_uncertainty_score":0.38202643},"labels":[],"label_agreement":null},{"id":"W1969083090","doi":"10.1007/s004930070004","title":"On Cayley Graphs on the Symmetric Group Generated by Tranpositions","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Cayley graph; Mathematics; Bipartite graph; Symmetric group; Conjecture; Graph; Eigenvalues and eigenvectors; Discrete mathematics","score_opus":0.022248902024591323,"score_gpt":0.2555700609254552,"score_spread":0.23332115890086388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969083090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94474155,0.0000854393,0.00008942509,0.0012569441,0.000082211496,0.00041609164,0.000049567767,0.00017981119,0.053098943],"genre_scores_gemma":[0.9974272,0.00005050082,0.00005128169,0.000591414,0.000011783435,0.00019836603,0.000029119776,0.000024390436,0.0016159113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904853,0.00014334627,0.00018412017,0.00022491797,0.00018881289,0.0002102759],"domain_scores_gemma":[0.99861985,0.00068769563,0.000047049125,0.00053425547,0.00003184879,0.00007926924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016445339,0.00015531058,0.00014062782,0.00010293896,0.0005022352,0.000036587193,0.0003050746,0.000065156346,0.0006093845],"category_scores_gemma":[0.000056984096,0.00011001264,0.0001054432,0.001365515,0.00006205685,0.000030567604,0.000008246109,0.00023723036,0.00032679047],"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.000009590682,0.00074071524,0.0000056333092,0.0000036720426,0.000022799097,0.0000010333351,0.00006375713,0.0000020702805,0.0002459147,0.92510164,0.07269318,0.0011099862],"study_design_scores_gemma":[0.00031560197,0.00016769096,0.00019816465,0.000011479661,0.000034185865,0.000002066681,0.000013665852,0.000048439695,0.0014034796,0.98591393,0.011745541,0.00014575054],"about_ca_topic_score_codex":0.0000053977747,"about_ca_topic_score_gemma":9.359989e-7,"teacher_disagreement_score":0.060947638,"about_ca_system_score_codex":0.0000340372,"about_ca_system_score_gemma":0.0000069457215,"threshold_uncertainty_score":0.6672333},"labels":[],"label_agreement":null},{"id":"W1969104367","doi":"10.1007/s00493-013-2910-5","title":"Lines in hypergraphs","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University; Google (Canada)","funders":"Concordia University; Canada Research Chairs","keywords":"Hypergraph; Combinatorics; Mathematics; Vertex (graph theory); De Bruijn sequence; Finite set; Statement (logic); Discrete mathematics; Graph","score_opus":0.023471736362064788,"score_gpt":0.2756630780826877,"score_spread":0.2521913417206229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969104367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96960723,0.00022639318,0.00002769001,0.00022158716,0.00055212196,0.00019225388,5.281531e-7,0.000083054874,0.029089147],"genre_scores_gemma":[0.9981679,0.000024274432,0.0009626417,0.00010521646,0.000032032072,0.00003668881,5.213996e-7,0.000016078908,0.00065467745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993054,0.000047740785,0.00018942417,0.00014215741,0.00011747441,0.0001977666],"domain_scores_gemma":[0.9993367,0.00021507166,0.000042354797,0.0003027936,0.000049740538,0.00005332466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011771511,0.00010505251,0.00016855879,0.00011047354,0.00007705193,0.00001959127,0.00021741015,0.00007318531,0.00022804867],"category_scores_gemma":[0.00019286636,0.00008144423,0.00005752917,0.0002729158,0.000044763296,0.000081237085,0.00008742244,0.00013845722,0.00004123861],"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.000001979021,0.000074860596,0.008469169,0.000019833145,0.000007484678,0.000003612309,0.00026133933,1.6782802e-7,0.00009533504,0.98118377,0.008065236,0.0018171929],"study_design_scores_gemma":[0.00028608926,0.000024928017,0.009609498,0.000011683094,0.0000040202276,0.0000031106172,0.000050028517,0.00003473586,0.0002453389,0.9867787,0.0028401548,0.0001117487],"about_ca_topic_score_codex":0.00002512526,"about_ca_topic_score_gemma":0.0000017478092,"teacher_disagreement_score":0.028560646,"about_ca_system_score_codex":0.000019794745,"about_ca_system_score_gemma":0.000007610507,"threshold_uncertainty_score":0.33211994},"labels":[],"label_agreement":null},{"id":"W1969944193","doi":"10.1007/s00493-011-2563-1","title":"On planarity of compact, locally connected, metric spaces","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Disjoint sets; Planarity testing; Social connectedness; Metric space; Compact space; Metric (unit); Combinatorics; Space (punctuation); Disjoint union (topology); Surface (topology); Locally compact space; Pure mathematics; Geometry","score_opus":0.06910947974797159,"score_gpt":0.2846020704323632,"score_spread":0.21549259068439158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969944193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8931276,0.00025544042,0.0017503247,0.00018018627,0.00059222005,0.00023332007,0.0000096401845,0.00014114677,0.10371012],"genre_scores_gemma":[0.9988839,0.00001272289,0.00055833056,0.000058000416,0.000012484563,0.0000028439238,0.000001805067,0.000015875725,0.00045402758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989243,0.00008327908,0.00029308494,0.00020042487,0.000239559,0.0002593568],"domain_scores_gemma":[0.99807674,0.001103719,0.00021021225,0.00038642518,0.00011295913,0.00010997682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023639985,0.00015364407,0.00041789873,0.0004358176,0.00005670111,0.000006289,0.0003131246,0.0001178052,0.00062797504],"category_scores_gemma":[0.0013221917,0.00012911968,0.00008584947,0.0011570499,0.000113163645,0.00003687556,0.000051529427,0.00019175284,0.00008204256],"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.000043008382,0.0007657782,0.0037396697,0.0000523296,0.000059917893,0.000018241886,0.00028829725,2.8888243e-7,0.000010696093,0.98110414,0.013568122,0.00034948892],"study_design_scores_gemma":[0.000965899,0.0008224144,0.013151464,0.000021322336,0.000049733862,0.000013274409,0.00015891907,0.000022003582,0.0022256572,0.98121,0.0011693712,0.0001899213],"about_ca_topic_score_codex":0.00014281423,"about_ca_topic_score_gemma":0.0000033570263,"teacher_disagreement_score":0.10575631,"about_ca_system_score_codex":0.000041386436,"about_ca_system_score_gemma":0.00004088866,"threshold_uncertainty_score":0.68758863},"labels":[],"label_agreement":null},{"id":"W1975999171","doi":"10.1007/s00493-007-2163-2","title":"Birth control for giants","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":107,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Giant component; Logarithm; Vertex (graph theory); Connected component; Branching process; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.041606537222897,"score_gpt":0.33842125206509777,"score_spread":0.2968147148422008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975999171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012850144,0.00008624581,0.9946955,0.000120447345,0.000535252,0.00034015745,0.00003032654,0.00009494031,0.0028121325],"genre_scores_gemma":[0.97674936,0.0000025185811,0.02236158,0.00016013558,0.000067145236,0.00003154437,0.0000014413107,0.000025307972,0.00060093723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990977,0.0000071170625,0.00023481056,0.00016578045,0.00016222724,0.00033234264],"domain_scores_gemma":[0.9976772,0.0017898817,0.00007387493,0.000180351,0.00015223316,0.00012645734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038648015,0.000108895016,0.0002128307,0.000040926177,0.00009367276,0.00001639034,0.00015414976,0.000068775465,0.000042214662],"category_scores_gemma":[0.0022940943,0.0000948236,0.000055221582,0.00013532555,0.000018410323,0.000028525164,0.000019732997,0.000078523415,0.000025668875],"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.000058566347,0.00011731152,0.0000134910815,0.00009064858,0.000016143198,0.000006054913,0.00003667686,6.735139e-8,0.00007847876,0.98968244,0.003815317,0.006084794],"study_design_scores_gemma":[0.0014623317,0.00022965758,0.00006035184,0.000014839575,0.000029752322,0.0000044017497,0.000031742133,0.001479614,0.00044005064,0.9875947,0.008520814,0.0001316924],"about_ca_topic_score_codex":9.72237e-7,"about_ca_topic_score_gemma":9.764835e-7,"teacher_disagreement_score":0.9754644,"about_ca_system_score_codex":0.000043144755,"about_ca_system_score_gemma":0.000027776847,"threshold_uncertainty_score":0.3866794},"labels":[],"label_agreement":null},{"id":"W1976459503","doi":"10.1007/s00493-006-0016-z","title":"Network Design Via Iterative Rounding Of Setpair Relaxations","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"","keywords":"Rounding; Mathematics; Combinatorics; Linear programming relaxation; Vertex (graph theory); Omega; Approximation algorithm; Discrete mathematics; Relaxation (psychology); Linear programming; Integer (computer science); Network planning and design; Vertex connectivity; Undirected graph; Graph; Mathematical optimization; Computer science","score_opus":0.023675307206910665,"score_gpt":0.23164786684606414,"score_spread":0.20797255963915348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976459503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009395464,0.00032473367,0.9940106,0.0002690574,0.0007191065,0.0001416428,9.5179956e-7,0.0001491694,0.0034451715],"genre_scores_gemma":[0.8399587,0.0000039877827,0.15960816,0.000054012784,0.00007833574,0.000015984455,0.0000028528864,0.0000069141943,0.0002710375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988832,0.00013203511,0.000265245,0.00024814604,0.00021896267,0.00025242782],"domain_scores_gemma":[0.99889886,0.00035725985,0.00015893074,0.00042124535,0.00011895316,0.000044727232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002897901,0.0001172474,0.0001749007,0.0000930883,0.00027410733,0.000078388824,0.0006060371,0.000049070182,0.0000093255185],"category_scores_gemma":[0.000028880539,0.000118141856,0.00007021687,0.0010772698,0.00006006178,0.0003257194,0.00017379443,0.00012969186,0.000014162294],"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.0000022111021,0.00012777322,0.0006677266,0.0000057000657,0.000010722485,0.0000061748856,0.00018572777,0.0028473372,0.000086426946,0.9864533,0.007499187,0.0021077371],"study_design_scores_gemma":[0.0002604678,0.00015820879,0.0026394047,0.000026019672,0.0000063041916,0.000008220586,0.000005599462,0.077408515,0.00066904514,0.91532737,0.0033213052,0.00016954084],"about_ca_topic_score_codex":0.00003763041,"about_ca_topic_score_gemma":0.0000013957037,"teacher_disagreement_score":0.8390192,"about_ca_system_score_codex":0.00006817431,"about_ca_system_score_gemma":0.000045369303,"threshold_uncertainty_score":0.48176852},"labels":[],"label_agreement":null},{"id":"W1977900870","doi":"10.1007/s00493-009-2269-9","title":"Tilings of the integers can have superpolynomial periods","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Mathematical Analysis and Transform Methods","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Disjoint sets; Combinatorics; Partition (number theory); Set (abstract data type); Period (music); Square (algebra); Discrete mathematics; Upper and lower bounds; Function (biology); Geometry","score_opus":0.040109790994112854,"score_gpt":0.32715807986496936,"score_spread":0.28704828887085654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977900870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9259165,0.00013825344,0.0057725688,0.00566269,0.00037914273,0.00046702742,0.000008996283,0.0000934357,0.06156137],"genre_scores_gemma":[0.9951041,0.0000071908066,0.0039584185,0.00010891096,0.000022862905,0.0000047003173,5.1599426e-7,0.000010647955,0.00078266894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888265,0.000097501696,0.0003873916,0.0001555468,0.00027628517,0.0002006008],"domain_scores_gemma":[0.99905485,0.00025048933,0.00010508436,0.00044829483,0.00006625272,0.00007501328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044172787,0.00014181713,0.0003852379,0.000045629517,0.00009960119,0.000018454282,0.00036786817,0.000076620716,0.00012849341],"category_scores_gemma":[0.00034934192,0.00008506379,0.0002992849,0.00025186967,0.000088994064,0.00003168757,0.00003304239,0.00019030996,0.0000028131901],"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.000013366034,0.0004091643,0.00048088896,0.000084210165,0.000057053567,0.0000017179165,0.0023352627,5.040843e-7,0.0010486608,0.9897711,0.0010941381,0.004703899],"study_design_scores_gemma":[0.0004069542,0.00010874235,0.0006066289,0.000052407213,0.00012953869,0.000005427624,0.00025848002,0.00051745214,0.019816482,0.9764716,0.0014744326,0.00015185811],"about_ca_topic_score_codex":0.000019810768,"about_ca_topic_score_gemma":0.0000060897946,"teacher_disagreement_score":0.06918757,"about_ca_system_score_codex":0.000043601543,"about_ca_system_score_gemma":0.000041878997,"threshold_uncertainty_score":0.34688008},"labels":[],"label_agreement":null},{"id":"W1979736093","doi":"10.1007/s00493-008-2272-6","title":"Note edge-colourings of K n,n with no long two-coloured cycles","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Bounded function; Graph; Upper and lower bounds","score_opus":0.0062415386611180896,"score_gpt":0.1904457517298767,"score_spread":0.18420421306875862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979736093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.975878,0.00038176554,0.0003614162,0.000011931329,0.0006572163,0.00017669583,0.0000025277245,0.0002788194,0.022251612],"genre_scores_gemma":[0.9993254,0.000029798046,0.00012319084,0.000008921073,0.000041637453,0.000024544723,0.0000020321165,0.000038272105,0.00040621776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991728,0.000031721607,0.00021805636,0.00014932132,0.00017668112,0.00025141196],"domain_scores_gemma":[0.9994114,0.00006135136,0.00005590231,0.0002999243,0.000082276485,0.000089117944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009797819,0.0001688981,0.00028354287,0.00008976326,0.00009293946,0.00000793333,0.00021702024,0.00007355133,0.000029141449],"category_scores_gemma":[0.0000161265,0.00015029176,0.00006837838,0.00029974975,0.000088694025,0.00009080749,0.000025087267,0.00015659213,0.000085084146],"study_design_candidate":"observational","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.001431033,0.0028765777,0.3636203,0.003793514,0.0021242513,0.0025319974,0.022536801,0.03422098,0.098826386,0.41058347,0.05037878,0.0070759035],"study_design_scores_gemma":[0.026195465,0.003993828,0.4002388,0.0016699828,0.0004991182,0.001605686,0.0005409375,0.014052084,0.4070969,0.038607337,0.099424735,0.0060751354],"about_ca_topic_score_codex":0.000013576797,"about_ca_topic_score_gemma":0.0000024823694,"teacher_disagreement_score":0.37197614,"about_ca_system_score_codex":0.000047190788,"about_ca_system_score_gemma":0.00001894699,"threshold_uncertainty_score":0.612872},"labels":[],"label_agreement":null},{"id":"W1979865967","doi":"10.1007/s004930070030","title":"Approximate Homomorphisms II: Group Homomorphisms","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Homomorphism; Mathematics; Group (periodic table); Combinatorics; Discrete mathematics; Chemistry","score_opus":0.03743375855110635,"score_gpt":0.27089127136301955,"score_spread":0.23345751281191318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979865967","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.801879,0.00036863616,0.0029752047,0.001722493,0.0013028681,0.001375398,0.000099819285,0.0013157543,0.1889608],"genre_scores_gemma":[0.98364604,0.00003573465,0.0051967856,0.00013233926,0.00009669224,0.00016366498,0.000058327892,0.00006508528,0.010605314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99778515,0.000112608854,0.00053822424,0.0005066977,0.00059114496,0.00046616356],"domain_scores_gemma":[0.99811167,0.00048813075,0.00012231183,0.0009331843,0.00015496733,0.00018973563],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000448048,0.00029479354,0.0003900148,0.000115354145,0.0005454173,0.000056798435,0.0004301769,0.00015807763,0.003787848],"category_scores_gemma":[0.00040902663,0.00028605753,0.00017065431,0.0006677072,0.00016906895,0.0002287305,0.00011166956,0.00030077723,0.0007693724],"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.000087417866,0.0016171738,0.00009109988,0.00006560382,0.00005088855,0.000018351562,0.00027384836,0.00001220939,0.00015950236,0.9757494,0.015423415,0.00645111],"study_design_scores_gemma":[0.0014687922,0.0003380913,0.0004386866,0.000029336306,0.00005143472,0.000041359315,0.000034949193,0.0009188721,0.00033255073,0.9491032,0.0468486,0.00039414922],"about_ca_topic_score_codex":0.000019164276,"about_ca_topic_score_gemma":0.00000224201,"teacher_disagreement_score":0.18176705,"about_ca_system_score_codex":0.0002483757,"about_ca_system_score_gemma":0.000058863177,"threshold_uncertainty_score":0.9999592},"labels":[],"label_agreement":null},{"id":"W1981300700","doi":"10.1007/s00493-013-2771-y","title":"Local chromatic number of quadrangulations of surfaces","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Chromatic scale; Vertex (graph theory); Graph; Betti number; Generalization; Discrete mathematics; Mathematical analysis","score_opus":0.010703791616940099,"score_gpt":0.2437316914439877,"score_spread":0.2330278998270476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981300700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5982479,0.00025045167,0.39442736,0.0006343882,0.00016220075,0.00012079048,0.0000049845808,0.00006413473,0.0060878275],"genre_scores_gemma":[0.99321157,0.000008089105,0.00654931,0.000015778083,0.0000024450255,0.000005003985,0.0000023373877,0.0000017970193,0.00020365509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992287,0.000039709415,0.00025788607,0.0001409089,0.00021392283,0.00011886617],"domain_scores_gemma":[0.99908644,0.00018455453,0.00012544016,0.00041534982,0.00013320462,0.000055007116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009076451,0.00006380908,0.00021627735,0.00009041276,0.000032994812,0.000017600732,0.00059573475,0.00003759237,0.0004859279],"category_scores_gemma":[0.00007881819,0.000047895905,0.000072647956,0.0015198721,0.000095376956,0.00023437984,0.00017407008,0.000041642375,0.00018408825],"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.0000011782486,0.00075019203,0.02883044,0.000068609304,0.00010406099,0.0000025112004,0.00029998238,0.00023163097,0.0004906414,0.92375284,0.005236329,0.040231586],"study_design_scores_gemma":[0.0007189255,0.00023985826,0.3960151,0.0000326133,0.000059251473,0.000008435763,0.00014943819,0.06420153,0.005539114,0.529526,0.0031315605,0.0003782057],"about_ca_topic_score_codex":0.0004243239,"about_ca_topic_score_gemma":9.899885e-7,"teacher_disagreement_score":0.3949637,"about_ca_system_score_codex":0.000012251092,"about_ca_system_score_gemma":0.000016542132,"threshold_uncertainty_score":0.532057},"labels":[],"label_agreement":null},{"id":"W1982114488","doi":"10.1007/s004930200024","title":"On Erdős's Conjecture on Multiplicities of Complete Subgraphs Lower Upper Bound for Cliques of Size 6","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Upper and lower bounds; Discrete mathematics","score_opus":0.044313882278276054,"score_gpt":0.28693761128235407,"score_spread":0.24262372900407803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982114488","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98701817,0.00028146937,0.00010306688,0.00013449811,0.0007782941,0.00053516723,0.000121042394,0.00006630971,0.010961971],"genre_scores_gemma":[0.9982232,0.00003887749,0.00086344307,0.00020166252,0.00003497068,0.000024806546,0.000002578447,0.000039947874,0.0005705111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987343,0.0000821908,0.00041596172,0.00023869921,0.00027548432,0.00025338586],"domain_scores_gemma":[0.99577135,0.0031828706,0.00026790565,0.0005602765,0.00015984624,0.000057775174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018171221,0.0002358,0.00053156144,0.00011725957,0.00015337035,0.000012488465,0.0003031057,0.00016009486,0.0001751172],"category_scores_gemma":[0.00067185046,0.00018093488,0.00030148373,0.00015104703,0.0002513028,0.00003489446,0.000056124045,0.00017983337,0.0000020992877],"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.00017279405,0.00039312005,0.00026207854,0.00022657625,0.00009208643,0.0000016597832,0.0009829719,0.0000024405201,0.0003674373,0.9877357,0.009543357,0.00021978356],"study_design_scores_gemma":[0.00132042,0.0012474421,0.0004787252,0.000108968896,0.000047222115,0.000001811207,0.000079507015,0.00009636599,0.0069662426,0.98566306,0.0037811243,0.00020910433],"about_ca_topic_score_codex":0.0000047095687,"about_ca_topic_score_gemma":0.0000012288135,"teacher_disagreement_score":0.011205021,"about_ca_system_score_codex":0.000031198277,"about_ca_system_score_gemma":0.000007937857,"threshold_uncertainty_score":0.737831},"labels":[],"label_agreement":null},{"id":"W1984911038","doi":"10.1007/s004930100000","title":"On a Generalized Anti-Ramsey Problem","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Ramsey's theorem; Order (exchange); Ramsey theory; Greedy coloring; Fractional coloring; List coloring; Complete coloring; Discrete mathematics","score_opus":0.03030719509583264,"score_gpt":0.29230931718515496,"score_spread":0.26200212208932233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984911038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90598035,0.00012277704,0.00031173235,0.0002567078,0.0006838242,0.00027567914,0.000002245274,0.00023546812,0.092131235],"genre_scores_gemma":[0.99529076,0.000058828056,0.0020636288,0.00030859635,0.00006346566,0.000022312275,0.0000020639327,0.000034645534,0.0021556958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890095,0.000091693575,0.000223794,0.00024166366,0.00024858024,0.0002933359],"domain_scores_gemma":[0.9990318,0.00023085556,0.00008981497,0.0004962679,0.000057529036,0.00009377374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002119923,0.00017696037,0.00026184059,0.00008712472,0.00025104234,0.000030448127,0.0002943113,0.00010470278,0.00023737158],"category_scores_gemma":[0.00015298075,0.00013655031,0.00010884844,0.00027379766,0.000051831306,0.000046682773,0.000095955365,0.00018964225,0.000037665468],"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.00002459102,0.00016164241,0.0005649126,0.000020322745,0.000029079609,0.00002911924,0.00022454326,0.0000018761217,0.00006844734,0.98140687,0.016480962,0.0009876197],"study_design_scores_gemma":[0.000805289,0.000111299385,0.00039565668,0.000022074939,0.00001891114,0.000020280686,0.000011282411,0.000036608628,0.00028692596,0.97408986,0.024015985,0.00018583414],"about_ca_topic_score_codex":0.000004585289,"about_ca_topic_score_gemma":3.7405724e-7,"teacher_disagreement_score":0.089975536,"about_ca_system_score_codex":0.00004533044,"about_ca_system_score_gemma":0.000014806043,"threshold_uncertainty_score":0.556836},"labels":[],"label_agreement":null},{"id":"W1986273263","doi":"10.1007/s00493-003-0030-3","title":"Fast Cycle Canceling Algorithms for Minimum Cost Submodular Flow*","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Time complexity; Minimum-cost flow problem; Combinatorics; Flow (mathematics); Disjoint sets; Algorithm; Flow network; Discrete mathematics","score_opus":0.02942264740207311,"score_gpt":0.2672352279507417,"score_spread":0.2378125805486686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986273263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002653084,0.0007507048,0.9883281,0.00042189262,0.0035513877,0.00058054616,0.000016299513,0.0002919465,0.003406067],"genre_scores_gemma":[0.6830288,0.0000826424,0.31497976,0.0005333679,0.00018826543,0.00035410354,0.000014135037,0.00005153291,0.00076733896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805695,0.00007531864,0.0003106509,0.0006127418,0.00032340016,0.00062091247],"domain_scores_gemma":[0.99847937,0.00020218243,0.00009945106,0.0008107005,0.00019707665,0.00021120837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004074593,0.00023894296,0.0002931794,0.00013250281,0.00045942896,0.00019566044,0.0010631402,0.00009469697,0.000020215366],"category_scores_gemma":[0.00013555074,0.00025271447,0.00017639293,0.00075567194,0.00006994258,0.00032045186,0.00016447555,0.0001918829,0.000035286273],"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.000008313119,0.00047327142,0.00029868033,0.000053672775,0.00006186636,0.000031790885,0.0006812323,0.0007778208,0.00022513203,0.8339563,0.005788008,0.1576439],"study_design_scores_gemma":[0.0019033363,0.00028208565,0.00021422168,0.000035482237,0.000017342527,0.000031841926,0.000066647466,0.47967222,0.0041225585,0.31315958,0.19980095,0.0006937179],"about_ca_topic_score_codex":0.000021243342,"about_ca_topic_score_gemma":0.0000034854188,"teacher_disagreement_score":0.68037575,"about_ca_system_score_codex":0.00012300981,"about_ca_system_score_gemma":0.0001230764,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W1994006656","doi":"10.1007/s00493-012-2552-z","title":"A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks","year":2012,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Spanning tree; Minimum spanning tree; Steiner tree problem; Minimum weight; Minimum degree spanning tree; k-minimum spanning tree; Connected dominating set; Bounded function; Asymptotically optimal algorithm","score_opus":0.028307662286784503,"score_gpt":0.26016036637486684,"score_spread":0.23185270408808234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994006656","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6037306,0.02933463,0.3569645,0.0015042722,0.0029969488,0.0015033165,0.000009710492,0.00039364444,0.0035623848],"genre_scores_gemma":[0.98569196,0.00017774747,0.013468756,0.00022192998,0.00014858242,0.00009347906,0.0000036080473,0.000021763082,0.00017215536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998224,0.000069287154,0.000327078,0.00048719047,0.00020979813,0.0006826224],"domain_scores_gemma":[0.99865484,0.000524962,0.0001022887,0.00044689392,0.000046864472,0.00022417783],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005982217,0.00027039577,0.00042195446,0.00021707852,0.00028139094,0.00040073827,0.0004913765,0.00012565787,0.000004555527],"category_scores_gemma":[0.000059835897,0.00024754147,0.000095707794,0.0004667142,0.00016862899,0.0007677687,0.00042781638,0.00023503702,0.0000016288504],"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.0002262798,0.00081924093,0.15036799,0.00008092248,0.00013682728,0.000024804873,0.004222448,0.000055360968,0.00011005756,0.7376967,0.0040986324,0.10216072],"study_design_scores_gemma":[0.016884733,0.0010659706,0.16869631,0.00025168897,0.00006935057,0.00009143699,0.00026737226,0.40099776,0.00022878531,0.36325923,0.04653793,0.00164943],"about_ca_topic_score_codex":0.000039518643,"about_ca_topic_score_gemma":0.00007458061,"teacher_disagreement_score":0.4009424,"about_ca_system_score_codex":0.000050356346,"about_ca_system_score_gemma":0.000031886815,"threshold_uncertainty_score":0.9999977},"labels":[],"label_agreement":null},{"id":"W2005117665","doi":"10.1007/s00493-007-0041-6","title":"Vertex-Colouring Edge-Weightings","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Neighbourhood (mathematics); Discrete mathematics","score_opus":0.008634628087088286,"score_gpt":0.22095935191402125,"score_spread":0.21232472382693296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005117665","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7437551,0.0022433917,0.14521497,0.0028608039,0.008947708,0.0004003305,5.2492237e-7,0.0024000995,0.09417707],"genre_scores_gemma":[0.99116564,0.000009221741,0.0078364555,0.00041642296,0.00000685636,0.0000033796866,4.570421e-7,0.000010041076,0.0005515236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868006,0.000021815944,0.00023943982,0.0003480694,0.00028127656,0.0004293713],"domain_scores_gemma":[0.99895614,0.00013519112,0.00007741354,0.0005378476,0.00011232729,0.00018107204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064556516,0.00012710868,0.00014084062,0.0001547117,0.00022616789,0.00009031363,0.00072406005,0.00007194352,0.000008732624],"category_scores_gemma":[0.00007169175,0.00011793172,0.0000648182,0.0007090719,0.00003539945,0.00021385311,0.00026866526,0.00017176426,0.00020529258],"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.0000025732404,0.00010604124,0.0010299677,0.0000076226966,0.000007824154,0.00004204517,0.00025332658,0.0000026244177,0.0013485942,0.97846377,0.0051966324,0.013539008],"study_design_scores_gemma":[0.0011349171,0.00021297201,0.0049430123,0.000051815972,0.000009461482,0.00004318994,0.000023613584,0.0031866224,0.026989497,0.9203276,0.042570584,0.000506721],"about_ca_topic_score_codex":0.000015042737,"about_ca_topic_score_gemma":6.30595e-7,"teacher_disagreement_score":0.24741054,"about_ca_system_score_codex":0.000049280974,"about_ca_system_score_gemma":0.000033571912,"threshold_uncertainty_score":0.48091158},"labels":[],"label_agreement":null},{"id":"W2009649498","doi":"10.1007/s00493-014-3040-4","title":"Highly arc-transitive digraphs — Structure and counterexamples","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Transitive relation; Arc (geometry); Counterexample; Combinatorics; Digraph; Discrete mathematics; Transitive closure; Geometry","score_opus":0.029607543545062426,"score_gpt":0.28701406332159995,"score_spread":0.2574065197765375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009649498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892858,0.00016091774,0.0015670811,0.00032204186,0.00019890303,0.00026731825,0.000035278805,0.00015023453,0.008012419],"genre_scores_gemma":[0.99883944,0.000022139599,0.0006896083,0.000080604,0.000043251854,0.000010010849,0.00000710972,0.00003552464,0.00027229395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986966,0.00019671283,0.00018538002,0.00028851704,0.00030754352,0.00032522646],"domain_scores_gemma":[0.9977721,0.0015153319,0.000058665806,0.00040269198,0.00011614221,0.00013507168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035398663,0.00017908584,0.0002744814,0.000113304755,0.00014655916,0.0000676469,0.00024586712,0.00010475691,0.00008274002],"category_scores_gemma":[0.000555692,0.00015408968,0.000049155824,0.00023035167,0.00018099896,0.00009331844,0.000091709364,0.000273284,0.000017025319],"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.000033318287,0.00006535083,0.001417933,0.00011348859,0.00003613089,0.000005794922,0.00080074876,8.431794e-8,0.0014739356,0.9928325,0.0016962895,0.0015244304],"study_design_scores_gemma":[0.0007014156,0.00018900364,0.0028126969,0.00003333644,0.000022272096,0.000013726443,0.00008589046,0.00013103137,0.0018380784,0.9846596,0.009315845,0.00019708659],"about_ca_topic_score_codex":0.000012512867,"about_ca_topic_score_gemma":0.000007249265,"teacher_disagreement_score":0.009553651,"about_ca_system_score_codex":0.000038533297,"about_ca_system_score_gemma":0.000018151757,"threshold_uncertainty_score":0.62835944},"labels":[],"label_agreement":null},{"id":"W2016667694","doi":"10.1007/s004930200014","title":"Ramsey Numbers for Trees of Small Maximum Degree","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Degree (music); Ramsey's theorem; Vertex (graph theory); Graph; Upper and lower bounds; Complete bipartite graph; Tree (set theory); Discrete mathematics","score_opus":0.1102685928597671,"score_gpt":0.28648096946199547,"score_spread":0.17621237660222838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016667694","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8094656,0.0016789313,0.0078032757,0.00047581532,0.0029074464,0.001367612,0.000056849873,0.00034110242,0.1759034],"genre_scores_gemma":[0.9899778,0.000032117256,0.008161109,0.000046760822,0.000042427066,0.000026854474,0.0000014794741,0.00003108486,0.0016803703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991455,0.000039382787,0.00027217923,0.00017382503,0.00013738644,0.00023174784],"domain_scores_gemma":[0.9987569,0.000518799,0.0001419638,0.00042427715,0.00009128861,0.000066758315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017203929,0.00014309159,0.000287122,0.00006435813,0.00012921522,0.000010486667,0.00032076155,0.00010698971,0.00016621174],"category_scores_gemma":[0.00031576538,0.0001190922,0.00017388604,0.00015092637,0.000086422704,0.000034544104,0.000075246346,0.00009698957,0.000004804017],"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.000020478426,0.00017933414,0.0006299871,0.00012231339,0.00006093771,0.000002234514,0.0008000024,4.9225736e-7,0.00006160714,0.97161245,0.016878884,0.009631295],"study_design_scores_gemma":[0.0008500489,0.00013876661,0.0003094639,0.00002011666,0.000048291982,0.0000044959233,0.00006861295,0.00015244483,0.00071924285,0.98659587,0.0109407725,0.00015185619],"about_ca_topic_score_codex":0.000004778609,"about_ca_topic_score_gemma":0.000003301466,"teacher_disagreement_score":0.18051222,"about_ca_system_score_codex":0.000026717977,"about_ca_system_score_gemma":0.0000058380733,"threshold_uncertainty_score":0.4856439},"labels":[],"label_agreement":null},{"id":"W2019038833","doi":"10.1007/s00493-014-2967-9","title":"Erratum to: Commentary for “On planarity of compact, locally connected, metric spaces”","year":2014,"lang":"en","type":"erratum","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Planarity testing; Metric space; Metric (unit); Combinatorics; Discrete mathematics; Pure mathematics","score_opus":0.018324183717083123,"score_gpt":0.2670987992344801,"score_spread":0.248774615517397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019038833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026052754,0.0012314108,0.8730053,0.018999627,0.07702231,0.002014095,0.00021237506,0.00032646736,0.026927928],"genre_scores_gemma":[0.79066306,0.0003628384,0.03944377,0.04107713,0.0066266544,0.0004923464,0.0072841705,0.00035567692,0.11369437],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972479,0.00018695243,0.00058615307,0.0007747922,0.00076025474,0.00044398423],"domain_scores_gemma":[0.99677086,0.00092180085,0.00046649037,0.00095401815,0.00059503823,0.0002917897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005566819,0.00043828637,0.00081706175,0.0009454571,0.0002275719,0.00016601056,0.0015792393,0.00035442525,0.000011501028],"category_scores_gemma":[0.00039148727,0.0004456264,0.00024202272,0.0019060161,0.000041615298,0.00014784819,0.00026726216,0.00057745783,0.000037342943],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003892305,0.00030789291,0.000013413817,0.00016739426,0.00007760485,0.0000038154935,0.000067420806,0.00084128045,0.000013180749,0.06424136,0.93171364,0.0025140757],"study_design_scores_gemma":[0.0009734297,0.0017425353,0.0004577625,0.00016479661,0.000045968707,0.000006296236,0.000006359631,0.025384884,0.0003316499,0.020041415,0.9503042,0.00054067525],"about_ca_topic_score_codex":0.00006685334,"about_ca_topic_score_gemma":0.000011250825,"teacher_disagreement_score":0.8335615,"about_ca_system_score_codex":0.0002508354,"about_ca_system_score_gemma":0.00032928964,"threshold_uncertainty_score":0.99979955},"labels":[],"label_agreement":null},{"id":"W2026211607","doi":"10.1007/s004930070006","title":"Hedetniemi's Conjecture and the Retracts of a Product of Graphs","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Champlain Regional College","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.004598761815875983,"score_gpt":0.18767523242924197,"score_spread":0.183076470613366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026211607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985181,0.005854955,0.00011689401,0.002557496,0.00023087564,0.0002843385,0.0000015030458,0.00008659357,0.00568639],"genre_scores_gemma":[0.99864125,0.00018803976,0.0008590043,0.000092487266,0.0000015308967,0.0000041872922,3.178873e-7,0.000003818097,0.000209368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991706,0.000076884004,0.00022000818,0.0002080971,0.00019998926,0.0001243933],"domain_scores_gemma":[0.9990974,0.0001258624,0.000105406456,0.00053880765,0.00008901801,0.000043477306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003930236,0.00008385534,0.00020795713,0.00005493434,0.000065388434,0.000018204812,0.0003951249,0.000036306068,0.000012081127],"category_scores_gemma":[0.00006172039,0.00005165663,0.00005354331,0.0005490298,0.00023374017,0.00007828415,0.0000663869,0.00010851679,0.0000024361332],"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.000023333057,0.000091720314,0.0003860641,0.00003169576,0.000018403362,0.000001701935,0.00073633954,0.000009364827,0.0006759158,0.9859166,0.0019598028,0.010149056],"study_design_scores_gemma":[0.0017415975,0.00016543063,0.0019232613,0.000046967936,0.000016364247,0.000022918728,0.000009470129,0.0007012234,0.012355668,0.98019344,0.002705829,0.00011785698],"about_ca_topic_score_codex":0.000047405643,"about_ca_topic_score_gemma":3.7990912e-7,"teacher_disagreement_score":0.0134602925,"about_ca_system_score_codex":0.0000031850152,"about_ca_system_score_gemma":0.000028586965,"threshold_uncertainty_score":0.21064962},"labels":[],"label_agreement":null},{"id":"W2029049420","doi":"10.1007/s00493-003-0034-z","title":"The Fixing Block Method in Combinatorics on Words","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Block (permutation group theory); Combinatorics on words; Algebraic combinatorics; Discrete mathematics; Word (group theory); Geometry","score_opus":0.010670412091314195,"score_gpt":0.25678029379713985,"score_spread":0.24610988170582565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029049420","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18760014,0.009217522,0.3099651,0.011842103,0.024787733,0.0022286652,0.000003862938,0.0024930458,0.45186183],"genre_scores_gemma":[0.9963992,0.000060481787,0.0023977265,0.00034144393,0.000014154847,0.000030703966,2.5751845e-7,0.000015893007,0.0007400927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980888,0.00042551212,0.00027633397,0.00039554675,0.0003450864,0.00046875427],"domain_scores_gemma":[0.99764395,0.0011643538,0.00009542445,0.00095241563,0.000045967176,0.00009790464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564932,0.00018373087,0.00020037501,0.000112617185,0.00033639217,0.00020781526,0.001242652,0.00008091307,0.000004801991],"category_scores_gemma":[0.00033211737,0.00013582617,0.000073252166,0.0011656139,0.000035785335,0.00016701226,0.00017630469,0.00034485688,0.00006479686],"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.0000022678098,0.00013349814,0.00038502362,0.000003237431,0.0000056006047,0.000021120462,0.00022203533,0.000025369125,0.00003240023,0.99120915,0.0013872558,0.006573059],"study_design_scores_gemma":[0.0008227819,0.00015402255,0.0012750978,0.000032568707,0.0000034117504,0.000021495876,0.00009340549,0.006852446,0.0031136726,0.8901946,0.09712864,0.00030785886],"about_ca_topic_score_codex":0.000008315211,"about_ca_topic_score_gemma":0.0000010861187,"teacher_disagreement_score":0.8087991,"about_ca_system_score_codex":0.0001560271,"about_ca_system_score_gemma":0.00006713246,"threshold_uncertainty_score":0.553883},"labels":[],"label_agreement":null},{"id":"W2031397195","doi":"10.1007/s00493-008-2099-1","title":"Near optimal bounds for the Erdős distinct distances problem in high dimensions","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Set (abstract data type)","score_opus":0.018005790983252574,"score_gpt":0.24024051087477719,"score_spread":0.2222347198915246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031397195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29398218,0.00096935296,0.699911,0.0029266027,0.0010728781,0.00052745827,0.0000055456344,0.000112168564,0.0004928476],"genre_scores_gemma":[0.97116995,0.000026093778,0.028140044,0.00008837301,0.000045522618,0.000103715945,0.000009651606,0.0000056550216,0.00041100662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909604,0.000037178273,0.00018732205,0.00026207327,0.00020778677,0.00020960887],"domain_scores_gemma":[0.9991151,0.000401928,0.00006126355,0.00027423337,0.00009638207,0.000051111703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018799848,0.00009941212,0.0001152776,0.000048266764,0.0006501177,0.00010294881,0.00045302277,0.00003115759,0.0000038968046],"category_scores_gemma":[0.000058098933,0.00007386631,0.000048899168,0.00065765943,0.00007011553,0.0002287068,0.0001227111,0.00009054718,0.000010112061],"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.000028293716,0.00039361723,0.0032138743,0.000019167066,0.000023587429,0.000020811345,0.0012367322,0.023459254,0.00007203709,0.94827825,0.012541288,0.010713077],"study_design_scores_gemma":[0.0020983284,0.0004754686,0.08597033,0.000029455634,0.000016715185,0.000050758543,0.000032725777,0.5711783,0.00048779265,0.14371029,0.19542348,0.0005263565],"about_ca_topic_score_codex":0.000024839934,"about_ca_topic_score_gemma":0.000006585833,"teacher_disagreement_score":0.804568,"about_ca_system_score_codex":0.00006249382,"about_ca_system_score_gemma":0.00012886919,"threshold_uncertainty_score":0.50002456},"labels":[],"label_agreement":null},{"id":"W2032198109","doi":"10.1007/s00493-008-2157-8","title":"An algorithm for packing non-zero A-paths in group-labelled graphs","year":2008,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Path (computing); Abelian group; Graph; Group (periodic table); Matching (statistics); Induced path; Zero (linguistics); Discrete mathematics; Algorithm; Longest path problem; Shortest path problem; Computer science","score_opus":0.02376304741433146,"score_gpt":0.2586423356285821,"score_spread":0.2348792882142506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032198109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039816257,0.00033180843,0.95641387,0.00016243936,0.0016251665,0.0005861061,0.000007741158,0.00032452896,0.00073210744],"genre_scores_gemma":[0.82615143,0.0000931208,0.17324089,0.00021336999,0.000052640004,0.00013786943,0.000012932609,0.000026581703,0.000071163624],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780613,0.000088387686,0.0003979508,0.00071456895,0.00036003665,0.0006329534],"domain_scores_gemma":[0.9983854,0.00021874427,0.000119274875,0.000939846,0.00012834927,0.00020835949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041976786,0.00027242803,0.00038372862,0.0003901434,0.0005008682,0.000107293694,0.001576306,0.0001254588,0.0000061468086],"category_scores_gemma":[0.00003317845,0.0002864658,0.00016424696,0.0014837768,0.00011526625,0.00069514994,0.00025411186,0.000275771,0.000014574574],"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.00001744908,0.0023243797,0.0051488425,0.0000418114,0.000046790745,0.00028233876,0.0029716312,0.000027410757,0.0004877612,0.50425655,0.0028053662,0.48158965],"study_design_scores_gemma":[0.0037512092,0.001173977,0.009552467,0.000050419356,0.000009090466,0.000080489874,0.000042696076,0.3836365,0.0008060572,0.59238034,0.007693621,0.000823151],"about_ca_topic_score_codex":0.00006646295,"about_ca_topic_score_gemma":0.0000065611175,"teacher_disagreement_score":0.7863352,"about_ca_system_score_codex":0.00008794863,"about_ca_system_score_gemma":0.00007097103,"threshold_uncertainty_score":0.99995875},"labels":[],"label_agreement":null},{"id":"W2033177258","doi":"10.1007/s00493-007-2241-5","title":"A phase transition for the metric distortion of percolation on the hypercube","year":2007,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Hypercube; Combinatorics; Distortion (music); Phase transition; Percolation (cognitive psychology); Uniqueness; Bernoulli's principle; Metric (unit); Discrete mathematics; Mathematical analysis; Physics; Condensed matter physics; Thermodynamics","score_opus":0.06520229943308131,"score_gpt":0.35047540168216074,"score_spread":0.2852731022490794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033177258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30597728,0.0000826901,0.6894639,0.00095978315,0.0001857346,0.000923564,0.000013590948,0.000030268237,0.0023631637],"genre_scores_gemma":[0.9992094,0.000010900513,0.00053011504,0.0000670091,0.000030941694,0.000045776495,0.000004641816,0.00001397243,0.00008724811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999213,0.00003055123,0.00029455306,0.00009918087,0.00023088783,0.00013183133],"domain_scores_gemma":[0.9959007,0.0035629056,0.00013381329,0.00026746723,0.00010543875,0.000029665765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011416116,0.000086446955,0.00014784795,0.000059862756,0.00014654297,0.000012057428,0.00013919108,0.00005493758,0.00004056262],"category_scores_gemma":[0.00082137296,0.00004614821,0.00012105382,0.00028526344,0.000039099938,0.00003865587,0.000008897286,0.000092715316,0.0000036236129],"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.000068033674,0.0010753486,0.0000029367397,0.00007950353,0.000027391154,3.7484702e-7,0.00061336305,0.0000030380982,0.00047726842,0.983877,0.0007632927,0.013012456],"study_design_scores_gemma":[0.0012551898,0.0005891952,0.00027133155,0.000037901562,0.00014081648,0.0000023551427,0.00032859563,0.031280126,0.0021982405,0.96257484,0.0012011203,0.00012029031],"about_ca_topic_score_codex":0.0000032134724,"about_ca_topic_score_gemma":0.0000012548412,"teacher_disagreement_score":0.6932321,"about_ca_system_score_codex":0.00006152925,"about_ca_system_score_gemma":0.000009563019,"threshold_uncertainty_score":0.18818694},"labels":[],"label_agreement":null},{"id":"W2039034730","doi":"10.1007/s00493-005-0013-7","title":"Matroid Matching Via Mixed Skew-Symmetric Matrices","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Matroid; Rank (graph theory); Matching (statistics); Discrete mathematics; Matrix (chemical analysis); Bipartite graph; Cardinality (data modeling); Skew; Graph","score_opus":0.00494074972957487,"score_gpt":0.1859508627076843,"score_spread":0.18101011297810943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039034730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9392108,0.008839377,0.0076822895,0.000098077195,0.002772691,0.00024626285,0.000005666582,0.0014196257,0.039725237],"genre_scores_gemma":[0.9988807,0.000091453716,0.00044239603,0.0000275177,0.00016861869,0.000017015867,0.0000041370945,0.000052017498,0.00031617415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989064,0.000048767,0.00028996478,0.00018699747,0.00020489444,0.00036297704],"domain_scores_gemma":[0.99938154,0.000089902576,0.000046218134,0.0003288138,0.000027896296,0.00012564793],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021318533,0.00020832101,0.00024759973,0.00029291882,0.00012025544,0.000061140156,0.00031683917,0.00010584453,0.00008448395],"category_scores_gemma":[0.000010544191,0.00020939446,0.00010950729,0.00084916066,0.000016644326,0.00020586817,0.00004038327,0.00021282244,0.0008330196],"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.000037518497,0.00053535163,0.0018321088,0.00086566113,0.0004402379,0.0000865549,0.003307567,0.007254814,0.017068855,0.83480036,0.037976276,0.09579469],"study_design_scores_gemma":[0.0037751005,0.00030446265,0.008044896,0.00025581286,0.00021984984,0.00029561823,0.0009843075,0.026793407,0.036747023,0.38164455,0.53778434,0.0031506482],"about_ca_topic_score_codex":0.000012576668,"about_ca_topic_score_gemma":0.0000016195413,"teacher_disagreement_score":0.49980804,"about_ca_system_score_codex":0.000107116626,"about_ca_system_score_gemma":0.000005856561,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W2040142481","doi":"10.1007/s00493-013-2723-6","title":"Ramsey degrees of boron tree structures","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Automorphism group; Automorphism; Embedding; Tree (set theory); Discrete mathematics; Group (periodic table); Limit (mathematics); Ramsey's theorem; Binary tree; Class (philosophy); Graph","score_opus":0.03028159500317529,"score_gpt":0.29926871099050356,"score_spread":0.2689871159873283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040142481","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9659015,0.0005867944,0.002654361,0.00023101273,0.00052752125,0.00031508325,0.000004106946,0.00013707149,0.02964254],"genre_scores_gemma":[0.9935008,0.000013775831,0.005384408,0.00002667713,0.000021064589,0.000015327669,0.0000019456504,0.0000149345005,0.001021037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999349,0.000059683684,0.00019489396,0.0001247056,0.00010121582,0.00017047409],"domain_scores_gemma":[0.9991075,0.00034341784,0.00010987944,0.00031743548,0.000071941,0.000049841048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007460468,0.00010698384,0.00022302456,0.000042556178,0.000057888275,0.0000049505443,0.00020766148,0.00010311982,0.00051668537],"category_scores_gemma":[0.00026456467,0.00008681272,0.000055696244,0.0000880893,0.00012557219,0.000085097396,0.000056067423,0.000126055,0.000042486343],"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.000008894187,0.00007601989,0.00056619546,0.00003220222,0.00002253865,0.0000017522923,0.00024266406,0.0000018585528,0.0004825357,0.9882506,0.005988904,0.0043258234],"study_design_scores_gemma":[0.00033530896,0.00007820073,0.0050641843,0.0000074863506,0.000014599397,0.0000039047654,0.00012056924,0.000030821804,0.0032421167,0.9901014,0.0009068143,0.00009458664],"about_ca_topic_score_codex":0.00001888755,"about_ca_topic_score_gemma":0.0000032974829,"teacher_disagreement_score":0.028621502,"about_ca_system_score_codex":0.000021620812,"about_ca_system_score_gemma":0.00001443506,"threshold_uncertainty_score":0.5657342},"labels":[],"label_agreement":null},{"id":"W2042875854","doi":"10.1007/s00493-014-2959-9","title":"Many non-equivalent realizations of the associahedron","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Liquid Crystal Research Advancements","field":"Materials Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Modulo; Polytope; Equivalence (formal languages); Isometry (Riemannian geometry); Type (biology); Cluster algebra; Realization (probability); Polyhedron","score_opus":0.014258493655138814,"score_gpt":0.28036040500932735,"score_spread":0.26610191135418854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042875854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95718664,0.00005933643,0.007011437,0.00085252896,0.0013328765,0.000441388,0.000019853755,0.000058785477,0.03303714],"genre_scores_gemma":[0.9976377,0.000012490516,0.00013708202,0.000054317963,0.000022201999,0.00002167971,0.0000017980367,0.000010579326,0.0021021636],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99875045,0.0001254573,0.00018794031,0.00016097743,0.0005201608,0.00025503445],"domain_scores_gemma":[0.9990832,0.00009438563,0.0001254842,0.00048301613,0.00014058908,0.000073279094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044498796,0.00007340405,0.00012417187,0.000028214805,0.00014937305,0.000023494105,0.00055438286,0.000033008768,0.00018334648],"category_scores_gemma":[0.0005768658,0.000052321077,0.000047994105,0.00025504822,0.00009331181,0.00010145773,0.00032772636,0.00007106547,0.00008555883],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.000019040162,0.0003802089,0.006648861,0.00008969432,0.000012004884,0.0000010100605,0.00024323429,0.00008582143,0.76670796,0.21291685,0.012087218,0.00080807594],"study_design_scores_gemma":[0.0016653127,0.0005271731,0.037344784,0.00013373337,0.0000295085,0.0000019697497,0.000073295836,0.0014670157,0.74169946,0.10878237,0.10792633,0.00034907114],"about_ca_topic_score_codex":0.000029848105,"about_ca_topic_score_gemma":0.0000018851381,"teacher_disagreement_score":0.10413448,"about_ca_system_score_codex":0.00013756395,"about_ca_system_score_gemma":0.000052738666,"threshold_uncertainty_score":0.21335916},"labels":[],"label_agreement":null},{"id":"W2044603066","doi":"10.1007/s00493-005-0014-6","title":"Lower Bounds For Concurrent Zero Knowledge*","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical proof; Zero-knowledge proof; Asynchronous communication; Zero (linguistics); Argument (complex analysis); Mathematics; Class (philosophy); Discrete mathematics; Theoretical computer science; Computer science; Artificial intelligence; Computer network","score_opus":0.018413443628149253,"score_gpt":0.27931495785124527,"score_spread":0.26090151422309604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044603066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035209444,0.0029827422,0.97900337,0.0010314689,0.0041918876,0.00031569498,0.00001970709,0.0003366264,0.008597568],"genre_scores_gemma":[0.9924207,0.000037771995,0.007054144,0.00018666813,0.00012009445,0.00005193335,0.000010336406,0.000008376401,0.0001100177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989642,0.000025685817,0.00018674064,0.0003633951,0.00014044784,0.00031955197],"domain_scores_gemma":[0.99894863,0.00013260501,0.000055762386,0.000597063,0.0001245128,0.00014143474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019105767,0.00013764063,0.00015829377,0.00008662635,0.00020038609,0.00015656577,0.0009164997,0.000062643885,0.000018489152],"category_scores_gemma":[0.00003989336,0.00013258921,0.00013794472,0.00042745398,0.00005044705,0.00043351648,0.00025658417,0.0001131695,0.00011803551],"study_design_candidate":"not_applicable","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.0000031831507,0.00040583254,0.00007849118,0.000011780384,0.000008954991,8.823453e-7,0.00021790968,6.800619e-7,0.000019029612,0.8588641,0.08033184,0.06005727],"study_design_scores_gemma":[0.00069841347,0.00015621886,0.0002216537,0.000008554207,0.000005997793,0.000002861619,0.0000026072023,0.0038176023,0.0004450464,0.094725534,0.89972585,0.00018964188],"about_ca_topic_score_codex":0.0000018882471,"about_ca_topic_score_gemma":0.0000026998664,"teacher_disagreement_score":0.9888997,"about_ca_system_score_codex":0.000058307865,"about_ca_system_score_gemma":0.000063759064,"threshold_uncertainty_score":0.5406831},"labels":[],"label_agreement":null},{"id":"W2044987315","doi":"10.1007/s00493-014-3132-1","title":"Sabidussi versus Hedetniemi for three variations of the chromatic number","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Conjecture; Chromatic scale; Homomorphism; Product (mathematics); Graph; Discrete mathematics; Geometry","score_opus":0.12270365183534478,"score_gpt":0.34171966285097594,"score_spread":0.21901601101563117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044987315","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9185837,0.0002405723,0.019819837,0.001784828,0.0206229,0.0027585293,0.000032894055,0.0002905097,0.03586626],"genre_scores_gemma":[0.99815667,9.124586e-7,0.0013408315,0.000020620872,0.0001232676,0.00008566058,0.0000018667879,0.000030450905,0.00023972619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988527,0.000047656304,0.00033509528,0.00017753578,0.00036397524,0.00022298061],"domain_scores_gemma":[0.9981532,0.00061872404,0.00023725689,0.00064768933,0.0002451233,0.000097994845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022997973,0.00015634407,0.00029088868,0.000021963011,0.00013465274,0.000022769145,0.0004834298,0.000117415824,0.00004380571],"category_scores_gemma":[0.0011649694,0.00010903329,0.00016812026,0.000292103,0.0000645752,0.000070347494,0.00014445963,0.000113299415,0.000010718926],"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.00004476652,0.00010519848,0.00043372583,0.000043763466,0.000059034162,1.6267595e-7,0.00031306906,0.000004720079,0.000009776171,0.9905019,0.008291793,0.0001921277],"study_design_scores_gemma":[0.002517897,0.00010925642,0.00051887514,0.000023138306,0.000103245795,0.0000019347312,0.00005742797,0.0005812656,0.00027089863,0.9936384,0.0020431331,0.00013451022],"about_ca_topic_score_codex":0.000024635774,"about_ca_topic_score_gemma":0.000008276092,"teacher_disagreement_score":0.07957299,"about_ca_system_score_codex":0.00013703901,"about_ca_system_score_gemma":0.0001719948,"threshold_uncertainty_score":0.44462487},"labels":[],"label_agreement":null},{"id":"W2046052042","doi":"10.1007/s00493-006-0013-2","title":"Canonical Partitions Of Universal Structures","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Countable set; Combinatorics; Equivalence relation; Homogeneous; Equivalence (formal languages); Omega; Characterization (materials science); Discrete mathematics; Binary number; Equivalence class (music); Arithmetic","score_opus":0.007565791298253982,"score_gpt":0.21510860452189662,"score_spread":0.20754281322364262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046052042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33710524,0.0008415082,0.5933576,0.0015490439,0.0014090033,0.00022710122,0.000008230849,0.00047568203,0.06502657],"genre_scores_gemma":[0.9954699,0.000003237363,0.004297834,0.00002954221,0.000018371149,0.0000017428672,0.0000016056142,0.0000026203325,0.00017513681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947864,0.000021322381,0.00010934596,0.00014086295,0.0001143508,0.00013546257],"domain_scores_gemma":[0.99956256,0.000046626108,0.000048101254,0.00026174064,0.00004416723,0.0000368142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002501726,0.00005834628,0.000093493574,0.00003795384,0.000063201434,0.000012970787,0.00036875703,0.000030843596,0.000017621023],"category_scores_gemma":[0.000010204991,0.000052209238,0.00003817253,0.0002762553,0.00005127569,0.00013319773,0.00009502238,0.0000626287,0.000007989491],"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":[7.5569557e-7,0.000042931624,0.0004801155,0.0000020434488,0.000001996882,0.0000068592426,0.00001821999,0.00010224249,0.0002510518,0.9971648,0.0013820374,0.00054697826],"study_design_scores_gemma":[0.00023205271,0.000058744838,0.0127142,0.0000023790692,0.0000030156964,0.0000046105943,0.0000055972355,0.0004059628,0.0027240154,0.97493726,0.00882996,0.00008223011],"about_ca_topic_score_codex":0.00003664828,"about_ca_topic_score_gemma":0.0000037670882,"teacher_disagreement_score":0.65836465,"about_ca_system_score_codex":0.00003159548,"about_ca_system_score_gemma":0.00005031387,"threshold_uncertainty_score":0.2129031},"labels":[],"label_agreement":null},{"id":"W2051714857","doi":"10.1007/s00493-006-0015-0","title":"COLORING SUBGRAPHS OF THE RADO GRAPH","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"semigroups and automata theory","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Partition (number theory); Combinatorics; Countable set; Homogeneous; Element (criminal law); Graph; Binary number; Discrete mathematics; Class (philosophy); Arithmetic; Computer science","score_opus":0.003797364287851082,"score_gpt":0.17083807351288774,"score_spread":0.16704070922503667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051714857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93165994,0.001650384,0.027844299,0.0010881108,0.0030797191,0.0002983906,0.0000024303183,0.00041516338,0.033961583],"genre_scores_gemma":[0.9991861,0.000007391084,0.0005396258,0.00005514658,0.000017113893,0.0000061480678,2.6974004e-7,0.0000052206383,0.00018298473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992375,0.00004995389,0.00016265151,0.00017231437,0.00020369205,0.0001738879],"domain_scores_gemma":[0.99913543,0.00008508583,0.000095007665,0.0006173902,0.000041600266,0.000025483883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016931175,0.000081754784,0.000115942974,0.000058972822,0.000114211434,0.00003532634,0.0010943896,0.00003397547,0.0000052671558],"category_scores_gemma":[0.000014203892,0.000057411326,0.00010306231,0.0007997203,0.00006626483,0.00012897911,0.0002557133,0.00008123028,0.000006759581],"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":[7.82803e-7,0.00006801966,0.0047441935,0.0000061079,0.0000039742054,0.0000018502319,0.000044871187,0.000008122217,0.0012402491,0.99118894,0.0018020711,0.00089082966],"study_design_scores_gemma":[0.00044087856,0.000052402967,0.074314035,0.000027168377,0.0000074000636,0.0000088321885,0.000014703556,0.0013306077,0.03370021,0.8786252,0.011302058,0.00017646591],"about_ca_topic_score_codex":0.00004947462,"about_ca_topic_score_gemma":0.0000011867567,"teacher_disagreement_score":0.11256369,"about_ca_system_score_codex":0.000018761184,"about_ca_system_score_gemma":0.000022348717,"threshold_uncertainty_score":0.2341166},"labels":[],"label_agreement":null},{"id":"W2058108962","doi":"10.1007/s004930170003","title":"Integer and Fractional Packings in Dense Graphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":92,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Graph; Disjoint sets; Integer (computer science); Pairwise comparison; Discrete mathematics; Statistics","score_opus":0.024759626505838645,"score_gpt":0.28694245928115264,"score_spread":0.262182832775314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058108962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9878965,0.00024289032,0.00017469576,0.00016402028,0.00036122397,0.000084330204,8.438802e-7,0.000045207533,0.011030269],"genre_scores_gemma":[0.99910605,0.000111019,0.0003082935,0.00013126656,0.000020131449,0.000007963655,6.908156e-7,0.000013259809,0.000301296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999337,0.000047300735,0.00015896917,0.00015917947,0.00013354058,0.00016397815],"domain_scores_gemma":[0.9993671,0.00031506334,0.00005031257,0.00017552637,0.000037223224,0.00005473072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019718122,0.00010264709,0.00014913072,0.0001266523,0.0001079557,0.000018750095,0.00009761569,0.00007846775,0.00009989089],"category_scores_gemma":[0.00021204204,0.00008627402,0.00003987169,0.00023036455,0.00006970917,0.00007847054,0.0000747913,0.00020433305,0.0000037028503],"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.000020170326,0.00006449544,0.030846708,0.000011930991,0.000010957442,0.0000306201,0.00043480622,1.4102348e-7,0.000021941712,0.96585524,0.0017565101,0.0009464782],"study_design_scores_gemma":[0.0003977663,0.000028164446,0.016794631,0.000016659103,0.00000746595,0.000052993964,0.00007951596,0.00002748749,0.00005047086,0.97507477,0.0073619676,0.000108126886],"about_ca_topic_score_codex":0.000009852841,"about_ca_topic_score_gemma":0.0000035858168,"teacher_disagreement_score":0.014052078,"about_ca_system_score_codex":0.000030906926,"about_ca_system_score_gemma":0.000008696253,"threshold_uncertainty_score":0.35181522},"labels":[],"label_agreement":null},{"id":"W2059154872","doi":"10.1007/s004930170005","title":"Critical Facets of the Stable Set Polytope","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Critical graph; Birkhoff polytope; Graph; Facet (psychology); Discrete mathematics; Line graph; Voltage graph; Geometry; Convex set","score_opus":0.028981905935811323,"score_gpt":0.27306865573500755,"score_spread":0.24408674979919623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059154872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23256388,0.003956919,0.51694643,0.06498549,0.016101029,0.0011736061,0.000046029392,0.0010862962,0.16314033],"genre_scores_gemma":[0.9972142,0.000020007452,0.0018958541,0.00034039313,0.00001997043,0.0000049963132,3.0097414e-7,0.0000048584084,0.00049941463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989654,0.000072481496,0.00017316123,0.00021715685,0.00030659733,0.00026521442],"domain_scores_gemma":[0.9988325,0.00016555903,0.000044706732,0.0007742913,0.00010849087,0.00007441766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001601499,0.00009439784,0.00014296801,0.000046575045,0.00019443073,0.0000673268,0.0013991867,0.000042433516,0.00004793068],"category_scores_gemma":[0.00013555332,0.00007046971,0.000088805435,0.0008140505,0.00013636277,0.00022815815,0.00057360256,0.00015725048,0.00002270978],"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.0000018293275,0.00014019292,0.0021354847,0.000008340643,0.000006976211,0.000006635326,0.0001723454,0.0000038118426,0.00015615665,0.98655325,0.0061736135,0.004641368],"study_design_scores_gemma":[0.00058529445,0.00021604399,0.019097753,0.000048462738,0.000011634323,0.00007199932,0.000049979986,0.010286872,0.006622742,0.7702417,0.19243237,0.00033514414],"about_ca_topic_score_codex":0.000027851342,"about_ca_topic_score_gemma":0.0000012997664,"teacher_disagreement_score":0.76465034,"about_ca_system_score_codex":0.000026488102,"about_ca_system_score_gemma":0.000051786938,"threshold_uncertainty_score":0.28736714},"labels":[],"label_agreement":null},{"id":"W2062920840","doi":"10.1007/s00493-005-0031-5","title":"Small Forbidden Configurations IV: The 3 Rowed Case","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.06555081426316522,"score_gpt":0.2961509496191087,"score_spread":0.23060013535594348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062920840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.835652,0.00058058155,0.0018525743,0.003998009,0.0013177727,0.0007690662,0.00001773898,0.00033048683,0.15548179],"genre_scores_gemma":[0.9954605,0.000011278359,0.0012035756,0.00031787853,0.00015234403,0.00003128204,0.0000017234767,0.000021742899,0.0027996583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916637,0.00010419442,0.00022490867,0.00015610128,0.00012986576,0.00021857065],"domain_scores_gemma":[0.9986696,0.00052861194,0.000085427295,0.00056460936,0.000082208026,0.00006951935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029202495,0.00013434251,0.00015035439,0.000040992312,0.0006439707,0.00004729415,0.0002995751,0.00007783489,0.00023141016],"category_scores_gemma":[0.00025627538,0.000085334475,0.00009943806,0.00016219853,0.00009089879,0.000060637045,0.00009502028,0.00020584474,0.00003104847],"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.0000046501345,0.000055186923,0.000030993415,0.000008879597,0.00002998565,0.00005911992,0.0012576038,0.0000016556522,0.000025899066,0.9839996,0.011583756,0.0029426664],"study_design_scores_gemma":[0.0004219533,0.000037284073,0.000089303096,0.0000064204846,0.000052373005,0.0005089093,0.00024964332,0.00027054903,0.0004349132,0.91310006,0.084675096,0.00015346844],"about_ca_topic_score_codex":0.000009985623,"about_ca_topic_score_gemma":0.000020883652,"teacher_disagreement_score":0.15980853,"about_ca_system_score_codex":0.000042329775,"about_ca_system_score_gemma":0.000023347493,"threshold_uncertainty_score":0.49529672},"labels":[],"label_agreement":null},{"id":"W2064317094","doi":"10.1007/s00493-003-0028-x","title":"Sharp Concentration of the Number of Submaps in Random Planar Triangulations","year":2003,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Planar; Vertex (graph theory); Degree (music); Convex polygon; Polygon (computer graphics); Regular polygon; Limiting; Triangulation; Planar graph; Point set triangulation; Geometry; Graph; Delaunay triangulation; Physics","score_opus":0.012195773987423764,"score_gpt":0.24536825558037026,"score_spread":0.23317248159294648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064317094","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7383404,0.00034997793,0.24265993,0.0006630874,0.0014271659,0.00052257965,0.000005149203,0.000029549976,0.016002178],"genre_scores_gemma":[0.99811816,0.000004941902,0.0017370285,0.000025554227,0.000006612023,0.000006383561,0.000002751679,0.0000018900417,0.0000966783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924886,0.00013794923,0.0002458405,0.00010830947,0.00018089563,0.00007813549],"domain_scores_gemma":[0.999407,0.00015766024,0.00012206547,0.00020055285,0.00009311623,0.000019630814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002511191,0.00004920297,0.00010993035,0.000037946487,0.000043847274,0.000011657474,0.0002124217,0.000029234092,0.000016693883],"category_scores_gemma":[0.00015608316,0.0000402002,0.000045447978,0.0008076588,0.00002050057,0.00013480966,0.000018749768,0.000048880043,0.0000029351143],"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.000007019436,0.0001034773,0.013677971,0.000007744358,0.0000053143913,3.672445e-7,0.0003027577,0.0012931987,0.0010168577,0.98258364,0.00024488222,0.0007567724],"study_design_scores_gemma":[0.013385096,0.000114493996,0.29132673,0.00011075534,0.000030611413,0.000027537542,0.00008286911,0.056338347,0.12100015,0.5060217,0.011105246,0.00045647024],"about_ca_topic_score_codex":0.000009581353,"about_ca_topic_score_gemma":0.0000018940368,"teacher_disagreement_score":0.47656196,"about_ca_system_score_codex":0.00002832886,"about_ca_system_score_gemma":0.00011691107,"threshold_uncertainty_score":0.16393167},"labels":[],"label_agreement":null},{"id":"W2065653857","doi":"10.1007/s00493-009-2267-y","title":"On the edge-density of 4-critical graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Brock University","funders":"Kempe Foundation","keywords":"Mathematics; Combinatorics; Conjecture; Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.027806760855781033,"score_gpt":0.29770400574462824,"score_spread":0.2698972448888472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065653857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95030946,0.00009939226,0.00020106167,0.001863261,0.0007228981,0.00016590412,0.0000029305804,0.0000804658,0.04655463],"genre_scores_gemma":[0.99927026,0.000005542304,0.00020680239,0.00039564853,0.000020008125,0.0000020524576,2.652789e-7,0.000007970212,0.00009142477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999172,0.00010710605,0.00018345178,0.00013497619,0.00023223866,0.00017027277],"domain_scores_gemma":[0.99790496,0.0013927381,0.00005435033,0.00051349687,0.00008418866,0.000050259616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029364956,0.00011081008,0.00019249997,0.000047457383,0.00021392004,0.000010184213,0.00029834284,0.00007008816,0.000069225665],"category_scores_gemma":[0.0012333795,0.00006632514,0.00011920179,0.00019160935,0.00018306577,0.000023479122,0.0000495028,0.00020390662,0.0000055367127],"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.00001557299,0.00019544529,0.00007148026,0.000013502482,0.00000919677,0.0000035022636,0.00022805735,5.2063992e-8,0.000074515854,0.9896837,0.0091364635,0.0005685167],"study_design_scores_gemma":[0.00014566765,0.00019065886,0.0019580235,0.000016799682,0.000020800393,0.0000036763852,0.000029068002,0.000007766638,0.002744391,0.994571,0.00023048813,0.00008171167],"about_ca_topic_score_codex":8.4060713e-7,"about_ca_topic_score_gemma":9.015247e-8,"teacher_disagreement_score":0.048960827,"about_ca_system_score_codex":0.000014098882,"about_ca_system_score_gemma":0.000009703784,"threshold_uncertainty_score":0.2704661},"labels":[],"label_agreement":null},{"id":"W2074813456","doi":"10.1007/s00493-014-2880-2","title":"Measurable events indexed by products of trees","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Homogeneous; Tree (set theory); Product (mathematics); Sequence (biology); Discrete mathematics; Integer (computer science); Lebesgue integration; Finite set; Mathematical analysis","score_opus":0.020607426182429462,"score_gpt":0.2553691899771304,"score_spread":0.2347617637947009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074813456","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9749636,0.0003154989,0.00033024154,0.00019712125,0.0009287855,0.0002744493,0.000006849508,0.00010357077,0.022879874],"genre_scores_gemma":[0.9980269,0.000009008284,0.00054848194,0.000026367936,0.000028531009,0.000008645969,0.0000021692254,0.000021215526,0.0013286432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989662,0.00013003322,0.00024300913,0.0001887117,0.00028313743,0.00018886667],"domain_scores_gemma":[0.99896055,0.00020446842,0.00015191223,0.00049764273,0.00013102451,0.00005440741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045379743,0.00012694589,0.00027150387,0.000051890725,0.00011113853,0.0000058609353,0.00030283706,0.00007638967,0.000030396106],"category_scores_gemma":[0.0008722534,0.00010093387,0.000057787554,0.00021979892,0.000055146356,0.00005411663,0.000083838626,0.00011425823,0.0000042146917],"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.00002105774,0.0002508405,0.003000721,0.00013123103,0.000049460057,3.5151874e-7,0.00034313483,3.1670697e-7,0.0028040993,0.9512592,0.039657194,0.002482395],"study_design_scores_gemma":[0.0005046626,0.000099092445,0.0014899313,0.000024712712,0.000023782333,0.000001586458,0.00001507425,0.0000148616355,0.02784672,0.95820475,0.011644362,0.0001304425],"about_ca_topic_score_codex":0.000004540883,"about_ca_topic_score_gemma":5.165667e-7,"teacher_disagreement_score":0.02801283,"about_ca_system_score_codex":0.000022860953,"about_ca_system_score_gemma":0.000015120807,"threshold_uncertainty_score":0.4115964},"labels":[],"label_agreement":null},{"id":"W2076369652","doi":"10.1007/s004930100002","title":"Optimal Edge-Colourings for a Class of Planar Multigraphs","year":2001,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Conjecture; Multigraph; Polytope; Discrete mathematics; Planar graph; Graph","score_opus":0.02340767389095119,"score_gpt":0.28925956485033,"score_spread":0.2658518909593788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076369652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24022941,0.0005791363,0.7516659,0.0009901214,0.0006686489,0.0009085305,0.000008849431,0.00030042522,0.0046489625],"genre_scores_gemma":[0.9457309,0.00004457699,0.05334697,0.00005871657,0.000020805612,0.00009918232,0.000001784138,0.000016542037,0.0006804697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986249,0.00005216266,0.00022889765,0.00036648885,0.00028637797,0.00044112362],"domain_scores_gemma":[0.99853,0.0003780149,0.00010356795,0.00063541136,0.00021196084,0.00014105233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032654003,0.00013572602,0.0002305489,0.00023174807,0.00013306255,0.00003378877,0.0012811688,0.0000710712,0.0000062625822],"category_scores_gemma":[0.00014532478,0.00013221089,0.0001297046,0.0008448622,0.000113038055,0.0002723723,0.00017814687,0.00014811067,0.000013346834],"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.00011766379,0.00035798768,0.0017483584,0.000045957324,0.000038015754,0.00004246586,0.00052520673,0.00011147073,0.0019958075,0.9828569,0.0029313972,0.009228733],"study_design_scores_gemma":[0.0049875122,0.0018752185,0.0034985195,0.000065282526,0.000018546663,0.000089663314,0.00010381232,0.036327515,0.01843462,0.7312207,0.20262328,0.00075529824],"about_ca_topic_score_codex":0.0000056650442,"about_ca_topic_score_gemma":5.389858e-7,"teacher_disagreement_score":0.70550156,"about_ca_system_score_codex":0.000046659858,"about_ca_system_score_gemma":0.000053988537,"threshold_uncertainty_score":0.53914034},"labels":[],"label_agreement":null},{"id":"W2077882202","doi":"10.1007/s00493-014-2862-4","title":"The edge density of critical digraphs","year":2014,"lang":"ceb","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Critical graph; Graph; Corollary; Discrete mathematics; Graph power; Line graph","score_opus":0.01392579734803384,"score_gpt":0.2806488513578588,"score_spread":0.26672305400982493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077882202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80851257,0.007624532,0.004716403,0.0036266858,0.020631261,0.0010712415,0.000041589483,0.00026188817,0.15351382],"genre_scores_gemma":[0.9986406,0.00018099819,0.00027108102,0.000101216654,0.00015904022,0.0000065678423,9.278875e-7,0.000039264134,0.00060029817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974541,0.00057740306,0.00061505433,0.00032627062,0.0004899632,0.000537218],"domain_scores_gemma":[0.9920705,0.0058415662,0.00023047962,0.0013106116,0.00035983266,0.00018700048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013031687,0.0002998086,0.0005387713,0.00007271362,0.0011020873,0.000069771886,0.0008412211,0.00025599016,0.00006165656],"category_scores_gemma":[0.0045091636,0.00020094162,0.0003450233,0.00034587222,0.0012779549,0.00006281111,0.00047238037,0.0004917571,0.000025027939],"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.000034743716,0.0002680216,0.001510306,0.0003087681,0.000074369396,0.0000030511346,0.0008539459,9.8363905e-8,0.000045196506,0.98717237,0.0063507333,0.003378416],"study_design_scores_gemma":[0.00042723754,0.00023325619,0.003157936,0.000067358815,0.00017838864,0.00000957824,0.00016740129,0.00017765912,0.001528589,0.9744638,0.0193455,0.00024327454],"about_ca_topic_score_codex":0.000008362223,"about_ca_topic_score_gemma":0.0000022006088,"teacher_disagreement_score":0.19012803,"about_ca_system_score_codex":0.00003988321,"about_ca_system_score_gemma":0.000043835866,"threshold_uncertainty_score":0.8476476},"labels":[],"label_agreement":null},{"id":"W2082374751","doi":"10.1007/s00493-011-2595-6","title":"Linear algebra methods for forbidden configurations","year":2011,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; TRACE (psycholinguistics); Matrix (chemical analysis); Context (archaeology); Permutation (music); Row; Simple (philosophy); Concatenation (mathematics); Physics","score_opus":0.04519378722971197,"score_gpt":0.29338629396375326,"score_spread":0.2481925067340413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082374751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023808641,0.0015471353,0.7957018,0.000038937236,0.004499001,0.0009476088,0.000018995353,0.0012019617,0.1722359],"genre_scores_gemma":[0.98427737,0.000011059974,0.015052396,0.000019151315,0.000047273177,0.00016929327,0.0000069914067,0.000032034997,0.00038440354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994748,0.00004131759,0.00016433648,0.00010435784,0.000038377566,0.00017676533],"domain_scores_gemma":[0.9995374,0.00010069487,0.00002123291,0.00022465011,0.000047630325,0.000068384674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022098361,0.000102048994,0.00014477182,0.000055406297,0.000079696365,0.00001050262,0.00015696559,0.000072352224,0.000094377014],"category_scores_gemma":[0.000036381316,0.00010049693,0.00008182358,0.00014493438,0.000019557747,0.00007512747,0.000010151919,0.00007232703,0.00005250935],"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.000006584453,0.00003716308,0.000042618027,0.000047666337,0.000059345086,8.8959615e-7,0.0007724002,0.000009755498,0.0034739668,0.9875236,0.0030432588,0.0049827187],"study_design_scores_gemma":[0.00095260306,0.00021323499,0.0005564241,0.00002725599,0.00007213598,0.0000112283005,0.00027106324,0.011480094,0.10366167,0.61668766,0.26555914,0.0005075151],"about_ca_topic_score_codex":0.0000031459867,"about_ca_topic_score_gemma":3.0960234e-7,"teacher_disagreement_score":0.96046877,"about_ca_system_score_codex":0.000018470191,"about_ca_system_score_gemma":0.000007435807,"threshold_uncertainty_score":0.4098146},"labels":[],"label_agreement":null},{"id":"W2087219950","doi":"10.1007/s004930200002","title":"Homomorphisms of Products of Graphs into Graphs Without Four Cycles","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Indifference graph; Chordal graph; Graph product; Discrete mathematics; 1-planar graph; Graph","score_opus":0.034409806586687866,"score_gpt":0.2682679763669812,"score_spread":0.23385816978029333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087219950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94623023,0.005673352,0.034059744,0.0016077758,0.0013133341,0.0012081136,0.000008303764,0.00046218926,0.009436932],"genre_scores_gemma":[0.98661286,0.00016896192,0.012917102,0.000019595183,0.00000750713,0.000024248617,6.836634e-7,0.00001934795,0.00022971726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978938,0.00016755056,0.0004018131,0.0004960444,0.0006524115,0.00038839222],"domain_scores_gemma":[0.9976338,0.00016203412,0.00024904605,0.0013521857,0.00046612564,0.00013681957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004004908,0.00019463849,0.00040127247,0.000476279,0.00011571436,0.000024826,0.0017205632,0.000071264134,0.000020061281],"category_scores_gemma":[0.00024261432,0.00018125791,0.00012509803,0.0024979587,0.0004045969,0.00040720138,0.00042478734,0.00022002608,0.00002282696],"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.000012449081,0.00041002373,0.005439025,0.0001092521,0.000037459507,0.00001522727,0.000657594,0.000009060167,0.0077460622,0.9737722,0.0006382992,0.011153295],"study_design_scores_gemma":[0.0006519862,0.00039223384,0.0026887415,0.000046757013,0.000008714789,0.00001556106,0.000024372914,0.0010465818,0.0576794,0.93654656,0.0006677814,0.00023132912],"about_ca_topic_score_codex":0.000015364438,"about_ca_topic_score_gemma":7.626021e-7,"teacher_disagreement_score":0.049933337,"about_ca_system_score_codex":0.000032042142,"about_ca_system_score_gemma":0.000034912173,"threshold_uncertainty_score":0.7391483},"labels":[],"label_agreement":null},{"id":"W2090968858","doi":"10.1007/s00493-014-3035-1","title":"On the monotonicity of a data stream","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Subsequence; Combinatorics; Omega; Upper and lower bounds; Monotonic function; Alphabet; Space (punctuation); Binary logarithm; Discrete mathematics; Mathematical analysis","score_opus":0.04818908662102291,"score_gpt":0.26956434263017376,"score_spread":0.22137525600915084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090968858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118010916,0.0002487076,0.8051745,0.009318976,0.0019300353,0.0005643325,0.000030357583,0.00042216762,0.064299956],"genre_scores_gemma":[0.99604714,0.000007219569,0.0036444,0.00023350437,0.000015050754,0.000004258854,0.000001918146,0.0000034587326,0.00004303598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911433,0.00009703652,0.00013551809,0.0002745306,0.00023346678,0.00014512346],"domain_scores_gemma":[0.9970085,0.0006156782,0.00007535079,0.0022172113,0.00004247086,0.000040781426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044072227,0.00008055996,0.00012064073,0.00003976327,0.000121990706,0.00004439914,0.0032935243,0.000026117521,0.000013199288],"category_scores_gemma":[0.00016387779,0.000054723172,0.000037032107,0.00037447765,0.00007062631,0.00016870938,0.0009848799,0.00013283032,0.000023830018],"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.0000012297767,0.00011146045,0.000059824783,0.000002913663,0.0000065413283,4.2943842e-7,0.000048764006,0.0000034315053,0.0000116113815,0.97190607,0.003483025,0.024364715],"study_design_scores_gemma":[0.00022490624,0.0002308062,0.0012641173,0.000015520367,0.000003896901,0.0000016178262,0.0000060196103,0.14045614,0.0008764637,0.8356619,0.021148853,0.0001097518],"about_ca_topic_score_codex":0.000025837393,"about_ca_topic_score_gemma":0.0000012852585,"teacher_disagreement_score":0.87803626,"about_ca_system_score_codex":0.000011573855,"about_ca_system_score_gemma":0.000023773187,"threshold_uncertainty_score":0.61202425},"labels":[],"label_agreement":null},{"id":"W2094094736","doi":"10.1007/s004930200025","title":"The Circular Flow Number of a 6-Edge Connected Graph is Less Than Four","year":2002,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Burnaby Hospital; Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.038923521854735244,"score_gpt":0.27472123876878557,"score_spread":0.23579771691405033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094094736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50714123,0.008279808,0.41588348,0.009741448,0.0039371075,0.0019978832,0.000029524424,0.0011596774,0.051829875],"genre_scores_gemma":[0.99751496,0.00018566455,0.0013485589,0.000087966495,0.000016699285,0.000035250374,5.0507447e-7,0.000018444787,0.00079197396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802846,0.00023669495,0.00026441255,0.0004024679,0.0005662579,0.0005017155],"domain_scores_gemma":[0.9975382,0.0005192243,0.00011816788,0.0013728396,0.00030463285,0.00014690259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003915717,0.00017123752,0.00023405257,0.000097171,0.00037763972,0.00009819802,0.0020556436,0.00007590276,0.00006101791],"category_scores_gemma":[0.00017317575,0.00013147944,0.00016297294,0.0016454234,0.00023803295,0.0002540476,0.00041482455,0.0002756016,0.00015027773],"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.000011702953,0.0002613115,0.0044489494,0.00003286239,0.000086943655,0.00005089158,0.001111147,0.000009719768,0.00044172554,0.96000314,0.006299535,0.027242076],"study_design_scores_gemma":[0.0011997449,0.00014188401,0.0025060712,0.000032984317,0.000011285033,0.00006404409,0.000094716655,0.030768596,0.004551407,0.94164747,0.018591022,0.00039078383],"about_ca_topic_score_codex":0.00000896694,"about_ca_topic_score_gemma":9.72806e-7,"teacher_disagreement_score":0.49037373,"about_ca_system_score_codex":0.000046934423,"about_ca_system_score_gemma":0.000027184304,"threshold_uncertainty_score":0.53615755},"labels":[],"label_agreement":null},{"id":"W2099528956","doi":"10.1007/s00493-006-0024-z","title":"Independent Sets In Association Schemes","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Eigenvalues and eigenvectors; Adjacency matrix; Corollary; Graph; Upper and lower bounds; Discrete mathematics; Mathematical analysis","score_opus":0.017459315025400254,"score_gpt":0.28325560825745477,"score_spread":0.2657962932320545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099528956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97688097,0.000051182426,0.000117902535,0.00038299515,0.00009147212,0.00015076829,0.000002484404,0.00008243895,0.022239776],"genre_scores_gemma":[0.9982013,0.0000029877178,0.00037532486,0.000021124011,0.000015067104,0.00004924836,0.000005098216,0.0000090536205,0.0013208053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936754,0.00004348802,0.00017238125,0.0001172635,0.0001522409,0.00014708351],"domain_scores_gemma":[0.9994714,0.0002076569,0.0000918425,0.00017061793,0.000037682898,0.000020747724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002862773,0.000066789515,0.00010522924,0.000064435095,0.00005807026,0.000016729427,0.000108804314,0.0000759755,0.000039718263],"category_scores_gemma":[0.00011383537,0.000068548215,0.000036171044,0.00028133445,0.000008137821,0.00004995404,0.000026684565,0.00011973114,0.000057788802],"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.0000013591833,0.0002519947,0.038610075,0.0000072738803,0.000003921457,0.0000012294005,0.000033897828,5.5315525e-7,0.00018009525,0.95505285,0.0057311053,0.00012564991],"study_design_scores_gemma":[0.00032190955,0.0000073350566,0.022199102,0.0000067938495,0.0000064906576,5.727555e-7,0.000017588975,0.00002008724,0.0016206332,0.9666896,0.009033109,0.000076786615],"about_ca_topic_score_codex":0.000016723034,"about_ca_topic_score_gemma":0.000010064446,"teacher_disagreement_score":0.02132031,"about_ca_system_score_codex":0.00015526112,"about_ca_system_score_gemma":0.000012828586,"threshold_uncertainty_score":0.2795315},"labels":[],"label_agreement":null},{"id":"W2102229938","doi":"10.1007/s00493-016-3441-7","title":"Point-Curve Incidences in the Complex Plane","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Hypersurface; Lemma (botany); Algebraic curve; Combinatorics; Plane curve; Algebraic geometry; Algebraic number; Differential geometry; Plane (geometry); Incidence (geometry); Complex plane; Geometry; Discrete mathematics; Mathematical analysis","score_opus":0.047440835050536416,"score_gpt":0.2976345836036157,"score_spread":0.2501937485530793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102229938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6392432,0.00088924676,0.23338436,0.051364105,0.004769341,0.0009493043,0.0000065459117,0.0002726371,0.06912127],"genre_scores_gemma":[0.99777186,0.000010487734,0.0016082717,0.00042817363,0.00005363568,0.00001214654,0.000003640483,0.0000020330383,0.00010977359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9991732,0.000088457644,0.00013419827,0.00019516333,0.0002648264,0.00014410513],"domain_scores_gemma":[0.99900633,0.00017987425,0.000102636855,0.00062812964,0.0000510499,0.000031950523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981795,0.00007358844,0.000088526576,0.000065975626,0.00046469123,0.00042699592,0.0016931285,0.000026995916,0.000011465337],"category_scores_gemma":[0.00015530027,0.000054416843,0.000027613756,0.00018625356,0.000041991527,0.00047258372,0.0002116987,0.00010218984,0.000057229383],"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.0000033933534,0.00011813179,0.0059492863,0.000005601669,0.000004816933,0.000040222476,0.00070201507,0.0001016593,0.00012070059,0.9704937,0.009929848,0.012530662],"study_design_scores_gemma":[0.0006350322,0.0001455225,0.7065012,0.000015434369,0.0000030749638,0.000035910456,0.000049730024,0.027745768,0.0003153273,0.2268462,0.037481215,0.00022558469],"about_ca_topic_score_codex":0.00006313079,"about_ca_topic_score_gemma":0.00002023289,"teacher_disagreement_score":0.74364746,"about_ca_system_score_codex":0.000024847068,"about_ca_system_score_gemma":0.00004271896,"threshold_uncertainty_score":0.41175315},"labels":[],"label_agreement":null},{"id":"W2103315245","doi":"10.1007/s00493-014-2952-3","title":"An analogue of the Erdős-Stone theorem for finite geometries","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Integer (computer science); Rank (graph theory); Equivalence (formal languages); Discrete mathematics","score_opus":0.02408680668586328,"score_gpt":0.28996538134667854,"score_spread":0.26587857466081527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103315245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959761,0.00021413981,0.023873918,0.00037417494,0.0020230727,0.0007270696,0.00006866232,0.00013136984,0.012826586],"genre_scores_gemma":[0.9984841,0.0000060595453,0.0010751645,0.00012819577,0.000057984966,0.000016305235,0.0000035441658,0.000023226821,0.00020544976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908555,0.0001225498,0.00024396129,0.00016563208,0.00018741122,0.00019489264],"domain_scores_gemma":[0.9973209,0.0015392165,0.00017773235,0.0007843358,0.00012631547,0.000051486524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064527,0.00012839213,0.00026065015,0.00008526379,0.00027356768,0.000015733167,0.0005747885,0.000089022775,0.000023324978],"category_scores_gemma":[0.001395977,0.000078220684,0.0001527755,0.00032138597,0.00020897805,0.00005303485,0.00010724179,0.00008633415,8.798681e-7],"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.000021345082,0.00008245713,0.00080066104,0.00006121433,0.000027509717,9.391232e-8,0.00042471974,0.000004390023,0.0001579564,0.9956926,0.0013214066,0.0014056079],"study_design_scores_gemma":[0.00043400994,0.00018426123,0.0015818989,0.000015203878,0.00004258106,0.0000011088896,0.00006139171,0.00025053305,0.005535424,0.9832253,0.008558553,0.00010972216],"about_ca_topic_score_codex":0.0000030410504,"about_ca_topic_score_gemma":0.0000013562939,"teacher_disagreement_score":0.038723063,"about_ca_system_score_codex":0.000016828675,"about_ca_system_score_gemma":0.000015699552,"threshold_uncertainty_score":0.3189747},"labels":[],"label_agreement":null},{"id":"W2105506385","doi":"10.1007/s00493-014-3079-2","title":"Embedding a graph-like continuum in a surface","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Voltage graph; Symmetric graph; Embedding; Discrete mathematics; Graph; Line graph; Computer science","score_opus":0.009086792051369086,"score_gpt":0.240379365254211,"score_spread":0.2312925732028419,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105506385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31631082,0.00018536727,0.67769986,0.0006771221,0.0013062716,0.00011604416,2.5842832e-7,0.00014214899,0.0035620977],"genre_scores_gemma":[0.9890755,0.000005802446,0.0102474755,0.00023193342,0.00002801911,0.0000060978005,0.0000022194515,0.0000046922505,0.00039826878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908555,0.000092084774,0.00016951471,0.00026947312,0.00018858846,0.00019481122],"domain_scores_gemma":[0.9993954,0.00015289416,0.000053163243,0.00026530764,0.00006846832,0.000064803644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003632906,0.00009007574,0.00012718311,0.00013138355,0.000075782074,0.00009033578,0.00038136495,0.000039593768,0.000005323329],"category_scores_gemma":[0.00006427406,0.00009404696,0.00003935861,0.0008848699,0.000012621816,0.0002490414,0.00011906746,0.00009726368,0.000042668536],"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.000008947853,0.00033471236,0.0049985885,0.000025328636,0.00001404406,0.000016339745,0.0008943605,0.012703571,0.0024219106,0.9391324,0.01141811,0.02803171],"study_design_scores_gemma":[0.001481615,0.00019150863,0.015442912,0.00003517355,0.000004085387,0.000015040498,0.000015117695,0.6785626,0.002292514,0.2255314,0.0760014,0.0004266537],"about_ca_topic_score_codex":0.000010501345,"about_ca_topic_score_gemma":0.000005085338,"teacher_disagreement_score":0.713601,"about_ca_system_score_codex":0.000038744663,"about_ca_system_score_gemma":0.00003061818,"threshold_uncertainty_score":0.38351238},"labels":[],"label_agreement":null},{"id":"W2111430057","doi":"10.1007/s00493-005-0036-0","title":"Proof Of A Conjecture Of Erdős On Triangles In Set-Systems","year":2005,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Microsoft Research","keywords":"Conjecture; Combinatorics; Mathematics; Element (criminal law); Set (abstract data type); Discrete mathematics; Law; Computer science","score_opus":0.03945362164017345,"score_gpt":0.30515233261533936,"score_spread":0.2656987109751659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111430057","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9637302,0.021620592,0.000085119515,0.000088850764,0.0005821958,0.000989951,0.00002486099,0.00005281928,0.012825369],"genre_scores_gemma":[0.99946606,0.00015605852,0.00019975458,0.000008282302,0.000026828271,0.000015194228,7.8392395e-7,0.000015812713,0.00011124264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897826,0.00012501855,0.00043282658,0.00013581489,0.00018422295,0.00014383248],"domain_scores_gemma":[0.99888784,0.00045222102,0.00023195622,0.0003519605,0.00004296748,0.00003306588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865261,0.00012592322,0.00048583097,0.00015693234,0.000028272685,0.000004276228,0.00021867889,0.00011381812,0.00001727587],"category_scores_gemma":[0.00021367194,0.00009210276,0.000098251854,0.00026779695,0.00006134832,0.000030473626,0.000048184127,0.00013927132,7.948347e-7],"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.000043597458,0.00023546534,0.00016874797,0.00039892897,0.000031257423,0.0000028469174,0.0013213594,0.000028853732,0.000022979088,0.9898502,0.00041131058,0.007484427],"study_design_scores_gemma":[0.002508785,0.00052725285,0.00018391128,0.00051617937,0.000056365774,0.000011828307,0.00026646847,0.00021236097,0.0067162067,0.9670172,0.021716489,0.0002669529],"about_ca_topic_score_codex":0.0000043564887,"about_ca_topic_score_gemma":0.0000016794729,"teacher_disagreement_score":0.0357358,"about_ca_system_score_codex":0.000042551394,"about_ca_system_score_gemma":0.000025240455,"threshold_uncertainty_score":0.37558416},"labels":[],"label_agreement":null},{"id":"W2115859130","doi":"10.1007/s00493-005-0010-x","title":"List Colouring When The Chromatic Number Is Close To the Order Of The Graph","year":2004,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Chromatic scale; Conjecture; Graph; Order (exchange); Discrete mathematics","score_opus":0.005272078131285529,"score_gpt":0.19078437274404528,"score_spread":0.18551229461275975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115859130","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.981311,0.00044663495,0.00017905666,0.00216447,0.0014622862,0.00051959604,0.0000055650057,0.000109288136,0.013802076],"genre_scores_gemma":[0.99929845,0.000010682538,0.00002020548,0.0002324364,0.00003920019,0.000057957157,3.0463312e-7,0.000024748175,0.00031599682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991902,0.00006864823,0.0002153503,0.00010989772,0.00020751398,0.00020839447],"domain_scores_gemma":[0.99909925,0.00008387593,0.00004616095,0.0006797372,0.000047232905,0.000043720578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002534737,0.00013526464,0.00015466622,0.00002286919,0.00022829016,0.000035456636,0.0006496873,0.0000515572,0.00006802844],"category_scores_gemma":[0.000038086484,0.00006752262,0.00010984536,0.0005934356,0.00006681924,0.00004181604,0.000085412765,0.00018152593,0.00009678119],"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.00001524045,0.00019211728,0.004097581,0.00027319347,0.00032269614,0.00000597521,0.02674711,0.004470918,0.0020557728,0.9198275,0.04157763,0.0004142295],"study_design_scores_gemma":[0.0017170344,0.00012104424,0.016419616,0.00049524655,0.00017286054,0.000064532076,0.0019907795,0.0003805451,0.023554673,0.72852224,0.22585331,0.0007081089],"about_ca_topic_score_codex":0.000055585802,"about_ca_topic_score_gemma":0.00001632614,"teacher_disagreement_score":0.19130528,"about_ca_system_score_codex":0.00004983519,"about_ca_system_score_gemma":0.00001654453,"threshold_uncertainty_score":0.27534926},"labels":[],"label_agreement":null},{"id":"W2122404357","doi":"10.1007/s00493-014-2806-z","title":"A minimum degree condition forcing complete graph immersion","year":2014,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Discrete mathematics; Disjoint sets; Simple graph; Immersion (mathematics); Complement graph; Graph power; Line graph; Geometry","score_opus":0.03635824512445577,"score_gpt":0.2841506765625666,"score_spread":0.24779243143811083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122404357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040556062,0.00015721878,0.9466892,0.00066641497,0.0007168015,0.00025807146,0.0000021850378,0.0002856072,0.010668427],"genre_scores_gemma":[0.99404955,0.000012579771,0.0054787397,0.00020072448,0.000028431361,0.000025078825,0.000006959541,0.000015374952,0.00018258965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982375,0.00020662085,0.00020909063,0.00045529802,0.00041986624,0.00047165158],"domain_scores_gemma":[0.99839985,0.00036861288,0.000098542194,0.0008087997,0.00014108526,0.00018313316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049677736,0.00016141638,0.00020451375,0.00025743595,0.00034296286,0.00009507691,0.0011223733,0.000064304026,0.00002039161],"category_scores_gemma":[0.00009842054,0.00015753716,0.000102228216,0.0008628321,0.00010385254,0.0004851743,0.0003951031,0.00022305014,0.00021483189],"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.000011665544,0.000069775226,0.0004239978,0.000016390473,0.000012633603,0.000008085027,0.00012227097,0.0000138495625,0.005375244,0.9737375,0.0018974907,0.018311119],"study_design_scores_gemma":[0.0012687695,0.0004164445,0.0027592196,0.000033943135,0.0000068403306,0.000020322424,0.000037038353,0.024472443,0.0040315976,0.9537268,0.0128645925,0.00036198832],"about_ca_topic_score_codex":0.000006287492,"about_ca_topic_score_gemma":5.4206146e-7,"teacher_disagreement_score":0.9534935,"about_ca_system_score_codex":0.00007179369,"about_ca_system_score_gemma":0.000024534575,"threshold_uncertainty_score":0.6424179},"labels":[],"label_agreement":null},{"id":"W2125752997","doi":"10.1007/s00493-009-2362-0","title":"Hamilton cycles in highly connected and expanding graphs","year":2009,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Cograph; Indifference graph; Random graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Pathwidth; Graph; Variety (cybernetics); Chordal graph; 1-planar graph; Line graph; Computer science; Artificial intelligence","score_opus":0.022547729658570406,"score_gpt":0.29615728101104155,"score_spread":0.27360955135247117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125752997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925133,0.00050016504,0.000028705526,0.000105597,0.00024404621,0.00013344007,0.0000013005919,0.00010106109,0.0063723847],"genre_scores_gemma":[0.9992325,0.000108825036,0.00045052107,0.000110628345,0.000014787739,0.00000458808,0.000001212442,0.000011889896,0.000065084125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916124,0.00006900541,0.00021436643,0.00020350495,0.00012662407,0.00022526177],"domain_scores_gemma":[0.9993289,0.00027566717,0.00006379882,0.00023937394,0.000025985071,0.00006627045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019042144,0.00013996163,0.00023736178,0.00017240978,0.00014746575,0.000027119633,0.00014374252,0.000093230236,0.000010581493],"category_scores_gemma":[0.00014980248,0.000118970835,0.000042120053,0.0002860044,0.000054933906,0.00007620491,0.000037777263,0.00016190573,9.827257e-7],"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.000016143582,0.00006790925,0.0028175376,0.000017212922,0.000007913251,0.000015947435,0.0011458468,1.7694754e-7,0.00042846586,0.99329287,0.00046138404,0.0017285823],"study_design_scores_gemma":[0.00070035394,0.000091265116,0.028819803,0.000037628044,0.000010233145,0.000008152142,0.00009199074,0.000027029786,0.0008473497,0.9688726,0.0003369795,0.00015659396],"about_ca_topic_score_codex":0.0000049029895,"about_ca_topic_score_gemma":0.0000016801581,"teacher_disagreement_score":0.026002266,"about_ca_system_score_codex":0.0000303815,"about_ca_system_score_gemma":0.0000061417772,"threshold_uncertainty_score":0.48514897},"labels":[],"label_agreement":null},{"id":"W2136175864","doi":"10.1007/s00493-015-3070-6","title":"Nonrepetitive colouring via entropy compression","year":2015,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Mathematical proof; Discrete mathematics; Geometry","score_opus":0.031856152558521776,"score_gpt":0.29475177600056146,"score_spread":0.2628956234420397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136175864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028969502,0.00045908045,0.9533306,0.00076712976,0.001260886,0.00032396818,0.0000011192465,0.00045881202,0.014428936],"genre_scores_gemma":[0.988547,0.000010257858,0.010679209,0.00008496622,0.000033851473,0.000025902475,0.0000013474848,0.00001246711,0.000604954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838674,0.00018990763,0.00015599836,0.00037593354,0.00050020893,0.0003911997],"domain_scores_gemma":[0.9985034,0.00018114767,0.00006902974,0.00065862807,0.0002580204,0.00032976884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039183692,0.0001303259,0.00016820284,0.00012453954,0.00014539127,0.0000834391,0.0011304461,0.0000521914,0.000011984669],"category_scores_gemma":[0.00015692723,0.000120262695,0.000051304072,0.00059259194,0.00007772763,0.00044816264,0.0007642724,0.00023152422,0.00025391323],"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.000036012138,0.00021648643,0.0014048252,0.000007907192,0.000014201681,0.0001056098,0.0005869604,0.00006646179,0.0026065689,0.98496246,0.002440158,0.007552343],"study_design_scores_gemma":[0.0015850099,0.0004298131,0.0011871211,0.000033571305,0.0000036114748,0.000035510824,0.00006300936,0.018249568,0.023758426,0.92603993,0.0282704,0.00034403751],"about_ca_topic_score_codex":0.000007085982,"about_ca_topic_score_gemma":2.7022458e-7,"teacher_disagreement_score":0.95957756,"about_ca_system_score_codex":0.00016797087,"about_ca_system_score_gemma":0.00007804202,"threshold_uncertainty_score":0.49041703},"labels":[],"label_agreement":null},{"id":"W2139177710","doi":"10.1007/s00493-015-2662-5","title":"Counting flags in triangle-free digraphs","year":2016,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Univerzita Karlova v Praze; National Science Foundation","keywords":"Digraph; Flag (linear algebra); FLAGS register; Upper and lower bounds; Backslash","score_opus":0.02876470606477036,"score_gpt":0.2769097246493653,"score_spread":0.24814501858459495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139177710","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9553766,0.00038343505,0.00040564116,0.00067107775,0.0012764527,0.00028591522,0.00000954926,0.00019634022,0.041394964],"genre_scores_gemma":[0.9983598,0.000039096136,0.0004980836,0.000066524095,0.00005471369,0.00001776299,3.500978e-7,0.000027088407,0.00093657133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879795,0.00009561287,0.0003206386,0.00023244243,0.00023336158,0.0003199694],"domain_scores_gemma":[0.9981804,0.00091627345,0.000112906324,0.00067344913,0.000051722145,0.00006524744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394027,0.00015423588,0.00028751462,0.00016661473,0.00012323423,0.000019292158,0.00051617785,0.000106887645,0.000106887856],"category_scores_gemma":[0.0014513361,0.00009682389,0.00011076509,0.00033196443,0.00008224456,0.00011288971,0.00021813034,0.0001255423,0.0000126285595],"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.000021185422,0.00006784812,0.008060409,0.000024809542,0.000015442516,0.00001528017,0.00028235582,1.7239906e-8,0.0002106089,0.9792902,0.006922529,0.00508931],"study_design_scores_gemma":[0.001846789,0.000039941006,0.0028029047,0.00007363006,0.000010945274,0.0000046492332,0.000034222117,0.0000029379805,0.0006470815,0.9852376,0.00912793,0.00017139627],"about_ca_topic_score_codex":0.000006238297,"about_ca_topic_score_gemma":0.000005227669,"teacher_disagreement_score":0.04298318,"about_ca_system_score_codex":0.00006984391,"about_ca_system_score_gemma":0.000019334624,"threshold_uncertainty_score":0.39483637},"labels":[],"label_agreement":null},{"id":"W2159330890","doi":"10.1007/s00493-006-0030-1","title":"Packing Non-Zero A-Paths In Group-Labelled Graphs","year":2006,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Disjoint sets; Vertex (graph theory); Abelian group; Zero (linguistics); Induced path; Integer (computer science); Path (computing); Graph; Matching (statistics); Discrete mathematics; Group (periodic table); Longest path problem; Shortest path problem","score_opus":0.0036333433700278684,"score_gpt":0.17088307904416922,"score_spread":0.16724973567414134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159330890","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95545787,0.0012683392,0.0007906072,0.00001194664,0.0014184834,0.00021907942,0.0000021841452,0.0003660486,0.040465433],"genre_scores_gemma":[0.9996481,0.000024686435,0.00003474448,0.000010729911,0.00003058675,0.000046592508,0.000007873276,0.00003970034,0.0001569691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989975,0.00004242603,0.00028738313,0.00018400673,0.00013937058,0.00034930522],"domain_scores_gemma":[0.9995589,0.000057492478,0.00003083625,0.00027988933,0.000017919217,0.0000549099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021026908,0.00018328687,0.00024713774,0.00020222015,0.00006623653,0.00003201321,0.00019764072,0.00010929508,0.00001898603],"category_scores_gemma":[0.000007363179,0.00019206038,0.0000791352,0.000664852,0.00002434452,0.00010502742,0.000025484884,0.00019897327,0.00007160333],"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.000017419947,0.0003423212,0.045615938,0.00019754676,0.00004491395,0.00014054321,0.0005003359,0.0016220318,0.012724438,0.9283365,0.0084196925,0.0020383033],"study_design_scores_gemma":[0.0043425825,0.00016488414,0.05553648,0.000277285,0.000034376782,0.000027227146,0.00017263317,0.007582218,0.006563864,0.889198,0.034786433,0.0013140322],"about_ca_topic_score_codex":0.00006494675,"about_ca_topic_score_gemma":0.000014376106,"teacher_disagreement_score":0.04419024,"about_ca_system_score_codex":0.000070341724,"about_ca_system_score_gemma":0.0000045346524,"threshold_uncertainty_score":0.7831995},"labels":[],"label_agreement":null},{"id":"W2166183308","doi":"10.1007/s00493-013-2649-z","title":"Chromatic number and complete graph substructures for degree sequences","year":2013,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Degree (music); Conjecture; Disjoint sets; Upper and lower bounds; Clique number; Subdivision; Clique; Chromatic scale; Discrete mathematics","score_opus":0.033176896259429364,"score_gpt":0.2485224778428964,"score_spread":0.21534558158346706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166183308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71210384,0.0016134793,0.27306384,0.0062726215,0.0009257817,0.0009325536,0.000036665686,0.000464859,0.0045863413],"genre_scores_gemma":[0.9842573,0.00003168823,0.015240741,0.00023138858,0.00001666785,0.000054157354,0.000005959758,0.000003573388,0.00015852311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904466,0.000033554963,0.00017779272,0.00032201636,0.00016766762,0.0002542973],"domain_scores_gemma":[0.99907446,0.0002745721,0.00007528061,0.0003645677,0.00008643147,0.00012470043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009855091,0.00012314861,0.00022299762,0.00010343155,0.00018430005,0.000219378,0.0007096083,0.000050374176,0.00012811294],"category_scores_gemma":[0.00010299455,0.00008623571,0.000070482725,0.0008739615,0.000102452446,0.0003519141,0.00020779723,0.00006338933,0.000085454],"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.0000020272248,0.0000960806,0.013354809,0.000059544705,0.00010363369,0.0000075455887,0.00017270312,0.0000033819504,0.00038118628,0.9057191,0.017572429,0.06252757],"study_design_scores_gemma":[0.0003235513,0.00009536807,0.0969557,0.0000051040606,0.000019328285,0.00001791918,0.000019553068,0.0033056159,0.00012651665,0.892952,0.005966982,0.00021235313],"about_ca_topic_score_codex":0.00015415388,"about_ca_topic_score_gemma":0.000002630063,"teacher_disagreement_score":0.27215344,"about_ca_system_score_codex":0.000014634169,"about_ca_system_score_gemma":0.000010446873,"threshold_uncertainty_score":0.35165903},"labels":[],"label_agreement":null},{"id":"W2285618017","doi":"10.1007/s00493-016-3594-4","title":"On the Number of Bases of Almost All Matroids","year":2018,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Matroid; Combinatorics; Mathematics; Graphic matroid; Cardinality (data modeling); Omega; Discrete mathematics; Embedding; Physics","score_opus":0.03759325496127142,"score_gpt":0.33073093295384776,"score_spread":0.29313767799257634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2285618017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7532321,0.0008866835,0.12109662,0.0046264045,0.005337882,0.0023159275,0.00012418989,0.0004401027,0.11194005],"genre_scores_gemma":[0.9957036,0.00008347611,0.0035108358,0.000119023774,0.000028950408,0.000047817975,0.000003929222,0.000023788716,0.00047858633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977294,0.00032207815,0.00038004975,0.00051265716,0.00072943425,0.00032636672],"domain_scores_gemma":[0.99558485,0.0010189221,0.00036261772,0.0025267927,0.00042078824,0.00008603589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007106705,0.00023871266,0.00040991968,0.00012559844,0.00007078831,0.00003911027,0.0032924484,0.00015205836,0.0001458268],"category_scores_gemma":[0.00037697286,0.00017140307,0.00021030492,0.0004797349,0.00039066246,0.00007912567,0.0031987077,0.000564305,0.0001110903],"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.000022822067,0.00023187738,0.0008009637,0.00010642718,0.00006191532,0.0000056415674,0.00018142916,0.00002131354,0.00009379304,0.98968095,0.008055912,0.00073698495],"study_design_scores_gemma":[0.00017780619,0.00015305882,0.0007185741,0.0001530538,0.000009856662,0.0000038613935,0.000005946638,0.0009109469,0.009470821,0.98554343,0.002671955,0.00018071462],"about_ca_topic_score_codex":0.00003881551,"about_ca_topic_score_gemma":3.8059994e-7,"teacher_disagreement_score":0.24247144,"about_ca_system_score_codex":0.0000690385,"about_ca_system_score_gemma":0.00014987616,"threshold_uncertainty_score":0.69896144},"labels":[],"label_agreement":null},{"id":"W2520939841","doi":"10.1007/s00493-019-3817-6","title":"Geometry of Permutation Limits","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Permutation (music); Limit (mathematics); Sorting; Random permutation; Path (computing); Identity (music); Sorting network","score_opus":0.032677817526748226,"score_gpt":0.30995440405192604,"score_spread":0.27727658652517784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520939841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5340654,0.00021213766,0.44648042,0.0001189669,0.0009924782,0.00038292582,0.000016624144,0.000100032536,0.017630972],"genre_scores_gemma":[0.9947107,0.0000052001214,0.004590275,0.000020100615,0.000010005998,0.0000055250375,0.0000019681179,0.000012596516,0.00064363726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935263,0.000011768638,0.0001888198,0.00012088402,0.00020223965,0.00012366915],"domain_scores_gemma":[0.9989869,0.000559668,0.0000932775,0.00018602652,0.0001294663,0.000044683813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010039075,0.00007223368,0.0001865054,0.00005202527,0.000019187548,0.000006503389,0.00011937458,0.000051378913,0.0001866972],"category_scores_gemma":[0.00087941386,0.00006485587,0.00003574479,0.00023911268,0.0000112491525,0.000036186702,0.000027023783,0.00007295907,0.00010303827],"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.000008222291,0.000100275276,0.000113140755,0.00019536282,0.000010157457,0.0000010498657,0.0000826513,6.517451e-7,0.0004887116,0.99584717,0.00049587386,0.0026567662],"study_design_scores_gemma":[0.00039748132,0.00022299944,0.00028731293,0.000037049616,0.000022324783,0.0000030192489,0.00006921062,0.0017188113,0.0023619183,0.9943748,0.00040895957,0.000096078475],"about_ca_topic_score_codex":0.0000013630207,"about_ca_topic_score_gemma":8.312936e-8,"teacher_disagreement_score":0.46064526,"about_ca_system_score_codex":0.000024047908,"about_ca_system_score_gemma":0.000026163032,"threshold_uncertainty_score":0.26447457},"labels":[],"label_agreement":null},{"id":"W2743168372","doi":"10.1007/s00493-019-3848-z","title":"Clustered Colouring in Minor-Closed Classes","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Monochromatic color; Conjecture; Chromatic scale; Graph; Windmill graph; Friendship graph; Integer (computer science); Graph coloring","score_opus":0.014357102561388977,"score_gpt":0.268063887531273,"score_spread":0.253706784969884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743168372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689684,0.00028806672,0.008222707,0.0006102617,0.00085052353,0.0005105454,6.190942e-7,0.00021422403,0.020334661],"genre_scores_gemma":[0.9960073,0.000012367617,0.0022341267,0.00008850641,0.00000973957,0.000021910311,6.1895327e-7,0.000011908476,0.0016134747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849457,0.0001339984,0.00019542278,0.00041641796,0.0003127741,0.00044681574],"domain_scores_gemma":[0.99870783,0.00029335308,0.000055976943,0.0007768585,0.000065711494,0.00010025428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031275296,0.00012533205,0.00020118341,0.00025299288,0.000055738947,0.00008059426,0.0012686971,0.000065540604,0.00003260631],"category_scores_gemma":[0.0000775068,0.00012588197,0.00004922188,0.0010036265,0.000035980964,0.00043129423,0.0005421504,0.00025776416,0.00039184178],"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.000041520085,0.00031920502,0.05921134,0.000062300765,0.000014430264,0.000098508994,0.00052603416,0.000117295785,0.004091919,0.9246919,0.00064073026,0.010184819],"study_design_scores_gemma":[0.006221242,0.0008174569,0.1082132,0.00014091672,0.000004266436,0.000032392407,0.00017821188,0.032301165,0.015571404,0.8083243,0.027132332,0.0010631292],"about_ca_topic_score_codex":0.00000875459,"about_ca_topic_score_gemma":0.000003320143,"teacher_disagreement_score":0.11636761,"about_ca_system_score_codex":0.00014958512,"about_ca_system_score_gemma":0.00006762167,"threshold_uncertainty_score":0.5133318},"labels":[],"label_agreement":null},{"id":"W2751713657","doi":"10.1007/s00493-019-3856-z","title":"The Extremal Function for Bipartite Linklessly Embeddable Graphs","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bipartite graph; Disjoint sets; Edge-transitive graph; Complete bipartite graph; Graph; Embedding; Pancyclic graph; Cograph","score_opus":0.00429969646013545,"score_gpt":0.17865703529762733,"score_spread":0.17435733883749188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751713657","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9333236,0.0052159084,0.03485032,0.00039463476,0.008572594,0.0010704442,0.000008373395,0.0008028571,0.01576122],"genre_scores_gemma":[0.9984599,0.00010951873,0.00013951145,0.000017255019,0.000037252015,0.000028733766,0.000012034309,0.000015438758,0.0011803601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995348,0.0000073641795,0.00012125427,0.000098108925,0.000083051134,0.00015542195],"domain_scores_gemma":[0.99965817,0.00006052418,0.000023842205,0.00017063724,0.00005717875,0.000029635376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000066719964,0.00007929311,0.0000946794,0.00003281216,0.00012479402,0.00005580209,0.000093086855,0.00004370035,0.000046321613],"category_scores_gemma":[0.000010545248,0.000053790256,0.00007778609,0.00023215127,0.000008683277,0.00008297199,0.000011340518,0.000056367153,0.000048525813],"study_design_candidate":"simulation_or_modeling","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.00015071174,0.000066483386,0.01721982,0.0002586729,0.00057389407,0.0000010822594,0.00027114185,0.3393189,0.007965547,0.51032925,0.056655787,0.0671887],"study_design_scores_gemma":[0.0008056197,0.00013307505,0.0071995254,0.000014117273,0.00008667525,0.00000117891,0.0000620572,0.7790573,0.0016526077,0.05685757,0.15383,0.0003002402],"about_ca_topic_score_codex":0.0000022151528,"about_ca_topic_score_gemma":0.0000017381768,"teacher_disagreement_score":0.4534717,"about_ca_system_score_codex":0.000027732687,"about_ca_system_score_gemma":0.00000414113,"threshold_uncertainty_score":0.21935031},"labels":[],"label_agreement":null},{"id":"W2766828223","doi":"10.1007/s00493-019-3897-3","title":"The Satisfiability Threshold For Random Linear Equations","year":2020,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Finite field; Mathematics; Satisfiability; Random matrix; Combinatorics; Discrete mathematics; Matrix (chemical analysis); Field (mathematics); Zero (linguistics); Multivariate random variable; Combinatorial proof; Random variable; Pure mathematics; Physics; Quantum mechanics; Statistics","score_opus":0.06303154819406136,"score_gpt":0.3012957554934848,"score_spread":0.23826420729942344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766828223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017801044,0.0010140428,0.97559285,0.015529537,0.004457904,0.001376108,0.00004108061,0.00039235433,0.0014181216],"genre_scores_gemma":[0.93078977,0.00024127259,0.06624688,0.0005883806,0.0005273826,0.0012158136,0.000056205008,0.00004296567,0.00029130906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780864,0.0001303578,0.00047906165,0.0007919733,0.0004122537,0.00037774805],"domain_scores_gemma":[0.995222,0.0023000578,0.00023594801,0.0018066396,0.00027979587,0.00015560762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008072758,0.00028825548,0.00040916502,0.000054692,0.0008930069,0.00046587831,0.0031902336,0.00018297904,0.000004919265],"category_scores_gemma":[0.0008780862,0.00022591936,0.0004203344,0.00041630527,0.00016140868,0.000109314205,0.002726251,0.0007431515,0.000022805783],"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.000017786264,0.00008423724,0.000051536117,0.00006501989,0.000059702455,0.0000016940633,0.00026855824,0.00017696043,0.0000043674204,0.9801197,0.005759022,0.013391434],"study_design_scores_gemma":[0.0005994058,0.000068685666,0.000104248225,0.000017014469,0.000016396818,4.977209e-7,0.000006117396,0.28757146,0.00004908947,0.68259084,0.028776934,0.0001992763],"about_ca_topic_score_codex":0.000020133426,"about_ca_topic_score_gemma":0.0000057194707,"teacher_disagreement_score":0.9306118,"about_ca_system_score_codex":0.00011414914,"about_ca_system_score_gemma":0.0003011891,"threshold_uncertainty_score":0.9212724},"labels":[],"label_agreement":null},{"id":"W2774144053","doi":"10.1007/s00493-017-3396-3","title":"Extending Factorizations of Complete Uniform Hypergraphs","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Combinatorics; Hypergraph; Discrete mathematics","score_opus":0.019760809228066133,"score_gpt":0.22312220478638162,"score_spread":0.20336139555831548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2774144053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82226276,0.0006897714,0.0051394454,0.000041534688,0.00455086,0.00026761254,0.000050834085,0.00045435084,0.16654283],"genre_scores_gemma":[0.99974346,0.000041399388,0.000043343603,0.000001882074,0.000020858617,0.000007654474,0.0000045201614,0.000018024266,0.00011884458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949324,0.000012031957,0.00016489055,0.00008372731,0.00009725452,0.00014884483],"domain_scores_gemma":[0.99929565,0.00003113283,0.00006727946,0.00051124726,0.000038462513,0.000056201916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007866945,0.00009573535,0.00016780874,0.00007591847,0.00026730754,0.000037791,0.00035285347,0.000047868372,0.000026969832],"category_scores_gemma":[0.000029235256,0.00009527597,0.00006667384,0.00009311205,0.00005719624,0.00014020331,0.00003543591,0.00007802871,0.000019210785],"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.0000022160787,0.000031136336,0.009965583,0.000073217445,0.000052966345,0.000003120875,0.00018399346,0.00016175827,0.009257763,0.97893983,0.00044823534,0.0008801806],"study_design_scores_gemma":[0.0036040288,0.00032871866,0.23185346,0.00048108786,0.00016561165,0.000037367863,0.000675312,0.014266315,0.041406345,0.46364287,0.2416588,0.0018800898],"about_ca_topic_score_codex":0.000009839713,"about_ca_topic_score_gemma":0.0000010538839,"teacher_disagreement_score":0.515297,"about_ca_system_score_codex":0.000020472964,"about_ca_system_score_gemma":0.0000049244086,"threshold_uncertainty_score":0.38852414},"labels":[],"label_agreement":null},{"id":"W2824286381","doi":"10.1007/s00493-020-4041-0","title":"Expanding Polynomials: A Generalization of the Elekes-Rónyai Theorem to d Variables","year":2020,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Mathematical functions and polynomials","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Physics; Omega; Mathematics; Quantum mechanics","score_opus":0.06982136849772809,"score_gpt":0.32616016381708435,"score_spread":0.25633879531935627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2824286381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42342573,0.0015806168,0.3935178,0.020724941,0.022261338,0.011360151,0.00081256655,0.0013399132,0.124976955],"genre_scores_gemma":[0.9862155,0.00004605641,0.011319666,0.00039813,0.00041790577,0.00018795524,0.000017121221,0.00010318328,0.0012945052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768287,0.00030395205,0.00085106737,0.00045208086,0.00041561527,0.0002944181],"domain_scores_gemma":[0.99714607,0.0008077523,0.0005467187,0.0011659309,0.00016496664,0.00016856207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061856984,0.00035855416,0.0008266929,0.00011617602,0.00016935306,0.00008698751,0.00087361585,0.00030995978,0.00032710712],"category_scores_gemma":[0.0024745376,0.00025474536,0.00033758645,0.00049482344,0.000056856068,0.000035703968,0.0012871368,0.00041446905,0.00003316953],"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.00002437554,0.00018729921,0.00007916957,0.00071155187,0.0001239861,9.61447e-7,0.0010831999,0.00006567683,0.0027117545,0.9239411,0.07081125,0.00025972174],"study_design_scores_gemma":[0.00026149212,0.000061101404,0.000037769394,0.00044037943,0.00020064921,0.0000022877014,0.00005590059,0.0005180672,0.014431455,0.9760532,0.0076146824,0.00032303328],"about_ca_topic_score_codex":0.000041500647,"about_ca_topic_score_gemma":0.0000017299916,"teacher_disagreement_score":0.56278974,"about_ca_system_score_codex":0.00015715368,"about_ca_system_score_gemma":0.00019403001,"threshold_uncertainty_score":0.99999046},"labels":[],"label_agreement":null},{"id":"W2921418856","doi":"10.1007/s00493-018-3708-2","title":"The Minimally Non-Ideal Binary Clutters with a Triangle","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Vibration and Dynamic Analysis","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Ideal (ethics); Combinatorics; Binary number; Discrete mathematics; Arithmetic; Epistemology","score_opus":0.0030253145988220586,"score_gpt":0.17572052417320796,"score_spread":0.17269520957438592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921418856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88638014,0.0006857651,0.010054314,0.0020632688,0.0012480102,0.0005174198,0.000004129021,0.00055347994,0.09849349],"genre_scores_gemma":[0.99748045,0.000033041233,0.00012936511,0.00009541606,0.000015786081,0.000014043848,0.0000046810073,0.000019977118,0.0022072082],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945354,0.000014200081,0.0001239365,0.00010553782,0.0001335863,0.00016921597],"domain_scores_gemma":[0.99957955,0.000064703636,0.000023976128,0.00025378296,0.000024160974,0.000053824657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007910657,0.00009667966,0.00013401611,0.000046381854,0.00008168828,0.000044734068,0.00016099431,0.00003606934,0.00005402173],"category_scores_gemma":[0.000005866406,0.00006365023,0.000056248973,0.00028322672,0.000020551703,0.000069422815,0.000019786594,0.00009616585,0.00027855378],"study_design_candidate":"simulation_or_modeling","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.0011063869,0.0008850868,0.08998478,0.0006021329,0.0036308647,0.0003000183,0.0057923496,0.28075042,0.015693994,0.10288529,0.44557673,0.052791927],"study_design_scores_gemma":[0.0027806102,0.00043954977,0.014427655,0.00003343761,0.000082185,0.000009207529,0.00053362583,0.9047693,0.0003014168,0.000958223,0.07515557,0.0005092428],"about_ca_topic_score_codex":0.0000056318636,"about_ca_topic_score_gemma":0.000004493182,"teacher_disagreement_score":0.62401885,"about_ca_system_score_codex":0.000056272303,"about_ca_system_score_gemma":0.000021047532,"threshold_uncertainty_score":0.3580338},"labels":[],"label_agreement":null},{"id":"W2921478501","doi":"10.1007/s00493-020-4177-y","title":"On the Density of C7-Critical Graphs","year":2022,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Homomorphism; Planar graph; Modulo; Girth (graph theory); Conjecture; Graph homomorphism; Graph; Discrete mathematics; Odd graph; 1-planar graph; Graph power; Line graph","score_opus":0.0345622702573892,"score_gpt":0.3188477609824474,"score_spread":0.28428549072505815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921478501","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47303656,0.0032183414,0.38167027,0.033905834,0.020003643,0.0044359677,0.00012646017,0.0016064874,0.08199643],"genre_scores_gemma":[0.9982241,0.00004422348,0.0011979166,0.00021243923,0.000011698198,0.00011248787,0.0000028481857,0.000018858835,0.00017544594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968996,0.0006927889,0.0002934644,0.0006917223,0.0010181528,0.00040428928],"domain_scores_gemma":[0.9941962,0.0026822037,0.00013413222,0.0026295711,0.00023510517,0.00012282074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010442659,0.00023670941,0.00036141978,0.00023711415,0.0003429231,0.00008039627,0.00433714,0.00012271471,0.00014000574],"category_scores_gemma":[0.0011495445,0.00018489025,0.00025729116,0.0008359283,0.0003531658,0.000074188276,0.0069780797,0.0017629106,0.000026796912],"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.000014096755,0.00021820264,0.00026568826,0.00004555404,0.000023820765,0.00003207685,0.00014488617,0.000053563694,0.000032850814,0.9965244,0.0018974293,0.00074741483],"study_design_scores_gemma":[0.00010639124,0.0001731395,0.00073558517,0.000029072144,0.0000063190178,0.0000037129955,0.000018954834,0.0010491925,0.00089582126,0.9957578,0.0010418124,0.00018216099],"about_ca_topic_score_codex":0.000012040389,"about_ca_topic_score_gemma":3.118235e-7,"teacher_disagreement_score":0.52518755,"about_ca_system_score_codex":0.0001386149,"about_ca_system_score_gemma":0.0001806921,"threshold_uncertainty_score":0.8697677},"labels":[],"label_agreement":null},{"id":"W2922170409","doi":"10.1007/s00493-018-3779-0","title":"The Two-Point Fano and Ideal Binary Clutters","year":2019,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fano plane; Ideal (ethics); Combinatorics; Binary number; Mathematics; Clutter; Discrete mathematics; Physics; Pure mathematics; Arithmetic; Computer science; Telecommunications","score_opus":0.0053238846182333665,"score_gpt":0.21095649114792916,"score_spread":0.2056326065296958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922170409","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93649036,0.0025635143,0.014972218,0.010126563,0.004201213,0.00048324405,0.0000010141945,0.0005163838,0.03064547],"genre_scores_gemma":[0.998872,0.000058571455,0.00037938863,0.0004517968,0.00001699096,0.000008346895,2.4179977e-7,0.0000059962467,0.00020666294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991357,0.00008983214,0.00011750464,0.0002628384,0.00015283882,0.00024132861],"domain_scores_gemma":[0.99897563,0.00027796792,0.000048044036,0.00059237523,0.000028321661,0.000077666606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038086652,0.00010267797,0.00010213108,0.00005509676,0.0002797426,0.00017690306,0.0007330093,0.000027320626,0.000007732731],"category_scores_gemma":[0.000015119977,0.00007302362,0.000058175898,0.0003493225,0.00007058764,0.0001984415,0.0004151304,0.00013367395,0.00009032083],"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.0000083130935,0.000023894014,0.0018668837,0.000004692825,0.000010472288,0.0000050286394,0.00021248675,0.0000019137715,0.0003578685,0.98118615,0.0019001795,0.014422119],"study_design_scores_gemma":[0.0012152784,0.0005036875,0.014141983,0.000028605638,0.00000949548,0.000033463195,0.0001043355,0.0047575296,0.0005979453,0.88606983,0.09214587,0.0003919734],"about_ca_topic_score_codex":0.00000532016,"about_ca_topic_score_gemma":3.4464534e-7,"teacher_disagreement_score":0.09511632,"about_ca_system_score_codex":0.000018118513,"about_ca_system_score_gemma":0.000018570736,"threshold_uncertainty_score":0.2977817},"labels":[],"label_agreement":null},{"id":"W2962755011","doi":"10.1007/s00493-018-3859-1","title":"Improved Bounds for Rota's Basis Conjecture","year":2018,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Matroid; Combinatorics; Disjoint sets; Conjecture; Rank (graph theory); Basis (linear algebra); Discrete mathematics; Geometry","score_opus":0.00628664731631921,"score_gpt":0.2029663673454901,"score_spread":0.1966797200291709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962755011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8779779,0.002499342,0.03673149,0.0002980533,0.016926894,0.0018158425,0.00007011511,0.0024815795,0.06119877],"genre_scores_gemma":[0.99895865,0.0000048790175,0.000114766226,0.00004043472,0.00021902415,0.00010001499,0.0000048476013,0.00003595235,0.0005214528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939215,0.000015923757,0.00013926749,0.00014121844,0.0000604096,0.00025103643],"domain_scores_gemma":[0.99952644,0.000053146057,0.000021259691,0.00026640852,0.000058551806,0.00007417218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012191728,0.00013288727,0.00016390624,0.000050940034,0.0001281544,0.000039012364,0.00017192501,0.0001024797,0.00005665069],"category_scores_gemma":[0.0000245798,0.0001254423,0.00008373619,0.00018282005,0.00004708274,0.00005688271,0.00001520841,0.00008054731,0.000042564097],"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.00011132211,0.00016489587,0.00085020275,0.00047991032,0.00041530488,0.000006530828,0.0022209957,0.000030788175,0.042178337,0.8146121,0.12177089,0.017158741],"study_design_scores_gemma":[0.0020548834,0.0006960833,0.0004284656,0.000042787175,0.000057602952,0.000015527532,0.00012560446,0.012146552,0.071983576,0.14340682,0.7683808,0.0006613082],"about_ca_topic_score_codex":0.0000034323425,"about_ca_topic_score_gemma":0.0000020852524,"teacher_disagreement_score":0.6712053,"about_ca_system_score_codex":0.000043375112,"about_ca_system_score_gemma":0.000009662911,"threshold_uncertainty_score":0.5115388},"labels":[],"label_agreement":null},{"id":"W2963873020","doi":"10.1007/s00493-017-3538-5","title":"Treewidth of Grid Subsets","year":2017,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Treewidth; Combinatorics; Grid; Graph; Pathwidth; Geometry","score_opus":0.029705580329058148,"score_gpt":0.31315980002095173,"score_spread":0.2834542196918936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963873020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42104033,0.0021459167,0.30998343,0.006812993,0.008912611,0.0011938455,0.000023982297,0.0008326451,0.24905425],"genre_scores_gemma":[0.99655724,0.000026548667,0.0028198475,0.000017358052,0.000021602455,0.000008005256,4.6165584e-7,0.000007140907,0.00054182275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899346,0.000049623064,0.00013997873,0.0002521349,0.0003049147,0.0002598735],"domain_scores_gemma":[0.99762094,0.000096065414,0.00015199617,0.0019032827,0.00012421823,0.00010347722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002775462,0.000087789136,0.00016481262,0.000085923784,0.0003111909,0.00009722468,0.0029142275,0.0000378663,0.000012272216],"category_scores_gemma":[0.00023423483,0.000080431375,0.000063902786,0.0001674106,0.00016965542,0.0005098183,0.0007167356,0.00012669127,0.000059655904],"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.0000066647626,0.00009517346,0.0054050223,0.000011531611,0.000009594097,0.000019992389,0.00008921866,0.0000014297678,0.0007136402,0.97022647,0.0013879436,0.022033311],"study_design_scores_gemma":[0.0008960275,0.00020426238,0.05041871,0.000023154991,0.0000034910533,0.000008415389,0.000007230268,0.0011708839,0.02522496,0.90787524,0.013937965,0.00022965968],"about_ca_topic_score_codex":0.00001116111,"about_ca_topic_score_gemma":9.924498e-7,"teacher_disagreement_score":0.5755169,"about_ca_system_score_codex":0.000027033619,"about_ca_system_score_gemma":0.000044185545,"threshold_uncertainty_score":0.54154086},"labels":[],"label_agreement":null},{"id":"W2989234367","doi":"10.1007/s00493-023-00007-w","title":"On the Density of Critical Graphs with No Large Cliques","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Clique-sum; Chordal graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.0351792611584909,"score_gpt":0.31964784191637935,"score_spread":0.28446858075788845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989234367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9864666,0.0000060844613,0.00024934224,0.0014372775,0.00007534321,0.00018820267,0.000010497907,0.00017432505,0.011392339],"genre_scores_gemma":[0.9994668,0.000004942841,0.00012908093,0.000105696425,0.000006383314,0.000042897052,0.0000018496233,0.000011756946,0.00023058668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993866,0.00007770954,0.000116251664,0.00011617958,0.00014865423,0.0001546135],"domain_scores_gemma":[0.9976207,0.0017874971,0.000039005747,0.00039144928,0.00012373758,0.00003757928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035995457,0.00007525576,0.00012351347,0.00004449745,0.00016937895,0.000008460456,0.00017409021,0.000037763944,0.00005180383],"category_scores_gemma":[0.0006017884,0.000045687982,0.000053383024,0.00045742502,0.0001244508,0.000020665586,0.000044161585,0.00012491939,0.00012871105],"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.000013327988,0.00026625296,0.0005085496,0.00003209945,0.000011088942,0.0000023239568,0.00012625518,4.048831e-8,0.00008310626,0.98668855,0.0122581655,0.0000102296735],"study_design_scores_gemma":[0.00012840872,0.00011027603,0.001206653,0.00002235401,0.000018948336,0.0000010489525,0.00007672643,0.000022236685,0.0022439058,0.99518996,0.00091956276,0.00005991386],"about_ca_topic_score_codex":0.000001229999,"about_ca_topic_score_gemma":8.323784e-7,"teacher_disagreement_score":0.013000218,"about_ca_system_score_codex":0.0000069192615,"about_ca_system_score_gemma":0.000011507362,"threshold_uncertainty_score":0.18631019},"labels":[],"label_agreement":null},{"id":"W3001610491","doi":"10.1007/s00493-020-4516-z","title":"On the Directions Determined by a Cartesian Product in an Affine Galois Plane","year":2021,"lang":"en","type":"preprint","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Cartesian product; Combinatorics; Affine transformation; Upper and lower bounds; Clique; Graph; Product (mathematics); Discrete mathematics; Pure mathematics; Geometry","score_opus":0.02954398501120894,"score_gpt":0.28591201975071084,"score_spread":0.2563680347395019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001610491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9881628,0.0007436907,0.00002218511,0.00079963804,0.0020667154,0.0007810757,0.000053714906,0.0001613533,0.0072088144],"genre_scores_gemma":[0.99839836,0.0000733714,0.00020996704,0.000113705944,0.000109411114,0.00019479958,0.00007037733,0.000057618206,0.0007723662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791515,0.00043679765,0.00038491486,0.00063891197,0.00030607134,0.0003181847],"domain_scores_gemma":[0.9973233,0.0007045999,0.00018974463,0.0015958848,0.00009527438,0.00009122741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043511976,0.00036743286,0.0005095074,0.00013945489,0.00026713687,0.0001223002,0.00066550716,0.00023587637,0.00016913256],"category_scores_gemma":[0.0007740442,0.0002619366,0.00014718044,0.00030229863,0.00008403882,0.000043720745,0.00047388702,0.0010613205,0.0000026282235],"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.000119258686,0.0023702162,0.001869421,0.0005916307,0.00027860238,0.00018879585,0.008787095,0.00001778345,0.0007416824,0.92073095,0.05795198,0.0063525587],"study_design_scores_gemma":[0.00043049542,0.00014532042,0.0012654231,0.00022548709,0.00007737227,0.000017269078,0.00019401468,0.00010222559,0.0020240026,0.9918126,0.003197579,0.00050823187],"about_ca_topic_score_codex":0.0000695219,"about_ca_topic_score_gemma":0.00009058201,"teacher_disagreement_score":0.0710816,"about_ca_system_score_codex":0.00015933586,"about_ca_system_score_gemma":0.000081378894,"threshold_uncertainty_score":0.9999833},"labels":[],"label_agreement":null},{"id":"W3134598310","doi":"10.1007/s00493-021-4774-4","title":"A Family of Balanced Generalized Weighing Matrices","year":2022,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Mathematics; Combinatorics; Integer (computer science); Class (philosophy); Matrix (chemical analysis); Association scheme; Scheme (mathematics); Integer matrix; Mathematical analysis; Symmetric matrix; Nonnegative matrix; Eigenvalues and eigenvectors; Physics","score_opus":0.006785211765883642,"score_gpt":0.18435956513308321,"score_spread":0.17757435336719957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134598310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9810885,0.0037664848,0.00021662722,0.000010256999,0.0017601828,0.00010814892,0.000010722927,0.00023784384,0.012801222],"genre_scores_gemma":[0.999652,0.000046358226,0.000058183385,0.000016255488,0.00001872596,0.000056615532,0.000004038581,0.00001965049,0.00012813597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933916,0.000065647626,0.00018667022,0.0000937401,0.00016694149,0.00014785022],"domain_scores_gemma":[0.999679,0.00003597631,0.00004128487,0.00019341566,0.000015136999,0.00003516538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016318337,0.00008619688,0.00018236758,0.00008721068,0.00009851667,0.000008084783,0.00022377077,0.000021819445,0.00008189309],"category_scores_gemma":[0.0000046126615,0.00009248284,0.0000668033,0.00040364914,0.000011039864,0.000042586955,0.0000561746,0.0001172922,0.0000077244695],"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.000066483706,0.0002312879,0.00426828,0.00044008455,0.00024631762,0.000044254637,0.0019373611,0.019200912,0.14345908,0.803598,0.02409657,0.0024114],"study_design_scores_gemma":[0.008742209,0.00086189073,0.0111229895,0.00014638541,0.00018778254,0.000067058616,0.0035017745,0.055486288,0.038923822,0.2253503,0.65324455,0.0023649593],"about_ca_topic_score_codex":0.000013153048,"about_ca_topic_score_gemma":8.006883e-8,"teacher_disagreement_score":0.62914795,"about_ca_system_score_codex":0.00004844488,"about_ca_system_score_gemma":0.0000073065703,"threshold_uncertainty_score":0.37713405},"labels":[],"label_agreement":null},{"id":"W3160268110","doi":"10.1007/s00493-023-00055-2","title":"Effective Results on the Size and Structure of Sumsets","year":2023,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Centre de Recherches Mathématiques","keywords":"Algorithm; Computer science","score_opus":0.015744175514643532,"score_gpt":0.26513998291885726,"score_spread":0.24939580740421374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160268110","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98969966,0.0003805317,0.0000013899747,0.00094348774,0.0016209023,0.000827998,0.0003250568,0.00008481261,0.0061161797],"genre_scores_gemma":[0.9987828,0.00019370824,0.000030623396,0.00011464841,0.00008716095,0.000010470545,0.000005653321,0.00004430221,0.00073064776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786556,0.00048272868,0.00044240494,0.00040458646,0.00043199267,0.0003727406],"domain_scores_gemma":[0.9882326,0.010313294,0.00032298404,0.00090800313,0.00012746327,0.00009561771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065115816,0.00032732924,0.00049847487,0.000110410976,0.00046962843,0.000041565894,0.00043934808,0.00026553532,0.000054392647],"category_scores_gemma":[0.004076613,0.00020196554,0.00014235383,0.0007589692,0.00037541176,0.00004015222,0.000425666,0.00053777674,0.000016718719],"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.0002908909,0.00007466244,0.00021095417,0.00032817235,0.00021341893,0.000018792181,0.0056358855,0.000002865228,0.0007858116,0.97445184,0.016173337,0.0018133767],"study_design_scores_gemma":[0.0013313609,0.0005146602,0.02114664,0.00020843832,0.000113116934,0.000006150553,0.00045146403,0.00007240216,0.006056735,0.96738565,0.002472797,0.00024056823],"about_ca_topic_score_codex":0.000010486635,"about_ca_topic_score_gemma":0.0000014793252,"teacher_disagreement_score":0.020935686,"about_ca_system_score_codex":0.00004643143,"about_ca_system_score_gemma":0.00002794476,"threshold_uncertainty_score":0.82359153},"labels":[],"label_agreement":null},{"id":"W3204767113","doi":"10.1007/s00493-023-00015-w","title":"Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research; Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Algorithm; Mathematics","score_opus":0.03349660689747145,"score_gpt":0.32149013006570326,"score_spread":0.2879935231682318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204767113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61064583,0.00087045843,0.34150377,0.013916749,0.014257066,0.00958766,0.00017484384,0.002975832,0.0060678064],"genre_scores_gemma":[0.9903269,0.000023104627,0.0049108854,0.00022646101,0.00022872018,0.0010779335,0.000017465687,0.00006709283,0.0031214594],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99723303,0.00014417962,0.00039097722,0.0006808442,0.00047613584,0.001074807],"domain_scores_gemma":[0.9960526,0.002304495,0.00015993645,0.0010953587,0.00018699956,0.00020057884],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011857275,0.000286096,0.00037794554,0.00012711037,0.0017617835,0.0007334794,0.0022713926,0.00011950333,0.000016208762],"category_scores_gemma":[0.000683509,0.00023411251,0.00029813277,0.001460745,0.00028764672,0.00052201434,0.0007235616,0.00026203733,0.0001838044],"study_design_candidate":"not_applicable","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.00033134516,0.00032560911,0.0004661152,0.00031464305,0.00021001277,0.00003375159,0.0045171953,0.00010428865,0.0021151397,0.2806177,0.6720652,0.038898993],"study_design_scores_gemma":[0.0056624566,0.00094413356,0.0016443055,0.0000928353,0.000045414836,0.000040392886,0.00031499975,0.34418735,0.0012766911,0.39757824,0.24726273,0.00095044926],"about_ca_topic_score_codex":0.000019657777,"about_ca_topic_score_gemma":0.0000028548836,"teacher_disagreement_score":0.42480245,"about_ca_system_score_codex":0.000253645,"about_ca_system_score_gemma":0.0003318761,"threshold_uncertainty_score":0.99953777},"labels":[],"label_agreement":null},{"id":"W3216450391","doi":"10.1007/s00493-020-4264-0","title":"The Ramsey Properties for Grassmannians Over ℝ, ℂ","year":2021,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Collège Lionel Groulx","funders":"Banff International Research Station for Mathematical Innovation and Discovery; Fundação de Amparo à Pesquisa do Estado de São Paulo; Instituto de Ciencias Matemáticas; National Science Foundation","keywords":"Mathematics; Rothschild; Combinatorics; Factorization; Finite field; Metric (unit); Ramsey theory; Dual (grammatical number); Field (mathematics); Discrete mathematics; Integer (computer science); Pure mathematics; Algorithm","score_opus":0.05685348400987948,"score_gpt":0.32288979978793997,"score_spread":0.2660363157780605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216450391","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7358917,0.024515858,0.10511678,0.02877792,0.012921457,0.0035840748,0.00004903569,0.0014928493,0.08765033],"genre_scores_gemma":[0.9743714,0.00009602866,0.0012814408,0.00026388618,0.00007147361,0.00013164607,0.0000027245178,0.000028754046,0.023752684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993383,0.00007078312,0.00014271321,0.0001453741,0.000080183796,0.00022260786],"domain_scores_gemma":[0.99871725,0.0007414572,0.000050591865,0.00034481785,0.000111090856,0.000034767207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019037462,0.000090717316,0.00013757565,0.00001056324,0.00044796304,0.000023441638,0.00016689417,0.00006946462,0.00002373831],"category_scores_gemma":[0.00090835587,0.000058621186,0.000079180136,0.00008673973,0.00011428181,0.000045529774,0.000062081584,0.00011848349,0.000013936281],"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.000027257365,0.00008050734,0.00005766189,0.000027380165,0.000031174703,0.000006287384,0.00022278629,4.2702365e-7,0.000254081,0.9847787,0.013321219,0.0011924963],"study_design_scores_gemma":[0.0003523217,0.00003426594,0.00004535927,0.0000091782,0.000017382119,0.0000069508114,0.00021623564,0.00003687246,0.00414885,0.8551552,0.1398963,0.00008104086],"about_ca_topic_score_codex":5.0038057e-7,"about_ca_topic_score_gemma":0.0000037210616,"teacher_disagreement_score":0.23847966,"about_ca_system_score_codex":0.000033278637,"about_ca_system_score_gemma":0.00005030592,"threshold_uncertainty_score":0.3445415},"labels":[],"label_agreement":null},{"id":"W4247202641","doi":"10.1007/s004930070033","title":"Adaptive Multicolouring","year":2000,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02092664864078052,"score_gpt":0.27073266581200073,"score_spread":0.2498060171712202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247202641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24593809,0.0015011317,0.44119796,0.002317469,0.0012381064,0.001076021,0.0000030649114,0.0021913645,0.3045368],"genre_scores_gemma":[0.9854037,0.000025151965,0.011705039,0.00008796469,0.000015350044,0.000022262497,1.997401e-7,0.000008887637,0.0027314026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989404,0.00007619908,0.00010729624,0.0002975303,0.0002435331,0.00033500488],"domain_scores_gemma":[0.9991171,0.00013016233,0.00002045986,0.0005540013,0.000052927768,0.00012539882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015524706,0.00009403134,0.000106960906,0.00007605432,0.00015880358,0.0000561395,0.0009801969,0.00003533857,0.00015957604],"category_scores_gemma":[0.000029789058,0.00009072692,0.000045803234,0.00056784495,0.0000531524,0.00035996924,0.00016267039,0.00017355589,0.00066545047],"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.000015166443,0.00012821276,0.00014361837,0.000002866215,0.000010281677,0.000049679482,0.00027499843,0.000108813016,0.00014132186,0.78345245,0.00047767162,0.21519494],"study_design_scores_gemma":[0.0011755213,0.00037736906,0.0029753128,0.00002036853,0.0000032962103,0.000025489653,0.000027434024,0.047460593,0.0044543846,0.8966996,0.046341896,0.0004387265],"about_ca_topic_score_codex":0.0000038325898,"about_ca_topic_score_gemma":1.9311426e-7,"teacher_disagreement_score":0.73946565,"about_ca_system_score_codex":0.00006414318,"about_ca_system_score_gemma":0.000027702175,"threshold_uncertainty_score":0.85532415},"labels":[],"label_agreement":null},{"id":"W4376143266","doi":"10.1007/s00493-023-00031-w","title":"Stronger Counterexamples to the Topological Tverberg Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Counterexample; Mathematics; Combinatorics; Conjecture; Disjoint sets; Embedding; Equivariant map; Continuous map; Discrete mathematics; Pure mathematics; Computer science","score_opus":0.012019137954067779,"score_gpt":0.20605481547363724,"score_spread":0.19403567751956946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376143266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9796927,0.00047893074,0.0004320915,0.0009996174,0.0030719638,0.0003083033,0.000018023864,0.0012042371,0.013794154],"genre_scores_gemma":[0.9989747,0.000017350225,0.0000052480973,0.000095598065,0.0000852042,0.000052609812,0.000005361245,0.0000179995,0.00074596284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993247,0.000043994256,0.000117608084,0.00012731436,0.00012543536,0.00026097786],"domain_scores_gemma":[0.99950045,0.00011429084,0.000010048905,0.00028651237,0.000016311817,0.00007235721],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017283902,0.00011588874,0.00013144188,0.000049905182,0.00010990894,0.000036152655,0.00028362073,0.000068597816,0.000119870165],"category_scores_gemma":[0.00002572265,0.00007606633,0.00005483632,0.00045884412,0.000026898602,0.000028409924,0.00005106062,0.00014487427,0.0009234166],"study_design_candidate":"not_applicable","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.000011272819,0.000025967416,0.0014163763,0.000040661693,0.00008605829,0.000037547336,0.0012746415,0.004428162,0.00076045457,0.7314246,0.25857556,0.0019186682],"study_design_scores_gemma":[0.00029397573,0.000095975905,0.013291061,0.000021205075,0.000014581061,0.000013978698,0.000616587,0.0008555023,0.0008504668,0.033395346,0.9502572,0.00029416906],"about_ca_topic_score_codex":0.000005704327,"about_ca_topic_score_gemma":0.0000032720945,"teacher_disagreement_score":0.6980293,"about_ca_system_score_codex":0.000032002943,"about_ca_system_score_gemma":0.000004633537,"threshold_uncertainty_score":0.9998545},"labels":[],"label_agreement":null},{"id":"W4380373845","doi":"10.1007/s00493-023-00047-2","title":"The Chromatic Number of the Product of 5-Chromatic Graphs can be 4","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.017308036087016348,"score_gpt":0.2537779589324572,"score_spread":0.23646992284544086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380373845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98014814,0.00042316562,0.0005262047,0.014063237,0.0010635753,0.00036928503,0.000018106002,0.00017904586,0.0032092691],"genre_scores_gemma":[0.9989939,0.00004929761,0.00015845163,0.00005034326,0.0000066788293,0.000014157394,0.0000017966048,0.0000036628242,0.0007217292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865866,0.00013100007,0.00031825117,0.000214859,0.00045216957,0.00022506012],"domain_scores_gemma":[0.9980188,0.00042396638,0.00021574153,0.0012040216,0.0000926878,0.000044809785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004623867,0.00009584308,0.00022725148,0.0000932604,0.00020751703,0.000035823614,0.0019467609,0.00002723822,0.000019322999],"category_scores_gemma":[0.0005344867,0.000046249148,0.00014934501,0.006225199,0.00019686554,0.000074672615,0.00064541196,0.000091514274,0.000029494828],"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.0000022870768,0.0002990028,0.020419966,0.00014528583,0.00017686178,0.0000068995896,0.0006898862,0.000020949063,0.00042871005,0.9412879,0.021363385,0.015158899],"study_design_scores_gemma":[0.0005028362,0.00015382699,0.25459087,0.00005182423,0.00011485427,0.000016163922,0.00017681747,0.0039253887,0.006961456,0.72306436,0.010123796,0.00031782157],"about_ca_topic_score_codex":0.000112190515,"about_ca_topic_score_gemma":0.000006192085,"teacher_disagreement_score":0.23417088,"about_ca_system_score_codex":0.000018802968,"about_ca_system_score_gemma":0.000045911907,"threshold_uncertainty_score":0.36175984},"labels":[],"label_agreement":null},{"id":"W4380629273","doi":"10.1007/s00493-023-00024-9","title":"An Improved Bound for the Linear Arboricity Conjecture","year":2023,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"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","funders":"","keywords":"Algorithm; Conjecture; Mathematics; Combinatorics","score_opus":0.028501187315718303,"score_gpt":0.33020969997860394,"score_spread":0.3017085126628856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380629273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030643314,0.0004584038,0.95955473,0.004395237,0.0020056681,0.0012938626,0.000013982647,0.0012286294,0.00040619491],"genre_scores_gemma":[0.9958953,0.000043715598,0.002932208,0.00022133888,0.0001094284,0.0001941779,0.0000053496797,0.00002329483,0.0005751561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986487,0.00009058371,0.00013888256,0.0003999512,0.00024808463,0.0004737652],"domain_scores_gemma":[0.9976517,0.0008980173,0.000052911564,0.0011183859,0.000153306,0.00012567487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069376023,0.00013138434,0.0001411726,0.000103560385,0.0005314302,0.00014788467,0.0018904249,0.00006673247,0.0000043752507],"category_scores_gemma":[0.00022869687,0.000091287984,0.00008283336,0.0014482851,0.00010163127,0.00029196983,0.0002781736,0.00023941444,0.000048811566],"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.00002878985,0.00010734138,0.00015422323,0.00002177834,0.000032319633,0.000010501684,0.00043561985,0.00020123195,0.0031768763,0.97209555,0.0038388583,0.0198969],"study_design_scores_gemma":[0.0006540589,0.0004340695,0.00090054626,0.0000035102375,0.0000059131357,0.0000034107518,0.000041327017,0.33782017,0.0034796596,0.61578566,0.04066979,0.00020191705],"about_ca_topic_score_codex":0.000008093538,"about_ca_topic_score_gemma":0.0000016865894,"teacher_disagreement_score":0.96525204,"about_ca_system_score_codex":0.00005110918,"about_ca_system_score_gemma":0.00008405125,"threshold_uncertainty_score":0.4087385},"labels":[],"label_agreement":null},{"id":"W4394572107","doi":"10.1007/s00493-024-00097-0","title":"Induced Subgraphs and Tree Decompositions VIII: Excluding a Forest in (Theta, Prism)-Free Graphs","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Prism; Tree (set theory); Forestry; Geography; Physics","score_opus":0.025770290063203218,"score_gpt":0.2955779802607052,"score_spread":0.269807690197502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394572107","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9007583,0.0055583515,0.07411388,0.0033932182,0.0013626657,0.0010568812,0.0000055173805,0.0010899387,0.012661223],"genre_scores_gemma":[0.99563223,0.00021755068,0.0038539176,0.000044284603,0.000013142781,0.00011319264,0.0000022338381,0.00002634168,0.00009710688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979603,0.00015499613,0.00028888776,0.000683805,0.00036866224,0.0005433131],"domain_scores_gemma":[0.9982427,0.00051463064,0.000039948336,0.0009512672,0.000049841405,0.0002016633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038785455,0.00022268477,0.00025163693,0.0010180989,0.00022749772,0.00033744998,0.0012927447,0.00009985082,0.000004207194],"category_scores_gemma":[0.00010183015,0.00021693982,0.00010677965,0.0029597206,0.00012253318,0.00078977825,0.0007803074,0.0005015193,0.000024772056],"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.000008292129,0.00011475622,0.0031431518,0.000037088965,0.000023696253,0.00015977772,0.0005862193,0.000004140789,0.0023475594,0.9679707,0.00029626308,0.025308339],"study_design_scores_gemma":[0.0006024294,0.00017639904,0.009818464,0.0001035256,0.0000066245852,0.000043106193,0.000028750637,0.009062456,0.0009511772,0.9778981,0.0010426174,0.00026631894],"about_ca_topic_score_codex":0.000027485868,"about_ca_topic_score_gemma":0.00004274963,"teacher_disagreement_score":0.09487391,"about_ca_system_score_codex":0.00010506602,"about_ca_system_score_gemma":0.00007558407,"threshold_uncertainty_score":0.8846549},"labels":[],"label_agreement":null},{"id":"W4396904930","doi":"10.1007/s00493-024-00106-2","title":"List-k-Coloring H-Free Graphs for All $$k>4$$","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.03212748022118933,"score_gpt":0.3144627735592146,"score_spread":0.28233529333802526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396904930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012865114,0.009213098,0.9386625,0.006492839,0.0074607357,0.0015322353,0.000025190067,0.0029663937,0.020781877],"genre_scores_gemma":[0.9762661,0.0001192973,0.020326536,0.00020455242,0.000083190585,0.00034924582,0.0000042436277,0.00005026264,0.0025966128],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981872,0.000056612025,0.00020513583,0.0006101957,0.00036521803,0.0005756571],"domain_scores_gemma":[0.9978741,0.0006347489,0.000029868806,0.0011581073,0.00012334675,0.00017983913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000539255,0.00017638662,0.00018444336,0.0003176239,0.0001766369,0.0003355145,0.0022797657,0.00007380898,0.000012730022],"category_scores_gemma":[0.00024471513,0.00016700948,0.0001719826,0.0012062538,0.00007368049,0.0006138432,0.00073501095,0.00025232753,0.000072080096],"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.000007756401,0.000045656925,0.000026394871,0.000065510845,0.00003121114,0.000038827257,0.00018464429,0.0000040766577,0.0009610311,0.9771241,0.01054513,0.010965657],"study_design_scores_gemma":[0.0003067512,0.00016557095,0.000045947476,0.000026838761,0.0000058488868,0.000009529276,0.000005694858,0.0066413134,0.0016931351,0.80196804,0.1889532,0.00017810105],"about_ca_topic_score_codex":0.0000034658192,"about_ca_topic_score_gemma":0.0000011289716,"teacher_disagreement_score":0.96340096,"about_ca_system_score_codex":0.000118353,"about_ca_system_score_gemma":0.00008060169,"threshold_uncertainty_score":0.6810449},"labels":[],"label_agreement":null},{"id":"W4399544156","doi":"10.1007/s00493-024-00109-z","title":"List-Avoiding Orientations","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.00929819383538542,"score_gpt":0.2415265926093738,"score_spread":0.2322283987739884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399544156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12188036,0.02265543,0.6958832,0.021245997,0.031436168,0.0005979872,0.0000067180113,0.009473409,0.096820705],"genre_scores_gemma":[0.9953323,0.00002835009,0.0032905133,0.00016719883,0.000007884521,0.000012278112,0.0000014262059,0.000007731456,0.0011523459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920136,0.000038262486,0.00013140916,0.0002826092,0.00017201577,0.00017435402],"domain_scores_gemma":[0.9993891,0.00013527271,0.000016122913,0.00032234113,0.00005370924,0.00008346393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022349879,0.00007743936,0.00007200715,0.0001351794,0.00021071952,0.0002965185,0.00035567235,0.000033004013,0.000016381706],"category_scores_gemma":[0.00004848984,0.00006917705,0.000051769053,0.0009852577,0.000021278336,0.0002907586,0.00012529329,0.00015795119,0.0002882508],"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":[1.5258358e-7,0.000022203783,0.000053371197,0.000010509699,0.0000064294063,0.000017296261,0.00035588528,0.0000053160993,0.00060635956,0.98156595,0.01399628,0.0033602165],"study_design_scores_gemma":[0.00012217634,0.00004934382,0.00008441002,0.000047980746,0.0000070048677,0.000016242966,0.000021827636,0.021370713,0.0013598854,0.8942739,0.0824893,0.00015722886],"about_ca_topic_score_codex":0.000011501144,"about_ca_topic_score_gemma":2.3199476e-7,"teacher_disagreement_score":0.8734519,"about_ca_system_score_codex":0.00003190287,"about_ca_system_score_gemma":0.000051544495,"threshold_uncertainty_score":0.37049767},"labels":[],"label_agreement":null},{"id":"W4400543041","doi":"10.1007/s00493-024-00112-4","title":"Unavoidable Flats in Matroids Representable over Prime Fields","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Mathematics; Combinatorics; Prime (order theory); Graphic matroid; Discrete mathematics","score_opus":0.007505440034048896,"score_gpt":0.24720173998075382,"score_spread":0.2396962999467049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400543041","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4207992,0.017207863,0.33149725,0.0057929214,0.012228469,0.0010102086,0.0000040153645,0.0035331897,0.20792687],"genre_scores_gemma":[0.9971579,0.000029787192,0.00082195067,0.00011820444,0.00003652202,0.00002258432,7.0738474e-7,0.000010077475,0.0018023127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988232,0.00007087827,0.00017841836,0.00042343957,0.00019353918,0.00031047544],"domain_scores_gemma":[0.99908024,0.00016105275,0.000020451818,0.0006458752,0.000018753506,0.000073596784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034924515,0.000121526864,0.00014491557,0.00023039283,0.000077912766,0.00028056398,0.0007086271,0.00008106556,0.00007796384],"category_scores_gemma":[0.000024125973,0.00011583299,0.0000915019,0.0014036248,0.00002486773,0.00046225992,0.0003324952,0.00026441432,0.00012263465],"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.00000526607,0.00006904736,0.0013206728,0.000037113237,0.000012998082,0.00010186811,0.00035141586,0.000015234445,0.00042013885,0.98145664,0.009561863,0.0066477596],"study_design_scores_gemma":[0.0003172665,0.00012310481,0.0026619865,0.000116698466,0.000006077099,0.0000148931695,0.0000123669115,0.012468072,0.003396743,0.91024137,0.07037164,0.00026976952],"about_ca_topic_score_codex":0.000050089617,"about_ca_topic_score_gemma":0.0000029420753,"teacher_disagreement_score":0.5763587,"about_ca_system_score_codex":0.00006898443,"about_ca_system_score_gemma":0.000060331266,"threshold_uncertainty_score":0.47235322},"labels":[],"label_agreement":null},{"id":"W4400919119","doi":"10.1007/s00493-024-00114-2","title":"Storage Codes on Coset Graphs with Asymptotically Unit Rate","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Combinatorics; Coset; Unit (ring theory); Discrete mathematics","score_opus":0.015269433132303528,"score_gpt":0.25138211051095577,"score_spread":0.23611267737865224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400919119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03476163,0.0015138848,0.932654,0.006015321,0.0018869464,0.0005576915,0.000058416488,0.008637853,0.013914228],"genre_scores_gemma":[0.986734,0.00006929888,0.012356284,0.000246002,0.0000114145905,0.00003780109,0.000011111771,0.000028011389,0.00050610374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998392,0.000069357724,0.00017330202,0.0006462517,0.0003298505,0.000389277],"domain_scores_gemma":[0.9981587,0.00039775783,0.00004583798,0.0012102359,0.00008282092,0.000104661005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002254321,0.00024503632,0.00022446578,0.0002652457,0.00015091768,0.00031174644,0.00148119,0.00009621045,0.000012794698],"category_scores_gemma":[0.00012442944,0.00018838281,0.000045616223,0.0014010671,0.00018405801,0.0004719301,0.00043482648,0.00044357395,0.00031157065],"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.000009281928,0.00007643701,0.000058399033,0.000023886123,0.000027189633,0.00048567203,0.000051204373,0.00007115149,0.00012640083,0.98303163,0.007331534,0.008707201],"study_design_scores_gemma":[0.00074181805,0.0018865819,0.0014762939,0.0002784194,0.000028623128,0.00008093848,0.000051977793,0.015061689,0.0043379487,0.7807628,0.19440559,0.0008873461],"about_ca_topic_score_codex":0.0000038650796,"about_ca_topic_score_gemma":0.0000017426805,"teacher_disagreement_score":0.95197237,"about_ca_system_score_codex":0.000110050925,"about_ca_system_score_gemma":0.00009087583,"threshold_uncertainty_score":0.7682028},"labels":[],"label_agreement":null},{"id":"W4401333586","doi":"10.1007/s00493-024-00117-z","title":"Pure Pairs. VIII. Excluding a Sparse Graph","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.03483557909027746,"score_gpt":0.2996560542547483,"score_spread":0.2648204751644708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401333586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024303807,0.016707119,0.8966346,0.006610356,0.006873154,0.0008946214,0.0000073844767,0.004766904,0.04320208],"genre_scores_gemma":[0.9954501,0.00011936616,0.0029929054,0.00009041236,0.000055124532,0.000050909464,0.0000012608155,0.000026849837,0.001213074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981006,0.000112239584,0.00018907338,0.000606559,0.0004657335,0.00052581116],"domain_scores_gemma":[0.9985678,0.000279745,0.00002768874,0.0008448127,0.000081995306,0.00019793426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004708731,0.00018104364,0.00017976433,0.0003776663,0.00020617351,0.0003544488,0.0013427119,0.00007458358,0.000040268627],"category_scores_gemma":[0.00009689026,0.00016451493,0.00013692466,0.0023128758,0.000091006325,0.0006695962,0.0005756456,0.0004111581,0.00045410005],"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.00000286772,0.00004754297,0.00008650272,0.000046553407,0.000021197508,0.00034111165,0.00033093596,0.000009481539,0.00046069996,0.9742803,0.0051708915,0.019201925],"study_design_scores_gemma":[0.00018399017,0.00010538143,0.00010091029,0.00007303804,0.0000043918035,0.00005745503,0.000027083539,0.005470961,0.0015830761,0.9117862,0.08035886,0.000248673],"about_ca_topic_score_codex":0.0000022768716,"about_ca_topic_score_gemma":4.9297194e-7,"teacher_disagreement_score":0.9711463,"about_ca_system_score_codex":0.0001037419,"about_ca_system_score_gemma":0.00008565523,"threshold_uncertainty_score":0.67087245},"labels":[],"label_agreement":null},{"id":"W4404145574","doi":"10.1007/s00493-024-00122-2","title":"Any Two-Coloring of the Plane Contains Monochromatic 3-Term Arithmetic Progressions","year":2024,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monochromatic color; Term (time); Arithmetic; Combinatorics; Arithmetic progression; Plane (geometry); Geometry; Physics","score_opus":0.006440745679770104,"score_gpt":0.2143328731498059,"score_spread":0.2078921274700358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404145574","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98755866,0.0034441992,0.00014289755,0.000042593663,0.0025072924,0.00030950812,0.0000072226762,0.0003944073,0.0055932007],"genre_scores_gemma":[0.9996851,0.000015802787,0.000019856621,0.0000038224275,0.00003278207,0.00006312928,0.0000014435802,0.00002600892,0.00015206412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992883,0.000048121496,0.00021944268,0.00011693612,0.00013557826,0.00019160192],"domain_scores_gemma":[0.99949855,0.00010917536,0.000024611345,0.00029885294,0.000015869702,0.00005297322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013782509,0.00012352188,0.00018065628,0.000071849696,0.00007413678,0.00003708392,0.00024261368,0.000049012848,0.000020375723],"category_scores_gemma":[0.000016904038,0.00008621682,0.00009092779,0.00038713656,0.000047227193,0.000060892267,0.000045315024,0.00017887354,0.00002623498],"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.000013019391,0.00022691602,0.010225975,0.0029052706,0.0004899916,0.00013164285,0.004229147,0.0010972734,0.040110186,0.9326683,0.002382821,0.0055194115],"study_design_scores_gemma":[0.006142339,0.0011155069,0.089761026,0.016591681,0.0011322213,0.0007469863,0.0025803535,0.17065321,0.2628156,0.39977303,0.045171633,0.0035164237],"about_ca_topic_score_codex":0.0000036592335,"about_ca_topic_score_gemma":0.0000010589738,"teacher_disagreement_score":0.5328953,"about_ca_system_score_codex":0.000055863376,"about_ca_system_score_gemma":0.000017811126,"threshold_uncertainty_score":0.351582},"labels":[],"label_agreement":null},{"id":"W4408986240","doi":"10.1007/s00493-025-00147-1","title":"Induced Subgraphs of $$K_r$$-Free Graphs and the Erdős–Rogers Problem","year":2025,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011869118175728008,"score_gpt":0.2551920491449339,"score_spread":0.24332293096920588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408986240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9041603,0.011976196,0.000077353034,0.0027660916,0.0029811766,0.002098972,0.000047290898,0.00015529754,0.0757373],"genre_scores_gemma":[0.9971384,0.0010080287,0.0004607383,0.00029019563,0.000018377548,0.000058545917,0.000001963606,0.00004404941,0.0009797039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969077,0.00057961803,0.0009493952,0.0005294578,0.00049104023,0.0005427556],"domain_scores_gemma":[0.9951754,0.0019670248,0.0005275079,0.0019005568,0.00029924806,0.00013024191],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014301352,0.00049201795,0.0010194522,0.00040542247,0.0006959332,0.0000891596,0.0014042554,0.00040670697,0.000043473883],"category_scores_gemma":[0.0009340817,0.00033291025,0.00044293728,0.0015476084,0.0013822238,0.000102785205,0.0011526146,0.00072999805,0.000002108766],"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.000266835,0.00022323076,0.0023456798,0.0009187347,0.0006345569,0.000005417296,0.0032394843,2.736722e-7,0.00011983421,0.9825838,0.0075886906,0.0020734644],"study_design_scores_gemma":[0.005679238,0.00015290643,0.0016556621,0.00033394495,0.0005722373,0.0000070791525,0.0006621997,0.000051784053,0.0011947475,0.98769814,0.001675017,0.00031705797],"about_ca_topic_score_codex":0.00008814402,"about_ca_topic_score_gemma":0.0000071229583,"teacher_disagreement_score":0.092978075,"about_ca_system_score_codex":0.00005077419,"about_ca_system_score_gemma":0.00014046012,"threshold_uncertainty_score":0.9999123},"labels":[],"label_agreement":null},{"id":"W4408986355","doi":"10.1007/s00493-025-00141-7","title":"Improved Integrality Gap in Max–Min Allocation, or, Topology at the North Pole","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Distributed and Parallel Computing Systems","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":"University of Waterloo","funders":"Freie Universität Berlin","keywords":"Mathematics; Combinatorics; Topology (electrical circuits); Discrete mathematics","score_opus":0.018865894879261894,"score_gpt":0.2707360994386738,"score_spread":0.25187020455941195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408986355","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5238987,0.0019294025,0.39027727,0.035414018,0.009730894,0.001522694,0.000018010915,0.00077300187,0.036435977],"genre_scores_gemma":[0.99227595,0.000009153079,0.00017411257,0.000561611,0.000019486428,0.0000333607,0.000011067013,0.000004152575,0.0069110966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860656,0.00022883093,0.00033573227,0.00038083605,0.00012948061,0.00031855292],"domain_scores_gemma":[0.99866545,0.00024435032,0.000100138386,0.00083566265,0.00010422104,0.000050204795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040256494,0.0001435341,0.00021584803,0.00008744094,0.00020260742,0.000095589035,0.001342919,0.00007762716,0.000013422024],"category_scores_gemma":[0.00013036434,0.000096606236,0.000055279288,0.0011613715,0.000060142997,0.00008718944,0.00057152007,0.00020228053,0.00004084765],"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.000041906915,0.0003589941,0.06825639,0.00006820173,0.000047212932,0.00002408958,0.0012276769,0.00012702793,0.00010797916,0.8700029,0.049382888,0.010354685],"study_design_scores_gemma":[0.0041310997,0.0005240308,0.25241384,0.00019666171,0.000032212127,0.00006311913,0.00033295597,0.09874775,0.0012156747,0.107895054,0.53330773,0.0011398373],"about_ca_topic_score_codex":0.0006285982,"about_ca_topic_score_gemma":0.0006826031,"teacher_disagreement_score":0.7621079,"about_ca_system_score_codex":0.00024072739,"about_ca_system_score_gemma":0.0001890344,"threshold_uncertainty_score":0.3939488},"labels":[],"label_agreement":null},{"id":"W4412016901","doi":"10.1007/s00493-025-00160-4","title":"Signed graphs with the same even cycles","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011003287367122902,"score_gpt":0.27149403176875814,"score_spread":0.2604907444016352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412016901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06441971,0.0025040435,0.84187084,0.033867057,0.00093529024,0.0011788105,0.0000027943818,0.00094781833,0.054273628],"genre_scores_gemma":[0.9954188,0.000015564676,0.0018061008,0.0005089868,0.000005911789,0.000059717757,4.646025e-7,0.000008155645,0.002176314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874765,0.00015693478,0.000107552754,0.00033577412,0.00031578244,0.00033628356],"domain_scores_gemma":[0.99834836,0.00044019727,0.000042410862,0.0009829934,0.00012090695,0.0000651517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030821827,0.00012699088,0.00013933485,0.00015718964,0.0003396832,0.000119260745,0.0018885826,0.000037407375,0.0000064316023],"category_scores_gemma":[0.000056116765,0.00007789085,0.000054077107,0.001880761,0.00017989647,0.00022959855,0.0004256339,0.00022252982,0.000031324817],"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.0000138325895,0.000052999316,0.0005571883,0.0000066558514,0.000023757735,0.000009619298,0.00014908201,0.000012312008,0.00023177601,0.98735374,0.0030321416,0.008556909],"study_design_scores_gemma":[0.00046240786,0.00013118773,0.0034150686,0.000020233609,0.000005737401,0.0000036426059,0.00005953039,0.00060036907,0.0017336827,0.9795466,0.013881787,0.00013974053],"about_ca_topic_score_codex":0.000007900445,"about_ca_topic_score_gemma":0.0000029211462,"teacher_disagreement_score":0.9309991,"about_ca_system_score_codex":0.000047669193,"about_ca_system_score_gemma":0.000095030504,"threshold_uncertainty_score":0.35094878},"labels":[],"label_agreement":null},{"id":"W4412597347","doi":"10.1007/s00493-025-00167-x","title":"An Approximate Counting Version of the Multidimensional Szemerédi Theorem","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.011591249925362566,"score_gpt":0.27813665399151827,"score_spread":0.2665454040661557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412597347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9785675,0.0001310487,0.00055729004,0.0001229724,0.0013218884,0.00022982205,0.0000068966756,0.00006441079,0.018998172],"genre_scores_gemma":[0.9982033,0.000005797528,0.0013565922,0.00009722237,0.000014356382,0.000004401407,0.0000014107645,0.000011246661,0.0003056702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990855,0.0001343469,0.00022503658,0.00016633517,0.00023284576,0.00015595996],"domain_scores_gemma":[0.9988025,0.00033758878,0.00013149875,0.00058184814,0.000119530516,0.000027072663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042732776,0.000114185816,0.00018158343,0.00005662093,0.00036419294,0.000009068265,0.0003931045,0.0000778053,0.00003802121],"category_scores_gemma":[0.00024615024,0.00007143235,0.00010096309,0.0002862064,0.0001439005,0.000055476357,0.00024403169,0.00015615553,0.000001132574],"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.00002226513,0.00011298208,0.00276383,0.0000675934,0.00002627967,4.7721284e-7,0.0002827845,0.0000030338551,0.0014604856,0.99313545,0.0016687305,0.00045607373],"study_design_scores_gemma":[0.00046561216,0.000026281376,0.0028331485,0.00007101063,0.000039701194,0.0000011791841,0.00014072873,0.0007986438,0.011141273,0.98227715,0.002118347,0.00008689164],"about_ca_topic_score_codex":0.0000057344905,"about_ca_topic_score_gemma":3.355286e-7,"teacher_disagreement_score":0.019635802,"about_ca_system_score_codex":0.000033249897,"about_ca_system_score_gemma":0.000033525936,"threshold_uncertainty_score":0.29129267},"labels":[],"label_agreement":null},{"id":"W4414537095","doi":"10.1007/s00493-025-00179-7","title":"Extension Property for Partial Automorphisms of the n-partite and Semigeneric Tournaments","year":2025,"lang":"lv","type":"article","venue":"COMBINATORICA","topic":"Advanced Topology and Set Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Agence Nationale de la Recherche; Technische Universität Dresden; Deutsche Forschungsgemeinschaft; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Tournament; Automorphism; Extension (predicate logic); Property (philosophy); Class (philosophy); Finite set","score_opus":0.026292804331246918,"score_gpt":0.30218853299806464,"score_spread":0.2758957286668177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414537095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9387904,0.009600169,0.025477203,0.008853339,0.009337234,0.0038879516,0.00008503391,0.00014179536,0.0038269018],"genre_scores_gemma":[0.9841387,0.00021440026,0.0010204936,0.00029745887,0.000037002366,0.00006550409,0.0000021631909,0.000022241922,0.014201983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998617,0.00018469268,0.00045004065,0.00030527983,0.00013835145,0.00030465578],"domain_scores_gemma":[0.99848896,0.00044908444,0.00028334913,0.00055774226,0.00016113666,0.000059698967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038219034,0.00020720535,0.00043413282,0.000053648604,0.0003828203,0.0000149051,0.00027751343,0.00020120823,0.000028931756],"category_scores_gemma":[0.00065644825,0.00012236643,0.00013549124,0.00025996842,0.00035217562,0.00006214035,0.0002851699,0.00021735947,0.000004143388],"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.00036083933,0.0010790261,0.0023937467,0.0009806063,0.0002902514,0.0000065320073,0.0010600374,0.000023146498,0.010544864,0.94520843,0.025629753,0.012422752],"study_design_scores_gemma":[0.0019601795,0.00027139767,0.0007105933,0.00044457006,0.00035649806,0.000007990945,0.00014336592,0.0026584093,0.04084141,0.90597844,0.046425782,0.00020138611],"about_ca_topic_score_codex":0.000004426815,"about_ca_topic_score_gemma":0.0000011479106,"teacher_disagreement_score":0.04534838,"about_ca_system_score_codex":0.00007532011,"about_ca_system_score_gemma":0.00012119952,"threshold_uncertainty_score":0.4989958},"labels":[],"label_agreement":null},{"id":"W4414756345","doi":"10.1007/s00493-025-00181-z","title":"Average plane-size in complex-representable matroids","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Matroid; Bounded function; Constant (computer programming); Rank (graph theory); Integer (computer science); Upper and lower bounds","score_opus":0.012517289125328734,"score_gpt":0.2742975333598036,"score_spread":0.2617802442344749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414756345","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008517922,0.00061954826,0.4391166,0.0036433404,0.00072026515,0.00045608432,0.0000035526693,0.0020378279,0.54488486],"genre_scores_gemma":[0.97279525,0.000010335887,0.022711445,0.000531069,0.000006223899,0.000033462715,0.000002512945,0.000008135183,0.0039015512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877995,0.000042520907,0.00024793475,0.00040284332,0.00020170289,0.00032507154],"domain_scores_gemma":[0.9989509,0.00016751156,0.000053159354,0.0007110536,0.00006173896,0.000055623397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001868537,0.00014434085,0.00021567766,0.00018643033,0.0000769658,0.00041668513,0.0014736839,0.00005701364,0.000014485908],"category_scores_gemma":[0.00014902408,0.00015074239,0.00004117922,0.0010951789,0.000048500606,0.0007119845,0.0008162133,0.00017308258,0.000046330504],"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.000012901788,0.00063286076,0.011872954,0.000108738845,0.000018418179,0.00016192188,0.00020085985,0.000017019924,0.0022049295,0.84051156,0.11711853,0.027139278],"study_design_scores_gemma":[0.00089564134,0.00007693118,0.011770632,0.00010688997,0.0000033029028,0.000014732253,0.00001107948,0.009878316,0.016234318,0.8986458,0.061981287,0.0003810515],"about_ca_topic_score_codex":0.000052298736,"about_ca_topic_score_gemma":0.0000019762522,"teacher_disagreement_score":0.9642773,"about_ca_system_score_codex":0.0001344907,"about_ca_system_score_gemma":0.00008598416,"threshold_uncertainty_score":0.6147096},"labels":[],"label_agreement":null},{"id":"W4415991362","doi":"10.1007/s00493-025-00168-w","title":"The Grid-Minor Theorem Revisited","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds De La Recherche Scientifique - FNRS; Monash University; Australian Government","keywords":"Treewidth; Graph minor; Planar graph; Graph; Upper and lower bounds; Existential quantification; Perfect graph; Chromatic scale","score_opus":0.010468888549975325,"score_gpt":0.2878532767963204,"score_spread":0.27738438824634504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415991362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005317782,0.01411946,0.6239169,0.023101695,0.005714917,0.0013810025,0.0000045974766,0.001348232,0.32509542],"genre_scores_gemma":[0.9835037,0.00029125976,0.0017975915,0.0006313628,0.000048069505,0.00007653277,0.0000014033735,0.000013163493,0.013636923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861354,0.00021149439,0.00017939114,0.00033092796,0.00027582652,0.00038881335],"domain_scores_gemma":[0.99755824,0.0008584302,0.000048436825,0.0012969762,0.00016417685,0.000073721596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069074926,0.00011692469,0.00013095737,0.000118429685,0.0006060545,0.00022082828,0.0023743948,0.00004357885,0.0000065824233],"category_scores_gemma":[0.00038428677,0.000078037025,0.00007498489,0.001712898,0.00015540808,0.00019519373,0.0007304289,0.00025131414,0.000096594085],"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.000007258304,0.000027172795,0.00021225266,0.0000062401796,0.000012632544,0.000005841394,0.000033117434,0.0000011214892,0.000073509014,0.95377815,0.010366332,0.03547638],"study_design_scores_gemma":[0.00021431017,0.000032933945,0.0007906109,0.00001557251,0.000002317814,0.000001934034,0.000012609122,0.00092737464,0.0010455792,0.78750205,0.20937139,0.00008333593],"about_ca_topic_score_codex":0.0000015493955,"about_ca_topic_score_gemma":3.0001823e-7,"teacher_disagreement_score":0.9781859,"about_ca_system_score_codex":0.000076268465,"about_ca_system_score_gemma":0.000079726815,"threshold_uncertainty_score":0.46613425},"labels":[],"label_agreement":null},{"id":"W4415991870","doi":"10.1007/s00493-025-00186-8","title":"Sunflowers in Set Systems with Small VC-Dimension","year":2025,"lang":"en","type":"article","venue":"COMBINATORICA","topic":"Fuzzy and Soft Set Theory","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Illinois at Urbana-Champaign; American Institute of Mathematics; National Science Foundation","keywords":"Family of sets; Set (abstract data type); Function (biology); Conjecture; Generating function","score_opus":0.06503684596531571,"score_gpt":0.3303971572465832,"score_spread":0.26536031128126747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415991870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93818873,0.0009855584,0.00069495116,0.00076180045,0.0021885773,0.00032818315,0.000003957323,0.00008707422,0.056761194],"genre_scores_gemma":[0.9928907,0.000009831027,0.0000577507,0.00020276368,0.000010199665,0.000017704087,0.0000019471845,0.000007808849,0.00680125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800384,0.00030005063,0.00041375344,0.00044059206,0.0005698129,0.00027193237],"domain_scores_gemma":[0.997532,0.0014225559,0.00009433802,0.00068408775,0.00018268444,0.000084309846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018514057,0.00013968661,0.00032541715,0.00041436998,0.0001215843,0.00014558442,0.00064537383,0.00010255441,0.000032817017],"category_scores_gemma":[0.0008730888,0.000095639334,0.00005040174,0.0017742071,0.000085656065,0.000118384414,0.00014339824,0.00020539184,0.00019632993],"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.0004402709,0.00043785563,0.077582166,0.000058266793,0.000046209036,0.0002758121,0.0016817829,0.001243982,0.00022647496,0.85470265,0.05630256,0.007001946],"study_design_scores_gemma":[0.005473795,0.00061819213,0.040454548,0.0005727357,0.000040045183,0.00002627711,0.0057827635,0.0037417244,0.00085919036,0.6792784,0.26226228,0.00089008553],"about_ca_topic_score_codex":0.00007086046,"about_ca_topic_score_gemma":0.000022098375,"teacher_disagreement_score":0.20595974,"about_ca_system_score_codex":0.00011053267,"about_ca_system_score_gemma":0.00012376324,"threshold_uncertainty_score":0.3900059},"labels":[],"label_agreement":null}]}