{"meta":{"query_hash":"4056339ef553","filters":{"venue":"Graphs and Combinatorics"},"cohort_total":139,"direct_labels_cover":0,"predictions_cover":139,"exported":139,"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/4056339ef553","api":"https://metacan.xera.ac/api/v1/cohort?venue=Graphs+and+Combinatorics"},"results":[{"id":"W1494111593","doi":"10.1007/s00373-016-1700-4","title":"A Tight Upper Bound on Acquaintance Time of Graphs","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"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 British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Conjecture; Upper and lower bounds; Multiplicative function; Vertex (graph theory); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.013483029321444037,"score_gpt":0.24491935892343747,"score_spread":0.23143632960199342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1494111593","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.99266064,0.00036241257,0.000108936554,0.00014024579,0.0003738507,0.00015257136,0.000022151846,0.00006524409,0.006113932],"genre_scores_gemma":[0.9982413,0.00027463285,0.00016031545,0.00010302414,0.000010164787,0.000008897402,7.590028e-7,0.000025204065,0.0011756696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887687,0.00006064202,0.0002791343,0.00025831425,0.0002704342,0.00025460604],"domain_scores_gemma":[0.9987611,0.00046476533,0.00014752902,0.00044443188,0.000086757114,0.0000954158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025842863,0.000201398,0.00031406418,0.00016742876,0.00018490024,0.000016864473,0.0002183298,0.00012413727,0.00009835814],"category_scores_gemma":[0.000103550025,0.00012068012,0.00014382557,0.00027635216,0.00025648758,0.00007416007,0.00008085969,0.0001019592,0.0000063152133],"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.00004237848,0.000095560215,0.0031734619,0.000042340085,0.0000514941,0.0000039240786,0.00027289084,2.1244782e-8,0.0006462942,0.9920178,0.0017823491,0.001871509],"study_design_scores_gemma":[0.0007243805,0.00023271154,0.0026314184,0.00009638194,0.000031413765,0.0000073908977,0.000025656604,0.0000048307757,0.0022625795,0.99237823,0.0014113723,0.0001936499],"about_ca_topic_score_codex":0.0000021241246,"about_ca_topic_score_gemma":4.393981e-7,"teacher_disagreement_score":0.0055806777,"about_ca_system_score_codex":0.000014852176,"about_ca_system_score_gemma":0.0000130980925,"threshold_uncertainty_score":0.49211925},"labels":[],"label_agreement":null},{"id":"W1641711201","doi":"10.1007/s00373-009-0864-6","title":"Upper Bounds for α-Domination Parameters","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","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":"Acadia University","funders":"","keywords":"Domination analysis; Mathematics; Upper and lower bounds; Combinatorics; Vertex (graph theory); Probabilistic logic; Graph; Discrete mathematics; Tuple; Statistics","score_opus":0.016888497846105178,"score_gpt":0.27610609123442076,"score_spread":0.25921759338831557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641711201","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.3206825,0.000946585,0.6728063,0.002179021,0.0006191878,0.00061758416,0.000004121816,0.00025624826,0.0018883973],"genre_scores_gemma":[0.9860876,0.00009171995,0.013301927,0.00027156962,0.0000046833024,0.000027108157,0.0000022817503,0.0000055558203,0.0002075081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909073,0.000031203428,0.00012223737,0.00028310154,0.0001931128,0.000279634],"domain_scores_gemma":[0.99930197,0.000141003,0.000042461263,0.0003052273,0.00011109177,0.00009827289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031081415,0.000104219034,0.00011927903,0.00018384487,0.00021704304,0.00015271138,0.0003764796,0.00005119657,6.8415363e-7],"category_scores_gemma":[0.000055065724,0.00009754814,0.00006777475,0.0005464349,0.00005393146,0.00036935936,0.000050539147,0.00009135258,0.0000017170943],"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.000009577645,0.000047205827,0.00030238277,0.0000050097174,0.0000045388033,0.0000013576034,0.00009783567,0.0000026274613,0.000117184085,0.9511779,0.00024396247,0.047990438],"study_design_scores_gemma":[0.000548752,0.00037361452,0.0027115308,0.0000049603714,0.0000031893208,0.000005049702,0.000018192322,0.003979088,0.0007916376,0.9893035,0.0021299561,0.00013051153],"about_ca_topic_score_codex":0.0000011699346,"about_ca_topic_score_gemma":2.2263272e-7,"teacher_disagreement_score":0.66540515,"about_ca_system_score_codex":0.000019820633,"about_ca_system_score_gemma":0.000017909613,"threshold_uncertainty_score":0.39778975},"labels":[],"label_agreement":null},{"id":"W1654746924","doi":"10.1007/s003730200005","title":"Enumerating Foldings and Unfoldings Between Polygons and Polytopes","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","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":"University of Waterloo","funders":"","keywords":"Polytope; Combinatorics; Polygon (computer graphics); Mathematics; Enumeration; Polytope model; Rectilinear polygon; Discrete mathematics; Regular polygon; Computer science; Geometry; Simple polygon","score_opus":0.015730337163467695,"score_gpt":0.19786159864013,"score_spread":0.1821312614766623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1654746924","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.97821075,0.0048514423,0.015212025,0.00096721214,0.00015960397,0.00008077145,0.0000020392968,0.0000778064,0.00043837327],"genre_scores_gemma":[0.9966072,0.00056479475,0.0025332686,0.00013791594,0.000023300863,0.0000038397948,0.0000015311033,0.000004843135,0.00012332524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992547,0.000022175036,0.00014179674,0.00027599186,0.00014133217,0.00016398465],"domain_scores_gemma":[0.99956805,0.000109475295,0.00005370209,0.00010612855,0.000042518997,0.00012010021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014331288,0.00011375828,0.00013047666,0.00014292954,0.00033639785,0.0002807178,0.00010885421,0.000049190377,0.000003096883],"category_scores_gemma":[0.000022322058,0.000112502334,0.000019848694,0.00042666087,0.000040746945,0.00036464288,0.00014746541,0.00008692371,0.0000010804661],"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":[6.4418225e-7,0.000023476669,0.0224482,0.00001847515,0.000018029841,0.0000033637236,0.0008304312,0.0000027611673,0.00032764513,0.8660505,0.00044976117,0.109826714],"study_design_scores_gemma":[0.0019928403,0.0006451163,0.13292411,0.00007740567,0.00007314981,0.00016266089,0.00020514529,0.094256386,0.0027261067,0.75363994,0.012210088,0.00108706],"about_ca_topic_score_codex":0.000015786181,"about_ca_topic_score_gemma":6.7638535e-7,"teacher_disagreement_score":0.11241057,"about_ca_system_score_codex":0.0000062962163,"about_ca_system_score_gemma":0.000005528509,"threshold_uncertainty_score":0.4587712},"labels":[],"label_agreement":null},{"id":"W1855352450","doi":"10.1007/s00373-015-1623-5","title":"Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Stars; Mathematics; Graph; Complete graph; Computer science","score_opus":0.015044310037013401,"score_gpt":0.18577438856827067,"score_spread":0.17073007853125727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1855352450","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.99434316,0.00084598194,0.003448541,0.00014217955,0.0002924078,0.00043443788,0.000029758967,0.00005177884,0.0004117254],"genre_scores_gemma":[0.999744,0.000047451886,0.00009117282,0.000029345978,0.000008836555,0.000035405184,0.0000014743069,0.000019756393,0.000022556113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999387,0.000018370849,0.00013201409,0.00013212634,0.00013766637,0.00019280546],"domain_scores_gemma":[0.999415,0.00019148503,0.000054638054,0.00018028302,0.0000740433,0.000084565945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002560923,0.00014923252,0.00019958825,0.00005988895,0.00014970022,0.000055957295,0.00012592222,0.00003156289,4.99959e-7],"category_scores_gemma":[0.00001059722,0.00007968477,0.000028957858,0.00033558722,0.0002053444,0.00006120954,0.000027666401,0.00010076117,1.4996523e-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.00018790911,0.000010892841,0.027519844,0.0001873417,0.00026116197,0.0000024976437,0.0065257796,0.00047073854,0.000091684524,0.96237487,0.0006525172,0.0017147888],"study_design_scores_gemma":[0.0099602975,0.004693238,0.022761274,0.00073623355,0.00065909215,0.0005015958,0.1318135,0.0055784774,0.0061861887,0.78923213,0.02608137,0.0017965977],"about_ca_topic_score_codex":0.000055018314,"about_ca_topic_score_gemma":0.000048690414,"teacher_disagreement_score":0.1731427,"about_ca_system_score_codex":0.00000969022,"about_ca_system_score_gemma":0.000010557895,"threshold_uncertainty_score":0.32494506},"labels":[],"label_agreement":null},{"id":"W1963702185","doi":"10.1007/s00373-004-0571-2","title":"Random Hypergraph Processes with Degree Restrictions","year":2004,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","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 Waterloo","funders":"","keywords":"Hypergraph; Mathematics; Combinatorics; Tuple; Degree (music); Equivalence (formal languages); Infinity; Discrete mathematics","score_opus":0.029094748128303937,"score_gpt":0.24837416858877107,"score_spread":0.21927942046046714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963702185","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.9886135,0.0012525616,0.0015696822,0.00014223794,0.000268055,0.00026669534,0.0000069914963,0.00019792575,0.0076823374],"genre_scores_gemma":[0.99710774,0.0008602295,0.001785655,0.00005905182,0.000016122021,0.00003226662,0.0000018197419,0.00002541931,0.00011170058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990769,0.000024372344,0.0001872854,0.00024112363,0.00022988117,0.00024042852],"domain_scores_gemma":[0.9991217,0.0002505751,0.00008604764,0.00028254135,0.00014939607,0.00010968777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012491959,0.00019454365,0.00023566127,0.00016884807,0.0005523287,0.00005055975,0.00015428534,0.000091775895,0.0000053663443],"category_scores_gemma":[0.00015095218,0.00013335986,0.000058863126,0.00084970886,0.00017281127,0.00010960666,0.000050834962,0.00017763078,6.545813e-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.00006263428,0.00010936757,0.004587818,0.00012038053,0.000056574692,0.000013814776,0.00044001636,0.000004235875,0.000006205922,0.9941353,0.00016785329,0.00029576576],"study_design_scores_gemma":[0.0026979204,0.0002104434,0.0023477708,0.00005708908,0.00008377531,0.00007147575,0.00020689609,9.933212e-7,0.00018021173,0.9932921,0.00063937093,0.00021194188],"about_ca_topic_score_codex":0.000024517638,"about_ca_topic_score_gemma":0.00004003329,"teacher_disagreement_score":0.008494222,"about_ca_system_score_codex":0.000014342592,"about_ca_system_score_gemma":0.000073345196,"threshold_uncertainty_score":0.54382575},"labels":[],"label_agreement":null},{"id":"W1964336276","doi":"10.1007/s00373-007-0712-5","title":"On the Density of Trigraph Homomorphisms","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Order (exchange); Graph homomorphism; Combinatorics; Algebra homomorphism; Discrete mathematics; Graph; Line graph; Voltage graph","score_opus":0.016357687131862527,"score_gpt":0.24953558173241772,"score_spread":0.23317789460055519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964336276","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.9171781,0.00026859183,0.07896759,0.00028963736,0.0002457078,0.00017485836,0.0000013168062,0.0000622272,0.0028119877],"genre_scores_gemma":[0.9992893,0.0000828029,0.00041436424,0.00013936772,0.0000028155853,0.000003357193,2.6785094e-7,0.0000052238224,0.00006254168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989147,0.00006356544,0.00016559185,0.00022469726,0.00036142522,0.00026999685],"domain_scores_gemma":[0.99847233,0.00067775167,0.00007422094,0.00055963633,0.00012273173,0.00009332658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123493,0.00010492342,0.0001377329,0.00020639821,0.00020273164,0.000033430184,0.0006270194,0.000048837406,0.0000029929433],"category_scores_gemma":[0.00007775206,0.00007080913,0.00007324522,0.0012309382,0.00022134985,0.000100530844,0.00016135025,0.00020652199,0.0000029631642],"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.000016240645,0.000069935864,0.0031724127,0.000004729579,0.000009600159,0.000011229904,0.00009413532,6.873304e-7,0.00018352117,0.99273086,0.00014208755,0.0035645433],"study_design_scores_gemma":[0.00025064903,0.00020086674,0.014104729,0.000007739112,0.0000025405568,0.0000077581,0.00003804533,0.00012287364,0.0064084837,0.97857666,0.00019413266,0.00008549514],"about_ca_topic_score_codex":0.0000070678266,"about_ca_topic_score_gemma":0.0000021108724,"teacher_disagreement_score":0.08211118,"about_ca_system_score_codex":0.000009419397,"about_ca_system_score_gemma":0.000015642232,"threshold_uncertainty_score":0.28875127},"labels":[],"label_agreement":null},{"id":"W1966205566","doi":"10.1007/s00373-011-1072-8","title":"On Cartesian Product of Factor-Critical Graphs","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Thompson Rivers University","funders":"","keywords":"Cartesian product; Mathematics; Combinatorics; Factor graph; Graph; Discrete mathematics; Factor (programming language); Product (mathematics); Cartesian coordinate system; Computer science; Geometry; Algorithm","score_opus":0.03510544318309315,"score_gpt":0.27590548118175523,"score_spread":0.24080003799866206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966205566","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.96022344,0.0014837201,0.022400683,0.0002754705,0.0011691198,0.0004934965,0.00001532805,0.00030677047,0.013631993],"genre_scores_gemma":[0.9981859,0.00007463144,0.0016302316,0.000040300274,0.0000031747877,0.000012024472,4.8602294e-7,0.000010988843,0.000042310232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855196,0.00009156753,0.0002017288,0.00042794982,0.00036860752,0.00035818224],"domain_scores_gemma":[0.998731,0.00018600904,0.00005094677,0.0006786894,0.00017139126,0.00018193884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022271706,0.00016024859,0.00021245368,0.0002999182,0.00013222493,0.00003267712,0.0006380583,0.000054635802,0.0000119028],"category_scores_gemma":[0.00012936648,0.00014028075,0.0000829841,0.0009305827,0.00028758953,0.00026732803,0.00017537862,0.00022427586,0.0000050123554],"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.000013944631,0.0001907055,0.0048883893,0.00002773876,0.000011459075,0.000013485859,0.00047305028,1.2965083e-7,0.00017357912,0.98924416,0.00005095135,0.004912378],"study_design_scores_gemma":[0.00023607549,0.000504656,0.012835184,0.000016305208,0.000003815743,0.000008287766,0.000027996703,0.000074795535,0.0058634398,0.9801971,0.00007396532,0.00015842539],"about_ca_topic_score_codex":0.0000146166085,"about_ca_topic_score_gemma":0.0000010566932,"teacher_disagreement_score":0.037962433,"about_ca_system_score_codex":0.000009751036,"about_ca_system_score_gemma":0.000029983743,"threshold_uncertainty_score":0.5720483},"labels":[],"label_agreement":null},{"id":"W1967042891","doi":"10.1007/s00373-009-0844-x","title":"Small Cycle Double Covers of Products II: Categorical and Strong Products with Paths and Cycles","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","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 Calgary; Dalhousie University","funders":"","keywords":"Categorical variable; Cartesian product; Product (mathematics); Mathematics; Combinatorics; Statistics; Geometry","score_opus":0.02579601507518095,"score_gpt":0.23950222730206627,"score_spread":0.21370621222688532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967042891","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.9969973,0.0014026343,0.000027019256,0.0002575252,0.00011323787,0.00031252974,0.0000049806063,0.000044434462,0.00084032264],"genre_scores_gemma":[0.9985837,0.00039853557,0.0008650513,0.000028597075,0.00001730736,0.0000051051125,0.000002390984,0.00001631533,0.000083046514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989438,0.000030571082,0.00021985952,0.0003655153,0.00019158468,0.00024864342],"domain_scores_gemma":[0.9992678,0.0000656215,0.00013193216,0.00029760323,0.00013531002,0.00010173935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021343,0.00021536357,0.00033287902,0.00010052709,0.00030110363,0.00003755344,0.000101029684,0.00009021595,0.0000011282738],"category_scores_gemma":[0.00005110426,0.00015647673,0.00002342025,0.0003154452,0.00022933693,0.00010341518,0.0000959687,0.00016768406,4.114754e-8],"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.000117451134,0.00015496039,0.005843508,0.00017103755,0.000039363378,0.000008048044,0.0012056552,9.886847e-7,0.00020670544,0.99037534,0.000116027,0.001760906],"study_design_scores_gemma":[0.0015180891,0.0007808623,0.013389026,0.000032534528,0.00009056667,0.000053799882,0.00025686488,0.000018735383,0.0023427857,0.9810446,0.00022152472,0.00025062912],"about_ca_topic_score_codex":0.000016893771,"about_ca_topic_score_gemma":0.0000030949066,"teacher_disagreement_score":0.009330768,"about_ca_system_score_codex":0.000008842504,"about_ca_system_score_gemma":0.000027045737,"threshold_uncertainty_score":0.6380936},"labels":[],"label_agreement":null},{"id":"W1967648182","doi":"10.1007/s00373-007-0714-3","title":"Efficient Many-To-Many Point Matching in One Dimension","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Complexity and Algorithms in Graphs","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":"Centre for Interdisciplinary Research in Music Media and Technology; Queen's University; McGill University","funders":"","keywords":"Combinatorics; Mathematics; Cardinality (data modeling); Matching (statistics); Dimension (graph theory); Point (geometry); Context (archaeology); 3-dimensional matching; Line (geometry); Discrete mathematics; Bipartite graph; Computer science; Graph; Statistics; Geometry","score_opus":0.016632490546493427,"score_gpt":0.23473731553534669,"score_spread":0.21810482498885325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967648182","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.7661599,0.00028878637,0.23132433,0.00039953162,0.0006557421,0.00017934313,8.584591e-7,0.00011878796,0.00087273226],"genre_scores_gemma":[0.9881368,0.000030377278,0.011407421,0.00036981588,0.000011183078,0.000005507332,7.9658884e-7,0.000009365631,0.000028695189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983622,0.000034583358,0.00031131375,0.00045129037,0.0003725619,0.00046806346],"domain_scores_gemma":[0.9991237,0.00011847326,0.000060959646,0.00043154272,0.0000581801,0.00020713442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009005281,0.00017403626,0.00021863356,0.00049368525,0.00021172753,0.00011883937,0.0004670429,0.00007085166,0.0000029740252],"category_scores_gemma":[0.000015973052,0.00017660149,0.00006479136,0.0014285747,0.000043569507,0.000095969415,0.00048727202,0.00025008555,0.000011120002],"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.000007791783,0.00026282118,0.0012321823,0.000014917999,0.000005907622,0.00004761445,0.001324395,0.000121444486,0.00024910114,0.98426133,0.000038031583,0.012434454],"study_design_scores_gemma":[0.00089056476,0.0002535107,0.07293924,0.00011233827,0.0000061938813,0.000028013672,0.00024369097,0.029556341,0.00073119847,0.89427286,0.0005022944,0.00046373773],"about_ca_topic_score_codex":0.000100079575,"about_ca_topic_score_gemma":0.000016770511,"teacher_disagreement_score":0.22197695,"about_ca_system_score_codex":0.000046766894,"about_ca_system_score_gemma":0.000015235338,"threshold_uncertainty_score":0.72016},"labels":[],"label_agreement":null},{"id":"W1969647805","doi":"10.1007/s00373-002-0506-8","title":"Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index","year":2003,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Block (permutation group theory); Chromatic scale; Steiner system; Block size; Discrete mathematics; Arithmetic; Computer science; Key (lock)","score_opus":0.00509165638525723,"score_gpt":0.17323249390673115,"score_spread":0.1681408375214739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969647805","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.9849229,0.0074685547,0.000053748736,0.000009755168,0.00092646055,0.00035231147,0.0000031484133,0.00006661288,0.006196515],"genre_scores_gemma":[0.9993268,0.00037032753,0.0000043157816,0.000007612447,0.000010746913,0.000035610843,5.247447e-7,0.000018544826,0.00022551655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915457,0.00010967067,0.00029121412,0.0001186104,0.00014916732,0.00017678225],"domain_scores_gemma":[0.99953765,0.000096232434,0.00006406005,0.0002050158,0.00003468693,0.00006234318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004735019,0.00015365714,0.00034680645,0.00009926709,0.00009877554,0.0000481586,0.00009168463,0.00008564107,0.000005516204],"category_scores_gemma":[0.000023949695,0.000106832325,0.00006728841,0.0003203854,0.00013320967,0.000052985895,0.000015710479,0.00011395049,0.0000010718371],"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.000018998562,0.000023320099,0.005125109,0.00029437107,0.00008721838,0.0000021142762,0.0005466137,0.00006785994,0.00014255021,0.99339515,0.00024717257,0.000049516777],"study_design_scores_gemma":[0.026562719,0.00038811244,0.019405205,0.000574118,0.00043419085,0.00032783777,0.0053363084,0.015372293,0.002882383,0.88864255,0.038576357,0.0014979484],"about_ca_topic_score_codex":0.00002373068,"about_ca_topic_score_gemma":0.0000013586574,"teacher_disagreement_score":0.10475263,"about_ca_system_score_codex":0.0000089740015,"about_ca_system_score_gemma":0.0000065850804,"threshold_uncertainty_score":0.43564957},"labels":[],"label_agreement":null},{"id":"W1969741579","doi":"10.1007/s003730170022","title":"Solution of a Conjecture of Volkmann on the Number of Vertices in Longest Paths and Cycles of Strong Semicomplete Multipartite Digraphs","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"University of Victoria","funders":"","keywords":"Multipartite; Digraph; Combinatorics; Mathematics; Conjecture; Graph; Discrete mathematics; Physics","score_opus":0.023888732718980208,"score_gpt":0.27729175245013604,"score_spread":0.2534030197311558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969741579","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.9974789,0.000738719,0.0012851364,0.00008102373,0.000043406173,0.00016255959,0.000010332566,0.000008243927,0.00019169759],"genre_scores_gemma":[0.99920696,0.00053423183,0.00023309982,0.000007339274,0.0000014455386,0.0000064456444,8.439492e-7,0.000005274118,0.000004377284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889296,0.00011968192,0.00031316595,0.0002021032,0.00028132834,0.00019074924],"domain_scores_gemma":[0.99888486,0.00038525643,0.00021850049,0.00034581928,0.00012222504,0.000043316686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037345145,0.00011381291,0.00027021766,0.00017986263,0.000045757304,0.000009993114,0.00033589095,0.000056591365,0.000001922922],"category_scores_gemma":[0.000055423683,0.00008416657,0.00005737516,0.0007951007,0.00037401755,0.0001493936,0.00014984456,0.00014130864,1.18752915e-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.000056982353,0.00016609846,0.3193952,0.000084514184,0.000021415353,0.0000023093824,0.0007191687,0.00003995329,0.0029522178,0.6744504,0.000004827352,0.002106942],"study_design_scores_gemma":[0.0015854503,0.0005761699,0.31317022,0.00028440263,0.00001912903,0.000012238638,0.00045697042,0.009950006,0.015430553,0.65826446,0.00004271507,0.00020771],"about_ca_topic_score_codex":0.00008923049,"about_ca_topic_score_gemma":0.000028962693,"teacher_disagreement_score":0.016185941,"about_ca_system_score_codex":0.0000063140405,"about_ca_system_score_gemma":0.000016269521,"threshold_uncertainty_score":0.3432213},"labels":[],"label_agreement":null},{"id":"W1969997664","doi":"10.1007/s00373-010-0887-z","title":"Diameter-Preserving Spanning Trees in Sparse Weighted Graphs","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Victoria","funders":"","keywords":"Combinatorics; Spanning tree; Mathematics; Weight function; Vertex (graph theory); Graph; Shortest-path tree; Simple graph; Connectivity; Discrete mathematics; Mathematical analysis","score_opus":0.020223197123717028,"score_gpt":0.2652129367781776,"score_spread":0.24498973965446055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969997664","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.96719396,0.002417763,0.025723148,0.00068695686,0.00032128007,0.00029037104,0.0000018565521,0.0002819506,0.0030827213],"genre_scores_gemma":[0.99409944,0.0004152988,0.005196056,0.0001628686,0.0000057970187,0.000013984452,0.0000016395558,0.000011678932,0.000093225244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980052,0.00013989984,0.0002883236,0.0005585293,0.00040005078,0.0006079884],"domain_scores_gemma":[0.99873817,0.0001921621,0.00007969762,0.0007050735,0.000083708226,0.00020117973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051646226,0.0002288719,0.00028142636,0.0007367166,0.00020126357,0.00019897195,0.0010298886,0.00008111979,0.0000047815074],"category_scores_gemma":[0.000061226725,0.00021855833,0.000088829,0.0025238462,0.00009155236,0.0007347103,0.00030592593,0.00037368678,0.0000039302413],"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.0000122902575,0.00013451622,0.017717263,0.000007316175,0.000007977891,0.000091341346,0.0003873548,0.000016192691,0.00044530476,0.95848,0.000092885384,0.022607582],"study_design_scores_gemma":[0.0006720624,0.00024039949,0.046758417,0.00004222411,0.0000030263636,0.000012967065,0.00005601055,0.008166027,0.00053975073,0.9429286,0.00031819756,0.00026228838],"about_ca_topic_score_codex":0.000027618451,"about_ca_topic_score_gemma":0.000015131868,"teacher_disagreement_score":0.029041154,"about_ca_system_score_codex":0.000028590151,"about_ca_system_score_gemma":0.000026364216,"threshold_uncertainty_score":0.891255},"labels":[],"label_agreement":null},{"id":"W1973079746","doi":"10.1007/s00373-013-1302-3","title":"The k-Dominating Graph","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":49,"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":"Combinatorics; Dominating set; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Graph power; Bound graph; Neighbourhood (mathematics); Line graph","score_opus":0.005714229060984769,"score_gpt":0.18446223829652275,"score_spread":0.178748009235538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973079746","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.6990764,0.007490034,0.21443371,0.006915901,0.013904762,0.0012116928,8.8413117e-7,0.00078491546,0.056181688],"genre_scores_gemma":[0.9989391,0.00013510174,0.0001566227,0.00013108781,0.000016682337,0.000038916027,1.3648409e-7,0.000004059195,0.0005782701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992985,0.000047204954,0.00015513354,0.00016330382,0.00013316849,0.00020266094],"domain_scores_gemma":[0.99935526,0.0001473888,0.000060244765,0.00026740838,0.000107222375,0.00006245348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002700441,0.0000809526,0.00008213846,0.000044061093,0.0005342533,0.0005017624,0.00036124128,0.000037128695,0.0000027744106],"category_scores_gemma":[0.000016113983,0.00005120713,0.000048527498,0.00035665656,0.000039649007,0.00023760572,0.000108105254,0.000102350175,0.000014899846],"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":[2.3231718e-7,0.000007767987,0.00082439923,0.0000024496237,0.0000062437184,6.8963e-7,0.000119315024,0.0000012357674,0.00001176405,0.9762963,0.00442654,0.018303072],"study_design_scores_gemma":[0.0002235891,0.00007693845,0.0040534865,0.000012093639,0.000002133368,0.000023001605,0.00020185305,0.025769094,0.00004798498,0.9574822,0.011964884,0.00014271306],"about_ca_topic_score_codex":0.00006809621,"about_ca_topic_score_gemma":0.0000041172657,"teacher_disagreement_score":0.2998627,"about_ca_system_score_codex":0.0000071037985,"about_ca_system_score_gemma":0.0000068120544,"threshold_uncertainty_score":0.48385063},"labels":[],"label_agreement":null},{"id":"W1975155259","doi":"10.1007/s00373-013-1286-z","title":"Subset-Sum Representations of Domination Polynomials","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Cape Breton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Domination analysis; Graph; Discrete mathematics","score_opus":0.014489181128081844,"score_gpt":0.27050442430798644,"score_spread":0.2560152431799046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975155259","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.9284941,0.00072605105,0.0640113,0.0009037212,0.00047982592,0.00053918053,0.000004505039,0.00012333195,0.0047179996],"genre_scores_gemma":[0.99709463,0.0001301245,0.002425485,0.00002931934,0.0000043954087,0.000040698393,0.000001955436,0.0000056257186,0.00026777032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906904,0.00007436468,0.00019966479,0.00023009923,0.00023721672,0.00018961562],"domain_scores_gemma":[0.99899733,0.00018191122,0.000091336944,0.00041869126,0.00021960899,0.0000910964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023822865,0.00008343907,0.0001351969,0.00022476671,0.00011646466,0.00007728662,0.0003994868,0.000043719923,0.000014062913],"category_scores_gemma":[0.00006900575,0.000077883,0.00004667171,0.00080138416,0.00010967409,0.0005618105,0.00016911914,0.00008819712,0.000010388487],"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.000001893381,0.000051362476,0.004953992,0.000010554938,0.000008444916,9.070946e-7,0.0001857488,0.0000025650936,0.0018496176,0.9841523,0.00047457544,0.008308006],"study_design_scores_gemma":[0.0003507458,0.000074440926,0.02824223,0.0000058987694,0.0000029264938,0.0000037437906,0.00007931027,0.0013008007,0.0052519455,0.9644218,0.00017124174,0.000094923365],"about_ca_topic_score_codex":0.000061823004,"about_ca_topic_score_gemma":0.0000013929772,"teacher_disagreement_score":0.068600535,"about_ca_system_score_codex":0.000010844238,"about_ca_system_score_gemma":0.000021610753,"threshold_uncertainty_score":0.31759766},"labels":[],"label_agreement":null},{"id":"W1982050567","doi":"10.1007/s00373-012-1270-z","title":"Solving Partition Problems with Colour-Bipartitions","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","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 Victoria; Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Pathwidth; Discrete mathematics; Homomorphism; Partition (number theory); Vertex (graph theory); Time complexity; Graph; Line graph","score_opus":0.021424106780662405,"score_gpt":0.24812032415968993,"score_spread":0.22669621737902754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982050567","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.70644635,0.002403841,0.2819968,0.0007915616,0.0005707342,0.0005940239,0.000004975457,0.00051707553,0.0066746427],"genre_scores_gemma":[0.9971389,0.00011185696,0.0024788291,0.000060692615,0.000010129287,0.00007326618,0.000002140739,0.0000090723315,0.0001150675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989301,0.00005671553,0.000114835944,0.00020347764,0.00024622766,0.00044862748],"domain_scores_gemma":[0.9992671,0.00007421549,0.000050335606,0.00030465968,0.00009515343,0.00020851233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261789,0.00011011178,0.00010867535,0.0001242954,0.000331422,0.00010617726,0.00024133862,0.000041627314,0.0000061492683],"category_scores_gemma":[0.000015722524,0.00009131969,0.000028034925,0.00077990035,0.00010352338,0.00085224817,0.0001251935,0.00015321175,0.000011432545],"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.0000029327039,0.00011365578,0.024263918,0.0000140359,0.000009621242,0.000001997882,0.0003197326,0.000010982314,0.00012354959,0.9740009,0.00015133886,0.0009873655],"study_design_scores_gemma":[0.00047728737,0.00028585122,0.0129289245,0.000029686009,0.000009293566,0.000039661623,0.000080679754,0.001137368,0.00069217966,0.97985244,0.0042227115,0.00024391667],"about_ca_topic_score_codex":0.000004741816,"about_ca_topic_score_gemma":0.000003233157,"teacher_disagreement_score":0.29069257,"about_ca_system_score_codex":0.000019700057,"about_ca_system_score_gemma":0.000020713853,"threshold_uncertainty_score":0.3723909},"labels":[],"label_agreement":null},{"id":"W1984034523","doi":"10.1007/s00373-013-1310-3","title":"A Note on Cyclic Connectivity and Matching Properties of Regular Graphs","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; Indifference graph; Graph","score_opus":0.01688209207769032,"score_gpt":0.24026086724360105,"score_spread":0.22337877516591073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984034523","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.99321294,0.0010547037,0.0047365213,0.00026904073,0.00011108579,0.00027857354,9.841243e-7,0.000075643184,0.0002604942],"genre_scores_gemma":[0.9987742,0.0002903266,0.0007736844,0.000063264466,0.00000241987,0.00003405211,2.313898e-7,0.000010404841,0.00005141711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877334,0.00011120251,0.00017371772,0.00036413947,0.00029546654,0.00028211504],"domain_scores_gemma":[0.99910045,0.00013796693,0.000081366576,0.00045311227,0.00012122597,0.00010590309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151343,0.00015713107,0.0002303732,0.00019885655,0.0002007785,0.00011245891,0.00035595635,0.000064656226,0.0000013725465],"category_scores_gemma":[0.00004779032,0.00012640221,0.000051849674,0.00048301747,0.00023036198,0.00046276127,0.00026901803,0.00020318743,0.0000026825348],"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.000009997256,0.00007905271,0.0015836934,0.000056533077,0.000013157784,0.0000026249636,0.00054969726,0.0000033780734,0.0110932905,0.9765654,0.000021807047,0.010021322],"study_design_scores_gemma":[0.00038012967,0.00025058154,0.009964539,0.000054066466,0.0000035148169,0.000009124306,0.000061180726,0.00095878966,0.010895896,0.9772111,0.00005098771,0.00016009796],"about_ca_topic_score_codex":0.00010269681,"about_ca_topic_score_gemma":0.0000025463355,"teacher_disagreement_score":0.009861224,"about_ca_system_score_codex":0.000010812164,"about_ca_system_score_gemma":0.000015085619,"threshold_uncertainty_score":0.5154532},"labels":[],"label_agreement":null},{"id":"W1984128589","doi":"10.1007/s00373-004-0579-7","title":"Spanning Trails Connecting Given Edges","year":2005,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"University of Regina","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Degree (music); Enhanced Data Rates for GSM Evolution; Multiple edges; Discrete mathematics; Physics; Computer science","score_opus":0.024392160606597258,"score_gpt":0.27269927210987666,"score_spread":0.2483071115032794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984128589","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.70651656,0.004888788,0.27222335,0.002980752,0.0007331275,0.00036052856,0.0000033110812,0.0007624796,0.01153109],"genre_scores_gemma":[0.993059,0.00012042612,0.006494765,0.000111485926,0.000021862948,0.000008494378,6.2250325e-7,0.000011082063,0.00017230386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988333,0.00005801362,0.00015491527,0.00034279368,0.00023567984,0.00037527832],"domain_scores_gemma":[0.99919325,0.00018036253,0.000056446108,0.0003400025,0.00008249406,0.00014746965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037579634,0.0001316938,0.00015306783,0.0001815638,0.00032858385,0.00016483825,0.0005336252,0.000054692242,0.0000061871715],"category_scores_gemma":[0.000059300884,0.00012698938,0.000055093387,0.00067066884,0.00006808931,0.0005241926,0.00023751539,0.00022225206,0.000011466883],"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.000002606019,0.000034670848,0.0010939124,0.000008162144,0.0000094747065,0.000007725878,0.00050255813,0.000023100127,0.00021812096,0.86933917,0.00014943304,0.12861104],"study_design_scores_gemma":[0.0006209465,0.00015098495,0.0020681736,0.000023693909,0.000004653386,0.00004099746,0.00021846048,0.0054219514,0.0029841394,0.96704596,0.021122376,0.00029764112],"about_ca_topic_score_codex":0.0000039484053,"about_ca_topic_score_gemma":0.0000018444543,"teacher_disagreement_score":0.28654242,"about_ca_system_score_codex":0.000021213677,"about_ca_system_score_gemma":0.000018323497,"threshold_uncertainty_score":0.51784766},"labels":[],"label_agreement":null},{"id":"W1984293343","doi":"10.1007/s00373-012-1172-0","title":"Cyclic Vertex-Connectivity of Cayley Graphs Generated by Transposition Trees","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Cayley graph; Vertex connectivity; Discrete mathematics; Graph","score_opus":0.009608412346894054,"score_gpt":0.2061704933930898,"score_spread":0.19656208104619574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984293343","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.972546,0.0023071154,0.022682665,0.00008300146,0.0015173275,0.0001238235,0.000008869414,0.00009331625,0.0006378701],"genre_scores_gemma":[0.9995534,0.0001958061,0.00007279737,0.00007599027,0.000012737012,0.000015096114,0.0000070718374,0.0000084756675,0.000058622805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989239,0.00011792087,0.0002519536,0.00023045542,0.00018888645,0.00028691415],"domain_scores_gemma":[0.9993346,0.0000677,0.00010702523,0.00026769607,0.00009131084,0.00013170492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030554223,0.00015168023,0.00023703008,0.00012576328,0.00015833284,0.00005531882,0.00021965212,0.00010977807,0.000004136116],"category_scores_gemma":[0.000006189017,0.00013734038,0.00009904664,0.0006353954,0.00004357628,0.0004417639,0.000031158677,0.000115607276,0.0000018507635],"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.000009457255,0.00027353858,0.030422399,0.000024779758,0.000047195874,0.0000012187343,0.0008287895,0.000009388226,0.00593174,0.95669496,0.002112191,0.0036443146],"study_design_scores_gemma":[0.0063813403,0.0022447652,0.22381458,0.00027321972,0.00019856075,0.00022857402,0.00061786536,0.04785588,0.09545004,0.6095253,0.010860977,0.002548875],"about_ca_topic_score_codex":0.00017380845,"about_ca_topic_score_gemma":0.000017038383,"teacher_disagreement_score":0.34716967,"about_ca_system_score_codex":0.000017883931,"about_ca_system_score_gemma":0.000010284969,"threshold_uncertainty_score":0.5600578},"labels":[],"label_agreement":null},{"id":"W1985239078","doi":"10.1007/s003730200035","title":"A Note on Cycle Lengths in Graphs","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":27,"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; Graph; Interval (graph theory); Degree (music); Discrete mathematics; Physics","score_opus":0.023160266115908844,"score_gpt":0.2606883193951853,"score_spread":0.23752805327927642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985239078","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.974553,0.00059552636,0.000016365604,0.0001395444,0.0005073694,0.00017809935,0.0000058362066,0.000092007154,0.023912251],"genre_scores_gemma":[0.9987168,0.00059076835,0.00018540549,0.0002112098,0.000010984881,0.00001477322,7.803606e-7,0.000025712665,0.00024359417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988346,0.00006540001,0.00026073292,0.00028537845,0.0002388637,0.00031501966],"domain_scores_gemma":[0.99910975,0.00031860496,0.00007431495,0.00036804614,0.00003127959,0.00009800669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022344572,0.00020914155,0.00026779308,0.0002801743,0.00021693516,0.00003374669,0.0001883591,0.00014481218,0.000058093974],"category_scores_gemma":[0.000107798696,0.0001753389,0.00010222533,0.0005176024,0.00010059803,0.000071776216,0.00007544108,0.0003139748,0.0000054904244],"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.000011731604,0.00018830018,0.0029674566,0.000035129906,0.000012651648,0.000020973628,0.0010509457,9.785298e-7,0.0000072116845,0.9904837,0.0010085568,0.0042123655],"study_design_scores_gemma":[0.00084440294,0.00015069502,0.0029214774,0.000035149416,0.000014748743,0.000009460067,0.00007713834,0.0003232133,0.00006352371,0.99392956,0.0014022621,0.00022834222],"about_ca_topic_score_codex":0.00001098283,"about_ca_topic_score_gemma":0.000007656007,"teacher_disagreement_score":0.02416377,"about_ca_system_score_codex":0.000019279616,"about_ca_system_score_gemma":0.0000034511577,"threshold_uncertainty_score":0.71501124},"labels":[],"label_agreement":null},{"id":"W1991507146","doi":"10.1007/s003730170006","title":"Diagonal Flips in Labelled Planar Triangulations","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"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; Carleton University","funders":"","keywords":"Combinatorics; Diagonal; Mathematics; Triangulation; Planar; Sequence (biology); Class (philosophy); Upper and lower bounds; Discrete mathematics; Geometry; Mathematical analysis; Computer science","score_opus":0.02099190701356197,"score_gpt":0.2671143189203534,"score_spread":0.24612241190679146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991507146","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.94887173,0.001757386,0.041916974,0.0012485617,0.0004485331,0.00035371666,0.0000043986993,0.00019417111,0.005204526],"genre_scores_gemma":[0.9980438,0.00039133572,0.0011066259,0.000075424025,0.000006707447,0.000022559452,0.0000026980915,0.0000067780766,0.00034410687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989683,0.00007687974,0.00016299324,0.00026976434,0.0002285462,0.00029351885],"domain_scores_gemma":[0.99930584,0.0001858782,0.000034057477,0.00031288055,0.00004928032,0.00011208646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133403,0.00010186589,0.0001387181,0.00032100495,0.00014897334,0.00006768796,0.00039419718,0.000053918997,0.000007890343],"category_scores_gemma":[0.00004541609,0.00009783419,0.000037781312,0.0015477485,0.000059332044,0.00027002997,0.000101850586,0.00017767544,0.00000826221],"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.000011019955,0.00008097708,0.029027479,0.000003033417,0.0000049306664,0.000044125507,0.00016225285,0.000010557952,0.000036680594,0.965323,0.00010577909,0.0051901964],"study_design_scores_gemma":[0.0010072605,0.00007026238,0.031459134,0.0000071011664,0.0000015269286,0.000017871438,0.00003094654,0.0028785018,0.000030533458,0.9612796,0.003086499,0.00013079679],"about_ca_topic_score_codex":0.000015444819,"about_ca_topic_score_gemma":0.000017210199,"teacher_disagreement_score":0.049172033,"about_ca_system_score_codex":0.000020777328,"about_ca_system_score_gemma":0.000027812588,"threshold_uncertainty_score":0.39895624},"labels":[],"label_agreement":null},{"id":"W1994609765","doi":"10.1007/s00373-006-0653-4","title":"Coloring Vertices and Faces of Locally Planar Graphs","year":2006,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Outerplanar graph; Graph; Discrete mathematics; Pathwidth; Line graph","score_opus":0.011546693249279157,"score_gpt":0.23584856605866827,"score_spread":0.22430187280938912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994609765","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.9817954,0.0034995873,0.01310845,0.000109264176,0.00014992061,0.00013765403,0.0000032966368,0.00008075668,0.0011156986],"genre_scores_gemma":[0.99764955,0.00042456336,0.0018294437,0.000020399173,0.0000030075557,0.000008572744,8.914794e-7,0.0000067608457,0.00005683998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891216,0.000046875186,0.00019870164,0.00029694728,0.00027700877,0.00026834125],"domain_scores_gemma":[0.9993195,0.00015842657,0.00007718603,0.00026573546,0.000091224574,0.00008792399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025233263,0.00012715666,0.00018859579,0.0002237447,0.00016069894,0.00008149961,0.00037972172,0.00005495174,8.819798e-7],"category_scores_gemma":[0.000016726148,0.00011573383,0.000036567577,0.0007353153,0.00021947279,0.0003314529,0.00015889676,0.000120770535,6.635993e-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.000010671082,0.00005131693,0.032595024,0.00003852516,0.000011158722,0.000009192142,0.00009001333,0.000008957373,0.00074392033,0.96390283,0.000054237,0.0024841751],"study_design_scores_gemma":[0.00045412543,0.0002257335,0.023289306,0.00002005061,0.0000060451516,0.000009166561,0.00006234079,0.001022888,0.0019962594,0.972141,0.00062437094,0.00014866922],"about_ca_topic_score_codex":0.000070524584,"about_ca_topic_score_gemma":0.000011009791,"teacher_disagreement_score":0.01585415,"about_ca_system_score_codex":0.0000071470517,"about_ca_system_score_gemma":0.000018623585,"threshold_uncertainty_score":0.47194886},"labels":[],"label_agreement":null},{"id":"W2000105603","doi":"10.1007/s00373-010-0940-y","title":"König–Egerváry Graphs are Non-Edmonds","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Combinatorics; Mathematics; Mathematical proof; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.01007385019446178,"score_gpt":0.24956467204907634,"score_spread":0.23949082185461457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000105603","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.97617984,0.0005846671,0.0144709805,0.0006223679,0.001997449,0.00030812682,0.000007211917,0.00039297107,0.005436368],"genre_scores_gemma":[0.9969761,0.00019772966,0.002208728,0.00018017292,0.000015939851,0.00003358399,0.0000019861368,0.000021822512,0.00036395123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979739,0.00005417792,0.00023450163,0.0006029938,0.00048544555,0.00064897456],"domain_scores_gemma":[0.99811137,0.00014780513,0.000114252056,0.0010410473,0.00020759844,0.0003779486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005422601,0.0002518367,0.0002693611,0.00042075786,0.00041927077,0.00023533835,0.0012448276,0.00016520714,0.000011785637],"category_scores_gemma":[0.00006326974,0.0002336413,0.00013053176,0.0016865765,0.0002520982,0.00055768975,0.0005047957,0.0007429383,0.000022742508],"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.00000589958,0.00010367595,0.020149339,0.000019516061,0.0000150282485,0.000040016585,0.00014955367,8.748804e-7,0.0017649289,0.9716237,0.00063652126,0.005490934],"study_design_scores_gemma":[0.00054668804,0.00012685212,0.019436123,0.000011928484,0.0000053927647,0.000031769523,0.000054045984,0.0010600388,0.001705651,0.9734939,0.0032038193,0.00032384257],"about_ca_topic_score_codex":0.000012228979,"about_ca_topic_score_gemma":0.000012725004,"teacher_disagreement_score":0.020796226,"about_ca_system_score_codex":0.00001197685,"about_ca_system_score_gemma":0.00004910055,"threshold_uncertainty_score":0.9527616},"labels":[],"label_agreement":null},{"id":"W2008597407","doi":"10.1007/s00373-006-0664-1","title":"On the Intersection Problem for Steiner Triple Systems of Different Orders","year":2006,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Toronto; University of Victoria; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Steiner system; Mathematics; Intersection (aeronautics); Order (exchange); Set (abstract data type); Steiner tree problem; Triple system; Discrete mathematics; Computer science; Pure mathematics","score_opus":0.005505699171466485,"score_gpt":0.16559429727165292,"score_spread":0.16008859810018644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008597407","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.99395466,0.0003966274,0.0017391549,0.000012902419,0.0010720195,0.00045679236,0.000008810597,0.0000765311,0.0022825233],"genre_scores_gemma":[0.99968123,0.000012254934,0.0000024026717,0.0000035914215,0.000011789906,0.000110084344,0.0000044415615,0.000014472571,0.00015974342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995074,0.00002574204,0.00017896337,0.00008620828,0.00008282789,0.000118825534],"domain_scores_gemma":[0.9997027,0.00008478894,0.000040475497,0.00012000379,0.000032969936,0.000019040048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012967695,0.00010604937,0.0001443279,0.00005700255,0.00006733142,0.000024046838,0.00006583411,0.000050217033,0.0000014075305],"category_scores_gemma":[0.0000037113705,0.00006871417,0.00006440359,0.00015815157,0.00002466817,0.000025150084,0.000006159506,0.00006422585,3.888329e-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.00001353496,0.00003955712,0.0005425229,0.00018052121,0.000028612058,1.4352831e-7,0.000060678656,0.0004810365,0.0004625348,0.9961155,0.0019777736,0.00009756537],"study_design_scores_gemma":[0.001348035,0.0005044601,0.0014175377,0.00016110094,0.000049619324,0.000004729772,0.000736871,0.013624328,0.0024287452,0.9766853,0.0027601777,0.0002791021],"about_ca_topic_score_codex":0.000040111812,"about_ca_topic_score_gemma":0.000007480795,"teacher_disagreement_score":0.019430226,"about_ca_system_score_codex":0.000014523951,"about_ca_system_score_gemma":0.0000018662691,"threshold_uncertainty_score":0.28020826},"labels":[],"label_agreement":null},{"id":"W2012753180","doi":"10.1007/s00373-014-1497-y","title":"Graphical Representations of Graphic Frame Matroids","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"","keywords":"Matroid; Graphic matroid; Combinatorics; Mathematics; Graph; Matroid partitioning; Discrete mathematics; Dual graph; Planar graph","score_opus":0.02808379344953137,"score_gpt":0.29715217956220635,"score_spread":0.269068386112675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012753180","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.7059524,0.0035177981,0.2790538,0.0014716778,0.0010730561,0.00053167995,0.000012985946,0.00044859573,0.007937982],"genre_scores_gemma":[0.99564296,0.00019777635,0.0039998614,0.00004736111,0.000005492891,0.000019345707,0.0000017217479,0.0000098087585,0.000075668846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984596,0.000119911725,0.00025545948,0.0003563866,0.00051536015,0.00029330415],"domain_scores_gemma":[0.99844414,0.00018613902,0.000089117515,0.0006806861,0.00030573673,0.00029420393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049643574,0.0001337647,0.00021282963,0.00045199497,0.00011272432,0.00006566026,0.000680874,0.000085458865,0.0000021102571],"category_scores_gemma":[0.00015914522,0.0001247991,0.000094884264,0.002227877,0.00029870134,0.0003771883,0.0003167542,0.00024310741,0.0000032914234],"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.000008642732,0.00009271065,0.020497303,0.0000113375345,0.00001628091,0.000008149867,0.00025671028,0.000006011631,0.00013989753,0.97783464,0.00033004532,0.0007982539],"study_design_scores_gemma":[0.00045472564,0.00023289006,0.006597116,0.000010249499,0.0000060889547,0.000018915487,0.00015955933,0.0010253491,0.00031935849,0.990649,0.00038912514,0.00013765115],"about_ca_topic_score_codex":0.000020172334,"about_ca_topic_score_gemma":0.0000018044645,"teacher_disagreement_score":0.28969055,"about_ca_system_score_codex":0.000010253306,"about_ca_system_score_gemma":0.0000560748,"threshold_uncertainty_score":0.50891596},"labels":[],"label_agreement":null},{"id":"W2013432272","doi":"10.1007/s00373-009-0870-8","title":"Fast Winning Strategies in Avoider-Enforcer Games","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"McGill University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Graph; Mathematical economics; Complete graph; Planarity testing; Set (abstract data type); Complete bipartite graph; Order (exchange); Computer science; Economics","score_opus":0.013567615020505925,"score_gpt":0.26867636386001625,"score_spread":0.25510874883951035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013432272","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.84434766,0.0033959914,0.12313734,0.0012019785,0.00042705992,0.0003803539,0.0000016397648,0.00041906856,0.026688905],"genre_scores_gemma":[0.9981373,0.00019755088,0.00133242,0.00014968328,0.0000051306442,0.0000064293604,6.739353e-7,0.0000056030563,0.0001652316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879533,0.000056176403,0.00017751673,0.0003240349,0.0002592234,0.00038773002],"domain_scores_gemma":[0.99936616,0.00007837647,0.000043800872,0.00035049496,0.000059474547,0.00010171835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029418783,0.00014251599,0.00016706309,0.0003120675,0.00013577024,0.0002618433,0.0005044667,0.000060268863,0.0000027561532],"category_scores_gemma":[0.00002177832,0.00013300934,0.000041931584,0.001136418,0.000077735196,0.00083967455,0.00011782772,0.0002708343,0.0000035777343],"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.000004517817,0.00004061192,0.0021871217,0.0000060950015,0.0000028815402,0.000025711146,0.0005346988,0.00006997286,0.00013491056,0.97564065,0.00005219884,0.02130062],"study_design_scores_gemma":[0.00039432,0.00017252658,0.015441883,0.000019840803,0.0000010771171,0.0000099260715,0.00038682116,0.0023921996,0.00019150319,0.9804094,0.00041269272,0.00016783188],"about_ca_topic_score_codex":0.000011092648,"about_ca_topic_score_gemma":0.0000034941886,"teacher_disagreement_score":0.15378961,"about_ca_system_score_codex":0.000020362288,"about_ca_system_score_gemma":0.000043455373,"threshold_uncertainty_score":0.5423963},"labels":[],"label_agreement":null},{"id":"W2019462472","doi":"10.1007/s00373-008-0795-7","title":"Hadwiger Number and the Cartesian Product of Graphs","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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","funders":"","keywords":"Combinatorics; Cartesian product; Mathematics; Graph; Discrete mathematics; Upper and lower bounds; Square (algebra); Geometry","score_opus":0.019050658265849774,"score_gpt":0.24508049963449793,"score_spread":0.22602984136864815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019462472","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.9915272,0.0013934681,0.000014886916,0.000166277,0.00030204892,0.00024939032,0.0000046583773,0.0000362159,0.006305876],"genre_scores_gemma":[0.99827665,0.0010692575,0.00024058994,0.00007473276,0.000012868163,0.0000132952155,8.1210925e-7,0.00001744061,0.000294334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902135,0.00009350642,0.0002575865,0.00021540339,0.0002210633,0.0001910711],"domain_scores_gemma":[0.99904794,0.0002839428,0.00012390691,0.00038528428,0.00009305892,0.000065895336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036628128,0.00016754809,0.00032616145,0.0000641816,0.00043911606,0.000014979913,0.00015513985,0.00006619215,0.000013195759],"category_scores_gemma":[0.00010515347,0.000100696365,0.00010581577,0.00030562427,0.0008744808,0.00005943569,0.00010343591,0.0001718821,3.8100438e-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.000037118803,0.000046015524,0.035317544,0.000058986305,0.000055223252,0.0000050080794,0.0021139795,3.912361e-8,0.000009789696,0.9607267,0.001262749,0.00036688385],"study_design_scores_gemma":[0.0011572836,0.000035938992,0.012984129,0.000012920326,0.000055983255,0.00011144964,0.00015474964,0.000008048757,0.00022877402,0.9844703,0.00064627547,0.00013411247],"about_ca_topic_score_codex":0.00002743767,"about_ca_topic_score_gemma":0.0000017489953,"teacher_disagreement_score":0.023743674,"about_ca_system_score_codex":0.0000035313706,"about_ca_system_score_gemma":0.000013918188,"threshold_uncertainty_score":0.41062787},"labels":[],"label_agreement":null},{"id":"W2021848912","doi":"10.1007/s003730070001","title":"The Permutations 123 p 4 … p m and 321 p 4 … p m are Wilf-Equivalent","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","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 Victoria","funders":"","keywords":"Bijection; Combinatorics; Mathematics; Permutation (music); Permutation matrix; Physics","score_opus":0.02374271035223836,"score_gpt":0.27966279429419105,"score_spread":0.2559200839419527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021848912","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.9894265,0.0022918577,0.000393832,0.00085472263,0.0005837622,0.0005042061,0.00001212134,0.00022366115,0.0057093427],"genre_scores_gemma":[0.9945118,0.0024516082,0.0007021438,0.00006043107,0.000029103656,0.00006385957,0.0000017208333,0.000043728505,0.002135601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867445,0.00006306474,0.00034237833,0.00026898368,0.00031275844,0.00033837018],"domain_scores_gemma":[0.9983792,0.00078442163,0.00014656292,0.00043672725,0.00010391353,0.00014918658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027847162,0.0002337435,0.000275242,0.000053146705,0.00081705203,0.00014288508,0.0002054116,0.00009654103,0.000024517563],"category_scores_gemma":[0.00021933667,0.00017360387,0.00006926957,0.00032240554,0.0002047054,0.00013433426,0.000079289355,0.00022585083,0.00001316479],"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.000010217412,0.00011533295,0.000562056,0.00006583996,0.000031373544,0.000006727087,0.00046568728,9.392916e-7,0.0000069882067,0.9930654,0.001125833,0.004543563],"study_design_scores_gemma":[0.00061736745,0.00009036758,0.00087656843,0.00004588613,0.000058316284,0.000029888206,0.0005756216,0.00018423556,0.000034990157,0.9866575,0.010607475,0.00022178341],"about_ca_topic_score_codex":0.00000382466,"about_ca_topic_score_gemma":0.000005632266,"teacher_disagreement_score":0.009481642,"about_ca_system_score_codex":0.000030683823,"about_ca_system_score_gemma":0.000020146344,"threshold_uncertainty_score":0.70793605},"labels":[],"label_agreement":null},{"id":"W2027818420","doi":"10.1007/s00373-008-0806-8","title":"Paired Domination Vertex Critical Graphs","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Domination analysis; Graph; Neighbourhood (mathematics); Upper and lower bounds; Discrete mathematics","score_opus":0.025413394764800368,"score_gpt":0.2717497073206486,"score_spread":0.24633631255584826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027818420","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.8112664,0.003310181,0.17316806,0.0021534525,0.0019879455,0.00052688643,0.000007145232,0.0008559119,0.0067239963],"genre_scores_gemma":[0.9969673,0.0004678428,0.0022428597,0.00013129275,0.000004838049,0.00002444438,0.0000017596923,0.000011380518,0.00014825392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841803,0.000113563576,0.00019160844,0.00042274926,0.00045002063,0.00040403553],"domain_scores_gemma":[0.9987148,0.0003473223,0.000036420057,0.00048025578,0.00020321176,0.00021796735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031046398,0.00015947802,0.00018348334,0.0002924325,0.0005092508,0.00007764811,0.0005521939,0.00008695197,0.0000059889967],"category_scores_gemma":[0.0001849513,0.00015275404,0.000084961226,0.0011989519,0.00034314702,0.0005670009,0.00022369596,0.00022280007,0.000013435743],"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.000008217711,0.00010458996,0.0030268538,0.000012437501,0.000007737798,0.000061111816,0.00022715585,6.388404e-7,0.000120389755,0.99046403,0.00053762353,0.0054292018],"study_design_scores_gemma":[0.000533619,0.00018235297,0.010740686,0.000009160045,0.0000037289976,0.00008849973,0.000026015614,0.0023219134,0.00046919272,0.98464674,0.00077704166,0.00020106728],"about_ca_topic_score_codex":0.000006690699,"about_ca_topic_score_gemma":7.360114e-7,"teacher_disagreement_score":0.18570091,"about_ca_system_score_codex":0.00002201677,"about_ca_system_score_gemma":0.000040947198,"threshold_uncertainty_score":0.62291294},"labels":[],"label_agreement":null},{"id":"W2028884430","doi":"10.1007/s00373-011-1091-5","title":"On Superconnectivity of (4, g)-Cages","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","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":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Cage; Graph; Vertex (graph theory); Graph power; Vertex-transitive graph; Discrete mathematics; Line graph","score_opus":0.023230265293499048,"score_gpt":0.19621133058195483,"score_spread":0.17298106528845578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028884430","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.9477721,0.00020436873,0.028161587,0.00003847213,0.0013099212,0.00009263034,0.0000010334628,0.000086521766,0.022333376],"genre_scores_gemma":[0.9996461,0.00003782095,0.00016720661,0.000053742806,0.00000521223,0.0000050265367,1.4649012e-7,0.0000037721886,0.00008094355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939233,0.00004727757,0.00013789104,0.00018543062,0.00011356758,0.0001234794],"domain_scores_gemma":[0.9994907,0.00007113155,0.000050224484,0.00027086958,0.00006657766,0.000050531304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002085796,0.000082274266,0.00014027779,0.0000927586,0.00007096665,0.000023105851,0.00022538395,0.000050743423,0.000008288889],"category_scores_gemma":[0.000014560881,0.000068646885,0.0000525795,0.0002654118,0.00003181573,0.00014912213,0.00006277269,0.000077838165,0.0000030964964],"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.00000369162,0.000081241014,0.0029221282,0.000008695067,0.000009209501,0.0000028139527,0.00054671225,7.754144e-7,0.000027374184,0.9942977,0.00031633372,0.0017833684],"study_design_scores_gemma":[0.0003730817,0.00065395783,0.01484564,0.00003214575,0.000004784999,0.000016147742,0.000093607414,0.0025556542,0.0021174676,0.9786982,0.00043468675,0.00017462218],"about_ca_topic_score_codex":0.000082100254,"about_ca_topic_score_gemma":0.000004756846,"teacher_disagreement_score":0.05187404,"about_ca_system_score_codex":0.0000064171227,"about_ca_system_score_gemma":0.000008081918,"threshold_uncertainty_score":0.27993387},"labels":[],"label_agreement":null},{"id":"W2030762014","doi":"10.1007/s00373-013-1365-1","title":"Forbidden Configurations and Product Constructions","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 British Columbia","funders":"","keywords":"Combinatorics; Matrix (chemical analysis); TRACE (psycholinguistics); Mathematics; Product (mathematics); Permutation (music); Simple (philosophy); Identity matrix; Geometry; Physics; Eigenvalues and eigenvectors","score_opus":0.0044833847345464055,"score_gpt":0.16072249211837758,"score_spread":0.15623910738383118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030762014","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.98615366,0.0015877936,0.0001183582,0.000064067724,0.00056054536,0.00022864039,0.000005430215,0.00018874073,0.011092765],"genre_scores_gemma":[0.99952865,0.00021343626,0.00003262739,0.0000109407265,0.0000109310395,0.000054659078,0.0000029883352,0.000009895478,0.00013584718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996036,0.0000122651645,0.000109951456,0.00010360913,0.000049756127,0.000120764795],"domain_scores_gemma":[0.9997382,0.000021049684,0.000013558703,0.00011518908,0.000038702085,0.00007328393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004550042,0.00008906346,0.00009793235,0.00006875239,0.0001338454,0.000069478745,0.000037715003,0.00003668184,0.000026326117],"category_scores_gemma":[0.0000055855426,0.00008364858,0.000019856205,0.00016838674,0.00007523988,0.00013772231,0.000009448907,0.000078392804,0.000009513184],"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":[4.1497333e-7,0.000009382079,0.0044340775,0.00004284957,0.000028869363,5.869061e-7,0.00017887677,0.0000054634124,0.0011726026,0.98927796,0.0017389951,0.0031099454],"study_design_scores_gemma":[0.0005075055,0.000054263008,0.029337512,0.000024882183,0.000034361074,0.00011374387,0.0009375897,0.001367842,0.0010659966,0.95720387,0.009007249,0.00034516113],"about_ca_topic_score_codex":0.000018844177,"about_ca_topic_score_gemma":0.000002084376,"teacher_disagreement_score":0.032074045,"about_ca_system_score_codex":0.0000044702447,"about_ca_system_score_gemma":0.0000039290267,"threshold_uncertainty_score":0.341109},"labels":[],"label_agreement":null},{"id":"W2031928820","doi":"10.1007/s00373-012-1224-5","title":"Paired-Domination in Claw-Free Graphs","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"","keywords":"Claw; Mathematics; Combinatorics; Discrete mathematics; Biology","score_opus":0.01856724002713184,"score_gpt":0.25932418640361954,"score_spread":0.2407569463764877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031928820","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.95393354,0.0048679626,0.03208891,0.00085099874,0.0013569946,0.000512388,0.000004560645,0.00031924518,0.0060654073],"genre_scores_gemma":[0.99769396,0.0002873837,0.0017665557,0.000091020716,0.000008876874,0.00003638664,0.0000017328152,0.000011405358,0.00010266431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984381,0.00013481356,0.00021031068,0.0002971754,0.0003646179,0.0005549722],"domain_scores_gemma":[0.9988146,0.00017059708,0.00006220412,0.00067418866,0.00007795523,0.00020048989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000873322,0.00015610842,0.00017670731,0.00047271978,0.000150119,0.000079688616,0.0007950252,0.000090280344,0.000003735886],"category_scores_gemma":[0.00010362679,0.00015063712,0.00006115671,0.0016948181,0.000107950276,0.0009590341,0.00041656915,0.00025182756,0.000007470025],"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.000006098388,0.00014019571,0.05166003,0.0000126416835,0.000005037088,0.000005188812,0.000369272,0.0000010470824,0.00006471585,0.9371585,0.00024902847,0.010328223],"study_design_scores_gemma":[0.0007843444,0.000078365025,0.050499234,0.000011283711,0.0000024024116,0.000010581551,0.00006027292,0.00061975315,0.00032724545,0.94630444,0.0011156058,0.00018645714],"about_ca_topic_score_codex":0.000015072659,"about_ca_topic_score_gemma":0.000006100171,"teacher_disagreement_score":0.04376044,"about_ca_system_score_codex":0.000037496244,"about_ca_system_score_gemma":0.000019869689,"threshold_uncertainty_score":0.61428034},"labels":[],"label_agreement":null},{"id":"W2032275177","doi":"10.1007/s003730200034","title":"Extension of Turán's Theorem to the 2-Stability Number","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Stability theorem; Disjoint sets; Upper and lower bounds; Discrete mathematics; Graph; Induced subgraph; Vertex (graph theory)","score_opus":0.04106609175210166,"score_gpt":0.2630655757629958,"score_spread":0.22199948401089412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032275177","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.9877978,0.00032949765,0.000102633996,0.00030346142,0.00041198326,0.00022028016,0.0000074260392,0.000039082868,0.010787848],"genre_scores_gemma":[0.999219,0.00012484593,0.00029528953,0.00016163148,0.000013606178,0.000008216159,3.7735566e-7,0.00001367174,0.00016338698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990698,0.00009099286,0.00022997533,0.00020021488,0.00022837282,0.00018062374],"domain_scores_gemma":[0.9988143,0.0003542729,0.00007990406,0.00056312256,0.000111738154,0.0000766595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045066388,0.00013573881,0.00021245613,0.000038628626,0.00024642874,0.000017577153,0.00021596198,0.000074794385,0.00019773777],"category_scores_gemma":[0.00021457384,0.00007956089,0.00009770409,0.00033395443,0.0001468098,0.000038161852,0.00015164108,0.00014488958,0.0000037703637],"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.0000103213915,0.00008177925,0.0038867928,0.00003498475,0.000016623751,0.0000012668538,0.0017099296,1.9297026e-7,0.00003820929,0.98936665,0.0030272363,0.0018260026],"study_design_scores_gemma":[0.00020164697,0.000058943373,0.0037557224,0.000013964087,0.00002712566,0.0000099057725,0.00025847548,0.00005493328,0.0004822325,0.99262506,0.002400691,0.000111286274],"about_ca_topic_score_codex":0.0000065456015,"about_ca_topic_score_gemma":0.0000021594078,"teacher_disagreement_score":0.011421188,"about_ca_system_score_codex":0.000007526304,"about_ca_system_score_gemma":0.0000027659962,"threshold_uncertainty_score":0.32443988},"labels":[],"label_agreement":null},{"id":"W2033449293","doi":"10.1007/s00373-015-1543-4","title":"Monitoring the Plane with Rotating Radars","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University; Carleton University; University of Waterloo; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Plane (geometry); Radar; Algorithm; Idle; Combinatorics; Mathematics; Set (abstract data type); Point (geometry); Binary logarithm; Physics; Computer science; Geometry; Mathematical analysis; Telecommunications","score_opus":0.02286262453610839,"score_gpt":0.22256370302563683,"score_spread":0.19970107848952845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033449293","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.88868916,0.0012744477,0.1072951,0.000686795,0.0008130017,0.00011850054,4.7200163e-7,0.00009987838,0.0010226496],"genre_scores_gemma":[0.99383706,0.000024029236,0.005975192,0.000049493923,0.000026722553,0.000006704087,9.1601584e-7,0.0000030263595,0.000076863194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994272,0.000026923866,0.00007559514,0.00013775889,0.00022612808,0.00010640234],"domain_scores_gemma":[0.9995976,0.0000627629,0.000039438717,0.0001406781,0.00008808629,0.00007142187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002130869,0.00006605814,0.000057065183,0.0000462097,0.00017070914,0.00014225802,0.00018509397,0.000017341948,2.0036448e-7],"category_scores_gemma":[0.000014204356,0.000042896496,0.000011300389,0.0004679,0.000019630543,0.0001781131,0.000062212515,0.00007379215,0.0000015124123],"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.000008302757,0.00004005849,0.025957836,0.0000070648243,0.000018648194,0.000012940318,0.0014043415,0.0009994778,0.00002629797,0.8987991,0.00046769698,0.07225824],"study_design_scores_gemma":[0.0025010817,0.0010019433,0.06122425,0.00006847543,0.00002885284,0.00023660439,0.0008817284,0.07536983,0.0024854995,0.84363806,0.011922345,0.0006413175],"about_ca_topic_score_codex":0.000011378044,"about_ca_topic_score_gemma":8.3322664e-7,"teacher_disagreement_score":0.1051479,"about_ca_system_score_codex":0.000008179605,"about_ca_system_score_gemma":0.000039958544,"threshold_uncertainty_score":0.17492683},"labels":[],"label_agreement":null},{"id":"W2036908020","doi":"10.1007/s00373-010-0881-5","title":"Packing and Covering Triangles in Planar Graphs","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","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":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Planar graph; Planar; Outerplanar graph; Graph; Pathwidth; Computer science; Line graph; Computer graphics (images)","score_opus":0.010776758511349073,"score_gpt":0.21953694696479698,"score_spread":0.2087601884534479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036908020","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.9775869,0.0018836131,0.019132834,0.00046327585,0.0002408349,0.00008985344,8.529112e-7,0.000057845264,0.00054398],"genre_scores_gemma":[0.99819475,0.00032979983,0.0012463174,0.00019835685,0.0000066023954,0.000002141214,0.0000022202341,0.000001977136,0.00001782574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939424,0.000023965827,0.00012599649,0.00020327247,0.000120630895,0.00013191851],"domain_scores_gemma":[0.9997304,0.00005209318,0.00003581198,0.000100058925,0.000024661796,0.000056959485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017004313,0.00008218071,0.00010346649,0.00022201372,0.000099759374,0.00012168736,0.000105622086,0.00003736749,4.188052e-7],"category_scores_gemma":[0.000014155302,0.00008214567,0.000019947936,0.0006273817,0.00001342112,0.00025200765,0.000028185576,0.00007386369,4.0097024e-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.0000035922176,0.000035063877,0.0039441823,0.0000053498406,0.00000279681,0.000010511621,0.00022958918,0.00006129921,0.00012734739,0.95165676,0.000067017674,0.043856464],"study_design_scores_gemma":[0.0006712221,0.0001474111,0.09964897,0.000017749931,0.000002723902,0.000018510756,0.000025270832,0.009776164,0.00017285509,0.8886704,0.0007007395,0.00014800376],"about_ca_topic_score_codex":0.000007311573,"about_ca_topic_score_gemma":0.000003765992,"teacher_disagreement_score":0.09570479,"about_ca_system_score_codex":0.000008868063,"about_ca_system_score_gemma":0.000013290027,"threshold_uncertainty_score":0.33498034},"labels":[],"label_agreement":null},{"id":"W2039732465","doi":"10.1007/s00373-006-0684-x","title":"Some Recent Progress and Applications in Graph Minor Theory","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":59,"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":"Graph minor; Minor (academic); Combinatorics; Robertson–Seymour theorem; Mathematics; Extremal graph theory; Discrete mathematics; Conjecture; Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.014278547458238774,"score_gpt":0.2798043015966379,"score_spread":0.26552575413839913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039732465","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.7903586,0.049867976,0.15398434,0.000745494,0.0005105095,0.001820875,0.0000067736,0.00040342766,0.0023019756],"genre_scores_gemma":[0.9952064,0.0027076844,0.0017866434,0.000089742,0.000012682228,0.00008736887,0.0000021798573,0.000011922526,0.00009537123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878675,0.00006480947,0.00018490678,0.0003736958,0.00021562267,0.00037423967],"domain_scores_gemma":[0.9991095,0.00022452878,0.000050518687,0.00037769537,0.000074242336,0.00016351315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096165977,0.00012958911,0.00013946909,0.00040288543,0.00016793513,0.000078380006,0.00039756557,0.000065514614,9.4444675e-7],"category_scores_gemma":[0.00001886949,0.00011644642,0.000026906455,0.0014016737,0.000249741,0.00029824817,0.00022837242,0.00019632379,0.0000013718562],"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.000009271389,0.000101731515,0.02368769,0.000014636563,0.0000052118103,0.000008131158,0.00016976566,2.3441545e-7,0.000019334113,0.9084095,0.0000112300495,0.06756331],"study_design_scores_gemma":[0.0003628829,0.00007202048,0.02979519,0.000007721698,0.0000023417194,0.0000073331876,0.000102145474,0.000039301816,0.00025701016,0.9666901,0.00252427,0.00013965587],"about_ca_topic_score_codex":0.0000022966863,"about_ca_topic_score_gemma":0.000004148868,"teacher_disagreement_score":0.20484778,"about_ca_system_score_codex":0.00001800199,"about_ca_system_score_gemma":0.000018231352,"threshold_uncertainty_score":0.47485474},"labels":[],"label_agreement":null},{"id":"W2040573390","doi":"10.1007/s003730070024","title":"Longest Cycles in Almost Claw-Free Graphs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Toronto","funders":"","keywords":"Combinatorics; Claw; Mathematics; Chordal graph; Graph; Pancyclic graph; Clique-sum; Discrete mathematics; 1-planar graph; Biology","score_opus":0.01351657810913522,"score_gpt":0.2533493710628817,"score_spread":0.23983279295374646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040573390","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.9824823,0.0033293916,0.0011837615,0.00080652116,0.00029461007,0.0003108423,0.0000074096697,0.00025759568,0.011327566],"genre_scores_gemma":[0.99596095,0.002247598,0.0011378397,0.00016916405,0.000006697746,0.000030962015,0.0000024024744,0.000017618508,0.000426741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981229,0.00011568387,0.0002562013,0.00054374937,0.00040123228,0.0005602773],"domain_scores_gemma":[0.9985274,0.0001577186,0.000043232212,0.001006397,0.00006185441,0.00020341948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040984777,0.00021352655,0.00024135518,0.00038281138,0.00020517869,0.00015440125,0.0013801645,0.000107409476,0.0000341977],"category_scores_gemma":[0.000035842462,0.00020671099,0.0000771255,0.0020301107,0.00020556175,0.000528072,0.00031446366,0.00035284265,0.00002315536],"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.000014655492,0.0001419605,0.019655893,0.000012820486,0.000007995669,0.0000697154,0.0002110093,0.000011706664,0.000024531366,0.93699443,0.00039101386,0.042464256],"study_design_scores_gemma":[0.0008876314,0.00014579836,0.034764275,0.000020759864,0.0000025045279,0.00002624708,0.000035877958,0.0007039942,0.00012465371,0.9600782,0.0029515584,0.00025850374],"about_ca_topic_score_codex":0.000051223262,"about_ca_topic_score_gemma":0.000036217007,"teacher_disagreement_score":0.04220575,"about_ca_system_score_codex":0.000025650348,"about_ca_system_score_gemma":0.000030940308,"threshold_uncertainty_score":0.84294295},"labels":[],"label_agreement":null},{"id":"W2043217677","doi":"10.1007/s00373-010-0980-3","title":"Characterizations of Bent and Almost Bent Function on $${\\mathbb{Z}_p^2}$$","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; Centre de Recherches Mathématiques","keywords":"Bent molecular geometry; Combinatorics; Bent function; Mathematics; Permutation group; Degenerate energy levels; Graph; Function (biology); Exponential function; Discrete mathematics; Permutation (music); Boolean function; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.004398247008042404,"score_gpt":0.18300560634441182,"score_spread":0.17860735933636943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043217677","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.98677164,0.000087687506,0.011076094,0.00026647985,0.00086842594,0.00010308307,0.0000043642835,0.000071527014,0.00075067655],"genre_scores_gemma":[0.9994347,0.00009964211,0.00025622608,0.00016202973,0.00000994586,0.0000086606815,0.0000038020178,0.0000050291605,0.000019953228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993332,0.00003457528,0.00014292376,0.00022262601,0.00013979268,0.00012687212],"domain_scores_gemma":[0.99940324,0.000076843535,0.00007861686,0.00029297895,0.000064411906,0.00008388788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002739431,0.00010485485,0.00011675008,0.00015713756,0.00018026806,0.00007161391,0.00017673151,0.000059708156,0.0000059622666],"category_scores_gemma":[0.00001807146,0.000095891904,0.00004468368,0.00043445217,0.000068545975,0.00015184763,0.000090611116,0.00014376179,0.0000010498875],"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.000007604512,0.00011922877,0.0048067747,0.0000143021525,0.000011266542,7.261023e-7,0.00017690139,2.4835452e-7,0.0027878368,0.97556835,0.00004887569,0.016457897],"study_design_scores_gemma":[0.0005156376,0.0008531863,0.14375411,0.000031860218,0.000024641178,0.000009011894,0.00004612176,0.001182699,0.0013703363,0.84514123,0.0068220925,0.00024905914],"about_ca_topic_score_codex":0.0000040434084,"about_ca_topic_score_gemma":0.0000020174916,"teacher_disagreement_score":0.13894734,"about_ca_system_score_codex":0.0000024383219,"about_ca_system_score_gemma":0.000010043677,"threshold_uncertainty_score":0.39103585},"labels":[],"label_agreement":null},{"id":"W2045559318","doi":"10.1007/s00373-003-0527-y","title":"On a Decomposition of Complete Graphs","year":2003,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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 Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Prime power; Discrete mathematics; Graph; Strongly regular graph; Prime (order theory); Pathwidth; Line graph","score_opus":0.007840884330635641,"score_gpt":0.19614832992341494,"score_spread":0.1883074455927793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045559318","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.9837166,0.00074255606,0.00031217985,0.00000308658,0.00050295505,0.000095598945,0.000008223655,0.00009545763,0.014523365],"genre_scores_gemma":[0.9998039,0.000108964385,0.000027144168,0.000015517222,0.0000015410909,0.000009456314,0.0000034803857,0.0000140406355,0.000015940166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999445,0.000042724078,0.00016636246,0.00010387093,0.00010126311,0.00014074145],"domain_scores_gemma":[0.9996759,0.00005518977,0.000029079074,0.00015326009,0.000026034126,0.000060483697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012811364,0.00011719452,0.0001683166,0.00013957226,0.00006220676,0.000012859285,0.000059966027,0.000057544636,0.000008848868],"category_scores_gemma":[0.0000057133557,0.00011414583,0.00006711537,0.00032014484,0.00003854163,0.000039523067,0.00000473117,0.000088630884,0.000003635403],"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.000005227601,0.000039093407,0.0011621361,0.00006332767,0.000026851627,0.000001973047,0.000080178055,0.00009183463,0.0012711802,0.9968459,0.00025136655,0.00016094722],"study_design_scores_gemma":[0.00051576766,0.00016227615,0.00206826,0.000043117834,0.000016074771,0.000012539532,0.00007198613,0.0003418178,0.0028672265,0.99238276,0.0013495014,0.00016868189],"about_ca_topic_score_codex":0.0000027866838,"about_ca_topic_score_gemma":5.294829e-7,"teacher_disagreement_score":0.016087338,"about_ca_system_score_codex":0.000006851483,"about_ca_system_score_gemma":0.0000031712157,"threshold_uncertainty_score":0.46547318},"labels":[],"label_agreement":null},{"id":"W2046260624","doi":"10.1007/s00373-007-0696-1","title":"Colouring Cubic Graphs by Small Steiner Triple Systems","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Cubic graph; Steiner system; Petersen graph; Vertex (graph theory); Graph; Discrete mathematics; Order (exchange); Line graph; Graph power; Voltage graph","score_opus":0.006570819486693912,"score_gpt":0.1749046238534504,"score_spread":0.1683338043667565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046260624","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.97612447,0.0126125,0.0009405814,0.000005983242,0.002770224,0.00029703756,0.000015206581,0.00046690545,0.006767082],"genre_scores_gemma":[0.99881387,0.00036963698,0.00001140209,0.000016576661,0.00002217818,0.000027948483,0.000011031007,0.000048473386,0.0006788677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863607,0.00004018625,0.00038575032,0.00024607388,0.00019189544,0.00050004106],"domain_scores_gemma":[0.9993115,0.00007966767,0.000058518937,0.0002768876,0.000051438,0.00022197641],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063542963,0.00027003695,0.00032341687,0.00024251018,0.00019995713,0.00009731463,0.00019166796,0.00018382787,0.000004874873],"category_scores_gemma":[0.000008076004,0.00026335733,0.000102699836,0.000669772,0.00005772618,0.000097720185,0.0000292494,0.00024177335,0.000008369407],"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.00003540831,0.0001338573,0.012766059,0.00056050374,0.00021040658,0.000066945395,0.0004961393,0.00020001929,0.0071431724,0.9693964,0.007475515,0.001515562],"study_design_scores_gemma":[0.013763206,0.0016667057,0.017438347,0.0009077691,0.0005473527,0.00062083564,0.009371674,0.014289421,0.025486005,0.58528256,0.3241105,0.006515615],"about_ca_topic_score_codex":0.00005286502,"about_ca_topic_score_gemma":0.000008422696,"teacher_disagreement_score":0.38411385,"about_ca_system_score_codex":0.00003186471,"about_ca_system_score_gemma":0.000005874404,"threshold_uncertainty_score":0.9999819},"labels":[],"label_agreement":null},{"id":"W2060519045","doi":"10.1007/s00373-011-1092-4","title":"The Orthogonality Spectrum for Latin Squares of Different Orders","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Victoria","funders":"","keywords":"Orthogonality; Mathematics; Latin square; Combinatorics; Order (exchange); Zhàng; Spectrum (functional analysis); Series (stratigraphy); Least-squares function approximation; Embedding; Upper and lower bounds; Discrete mathematics; Statistics; Mathematical analysis; Geometry; Computer science; Physics","score_opus":0.01590282505025051,"score_gpt":0.18330439079763167,"score_spread":0.16740156574738116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060519045","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.9956792,0.0007738925,0.0004659891,0.000012091176,0.000528502,0.0001739604,0.000009383867,0.00006193449,0.0022950592],"genre_scores_gemma":[0.9997623,0.00013778334,0.000009482986,0.0000033862848,0.000004988339,0.000028651297,0.000001608647,0.000011063071,0.00004075924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951375,0.000021037002,0.00016472668,0.000078989404,0.00007087424,0.00015059968],"domain_scores_gemma":[0.9996609,0.00008835302,0.000034000615,0.0001551439,0.000022452788,0.000039147264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015104288,0.00009600989,0.00013088195,0.00004183619,0.00010981186,0.000011558626,0.00010019395,0.000041946198,0.0000043222185],"category_scores_gemma":[0.000007961879,0.00006465208,0.00007306471,0.00015164094,0.000060513703,0.000023646217,0.000012768549,0.00005844699,3.1150216e-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.000015343287,0.000025903844,0.019517519,0.00008236502,0.000040350053,2.4183194e-7,0.00029136418,0.0000022086833,0.000047126076,0.9792889,0.00010413658,0.0005845473],"study_design_scores_gemma":[0.00032092817,0.00011609084,0.04071726,0.000013772949,0.000019839457,9.183092e-7,0.000292176,0.00037808434,0.0019443413,0.9548133,0.0012689212,0.00011437975],"about_ca_topic_score_codex":0.000012631715,"about_ca_topic_score_gemma":0.000018268998,"teacher_disagreement_score":0.024475606,"about_ca_system_score_codex":0.000004210438,"about_ca_system_score_gemma":0.0000027273527,"threshold_uncertainty_score":0.2636435},"labels":[],"label_agreement":null},{"id":"W2064483171","doi":"10.1007/s00373-008-0794-8","title":"Equitable Specialized Block-Colourings for Steiner Triple Systems","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"McMaster University","funders":"","keywords":"Partition (number theory); Combinatorics; Mathematics; Steiner system; Block (permutation group theory); Discrete mathematics","score_opus":0.015253395482545784,"score_gpt":0.19400801973313345,"score_spread":0.17875462425058766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064483171","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.98213005,0.0056776167,0.00045450727,0.000011034224,0.0033140313,0.00064019655,0.000026979304,0.00040389426,0.0073417155],"genre_scores_gemma":[0.9973373,0.00037035072,0.000024435532,0.000011031881,0.00006662875,0.00014765894,0.0000065971267,0.000038402384,0.001997602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99896526,0.000023833434,0.0002737312,0.00018885973,0.00014712205,0.00040117066],"domain_scores_gemma":[0.999505,0.000059105198,0.000043216078,0.0002082722,0.00006346573,0.0001209417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025009472,0.00019472504,0.00032792188,0.00013327134,0.0003261435,0.000050365303,0.00013708598,0.00011980953,0.000005328648],"category_scores_gemma":[0.000011746971,0.00018637424,0.00010643718,0.0003252699,0.000050282662,0.00009991154,0.00002539125,0.00010207495,0.0000053978456],"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.00005384132,0.00009488755,0.002007639,0.0005376478,0.00015537278,0.00003062548,0.000642732,0.00055829773,0.0014716043,0.9753405,0.018945936,0.00016093998],"study_design_scores_gemma":[0.014944159,0.0011021075,0.0021030088,0.00028255145,0.0002636658,0.00066544925,0.0018230462,0.022464091,0.006706314,0.34368935,0.60331374,0.002642495],"about_ca_topic_score_codex":0.000021136631,"about_ca_topic_score_gemma":0.0000012547648,"teacher_disagreement_score":0.63165116,"about_ca_system_score_codex":0.000024913896,"about_ca_system_score_gemma":0.000011078559,"threshold_uncertainty_score":0.7600121},"labels":[],"label_agreement":null},{"id":"W2069126428","doi":"10.1007/s00373-007-0709-0","title":"Enumerating Non-crossing Minimally Rigid Frameworks","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Structural Analysis and Optimization","field":"Engineering","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":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Set (abstract data type); Point (geometry); Space (punctuation); Graph; Property (philosophy); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Computer science; Geometry; Artificial intelligence","score_opus":0.003462599481939789,"score_gpt":0.1969183633865814,"score_spread":0.19345576390464161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069126428","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.9648818,0.0009300753,0.03152716,0.0000132678115,0.00039594917,0.00004219695,8.385013e-7,0.00010980857,0.002098951],"genre_scores_gemma":[0.9974198,0.00011839905,0.0023430784,0.000041881805,0.000027013391,0.0000012290755,0.000005277852,0.000013849126,0.00002950736],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941516,0.0000034844181,0.0001732708,0.000112942646,0.00010148611,0.00019365849],"domain_scores_gemma":[0.99974203,0.000033382046,0.000027011862,0.0000883673,0.000041448828,0.000067741144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011264148,0.0001103573,0.00012595255,0.00008141341,0.0002058052,0.00015690763,0.000054526306,0.00013858684,0.000010306423],"category_scores_gemma":[0.000010054782,0.000100980316,0.000045570185,0.00036619182,0.000030509977,0.00011977916,0.000015088094,0.00021445293,0.0000014263405],"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.000054049797,0.00010201713,0.17610851,0.00047804133,0.00060845155,0.00012095188,0.006636271,0.044436064,0.018695751,0.35536703,0.002423195,0.39496967],"study_design_scores_gemma":[0.0016674073,0.00018588429,0.15839073,0.0001742484,0.00018660442,0.000039205504,0.0008302489,0.63402766,0.012886077,0.18621548,0.003782345,0.0016141279],"about_ca_topic_score_codex":0.000008661052,"about_ca_topic_score_gemma":0.000004797379,"teacher_disagreement_score":0.58959156,"about_ca_system_score_codex":0.000016189426,"about_ca_system_score_gemma":0.000004060833,"threshold_uncertainty_score":0.41178578},"labels":[],"label_agreement":null},{"id":"W2069337358","doi":"10.1007/s00373-011-1068-4","title":"The Maximum Chromatic Index of Multigraphs with Given Δ and μ","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","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":"Simon Fraser University","funders":"","keywords":"Multigraph; Mathematics; Combinatorics; Multiplicity (mathematics); Edge coloring; Upper and lower bounds; Chromatic scale; Index (typography); Discrete mathematics; Graph; Geometry; Mathematical analysis; Computer science","score_opus":0.022317484597639804,"score_gpt":0.2248478408948655,"score_spread":0.2025303562972257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069337358","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.9948843,0.0009686342,0.00012985975,0.000019294417,0.00012438906,0.00019064451,0.000003298877,0.00003191644,0.0036476385],"genre_scores_gemma":[0.9989095,0.00040987725,0.0005897527,0.000015585298,0.0000032282228,0.000010873614,2.8191334e-7,0.000015421963,0.00004551596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992466,0.000046259276,0.00020579083,0.00015083062,0.00017027877,0.00018026511],"domain_scores_gemma":[0.9991716,0.000245704,0.000142542,0.00030341826,0.000067700894,0.00006900418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024071315,0.00014802645,0.00021124487,0.00007681523,0.00033226743,0.000019563966,0.00016266441,0.00007069032,0.000005505252],"category_scores_gemma":[0.000039140978,0.00008182176,0.000044965014,0.00022148769,0.00044521329,0.000053088334,0.00008879548,0.00012726257,9.828412e-8],"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.000043217555,0.000049861123,0.03772143,0.000097800024,0.00008002077,0.0000035503483,0.002286309,2.0148539e-8,0.000008765706,0.9574419,0.000078572964,0.002188524],"study_design_scores_gemma":[0.00056011317,0.00021506859,0.04348479,0.0000336563,0.000050057828,0.000019333484,0.0007031747,0.000030347697,0.00017016749,0.95446974,0.00014293012,0.00012061347],"about_ca_topic_score_codex":0.000029192945,"about_ca_topic_score_gemma":0.000012990905,"teacher_disagreement_score":0.0057633575,"about_ca_system_score_codex":0.0000031971986,"about_ca_system_score_gemma":0.000009181896,"threshold_uncertainty_score":0.33365944},"labels":[],"label_agreement":null},{"id":"W2069703039","doi":"10.1007/s00373-012-1246-z","title":"A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Acadia University","funders":"","keywords":"Infimum and supremum; Upper and lower bounds; Graph; Klein bottle; Surface (topology); Projective plane","score_opus":0.016220047580076866,"score_gpt":0.26878955691163486,"score_spread":0.252569509331558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069703039","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.99474937,0.00070219964,0.0010987718,0.00041222168,0.0004249519,0.00033347515,0.000003082428,0.000053805543,0.0022221117],"genre_scores_gemma":[0.9989147,0.0003325662,0.0002293725,0.0003067201,0.0000066289595,0.000038446302,9.0465574e-7,0.000013661366,0.00015695843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828553,0.00015360762,0.00018022588,0.00037816906,0.00040048672,0.00060196756],"domain_scores_gemma":[0.99858284,0.00054264243,0.00006352712,0.0005643847,0.00005511538,0.00019150627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085779297,0.00021066636,0.00021209833,0.00026604958,0.00023316394,0.00013747158,0.00048368776,0.00008158216,0.0000049099317],"category_scores_gemma":[0.000057722464,0.00014820303,0.000048409758,0.0013139419,0.0001739714,0.00041394183,0.0002515691,0.0003949268,0.00001115375],"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.000026869531,0.0001812955,0.019743282,0.00001102866,0.000008568206,0.0000054773536,0.0012098422,0.000020449295,0.00011303697,0.9767253,0.0002020611,0.0017528095],"study_design_scores_gemma":[0.0010139418,0.00043858206,0.042948563,0.000053439475,0.0000052976084,0.00001003455,0.00026030684,0.0028420838,0.0013262982,0.94939625,0.0013675616,0.0003376675],"about_ca_topic_score_codex":0.000025125619,"about_ca_topic_score_gemma":0.000005716874,"teacher_disagreement_score":0.027329056,"about_ca_system_score_codex":0.000027489896,"about_ca_system_score_gemma":0.000017948561,"threshold_uncertainty_score":0.6043544},"labels":[],"label_agreement":null},{"id":"W2069852972","doi":"10.1007/s003730200028","title":"The Crossing Number of P(N, 3)","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"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":"Crossing number (knot theory); Combinatorics; Mathematics; Graph","score_opus":0.01433431762498918,"score_gpt":0.23276634486681638,"score_spread":0.2184320272418272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069852972","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.89837724,0.0035215467,0.08670584,0.0009422281,0.0011859536,0.00010282044,9.280164e-7,0.00007773464,0.009085733],"genre_scores_gemma":[0.9985204,0.00011633769,0.00096682506,0.000056701112,0.000006362828,0.0000019265553,1.947347e-7,0.0000015204288,0.00032974864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958915,0.000017162025,0.000098478835,0.0000900352,0.00012485898,0.00008033189],"domain_scores_gemma":[0.9996462,0.00008307958,0.000042940137,0.00013207077,0.0000684346,0.000027304539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011510477,0.00004131773,0.000046454305,0.000022914597,0.0003429088,0.00016415268,0.00015531531,0.000017723247,0.0000034358627],"category_scores_gemma":[0.000014136671,0.000030127594,0.00002366221,0.00039019156,0.000053956206,0.00011404267,0.000054244305,0.00003872077,0.000003762175],"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":[3.6101062e-7,0.000019925039,0.0017124414,0.0000025799502,0.0000034507966,4.9270113e-7,0.0001472817,0.000010548695,0.000021775379,0.9621425,0.00066492334,0.035273664],"study_design_scores_gemma":[0.00028913683,0.000042938816,0.008264244,0.0000062249896,0.0000037114753,0.00002337322,0.000018377514,0.063273974,0.00055232894,0.89733905,0.030080564,0.00010609119],"about_ca_topic_score_codex":0.000002772232,"about_ca_topic_score_gemma":3.8788033e-7,"teacher_disagreement_score":0.10014317,"about_ca_system_score_codex":0.0000034732589,"about_ca_system_score_gemma":0.0000070324154,"threshold_uncertainty_score":0.2637412},"labels":[],"label_agreement":null},{"id":"W2074500200","doi":"10.1007/s00373-011-1053-y","title":"Super-Simple Twofold Steiner Pentagon Systems","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Mount Saint Vincent University","funders":"","keywords":"Pentagon; Combinatorics; Simple (philosophy); Mathematics; Order (exchange); Multigraph; Steiner system; Path (computing); Discrete mathematics; Graph; Computer science; Geometry","score_opus":0.01590127618815921,"score_gpt":0.1658016935877956,"score_spread":0.1499004173996364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074500200","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.9727758,0.003833775,0.00014031738,0.000002055617,0.0018062145,0.0001774177,0.000010103097,0.00036027408,0.020894011],"genre_scores_gemma":[0.99942714,0.00023330977,0.000006537009,0.0000109459415,0.000019750509,0.000035258352,0.0000066312114,0.000033697703,0.0002267516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916023,0.000034459226,0.00022144709,0.0001704296,0.00013165195,0.00028178733],"domain_scores_gemma":[0.99952424,0.00002193668,0.000024712954,0.00026363845,0.00003362523,0.00013185517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016997539,0.00018708991,0.00021912242,0.000114198054,0.00011277335,0.000047546182,0.00014745112,0.000099832076,0.00002787418],"category_scores_gemma":[0.0000033661274,0.00017166144,0.0000675402,0.00027680644,0.000038605638,0.00012807269,0.000027750404,0.00012937542,0.000020951384],"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.000008301647,0.000055416265,0.016370041,0.00019708877,0.00007526818,0.000024212824,0.0009419346,0.000025435775,0.00050487305,0.9793477,0.0020795765,0.0003701532],"study_design_scores_gemma":[0.0045839907,0.0009550567,0.026663678,0.00025827062,0.0003038716,0.00035619788,0.010462649,0.010090306,0.008476743,0.8418058,0.092978,0.0030654143],"about_ca_topic_score_codex":0.00009286681,"about_ca_topic_score_gemma":0.0000032587018,"teacher_disagreement_score":0.13754188,"about_ca_system_score_codex":0.000013735134,"about_ca_system_score_gemma":0.000004097984,"threshold_uncertainty_score":0.700015},"labels":[],"label_agreement":null},{"id":"W2075056990","doi":"10.1007/s00373-012-1132-8","title":"On Graphs Having Maximal Independent Sets of Exactly t Distinct Cardinalities","year":2012,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Maximal independent set; Integer (computer science); Degree (music); Independent set; Discrete mathematics; Indifference graph; Chordal graph; Graph; 1-planar graph; Computer science","score_opus":0.030485153982711413,"score_gpt":0.2755864075653491,"score_spread":0.24510125358263768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075056990","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.9907526,0.0008273598,0.000054801978,0.000011941874,0.00085539423,0.00014909383,0.000028058656,0.00006470762,0.007256084],"genre_scores_gemma":[0.9995476,0.00007444904,0.00016496878,0.000032737284,0.000017697468,0.000011880047,0.0000038529506,0.000028101089,0.000118692304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985656,0.00009587255,0.0003298012,0.00020314468,0.00041327055,0.0003922808],"domain_scores_gemma":[0.9988093,0.0003998744,0.00018077534,0.00037648974,0.000077745666,0.00015581903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005354372,0.00024357332,0.0003812197,0.00018964092,0.00027440875,0.00002787602,0.00019081715,0.00013783132,0.000028839715],"category_scores_gemma":[0.00012738959,0.000195163,0.0001803525,0.00023659426,0.00017093663,0.00012562722,0.00014819425,0.00024793865,7.7191163e-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.000030816183,0.00014230555,0.08482332,0.0001334389,0.00006946857,0.0000034555171,0.0012544311,1.5279625e-7,0.00001548491,0.9124277,0.00036151978,0.0007378819],"study_design_scores_gemma":[0.00042889404,0.00014889122,0.058402583,0.000046973288,0.000078628036,0.000019815703,0.00045443198,0.000004189295,0.00033521425,0.9396325,0.00022362989,0.00022428324],"about_ca_topic_score_codex":0.00002292903,"about_ca_topic_score_gemma":0.0000016994986,"teacher_disagreement_score":0.027204737,"about_ca_system_score_codex":0.000020908314,"about_ca_system_score_gemma":0.000011206394,"threshold_uncertainty_score":0.79585165},"labels":[],"label_agreement":null},{"id":"W2078609456","doi":"10.1007/s00373-007-0731-2","title":"Extremal Ternary Self-Dual Codes Constructed from Negacirculant Matrices","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"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 Lethbridge","funders":"University of Lethbridge","keywords":"Ternary operation; Dual (grammatical number); Mathematics; Combinatorics; Construct (python library); Discrete mathematics; Computer science","score_opus":0.0070924533394057885,"score_gpt":0.20372241116566261,"score_spread":0.19662995782625683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078609456","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.9619131,0.001601783,0.033405088,0.000053385993,0.00077875966,0.00009275357,0.000009676378,0.00047827937,0.001667178],"genre_scores_gemma":[0.9946791,0.00015457139,0.005012449,0.0001000984,0.000028006903,0.0000029244088,0.0000048317397,0.000008387418,0.000009609741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870855,0.000053538835,0.00024228675,0.0003937351,0.00026459724,0.00033728202],"domain_scores_gemma":[0.999046,0.00023544616,0.00010321967,0.00037907177,0.00006526499,0.00017099203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035003875,0.00018906064,0.00020348675,0.00023050686,0.00025112048,0.00020705498,0.00044163925,0.000097618955,0.0000096999265],"category_scores_gemma":[0.000008447461,0.00017468863,0.00009374042,0.00081651995,0.000095783646,0.00028284456,0.00020577491,0.00016926503,0.0000050965336],"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.000015062723,0.00011358235,0.104794584,0.000011127209,0.000055194607,0.00012268819,0.00044962775,2.9260042e-7,0.00032772173,0.88544106,0.00015943349,0.008509639],"study_design_scores_gemma":[0.0008480498,0.00016151945,0.090839736,0.000027790898,0.00003920705,0.000112425114,0.00025368086,0.0011071361,0.0007714849,0.90352064,0.0019089578,0.00040936953],"about_ca_topic_score_codex":0.00007528259,"about_ca_topic_score_gemma":0.0000051759025,"teacher_disagreement_score":0.032766026,"about_ca_system_score_codex":0.000012892014,"about_ca_system_score_gemma":0.000025888441,"threshold_uncertainty_score":0.71235955},"labels":[],"label_agreement":null},{"id":"W2079531625","doi":"10.1007/s00373-013-1306-z","title":"On the Roots of Domination Polynomials","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":43,"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; Domination analysis; Bipartite graph; Limiting; Closure (psychology); Order (exchange); Graph; Plane (geometry); Discrete mathematics; Vertex (graph theory); Geometry","score_opus":0.012877419538516972,"score_gpt":0.24061513584615798,"score_spread":0.227737716307641,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079531625","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.98212975,0.00025647227,0.011940568,0.0014598946,0.00025863468,0.00034141875,0.0000010477128,0.000045726123,0.0035664584],"genre_scores_gemma":[0.9994339,0.000048387898,0.00023521522,0.0001014849,0.0000029225398,0.000029702227,2.5028586e-7,0.0000041224457,0.00014403829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992442,0.000082476094,0.00012452563,0.00015994905,0.00023203634,0.00015679892],"domain_scores_gemma":[0.99896127,0.00042459674,0.00006509856,0.00038040898,0.000117236115,0.00005137028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032819615,0.0000747049,0.000098020515,0.00011814044,0.000120838864,0.00006577277,0.00047480583,0.000033133034,0.000012835057],"category_scores_gemma":[0.000084251245,0.000048626534,0.000037728663,0.0005266918,0.00009405325,0.00021136944,0.00013153256,0.0001009777,0.000012732691],"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.000002211987,0.000035539404,0.00032319606,0.0000041145304,0.000004982339,3.9110685e-7,0.00006518621,0.0000018659848,0.0007530031,0.9903109,0.0005758521,0.007922725],"study_design_scores_gemma":[0.00018355578,0.00012238795,0.008955276,0.0000070247706,0.0000011552845,0.0000012734994,0.000026948095,0.0009533537,0.0032194005,0.98634946,0.000120943165,0.000059213864],"about_ca_topic_score_codex":0.000015297535,"about_ca_topic_score_gemma":4.2589335e-7,"teacher_disagreement_score":0.017304096,"about_ca_system_score_codex":0.00000868621,"about_ca_system_score_gemma":0.000012606073,"threshold_uncertainty_score":0.19829325},"labels":[],"label_agreement":null},{"id":"W2083976285","doi":"10.1007/s00373-007-0706-3","title":"An O(n3)-Time Recognition Algorithm for hhds-free Graphs","year":2007,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Wilfrid Laurier University","funders":"","keywords":"Chordal graph; Combinatorics; Split graph; Indifference graph; Pathwidth; Mathematics; Time complexity; Discrete mathematics; Maximal independent set; Interval graph; Graph; 1-planar graph; Line graph","score_opus":0.018915110586098665,"score_gpt":0.2779508647299208,"score_spread":0.25903575414382213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083976285","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.072318695,0.0005151814,0.92417926,0.00014416272,0.000590369,0.00062262226,0.000042695916,0.00055201893,0.0010350227],"genre_scores_gemma":[0.6642601,0.0005139482,0.33360723,0.0006245571,0.00010031272,0.00019666254,0.00010510043,0.00010652341,0.00048555035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980308,0.00007051252,0.00027679946,0.0005855532,0.00039888782,0.00063747773],"domain_scores_gemma":[0.9980622,0.00030906656,0.00009468226,0.0008666424,0.00033303973,0.00033437173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013645705,0.00021734224,0.00022579223,0.00047330884,0.00039932167,0.00017863358,0.0010749648,0.00013226646,0.000004742697],"category_scores_gemma":[0.00006775375,0.0002166558,0.00011528509,0.0013179829,0.0001409055,0.00075851067,0.00020831643,0.00020988315,0.000011079742],"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.000019927926,0.00017853807,0.00017656646,0.000013500668,0.000018085422,0.000013674228,0.00012721171,6.7999173e-7,0.00037777916,0.5990192,0.0005041628,0.39955062],"study_design_scores_gemma":[0.0012259567,0.00069647905,0.0007648417,0.00001178113,0.000009287775,0.000016826418,0.00004916339,0.011339457,0.002115618,0.9823195,0.0011374971,0.00031363076],"about_ca_topic_score_codex":0.0000087739845,"about_ca_topic_score_gemma":0.0000033459808,"teacher_disagreement_score":0.5919414,"about_ca_system_score_codex":0.000027964272,"about_ca_system_score_gemma":0.000030159834,"threshold_uncertainty_score":0.8834967},"labels":[],"label_agreement":null},{"id":"W2085702149","doi":"10.1007/s00373-013-1356-2","title":"Graphs with a Minimal Number of Convex Sets","year":2013,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"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; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Convex hull; Induced path; Graph; Graph power; Line graph; Regular polygon","score_opus":0.011617081512219712,"score_gpt":0.2556868968321987,"score_spread":0.24406981531997898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085702149","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.990095,0.00029689266,0.0055650813,0.00017638874,0.00011701524,0.00027605618,0.0000026006944,0.000090614885,0.0033803012],"genre_scores_gemma":[0.99485147,0.00008752477,0.0048076203,0.0000642125,0.000001677387,0.000041729072,0.0000010153508,0.000011766075,0.0001329978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986875,0.0000611108,0.0001894962,0.00033660885,0.00037756885,0.00034773123],"domain_scores_gemma":[0.99884397,0.00012803577,0.00009232623,0.00049561757,0.00026370757,0.00017636351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017334163,0.00016020413,0.00023434141,0.00015671365,0.00011056914,0.000082879174,0.00055305945,0.00006233219,0.000029142773],"category_scores_gemma":[0.000015267678,0.00012565743,0.00005659732,0.0011029454,0.00027222926,0.00046946315,0.00020715341,0.00017087012,0.00001913543],"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.000010086446,0.00008823779,0.046900183,0.00002740398,0.000024912872,0.000008684116,0.00023249889,5.1478395e-7,0.0001286089,0.94888026,0.00029600254,0.0034026178],"study_design_scores_gemma":[0.00070774695,0.00028109847,0.02017462,0.000019369452,0.000005502242,0.00004549465,0.000084208245,0.0006586025,0.0007336008,0.9767655,0.0003276978,0.00019653075],"about_ca_topic_score_codex":0.000044224482,"about_ca_topic_score_gemma":0.0000013079648,"teacher_disagreement_score":0.027885279,"about_ca_system_score_codex":0.00000765895,"about_ca_system_score_gemma":0.00003581992,"threshold_uncertainty_score":0.5124162},"labels":[],"label_agreement":null},{"id":"W2086987965","doi":"10.1007/s00373-014-1498-x","title":"Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree","year":2014,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"European Commission","keywords":"Betweenness centrality; Combinatorics; Mathematics; Vertex (graph theory); Upper and lower bounds; Degree (music); Enhanced Data Rates for GSM Evolution; Neighbourhood (mathematics); Discrete mathematics; Graph; Centrality; Physics; Computer science","score_opus":0.02340104887465191,"score_gpt":0.2437281785376534,"score_spread":0.2203271296630015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086987965","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.99799025,0.00025563088,0.000098731514,0.00012629414,0.00004391632,0.00010090683,0.0000052853343,0.000012943429,0.0013660672],"genre_scores_gemma":[0.9997087,0.000052711082,0.00015091315,0.000011814406,0.0000017973617,0.0000061783358,7.4160477e-7,0.000004470505,0.00006264875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950165,0.00006585948,0.00018368,0.000084621315,0.000088112785,0.00007608917],"domain_scores_gemma":[0.9992565,0.00030195553,0.00013080722,0.00022257888,0.00005636659,0.00003180815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024199086,0.000059684196,0.00012538276,0.000033611082,0.00013590192,0.000008935057,0.0000897763,0.0000432754,0.0000028468537],"category_scores_gemma":[0.00013584603,0.000043400098,0.000043986904,0.00028468648,0.00016385836,0.000042196698,0.000043413096,0.00006713917,1.00885664e-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.0000027105593,0.00007321495,0.046669893,0.0000684912,0.000013191112,1.3991291e-8,0.00041888276,1.9093592e-7,0.0003515099,0.9520721,0.000073905365,0.00025592747],"study_design_scores_gemma":[0.00022869719,0.000025039202,0.09288661,0.000028181046,0.000057926998,6.759762e-7,0.00017129292,0.00016328707,0.0007586444,0.9054431,0.0001932017,0.000043372293],"about_ca_topic_score_codex":0.000017256998,"about_ca_topic_score_gemma":0.000019533158,"teacher_disagreement_score":0.046628997,"about_ca_system_score_codex":0.0000030370304,"about_ca_system_score_gemma":0.000008048056,"threshold_uncertainty_score":0.17698047},"labels":[],"label_agreement":null},{"id":"W2091551894","doi":"10.1007/s00373-010-0965-2","title":"Cleaning with Brooms","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Dalhousie University; Toronto Metropolitan University","funders":"","keywords":"Brush; Combinatorics; Broom; Graph; Mathematics; Computer science; Geography; Engineering","score_opus":0.0073598170529717115,"score_gpt":0.22958342487961023,"score_spread":0.22222360782663853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091551894","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.91291636,0.00018086622,0.079499006,0.00032793818,0.00046976292,0.0001498825,7.9513836e-7,0.00027937442,0.006176007],"genre_scores_gemma":[0.99302536,0.000026708749,0.0066938526,0.000068874826,0.000006334918,0.000008569368,3.9635452e-7,0.000009160919,0.00016075556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991174,0.00002135516,0.00008075412,0.00027651916,0.00023646289,0.00026753312],"domain_scores_gemma":[0.9992339,0.00007391494,0.000033314886,0.00043808317,0.00008093415,0.0001398733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021164001,0.00010183864,0.00009883572,0.0001222159,0.00020465517,0.0001317168,0.000491242,0.00004637104,0.0000037163375],"category_scores_gemma":[0.000018511924,0.00008016805,0.000023544098,0.00069980434,0.000124615,0.00031799744,0.0001766251,0.00034792273,0.000005413141],"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.000004481078,0.000026724336,0.0065317834,0.0000045862794,0.00000531734,0.000013870525,0.00010154586,9.743516e-7,0.0005162843,0.98087496,0.000042414194,0.0118770525],"study_design_scores_gemma":[0.00041600093,0.00019365097,0.0064103026,0.00000595436,0.0000022644936,0.000049461087,0.00003269794,0.0010795041,0.00089356856,0.9875756,0.0031715196,0.00016948058],"about_ca_topic_score_codex":0.0000059452855,"about_ca_topic_score_gemma":0.000008785514,"teacher_disagreement_score":0.08010898,"about_ca_system_score_codex":0.000003898555,"about_ca_system_score_gemma":0.000021558208,"threshold_uncertainty_score":0.32691583},"labels":[],"label_agreement":null},{"id":"W2091675867","doi":"10.1007/s00373-010-0886-0","title":"A Magnetic Procedure for the Stability Number","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Matrix Theory and Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Stability (learning theory); Discrete mathematics; Computer science","score_opus":0.010607719335356402,"score_gpt":0.2269015478680244,"score_spread":0.21629382853266801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091675867","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.55041945,0.009901493,0.39881653,0.018507129,0.0030000035,0.0033313865,0.000023924962,0.0009661518,0.015033923],"genre_scores_gemma":[0.99817437,0.000071095965,0.0011609566,0.0003700115,0.000012823796,0.000023764906,3.9525884e-7,0.0000027103242,0.00018389997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938893,0.000022304901,0.000100913494,0.00020474786,0.00010841231,0.00017470162],"domain_scores_gemma":[0.9994168,0.00013234158,0.000030525705,0.00030742705,0.000058362893,0.00005449801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029073327,0.00008830547,0.00008741355,0.000015933703,0.00023682254,0.00011503653,0.00037344027,0.000036434918,0.000009035612],"category_scores_gemma":[0.000026278829,0.000057690035,0.00005214704,0.00029870527,0.000037976726,0.00011634391,0.000045307035,0.00007808745,0.0000024005685],"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.0000040998316,0.00005705443,0.00041730714,0.00001178612,0.0000024511562,6.793669e-7,0.00017425304,3.0742146e-7,0.0000093354165,0.9721418,0.00041033837,0.026770597],"study_design_scores_gemma":[0.00029521578,0.00017736321,0.004630087,0.0000034986256,0.000007441831,0.000010871249,0.000033612007,0.005285597,0.0001382503,0.98500323,0.0043168264,0.00009800087],"about_ca_topic_score_codex":0.0000016606549,"about_ca_topic_score_gemma":3.6219785e-7,"teacher_disagreement_score":0.44775486,"about_ca_system_score_codex":0.000005233155,"about_ca_system_score_gemma":0.000019459665,"threshold_uncertainty_score":0.23525314},"labels":[],"label_agreement":null},{"id":"W2093541724","doi":"10.1007/s003730050006","title":"Symmetric Graph Designs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"McMaster University; University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Graph; Symmetric graph; Line graph; Discrete mathematics; Voltage graph","score_opus":0.009673629584774029,"score_gpt":0.1783846952900734,"score_spread":0.16871106570529937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093541724","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.94971454,0.0045927716,0.00015580421,0.0000082838815,0.0004861999,0.00011243938,0.0000043370505,0.00041231146,0.044513304],"genre_scores_gemma":[0.9982278,0.0012955216,0.00001813205,0.000024244524,0.000010256231,0.000016843906,0.0000025237093,0.000022038419,0.0003826611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993334,0.000027077314,0.00015226267,0.00013825693,0.0001141012,0.00023491686],"domain_scores_gemma":[0.9996436,0.000036964542,0.000011266474,0.00018075113,0.000016147766,0.00011124078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013229466,0.00014699179,0.00015726517,0.00020858896,0.00010793589,0.000043209442,0.000110965164,0.000083285566,0.00009176445],"category_scores_gemma":[0.000002877155,0.00014153437,0.00006898509,0.0010149454,0.000037481248,0.000084877436,0.000006556672,0.00012172738,0.000036850593],"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.0000069653715,0.000048279322,0.0031714062,0.00007583362,0.000059616294,0.000014398753,0.00017905256,0.0001604277,0.00014080456,0.96613777,0.0018253191,0.028180141],"study_design_scores_gemma":[0.0007402468,0.00013665303,0.007476529,0.00003115214,0.000041661915,0.000045648943,0.00010748565,0.001357577,0.0005745152,0.9646948,0.024260698,0.0005330476],"about_ca_topic_score_codex":0.0000067393635,"about_ca_topic_score_gemma":6.6123147e-7,"teacher_disagreement_score":0.04851323,"about_ca_system_score_codex":0.000008266438,"about_ca_system_score_gemma":0.0000028878399,"threshold_uncertainty_score":0.5771604},"labels":[],"label_agreement":null},{"id":"W2105006345","doi":"10.1007/s00373-010-0946-5","title":"Zero-Sum Flows in Regular Graphs","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Zero (linguistics); Vertex (graph theory); Graph; Conjecture; Discrete mathematics; Flow (mathematics)","score_opus":0.0072069046876433495,"score_gpt":0.20222801365725615,"score_spread":0.1950211089696128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105006345","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.9946884,0.0006875458,0.0009805362,0.0005067101,0.0016799117,0.00013510589,0.0000010661707,0.00020857879,0.0011121708],"genre_scores_gemma":[0.9959549,0.00014726486,0.0035490922,0.00021596166,0.0000018116223,0.000015099592,0.0000017091536,0.000010865608,0.00010330957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986033,0.000039505663,0.0002654525,0.00045887244,0.00026998873,0.00036287322],"domain_scores_gemma":[0.9989656,0.000050751656,0.00006707023,0.0006500028,0.00008893306,0.00017762103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004735751,0.00018168883,0.00020706332,0.00036545726,0.00016779316,0.00015027841,0.0005252497,0.00014727186,0.0000035055693],"category_scores_gemma":[0.000028490454,0.00016556219,0.00007561514,0.0012589112,0.00008130114,0.0002555483,0.00019440279,0.000404853,0.000008903729],"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.0000018291443,0.00009853473,0.009370791,0.000009589847,0.0000053605518,0.000017041037,0.00013887517,0.000003433837,0.0024297037,0.9841363,0.00057119405,0.0032173446],"study_design_scores_gemma":[0.0006412969,0.00007479697,0.0042490256,0.000014355237,0.0000042564448,0.000017929156,0.000010921331,0.0034703498,0.0006588045,0.9884615,0.002168404,0.00022834261],"about_ca_topic_score_codex":0.000073859046,"about_ca_topic_score_gemma":0.000033099153,"teacher_disagreement_score":0.0051217647,"about_ca_system_score_codex":0.0000052854607,"about_ca_system_score_gemma":0.00003096775,"threshold_uncertainty_score":0.675143},"labels":[],"label_agreement":null},{"id":"W2115695686","doi":"10.1007/s00373-010-0917-x","title":"Star-Uniform Graphs","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","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":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics; Star (game theory); Chordal graph; Discrete mathematics; Graph","score_opus":0.011841989009128423,"score_gpt":0.25266698218514294,"score_spread":0.24082499317601452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115695686","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.97273135,0.0003981877,0.016216956,0.00052274123,0.0015675792,0.0002771854,0.0000051649554,0.00042944012,0.007851409],"genre_scores_gemma":[0.9936216,0.00017872664,0.005767607,0.00012305092,0.000008297074,0.000019370958,0.000001692897,0.000013610411,0.00026608483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985604,0.00003521018,0.0001725447,0.00040737138,0.0003730918,0.0004513499],"domain_scores_gemma":[0.9986559,0.0001157782,0.000057208304,0.0007676575,0.00014299556,0.00026041924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042447064,0.0001722054,0.00016612964,0.00029842943,0.00031991146,0.0001830416,0.0009381825,0.00010119355,0.000013223212],"category_scores_gemma":[0.000045460078,0.00015449343,0.00007834014,0.0012162528,0.000199254,0.0005193594,0.000365601,0.0005342022,0.000015560014],"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.000004060539,0.000059649145,0.0030627989,0.000008721191,0.000009001848,0.000013754547,0.00011535888,2.849959e-7,0.0009113174,0.9861043,0.0001841721,0.00952659],"study_design_scores_gemma":[0.00037908248,0.00010431538,0.0038779997,0.000003583745,0.000002835532,0.000025040908,0.00002728374,0.0008147022,0.0008417526,0.9867999,0.006914678,0.0002088281],"about_ca_topic_score_codex":0.000012835915,"about_ca_topic_score_gemma":0.000012097933,"teacher_disagreement_score":0.020890223,"about_ca_system_score_codex":0.000008101492,"about_ca_system_score_gemma":0.000039036073,"threshold_uncertainty_score":0.6300059},"labels":[],"label_agreement":null},{"id":"W2123754314","doi":"10.1007/s00373-010-0937-6","title":"Enumerative Properties of Rooted Circuit Maps","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"semigroups and automata theory","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":"Carleton University","funders":"","keywords":"Planar graph; Combinatorics; Mathematics; Chordal graph; 1-planar graph; Planar; Pathwidth; Outerplanar graph; Indifference graph; Discrete mathematics; Planar straight-line graph; Vertex (graph theory); Graph; Computer science; Line graph","score_opus":0.011269198459668003,"score_gpt":0.18570217661450686,"score_spread":0.17443297815483885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123754314","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.994256,0.00057156134,0.0029040615,0.00012153142,0.0006199621,0.00009062823,0.0000024793305,0.000103372826,0.001330369],"genre_scores_gemma":[0.99952435,0.000033349817,0.00028329747,0.000056267025,0.0000064272685,0.0000069699113,7.4884923e-7,0.0000050177637,0.000083573796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935913,0.000024861669,0.00013921261,0.00018834085,0.00014520616,0.00014325578],"domain_scores_gemma":[0.9994479,0.000026365993,0.00006755247,0.00031675913,0.00008305741,0.00005838689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016881932,0.00009574915,0.0001388548,0.000078004756,0.00009392356,0.00006570112,0.0003637235,0.0000585305,0.000003019319],"category_scores_gemma":[0.00002160698,0.00007568443,0.0000392741,0.00032277522,0.000092351336,0.00020635284,0.000121698315,0.00015134542,0.000002499415],"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.0000013222474,0.00005416655,0.0012059219,0.000015525098,0.00000921491,0.0000022094223,0.0006074647,1.3439916e-7,0.017846875,0.9738108,0.00009724982,0.0063491343],"study_design_scores_gemma":[0.00035879845,0.00010140587,0.0044801724,0.000022154461,0.0000062654926,0.00001590764,0.00007848249,0.001248117,0.041340075,0.9510482,0.0011180238,0.00018239881],"about_ca_topic_score_codex":0.000026359101,"about_ca_topic_score_gemma":0.0000031142538,"teacher_disagreement_score":0.0234932,"about_ca_system_score_codex":0.0000029806706,"about_ca_system_score_gemma":0.000025094492,"threshold_uncertainty_score":0.30863217},"labels":[],"label_agreement":null},{"id":"W2133298523","doi":"10.1007/s00373-014-1518-x","title":"Graph Divisible Designs and Packing Constructions","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Victoria","funders":"","keywords":"Mathematics; Combinatorics; Generalization; Joins; Embedding; Constructive; Block (permutation group theory); Class (philosophy); Discrete mathematics; Computer science","score_opus":0.02773550956475689,"score_gpt":0.20157058305288544,"score_spread":0.17383507348812854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133298523","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.9868408,0.0038295153,0.0015422717,0.00001408862,0.0009559961,0.00010551468,0.000005713307,0.00027769053,0.0064284387],"genre_scores_gemma":[0.99956346,0.00028391244,0.0000686817,0.000010436446,0.0000101066635,0.00001203813,0.000001947414,0.00001571739,0.0000336817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994432,0.000027574108,0.00012820275,0.0001259202,0.00009621279,0.00017889723],"domain_scores_gemma":[0.99960494,0.00003291247,0.000018785942,0.00012891988,0.000038227565,0.00017622033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017829612,0.00012459996,0.00014530806,0.00013450877,0.0001209209,0.00006602077,0.000055293272,0.00006810265,0.0000022651152],"category_scores_gemma":[0.000009171331,0.00012146529,0.000031107418,0.0003492384,0.000089012756,0.00011647831,0.000021477852,0.000108556065,0.0000023009861],"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.0000030343745,0.000014732326,0.032014105,0.000049596063,0.000043135136,0.000005687958,0.00049488374,0.000052271724,0.00016562744,0.9647065,0.00081767817,0.0016327578],"study_design_scores_gemma":[0.00068331935,0.00008247552,0.003284137,0.00003162788,0.000032369993,0.00008945188,0.0012077118,0.0007199786,0.00034080842,0.9903473,0.002902543,0.00027823725],"about_ca_topic_score_codex":0.000009667503,"about_ca_topic_score_gemma":0.0000024403578,"teacher_disagreement_score":0.02872997,"about_ca_system_score_codex":0.000008503339,"about_ca_system_score_gemma":0.000006984098,"threshold_uncertainty_score":0.49532107},"labels":[],"label_agreement":null},{"id":"W2141015333","doi":"10.1007/s00373-015-1545-2","title":"Geometric Spanning Cycles in Bichromatic Point Sets","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","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 Toronto; University of Waterloo","funders":"","keywords":"Spanning tree; Plane (geometry); Point (geometry); Colored; Cycle basis; Enhanced Data Rates for GSM Evolution","score_opus":0.027968230855121273,"score_gpt":0.2527124176888726,"score_spread":0.22474418683375133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141015333","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.9183454,0.0019293906,0.07758814,0.00038071643,0.0005774537,0.000103250546,5.536783e-7,0.000082895654,0.0009921975],"genre_scores_gemma":[0.9956398,0.000046400124,0.0041484176,0.00010525927,0.0000078980975,0.0000072620282,0.0000032274156,0.0000037759553,0.000037983235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915034,0.00004210915,0.00018242109,0.0002126798,0.00024790937,0.00016452887],"domain_scores_gemma":[0.99951077,0.000074717995,0.000054863278,0.00016198533,0.000078390316,0.00011926463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004319278,0.00009094508,0.0001252411,0.00060417096,0.00006175926,0.000114005634,0.00017840767,0.000039971717,0.0000010934414],"category_scores_gemma":[0.00007831409,0.00008804824,0.000024692408,0.0022738709,0.000016206666,0.00031795315,0.0001212101,0.00008232578,0.0000071283284],"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.000004083292,0.00019767623,0.024298465,0.000033599987,0.000013121291,0.000040843264,0.001323661,0.0016432564,0.00003556397,0.9228125,0.0019664469,0.04763076],"study_design_scores_gemma":[0.00091423385,0.0001621764,0.073473744,0.000024414201,0.0000043542054,0.000037569902,0.00010906326,0.081881806,0.0001708177,0.8421624,0.0008352061,0.00022423177],"about_ca_topic_score_codex":0.000029694427,"about_ca_topic_score_gemma":0.0000027250405,"teacher_disagreement_score":0.08065014,"about_ca_system_score_codex":0.000032642765,"about_ca_system_score_gemma":0.000052731728,"threshold_uncertainty_score":0.3590503},"labels":[],"label_agreement":null},{"id":"W2144158529","doi":"10.1007/s00373-011-1063-9","title":"Coloring Eulerian Triangulations of the Klein Bottle","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","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":"Simon Fraser University","funders":"","keywords":"Klein bottle; Eulerian path; Mathematics; Combinatorics; Chromatic scale; Triangulation; Bottle; Graph; Point set triangulation; Delaunay triangulation; Geometry; Mathematical analysis; Lagrangian","score_opus":0.026032249480378265,"score_gpt":0.18251163230335274,"score_spread":0.15647938282297447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144158529","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.9892771,0.00059017976,0.002369238,0.00024547314,0.0011977657,0.00015909222,0.0000017302841,0.00009848464,0.006060908],"genre_scores_gemma":[0.99831575,0.00002766663,0.0014859072,0.000046634697,8.6111334e-7,0.000005345603,1.847336e-7,0.0000036185268,0.00011405336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.000033216296,0.00015654597,0.00014512199,0.00012874612,0.000121192126],"domain_scores_gemma":[0.9994216,0.000026946229,0.000080994214,0.00035301238,0.00006749554,0.000049931605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001791747,0.00006798051,0.00009571097,0.00006908291,0.00016148204,0.000023552344,0.0003293287,0.00003816225,0.0000038687795],"category_scores_gemma":[0.000018682,0.00004816468,0.0000557505,0.0006218768,0.00006644801,0.00009844944,0.00014606708,0.00006723518,0.0000013423125],"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.000001258434,0.00004648469,0.0071984497,0.000004891206,0.000006703073,4.958786e-7,0.0004964187,0.0000015741547,0.000218175,0.9912049,0.00013265299,0.00068799517],"study_design_scores_gemma":[0.00036962348,0.000067645225,0.03741642,0.00001568191,0.000009032143,0.000003320996,0.00003588921,0.00075669994,0.0028310835,0.9580033,0.00040517832,0.00008611914],"about_ca_topic_score_codex":0.000060745115,"about_ca_topic_score_gemma":0.0000031776785,"teacher_disagreement_score":0.033201598,"about_ca_system_score_codex":0.0000036606946,"about_ca_system_score_gemma":0.000021071231,"threshold_uncertainty_score":0.19640987},"labels":[],"label_agreement":null},{"id":"W2147365795","doi":"10.1007/s00373-011-1047-9","title":"Finding a Sun in Building-Free Graphs","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Experimental Program to Stimulate Competitive Research; National Security Agency; National Science Foundation","keywords":"Combinatorics; Indifference graph; Mathematics; Chordal graph; Pathwidth; Cograph; Discrete mathematics; Clique-sum; Split graph; Vertex (graph theory); Graph product; Maximal independent set; 1-planar graph; Graph; Line graph","score_opus":0.03634612366228012,"score_gpt":0.26875202869400155,"score_spread":0.23240590503172143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147365795","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.9655979,0.0012219273,0.025579426,0.00012317709,0.000538346,0.00028450356,0.0000028024724,0.00023869572,0.0064132125],"genre_scores_gemma":[0.9917524,0.00022799986,0.007842125,0.000060744856,0.0000029318007,0.000027897955,4.1129124e-7,0.0000135393675,0.00007193681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839133,0.00008618096,0.00022583261,0.0004684457,0.00030781297,0.0005204078],"domain_scores_gemma":[0.99878055,0.00011454292,0.000064863096,0.00080271874,0.000068725756,0.00016859807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005627275,0.00017767835,0.00020534857,0.0006472078,0.00016790634,0.00008229475,0.0013557585,0.000087221655,0.00000729787],"category_scores_gemma":[0.000083593986,0.00017286884,0.000071247356,0.0020533905,0.00013181279,0.0004961222,0.0006700232,0.0003138418,0.0000040374816],"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.000009121949,0.000092487775,0.035804674,0.000012671692,0.000007463188,0.00005285062,0.0006346377,5.8897916e-7,0.00009918202,0.95983756,0.00006247008,0.0033863022],"study_design_scores_gemma":[0.0006789148,0.00014703776,0.026099557,0.000021091893,0.0000023027153,0.000015689875,0.000052309395,0.00045519345,0.00069215614,0.97141683,0.00020811644,0.00021082195],"about_ca_topic_score_codex":0.000057891586,"about_ca_topic_score_gemma":0.00001225026,"teacher_disagreement_score":0.026154503,"about_ca_system_score_codex":0.000025350902,"about_ca_system_score_gemma":0.00002841798,"threshold_uncertainty_score":0.70493865},"labels":[],"label_agreement":null},{"id":"W2150037097","doi":"10.1007/s00373-010-0957-2","title":"Every Large Point Set contains Many Collinear Points or an Empty Pentagon","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Carleton University","funders":"","keywords":"Pentagon; Conjecture; Integer (computer science); Set (abstract data type); Plane (geometry); Point (geometry)","score_opus":0.01543672156284936,"score_gpt":0.26288012353766144,"score_spread":0.24744340197481207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150037097","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.87591684,0.00007092629,0.12128166,0.0004888683,0.0016204342,0.00020060604,0.000020525047,0.00013527086,0.00026488653],"genre_scores_gemma":[0.9932167,0.00004595262,0.0056825797,0.0006458363,0.00004943072,0.000012412851,0.000040437215,0.000008725425,0.00029791018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885,0.000055376284,0.00020577449,0.0003635958,0.00027134852,0.0002539269],"domain_scores_gemma":[0.9991443,0.00007053357,0.00007878589,0.00035102767,0.00016197616,0.00019334652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043615932,0.000149416,0.00015404563,0.00015569251,0.00031064267,0.00022844477,0.0003403769,0.000089678644,0.00003971681],"category_scores_gemma":[0.000036391288,0.00013004463,0.000050349336,0.0005903863,0.000029076176,0.00056209724,0.00015768876,0.00021454506,0.000009880959],"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.00002581845,0.00029527405,0.003435378,0.000013832004,0.000015699807,0.000028478189,0.00040366195,0.000049804847,0.0004570369,0.9919471,0.0013960508,0.0019318758],"study_design_scores_gemma":[0.004592326,0.0015254641,0.048697434,0.000022956108,0.00003927741,0.00025925104,0.00034444203,0.39788252,0.0036366093,0.50043744,0.041465655,0.001096612],"about_ca_topic_score_codex":0.000017070497,"about_ca_topic_score_gemma":0.00004658676,"teacher_disagreement_score":0.49150965,"about_ca_system_score_codex":0.000014589002,"about_ca_system_score_gemma":0.00008530721,"threshold_uncertainty_score":0.53030664},"labels":[],"label_agreement":null},{"id":"W2151378894","doi":"10.1007/s00373-010-0929-6","title":"Rigidity and Separation Indices of Graphs in Surfaces","year":2010,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","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":"Simon Fraser University","funders":"","keywords":"Embedding; Mathematics; Bounded function; Combinatorics; Rigidity (electromagnetism); Book embedding; 1-planar graph; Euler characteristic; Discrete mathematics; Chordal graph; Graph; Computer science; Mathematical analysis","score_opus":0.008431144429055935,"score_gpt":0.23632081290382262,"score_spread":0.2278896684747667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151378894","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.9983978,0.0006363504,0.000084422056,0.00010811449,0.0003595487,0.00007184935,0.0000012513963,0.000038937676,0.00030168565],"genre_scores_gemma":[0.99871886,0.00026982147,0.00096342235,0.000028801405,5.526325e-7,0.0000035100547,0.0000010143955,0.0000029059995,0.000011109326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925774,0.000030156234,0.00019098372,0.00023099873,0.00015483434,0.00013527612],"domain_scores_gemma":[0.99950194,0.000064120584,0.00009380158,0.00020893515,0.00006283869,0.00006834735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038020752,0.00009289541,0.00014671599,0.00021814958,0.000083271,0.000064066466,0.00017294793,0.00008139094,0.0000010962804],"category_scores_gemma":[0.000017685688,0.0000816195,0.000023101136,0.000620277,0.00010740333,0.00024563205,0.000087084685,0.00016328495,4.1481792e-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.0000017944126,0.000060296305,0.12501211,0.000017282215,0.0000037527193,0.0000013833657,0.0003074312,0.000002747396,0.002211494,0.87120295,0.000052146836,0.0011266097],"study_design_scores_gemma":[0.00039455548,0.00008671694,0.08993158,0.000011490951,0.0000036624638,0.0000048169927,0.000021911206,0.0022362142,0.0018042808,0.9052764,0.00012108029,0.00010725581],"about_ca_topic_score_codex":0.00015325799,"about_ca_topic_score_gemma":0.00007415137,"teacher_disagreement_score":0.035080537,"about_ca_system_score_codex":0.0000015407044,"about_ca_system_score_gemma":0.00001763238,"threshold_uncertainty_score":0.33283466},"labels":[],"label_agreement":null},{"id":"W2154562890","doi":"10.1007/s00373-009-0853-9","title":"Minimum Cost Homomorphism Dichotomy for Oriented Cycles","year":2009,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"","keywords":"Homomorphism; Combinatorics; Digraph; Mathematics; Conjecture; Vertex (graph theory); Graph; Algebra homomorphism; Discrete mathematics; Graph homomorphism; Line graph; Graph power","score_opus":0.017969535926905988,"score_gpt":0.2812984227620912,"score_spread":0.26332888683518524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154562890","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.26600733,0.0025374682,0.72102314,0.002621514,0.0012578211,0.0020748437,0.000032644362,0.0006802153,0.0037650112],"genre_scores_gemma":[0.9944737,0.00020052044,0.004644912,0.00030842164,0.00001294256,0.00007685198,0.0000063666207,0.000011010546,0.0002653016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861586,0.000042346972,0.00018853297,0.00042655919,0.00027634806,0.0004503424],"domain_scores_gemma":[0.99888045,0.00017851927,0.00006661787,0.0004898216,0.00017662611,0.00020798546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002898693,0.00017058261,0.00020146983,0.0002216227,0.00031707523,0.0001225501,0.00059519534,0.000074314696,0.0000019078168],"category_scores_gemma":[0.000056301968,0.00015872985,0.00008652658,0.00089760456,0.00010419758,0.0003384531,0.0001091525,0.00015374187,0.0000036024671],"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.000018581655,0.00011473295,0.0006525428,0.000008294314,0.000008809053,0.000010136179,0.00011665099,0.0000012241994,0.0001897164,0.96985924,0.00078167475,0.028238405],"study_design_scores_gemma":[0.0011500893,0.00039909213,0.0028994603,0.000012520665,0.000005824257,0.000010773423,0.00003011565,0.0023601404,0.00064857496,0.97386295,0.018399606,0.00022083225],"about_ca_topic_score_codex":0.0000020807138,"about_ca_topic_score_gemma":5.910804e-7,"teacher_disagreement_score":0.72846633,"about_ca_system_score_codex":0.000021999107,"about_ca_system_score_gemma":0.000030751817,"threshold_uncertainty_score":0.6472815},"labels":[],"label_agreement":null},{"id":"W2158086649","doi":"10.1007/s00373-014-1467-4","title":"Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences","year":2014,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Algorithms and Data Compression","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":"McGill University; Queen's University","funders":"","keywords":"Mathematics; Matching (statistics); Combinatorics; Real line; Line (geometry); Discrete mathematics; Algorithm; Statistics","score_opus":0.013452449097658995,"score_gpt":0.25548876252894354,"score_spread":0.24203631343128454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158086649","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.09101355,0.00020344314,0.90640384,0.0011367099,0.0005690776,0.00023737932,0.000011705385,0.000103795595,0.00032050253],"genre_scores_gemma":[0.9852419,0.000017250799,0.014135978,0.00043783616,0.0000705073,0.000015132936,0.0000060800053,0.000009696165,0.00006561177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987369,0.000053082502,0.00022239254,0.00041272977,0.00025018468,0.00032470192],"domain_scores_gemma":[0.9987926,0.0003938101,0.0001112287,0.0004925058,0.00007754725,0.00013230114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056305237,0.0001651719,0.000206707,0.00006076982,0.00063075416,0.0003423042,0.0010058949,0.000041602518,5.1132196e-7],"category_scores_gemma":[0.000030328723,0.00011296833,0.000061053746,0.0003758113,0.000060325412,0.00024860076,0.0004586549,0.00013023554,0.0000035498654],"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.0000023274977,0.000016788335,0.0035529255,0.000018777324,0.000008746626,8.057809e-7,0.00039450976,0.00001275537,0.000018515977,0.9418429,0.0012777206,0.052853234],"study_design_scores_gemma":[0.00062965293,0.000216162,0.009990478,0.00006768542,0.000015677351,0.0000046226314,0.000067842375,0.13917029,0.00011726147,0.7967893,0.052592803,0.00033823767],"about_ca_topic_score_codex":0.00004973652,"about_ca_topic_score_gemma":0.0000018410487,"teacher_disagreement_score":0.89422834,"about_ca_system_score_codex":0.000012884901,"about_ca_system_score_gemma":0.00001522351,"threshold_uncertainty_score":0.48513147},"labels":[],"label_agreement":null},{"id":"W2248242758","doi":"10.1007/s00373-016-1749-0","title":"A Refinement of Theorems on Vertex-Disjoint Chorded Cycles","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","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 British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Disjoint sets; Discrete mathematics; Graph","score_opus":0.032110673911330226,"score_gpt":0.28072310640791387,"score_spread":0.24861243249658366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248242758","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.9892901,0.00008196471,0.0002255044,0.00039174297,0.0000931634,0.00016964562,0.000016305681,0.000053674154,0.009677907],"genre_scores_gemma":[0.99931926,0.00017399278,0.00014114767,0.00003538702,0.000003373614,0.000036838715,9.850515e-7,0.000011610848,0.00027741792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993352,0.000033507895,0.0002009047,0.00015877353,0.00013873329,0.00013283503],"domain_scores_gemma":[0.9991895,0.0002844551,0.00009739539,0.0003222038,0.000049053448,0.000057389396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022522423,0.00010948422,0.000166249,0.000079743855,0.000084396626,0.0000076627575,0.00011548832,0.000047856298,0.000053624914],"category_scores_gemma":[0.00006436038,0.00006767275,0.00007069684,0.00018185866,0.00010655876,0.000026396328,0.000035843565,0.00005010406,0.000005077047],"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.000019802099,0.0002524368,0.00050775066,0.000024505098,0.000023000146,4.5939547e-7,0.00008255816,3.0038418e-8,0.0016230937,0.9924758,0.0009193465,0.0040712105],"study_design_scores_gemma":[0.00059996423,0.00015105156,0.001343891,0.00006607785,0.000022078957,0.0000012964366,0.000065088054,0.0000029475968,0.0057844063,0.99065113,0.0012124927,0.000099578254],"about_ca_topic_score_codex":0.0000031860054,"about_ca_topic_score_gemma":0.0000011568184,"teacher_disagreement_score":0.010029155,"about_ca_system_score_codex":0.00000867394,"about_ca_system_score_gemma":0.0000075372404,"threshold_uncertainty_score":0.2759615},"labels":[],"label_agreement":null},{"id":"W2287453773","doi":"10.1007/s00373-017-1768-5","title":"Burning Graphs: A Probabilistic Perspective","year":2017,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","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":"Dalhousie University; Toronto Metropolitan University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Probabilistic logic; Random graph; Combinatorics; Binomial (polynomial); Graph; Mathematics; Perspective (graphical); Discrete mathematics; Random regular graph; Sequence (biology); Computer science; Chordal graph; 1-planar graph; Statistics; Geometry","score_opus":0.0512860620082349,"score_gpt":0.3244218014708142,"score_spread":0.2731357394625793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2287453773","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.9541438,0.0034950487,0.0005893121,0.0007528431,0.0012084466,0.0018356004,0.00012261563,0.00055586913,0.037296433],"genre_scores_gemma":[0.9978159,0.0005049328,0.0006582987,0.000024471434,0.00002654649,0.00036493913,0.000015740208,0.000050313676,0.000538856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828184,0.00009444086,0.00033720708,0.0006920543,0.00026250098,0.00033196167],"domain_scores_gemma":[0.99748164,0.00029572166,0.000481291,0.0012374686,0.00034073147,0.00016314123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050710666,0.00041394503,0.0005472704,0.00022718387,0.0007707943,0.00027110605,0.0006122411,0.0003668901,0.000013730472],"category_scores_gemma":[0.00046026014,0.00039204527,0.00028152898,0.000187922,0.00034464037,0.000068585345,0.0006033794,0.00092179416,0.0000048047887],"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.000008836215,0.00022126641,0.00048288415,0.00030193618,0.00011605164,0.0000076059614,0.0011072578,0.000001567519,0.000006966855,0.9968097,0.0007076976,0.00022822143],"study_design_scores_gemma":[0.0003248135,0.000054005915,0.0005972008,0.00020853379,0.00023169216,0.000011948135,0.00056643045,0.00007855305,0.000017961023,0.9968793,0.0005877379,0.0004418606],"about_ca_topic_score_codex":0.000062260784,"about_ca_topic_score_gemma":0.000010142841,"teacher_disagreement_score":0.04367207,"about_ca_system_score_codex":0.00005798151,"about_ca_system_score_gemma":0.00008355294,"threshold_uncertainty_score":0.99985313},"labels":[],"label_agreement":null},{"id":"W2335881901","doi":"10.1007/s00373-017-1816-1","title":"New Bounds for Facial Nonrepetitive Colouring","year":2017,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"University of Ottawa; Carleton University","funders":"Ontario Ministry of Research and Innovation; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Mathematics","score_opus":0.024942534201698157,"score_gpt":0.26368803032448707,"score_spread":0.23874549612278892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335881901","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.22130255,0.018872747,0.68953675,0.0069444533,0.042173855,0.0042555695,0.00020678034,0.00219671,0.014510561],"genre_scores_gemma":[0.9662877,0.00087501516,0.029739646,0.00022344616,0.00004259211,0.00013097987,0.00002845303,0.000040198698,0.0026320135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981921,0.000030360032,0.00028834096,0.0008056883,0.00028908995,0.00039445175],"domain_scores_gemma":[0.9980882,0.000090481044,0.00032655674,0.0009875802,0.00024983645,0.00025735344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004009637,0.00032520856,0.0004190219,0.0002043236,0.0006939959,0.0009959688,0.0011231517,0.0003365615,0.000001718948],"category_scores_gemma":[0.00007522099,0.0003231459,0.00021754179,0.00012428137,0.000085349835,0.00016654651,0.0013907315,0.0004190936,0.0000031059865],"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.000008115819,0.00004277467,0.00050216954,0.000087926295,0.000051757783,0.0000079419115,0.00034013504,0.000012522662,0.000017105811,0.9834912,0.0037995372,0.011638859],"study_design_scores_gemma":[0.00079056644,0.00015104486,0.0005553437,0.00012129101,0.000033715984,0.0000059399426,0.0000099637,0.0019965277,0.0001888816,0.9873541,0.0083909985,0.00040164846],"about_ca_topic_score_codex":0.00019102712,"about_ca_topic_score_gemma":0.000010373747,"teacher_disagreement_score":0.7449851,"about_ca_system_score_codex":0.000027317894,"about_ca_system_score_gemma":0.00029980554,"threshold_uncertainty_score":0.99992204},"labels":[],"label_agreement":null},{"id":"W2460448338","doi":"10.1007/s00373-016-1724-9","title":"Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Indifference graph; 1-planar graph; Pathwidth; Chordal graph; Discrete mathematics; Cograph; Graph; Line graph; Computer science","score_opus":0.01344883607917286,"score_gpt":0.23785468601881501,"score_spread":0.22440584993964216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460448338","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.99236375,0.0012994397,0.0047080624,0.00050268514,0.0001432931,0.00039994958,0.000006892538,0.00014940677,0.00042654958],"genre_scores_gemma":[0.9975903,0.0013038089,0.00082943914,0.00010106591,0.0000034314228,0.00007465707,9.89641e-7,0.000023815277,0.00007248337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744445,0.00025390746,0.00035208798,0.0008423038,0.0003992216,0.00070801785],"domain_scores_gemma":[0.9976689,0.0011813204,0.00012797913,0.0006453676,0.0001384312,0.00023799887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009461533,0.00033267043,0.00041395042,0.0011437957,0.00017442745,0.00016240262,0.0006217001,0.00015617268,0.0000024903397],"category_scores_gemma":[0.00021808391,0.00024058894,0.000059542293,0.002853213,0.00041204473,0.0009692855,0.00045546162,0.00044282238,0.0000022487477],"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.000041621035,0.00013302421,0.37634742,0.00003300173,0.000013320135,0.00005882655,0.0006630372,0.0000035045537,0.00020347706,0.609119,0.000014881464,0.0133689],"study_design_scores_gemma":[0.0022906505,0.00040257958,0.20217241,0.00016285425,0.0000042643,0.000013951043,0.000052945856,0.00035618164,0.00039545228,0.79358363,0.00020734084,0.00035775665],"about_ca_topic_score_codex":0.00008032319,"about_ca_topic_score_gemma":0.0001250123,"teacher_disagreement_score":0.18446463,"about_ca_system_score_codex":0.000035202414,"about_ca_system_score_gemma":0.00006232228,"threshold_uncertainty_score":0.9810932},"labels":[],"label_agreement":null},{"id":"W2467377624","doi":"10.1007/s00373-016-1684-0","title":"On the Real Roots of $$\\sigma $$ σ -Polynomials","year":2016,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Combinatorial Mathematics","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":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Chromatic polynomial; Zero (linguistics); Sigma; Closure (psychology); Polynomial; Chromatic scale; Degree (music); Interval (graph theory); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.03330590376952604,"score_gpt":0.27956894949983985,"score_spread":0.24626304573031382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467377624","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.98862803,0.00008093064,0.0011596008,0.00054981996,0.00068047125,0.000364237,0.000012016977,0.00010056382,0.008424307],"genre_scores_gemma":[0.9989013,0.0002332391,0.00031616664,0.00003136395,0.00001910922,0.000029772094,2.4948915e-7,0.00003315834,0.00043564485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869835,0.00008498121,0.00040003224,0.00021822752,0.00034413725,0.00025427202],"domain_scores_gemma":[0.9960302,0.0028686856,0.00028480066,0.00061525067,0.000118519085,0.000082549246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000459778,0.00020515859,0.0003567351,0.00008425162,0.00012590701,0.000017379172,0.00029987135,0.00010447323,0.000028918696],"category_scores_gemma":[0.0008803897,0.00010677975,0.00010147283,0.00027409734,0.00016455472,0.00007266051,0.00010590384,0.00011056694,0.0000063812377],"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.000022249345,0.00015658366,0.00029634073,0.000044178858,0.000029788489,0.0000020219545,0.00009522631,8.838465e-8,0.0011320186,0.99549663,0.0017303167,0.0009945657],"study_design_scores_gemma":[0.00072324986,0.00023419243,0.00030899342,0.000115185685,0.000030048715,0.000002561529,0.000062290834,0.0000059493523,0.0054707103,0.9925856,0.00030471262,0.0001564868],"about_ca_topic_score_codex":0.0000051469474,"about_ca_topic_score_gemma":0.0000013959879,"teacher_disagreement_score":0.010273244,"about_ca_system_score_codex":0.000033561235,"about_ca_system_score_gemma":0.000025953683,"threshold_uncertainty_score":0.4354352},"labels":[],"label_agreement":null},{"id":"W2522164511","doi":"10.1007/s00373-018-1964-y","title":"Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of Regina; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Graph; Line graph; Upper and lower bounds; Set (abstract data type); Line (geometry); Graph power","score_opus":0.017773008886015833,"score_gpt":0.2793316129552443,"score_spread":0.26155860406922843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522164511","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.98062575,0.0010635987,0.015714677,0.00012245859,0.00031695364,0.00021336746,0.000007841709,0.00013129103,0.0018040752],"genre_scores_gemma":[0.99590695,0.0010389253,0.002797145,0.0001049898,0.000010349985,0.00001167683,0.0000017352894,0.000025376828,0.00010282565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802953,0.00012053233,0.00035376626,0.0006325539,0.000333207,0.00053038273],"domain_scores_gemma":[0.99837834,0.00030538428,0.00016009541,0.0005996989,0.00028342876,0.00027304052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000717347,0.00030721803,0.00040370453,0.00025663117,0.00045587728,0.00019161744,0.0005246199,0.00013786508,0.000008983465],"category_scores_gemma":[0.000062099156,0.00025862124,0.00009041679,0.0014349278,0.000751519,0.0006661124,0.00065176445,0.00032186607,0.0000035289477],"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.000020422312,0.000061814295,0.0714749,0.000054884833,0.000040918065,0.000005925509,0.0011168047,3.5585478e-7,0.00051109976,0.914929,0.000092777096,0.01169111],"study_design_scores_gemma":[0.0007843784,0.00021424201,0.007334566,0.00006420195,0.000010900205,0.0000952778,0.00016172035,0.0012397369,0.002629385,0.9867805,0.00038044705,0.00030461716],"about_ca_topic_score_codex":0.00006182706,"about_ca_topic_score_gemma":0.000008472935,"teacher_disagreement_score":0.071851544,"about_ca_system_score_codex":0.000010936055,"about_ca_system_score_gemma":0.000028963268,"threshold_uncertainty_score":0.9999866},"labels":[],"label_agreement":null},{"id":"W2604526143","doi":"10.1007/s00373-018-1943-3","title":"On Well-Covered Cartesian Products","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Saint Mary's University","funders":"Simons Foundation","keywords":"Cartesian product; Mathematics; Combinatorics; Cartesian coordinate system; Graph; Product (mathematics); Discrete mathematics; Geometry","score_opus":0.01298566698275696,"score_gpt":0.2510953005535228,"score_spread":0.23810963357076584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604526143","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.90449655,0.0008761437,0.032447513,0.0024926339,0.002686007,0.00077443663,0.000005710096,0.00068518484,0.055535797],"genre_scores_gemma":[0.99817324,0.000048117472,0.0008797903,0.0002266977,0.000024310128,0.000011105548,8.5435994e-7,0.000010770607,0.0006251324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868333,0.00006254957,0.0001181916,0.00046167604,0.000320789,0.00035346125],"domain_scores_gemma":[0.998859,0.00008568607,0.000042710868,0.0006941456,0.00018527679,0.0001332213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025608216,0.00013858844,0.00013039273,0.00018763442,0.00028119888,0.00011732172,0.0005753801,0.000051333962,0.0000072699468],"category_scores_gemma":[0.00007022629,0.00012304353,0.00003333024,0.0011419907,0.00018657873,0.00024857998,0.00019604168,0.0001615698,0.00007236363],"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.000011320719,0.00006382187,0.0004703115,0.000008388704,0.0000075263697,0.000008997494,0.00014569805,4.1308274e-7,0.00018264884,0.9941023,0.0014660527,0.00353251],"study_design_scores_gemma":[0.00037163513,0.00061386346,0.001803203,0.000010696584,0.0000021520207,0.000009459997,0.0000131490215,0.00047448397,0.0044433163,0.9859786,0.0061114407,0.00016797804],"about_ca_topic_score_codex":0.0000052935666,"about_ca_topic_score_gemma":0.0000012317548,"teacher_disagreement_score":0.09367665,"about_ca_system_score_codex":0.000018442972,"about_ca_system_score_gemma":0.000036358633,"threshold_uncertainty_score":0.50175697},"labels":[],"label_agreement":null},{"id":"W2618333023","doi":"10.1007/s00373-017-1798-z","title":"Fractional $$K_{4}$$ K 4 -Covers","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","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 Manitoba","funders":"","keywords":"Combinatorics; Mathematics; Disjoint sets; Graph; Pairwise comparison; Discrete mathematics","score_opus":0.03590228704043262,"score_gpt":0.3080626051655043,"score_spread":0.2721603181250717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618333023","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.9551798,0.00020319496,0.00019930782,0.0002106907,0.0015297399,0.000102871025,0.000009912017,0.00007150457,0.04249294],"genre_scores_gemma":[0.9987353,0.00015287206,0.00026833353,0.00008328966,0.000032323172,0.000005648285,0.000001140305,0.000013933549,0.0007071526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930584,0.000018840212,0.00012976369,0.0001784934,0.0001944219,0.00017266104],"domain_scores_gemma":[0.99909353,0.0001323946,0.00014232632,0.000496075,0.000054208638,0.00008146364],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00018505569,0.00012470155,0.00015693637,0.000057263373,0.0013551845,0.00012430822,0.0002604654,0.000093974726,0.000043578242],"category_scores_gemma":[0.00018597135,0.000103477854,0.00008054529,0.000042346976,0.00017300317,0.00016510139,0.00015364209,0.00016832403,0.0000023219634],"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.000010667213,0.00003240936,0.012683302,0.000015551406,0.000031688258,0.0000061113683,0.00012074388,9.18916e-8,0.000011294524,0.9836492,0.002500633,0.0009383188],"study_design_scores_gemma":[0.00043643045,0.000036341058,0.022279352,0.00000933612,0.000024110619,0.000012218314,0.000053275206,0.000020881802,0.00007472484,0.968858,0.008056957,0.00013835813],"about_ca_topic_score_codex":0.000014589013,"about_ca_topic_score_gemma":0.0000021198696,"teacher_disagreement_score":0.04355547,"about_ca_system_score_codex":0.00001051683,"about_ca_system_score_gemma":0.000011645412,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W2621537455","doi":"10.1007/s00373-017-1820-5","title":"On Saito’s Conjecture and the Oberly–Sumner Conjectures","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Analytic Number Theory Research","field":"Mathematics","cited_by":2,"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":"Banff International Research Station for Mathematical Innovation and Discovery; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Collatz conjecture; Discrete mathematics","score_opus":0.030401473161676764,"score_gpt":0.316875703183523,"score_spread":0.28647423002184624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621537455","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.9624629,0.000788668,0.00008226217,0.0024147215,0.00032570344,0.0004328725,0.000010322177,0.00005830161,0.033424232],"genre_scores_gemma":[0.99737144,0.00019619503,0.000031365053,0.00020890134,0.000022546212,0.000016071606,8.6407385e-7,0.000020862995,0.002131765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893546,0.00011649433,0.00015312675,0.00024278996,0.0002981811,0.00025392586],"domain_scores_gemma":[0.9979203,0.0010499675,0.00012702994,0.0007290674,0.000066321496,0.00010735031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070796086,0.00017992253,0.00029659868,0.000054553177,0.0008928698,0.00030540512,0.00037114733,0.00011027593,0.000029325638],"category_scores_gemma":[0.00067511207,0.000101962505,0.00007639039,0.000061415376,0.0008301682,0.000060813752,0.00018532637,0.00035142252,0.000005635023],"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.000083055704,0.000038478924,0.002008522,0.00003531201,0.00006647061,0.000011491693,0.0003624153,7.872108e-8,0.0000026899163,0.9914501,0.0049096528,0.0010317415],"study_design_scores_gemma":[0.0021613836,0.00008822169,0.0020688502,0.000025730102,0.000054105367,0.000021261996,0.00012961777,0.000079678866,0.00005611323,0.9936713,0.0015063463,0.00013738994],"about_ca_topic_score_codex":0.00007775735,"about_ca_topic_score_gemma":0.000022731008,"teacher_disagreement_score":0.03490851,"about_ca_system_score_codex":0.000012562541,"about_ca_system_score_gemma":0.000020977026,"threshold_uncertainty_score":0.6867323},"labels":[],"label_agreement":null},{"id":"W2739099791","doi":"10.1007/s00373-017-1833-0","title":"On Color Critical Graphs with Large Adaptable Chromatic Numbers","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Trent University","funders":"","keywords":"Combinatorics; Mathematics; Critical graph; Monochromatic color; Chromatic scale; Edge coloring; Discrete mathematics; Graph; Colored; Graph power; Line graph; Physics","score_opus":0.01692756262995187,"score_gpt":0.28940403621936756,"score_spread":0.2724764735894157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739099791","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.91172665,0.00063070643,0.060225282,0.0018454115,0.0010447955,0.0006744861,0.00001897173,0.00042966686,0.023404004],"genre_scores_gemma":[0.9973833,0.00007034338,0.0020621102,0.00015422452,0.0000049030623,0.00004104236,9.777941e-7,0.000017753991,0.00026536407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813694,0.00007284296,0.00015789042,0.00049939833,0.00051408925,0.0006188255],"domain_scores_gemma":[0.99790984,0.00032446175,0.000088604975,0.0012539623,0.00014615027,0.00027696675],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042553217,0.00021198661,0.00025593123,0.00016703634,0.0013724959,0.00054389675,0.0011905892,0.00008148877,0.000011007463],"category_scores_gemma":[0.00021022472,0.00017071614,0.0000644958,0.00038344096,0.00039971463,0.0007051207,0.00036320565,0.00030143964,0.000018839251],"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.000028112414,0.00018755066,0.0030039158,0.00003214809,0.000019890498,0.000072752424,0.00010163611,0.0000020761258,0.000019024761,0.99561274,0.00033085173,0.0005892823],"study_design_scores_gemma":[0.0010418012,0.00071219786,0.005877303,0.000055566346,0.00000941097,0.000026188465,0.000051961182,0.0028460529,0.00016735955,0.98828256,0.0006692641,0.00026033068],"about_ca_topic_score_codex":0.00001953021,"about_ca_topic_score_gemma":0.000013521917,"teacher_disagreement_score":0.085656606,"about_ca_system_score_codex":0.000024109346,"about_ca_system_score_gemma":0.000051175528,"threshold_uncertainty_score":0.9999276},"labels":[],"label_agreement":null},{"id":"W2749343700","doi":"10.1007/s00373-018-1907-7","title":"A Meyniel-Type Condition for Bipancyclicity in Balanced Bipartite Digraphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","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":"Western University","funders":"","keywords":"Digraph; Bipartite graph; Order (exchange); Strongly connected component; Directed graph; Complete bipartite graph","score_opus":0.03134306007140081,"score_gpt":0.3202403442278282,"score_spread":0.2888972841564274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2749343700","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.9964691,0.00027380482,0.00025034635,0.000050056122,0.0008486085,0.00035791445,0.000019411476,0.0000792642,0.0016515225],"genre_scores_gemma":[0.9989557,0.00016339285,0.00054005714,0.00012512229,0.00004107938,0.000041111838,0.000008209832,0.000021225302,0.00010407066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989472,0.000045933743,0.00027796515,0.00027415698,0.00014297802,0.0003117887],"domain_scores_gemma":[0.9991417,0.0002551696,0.000107004234,0.00026975828,0.00014438904,0.00008198844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031051217,0.00017608388,0.0002791719,0.00021050443,0.00028003746,0.000033289496,0.0001433099,0.00013825817,0.000018106273],"category_scores_gemma":[0.00017031262,0.00015059582,0.000084317646,0.00058354525,0.00020047199,0.000099509016,0.00005865867,0.00012660441,0.0000011235746],"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.000075763266,0.00008063454,0.019497834,0.00006723343,0.00002571262,0.0000015210506,0.00066378084,8.9670245e-8,0.00017181532,0.9774439,0.0013824147,0.000589299],"study_design_scores_gemma":[0.0010795691,0.00031985788,0.013063464,0.000036094225,0.000028527922,0.0000040015784,0.000093168324,0.00014791432,0.0007281124,0.98128414,0.0030115275,0.00020362338],"about_ca_topic_score_codex":0.000012840496,"about_ca_topic_score_gemma":0.00003108901,"teacher_disagreement_score":0.00643437,"about_ca_system_score_codex":0.000014348239,"about_ca_system_score_gemma":0.000013577234,"threshold_uncertainty_score":0.61411196},"labels":[],"label_agreement":null},{"id":"W2754747707","doi":"10.1007/s00373-019-02034-1","title":"Chromatic symmetric functions and H-free graphs","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Claw; Combinatorics; Chromatic scale; Symmetric function; Vertex (graph theory); Mathematics; Graph; Engineering","score_opus":0.031105117977606036,"score_gpt":0.2729586057262394,"score_spread":0.24185348774863338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754747707","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.9529653,0.009875872,0.0053446265,0.000440233,0.0105051035,0.0032780133,0.00020135027,0.0011127036,0.016276775],"genre_scores_gemma":[0.99123687,0.0020763518,0.004598854,0.000042560725,0.000058350688,0.00021966228,0.000031522024,0.00018957548,0.0015462784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967707,0.00012612806,0.000871384,0.00092394865,0.0007145441,0.0005933332],"domain_scores_gemma":[0.99538815,0.001230869,0.00069536595,0.002094517,0.00028824044,0.0003028328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045635976,0.0008058636,0.0012810166,0.00085176073,0.00031037952,0.0002523929,0.0007418609,0.0007099876,0.00001654582],"category_scores_gemma":[0.0011250344,0.00078292575,0.00027950434,0.0010967775,0.0002135682,0.00016393709,0.0021388356,0.0012193128,0.000016330392],"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.000009847514,0.00031273675,0.0008885492,0.0026748339,0.0002032581,0.00001380069,0.0002616748,0.000003546561,0.00000728852,0.99150985,0.003525556,0.000589027],"study_design_scores_gemma":[0.0014496553,0.0002195616,0.00039541733,0.00042812838,0.00046513198,0.000054776177,0.00025384285,0.000665267,0.000023143071,0.99476105,0.0004682584,0.00081577786],"about_ca_topic_score_codex":0.000020734607,"about_ca_topic_score_gemma":0.000003954743,"teacher_disagreement_score":0.038271524,"about_ca_system_score_codex":0.000111496134,"about_ca_system_score_gemma":0.00011320976,"threshold_uncertainty_score":0.9994622},"labels":[],"label_agreement":null},{"id":"W2783369107","doi":"10.1007/s00373-011-1019-0","title":"Algorithmic Folding Complexity","year":2011,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Algorithms and Data Compression","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":"Equidistant; Fold (higher-order function); Mathematics; Upper and lower bounds; Combinatorics; String (physics); Folding (DSP implementation); Sequence (biology); Binary number; Simple (philosophy); Geometry; Computer science; Mathematical analysis; Biology; Arithmetic","score_opus":0.05806883863181366,"score_gpt":0.2246883979558044,"score_spread":0.16661955932399072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783369107","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.122313775,0.0019806258,0.85632,0.00016911821,0.0024009757,0.0003137614,0.000013751006,0.0007350164,0.01575292],"genre_scores_gemma":[0.95340645,0.00017462295,0.046206247,0.00011626601,0.000013084997,0.000008947322,0.000003391484,0.000008320519,0.00006268897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990836,0.000028799408,0.00014915943,0.00031847405,0.00018015782,0.00023981901],"domain_scores_gemma":[0.99928963,0.000022613018,0.000060364142,0.00043941365,0.00005406676,0.0001339261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001544146,0.00012974004,0.00014256967,0.0000940569,0.00024272343,0.00009246709,0.0005600075,0.000053857028,0.000012971088],"category_scores_gemma":[0.0000064897654,0.00011300392,0.000044190147,0.00036215773,0.00006679994,0.00044229388,0.00045493396,0.0001216708,0.000009601174],"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.0000015078745,0.00006471114,0.0013684212,0.0000059696986,0.0000066216026,0.000012817799,0.00028520037,5.3885636e-8,0.000022654252,0.97738105,0.0004966392,0.020354342],"study_design_scores_gemma":[0.00038678182,0.00011515302,0.019137656,0.000014331971,0.000005584422,0.000026778984,0.000033058594,0.013626926,0.00034675628,0.96297944,0.0031009319,0.00022659435],"about_ca_topic_score_codex":0.00009903395,"about_ca_topic_score_gemma":0.000001229808,"teacher_disagreement_score":0.83109266,"about_ca_system_score_codex":0.000010331921,"about_ca_system_score_gemma":0.000015374522,"threshold_uncertainty_score":0.46081665},"labels":[],"label_agreement":null},{"id":"W2806119317","doi":"10.1007/s00373-023-02635-x","title":"Sieve Methods in Random Graph Theory","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Azrieli Foundation","keywords":"Mathematics; Combinatorics; Sieve (category theory); Corollary; Bipartite graph; Random graph; Discrete mathematics; Complement (music); Graph","score_opus":0.037174320559139766,"score_gpt":0.3555293950826113,"score_spread":0.3183550745234715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806119317","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.9810023,0.0012935149,0.0031608788,0.00010931616,0.00137707,0.00040799813,0.000008946663,0.0004017782,0.01223821],"genre_scores_gemma":[0.9954202,0.00081004656,0.0029378997,0.000109380446,0.000015936019,0.000042780124,0.0000037531045,0.000038069626,0.00062194344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840856,0.00043192468,0.00032254637,0.0002865609,0.00019206479,0.0003583251],"domain_scores_gemma":[0.99759734,0.0018294461,0.000082830215,0.00035403046,0.000043618744,0.000092722374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002390638,0.00020402655,0.00036945468,0.0004673989,0.00019189453,0.00003458646,0.00022037064,0.00015050964,0.000024198982],"category_scores_gemma":[0.00041812335,0.00016280357,0.00014147248,0.0014181882,0.00014838438,0.00007215325,0.00017315184,0.00027447252,0.0000026548435],"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.000055407043,0.000039159248,0.002656317,0.00005684634,0.00003761642,0.00001990421,0.0012190212,8.737019e-7,0.000053832107,0.98975354,0.0007472407,0.0053602406],"study_design_scores_gemma":[0.0015420733,0.000048397957,0.00443654,0.000022980052,0.000030212404,0.000007759636,0.00048901135,0.000054242508,0.00020947387,0.9919534,0.0009917101,0.00021422855],"about_ca_topic_score_codex":0.0000064158385,"about_ca_topic_score_gemma":0.0000026186533,"teacher_disagreement_score":0.0144179035,"about_ca_system_score_codex":0.00001137191,"about_ca_system_score_gemma":0.000015280624,"threshold_uncertainty_score":0.6638937},"labels":[],"label_agreement":null},{"id":"W2883056852","doi":"10.1007/s00373-018-1925-5","title":"On the Structure of (Even Hole, Kite)-Free Graphs","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Kite; Chordal graph; Vertex (graph theory); Split graph; Discrete mathematics; Graph; 1-planar graph; Geometry","score_opus":0.013030967221145003,"score_gpt":0.24866358694866922,"score_spread":0.23563261972752422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883056852","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.98917973,0.00037169468,0.0064324993,0.0007772744,0.0005571087,0.0002697161,0.000020004258,0.00009313791,0.0022988415],"genre_scores_gemma":[0.9990212,0.000063132655,0.0005968945,0.00020532258,0.00000992717,0.0000037787877,8.306295e-7,0.000010908564,0.00008803881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858266,0.000114232666,0.00017806265,0.00034037366,0.00046723598,0.00031744564],"domain_scores_gemma":[0.99801266,0.0003143647,0.000097471224,0.0012556812,0.00021741998,0.00010241841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028181216,0.00016236829,0.00017448913,0.0002195174,0.00029515987,0.00007351651,0.0016378835,0.00007688965,0.000015642181],"category_scores_gemma":[0.00013358214,0.000107747685,0.00007721521,0.0014701413,0.0004842871,0.00017678866,0.00049728993,0.00026122172,0.000003940894],"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.000013358447,0.000040145133,0.0008731069,0.000008841458,0.000017723502,0.000002623314,0.00024528982,0.0000014282817,0.0008180771,0.9949421,0.0011528543,0.0018844388],"study_design_scores_gemma":[0.00036899498,0.00043790968,0.0024243025,0.000015999736,0.00000406521,0.000004602447,0.000037947084,0.00031768347,0.006517857,0.9892022,0.00053957885,0.00012883324],"about_ca_topic_score_codex":0.000008306923,"about_ca_topic_score_gemma":0.000004964409,"teacher_disagreement_score":0.009841443,"about_ca_system_score_codex":0.000009706127,"about_ca_system_score_gemma":0.00002762592,"threshold_uncertainty_score":0.43938228},"labels":[],"label_agreement":null},{"id":"W2886292945","doi":"10.1007/s00373-019-02064-9","title":"On Rigidity of Unit-Bar Frameworks","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Differential Equations and Dynamical Systems","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":"University of British Columbia","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Infinitesimal; Rigidity (electromagnetism); Unit (ring theory); Bar (unit); Bipartite graph; Mathematics; Plane (geometry); Combinatorics; Geometry; Pure mathematics; Physics; Mathematical analysis; Graph; Quantum mechanics","score_opus":0.036954822076238736,"score_gpt":0.30713864260537976,"score_spread":0.270183820529141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886292945","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.91349334,0.00030660094,0.08023094,0.00004108024,0.0017947151,0.0005653522,0.000087483946,0.00008484802,0.0033956307],"genre_scores_gemma":[0.99870825,0.00015952183,0.0007376908,0.000019534085,0.000015242745,0.00002348223,0.000032346823,0.000028269422,0.0002756736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986723,0.000072188195,0.00042162932,0.00032967704,0.0003203815,0.00018383923],"domain_scores_gemma":[0.99816704,0.0005763218,0.00037675246,0.00063694594,0.00015495063,0.00008796829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016881197,0.00026033624,0.0005831905,0.00012409502,0.0000649097,0.00003529604,0.00021847336,0.00074381294,0.00002272858],"category_scores_gemma":[0.00019414896,0.00022144518,0.00017100519,0.00015548193,0.000066395405,0.000024957293,0.000270502,0.0010117686,0.0000055372966],"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.000013068845,0.00018555111,0.00093399454,0.0005367766,0.000049961807,9.437747e-7,0.00006138103,0.00009891177,0.0000041923013,0.9975065,0.00022248003,0.00038624054],"study_design_scores_gemma":[0.00034718777,0.00012120126,0.0005424298,0.00035305184,0.000058847163,5.3128986e-7,0.000031921118,0.0029485878,0.000025147097,0.9952266,0.00011520103,0.00022927788],"about_ca_topic_score_codex":0.000040286937,"about_ca_topic_score_gemma":0.0000019716956,"teacher_disagreement_score":0.08521488,"about_ca_system_score_codex":0.000026514008,"about_ca_system_score_gemma":0.000035890076,"threshold_uncertainty_score":0.90302724},"labels":[],"label_agreement":null},{"id":"W2894741972","doi":"10.1007/s00373-020-02174-9","title":"Which Graphs Occur as $$\\gamma $$-Graphs?","year":2020,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Split graph; Discrete mathematics; Dominating set; Pathwidth; Graph; Indifference graph; Line graph; Vertex (graph theory)","score_opus":0.027846297911901557,"score_gpt":0.2867018332296616,"score_spread":0.25885553531776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894741972","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.6901755,0.036530986,0.14813052,0.019910932,0.020787017,0.00809549,0.00040573932,0.007876278,0.068087555],"genre_scores_gemma":[0.9918352,0.003877051,0.0031091198,0.0005425773,0.000036124296,0.00021352194,0.00004710264,0.000089673704,0.00024962536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99396515,0.00039652907,0.00074398424,0.002310239,0.0014089408,0.0011751859],"domain_scores_gemma":[0.9950874,0.0003507626,0.0004250268,0.0024889074,0.00072055997,0.0009273282],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0008449104,0.00093752635,0.0010283411,0.001032949,0.0005642232,0.000918617,0.0040366836,0.0006977904,0.000020308886],"category_scores_gemma":[0.00028309392,0.0009509059,0.00050093344,0.004263699,0.00034456057,0.000525497,0.0054457467,0.0026417393,0.00007551681],"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.000034874225,0.00016197118,0.0029445582,0.00024927707,0.00015748787,0.00010919941,0.00049050746,0.000020070473,0.000069667396,0.9895486,0.0017689212,0.0044448716],"study_design_scores_gemma":[0.00077272713,0.00038291578,0.0023746106,0.00011444329,0.000043761123,0.00004277477,0.00007272451,0.0018875878,0.00032900908,0.989619,0.00334146,0.0010189482],"about_ca_topic_score_codex":0.00008905531,"about_ca_topic_score_gemma":0.00001859522,"teacher_disagreement_score":0.30165973,"about_ca_system_score_codex":0.00006892588,"about_ca_system_score_gemma":0.00039631707,"threshold_uncertainty_score":0.9996592},"labels":[],"label_agreement":null},{"id":"W2901689010","doi":"10.1007/s00373-020-02272-8","title":"Art Gallery Problem with Rook and Queen Vision","year":2021,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Division of Mathematical Sciences; European Commission; National Science Foundation","keywords":"Polyomino; Guard (computer science); Combinatorics; Square tiling; Square (algebra); Matching (statistics); Computer science; Irrational number; Queen (butterfly); Mathematics; Grid; Regular polygon; Geometry; Biology","score_opus":0.0074286925048228,"score_gpt":0.21510356266226568,"score_spread":0.20767487015744288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901689010","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.29011992,0.0046246033,0.69465166,0.0029761412,0.0014814695,0.00082902244,0.0000073269866,0.0003268508,0.004983038],"genre_scores_gemma":[0.963136,0.001949901,0.03333135,0.0002438287,0.000036309204,0.000056489785,0.00009022211,0.000018068056,0.0011378072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986688,0.000057975292,0.00019135018,0.0006040488,0.000313344,0.00016450095],"domain_scores_gemma":[0.9991671,0.000051249917,0.00011561293,0.00034228523,0.00020623844,0.00011750582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019800971,0.00021193268,0.00023352461,0.00017234204,0.00015727678,0.0006051956,0.00022622081,0.00014113178,0.0000025572838],"category_scores_gemma":[0.0000056568942,0.00018764,0.000044014385,0.0003968725,0.000038393253,0.00023645269,0.000760786,0.0002943012,0.0000012962996],"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.000021812299,0.00037265042,0.0042958623,0.00057554845,0.00016823024,0.00010488861,0.0011131867,0.0034333398,0.00005724161,0.9419998,0.007136785,0.040720675],"study_design_scores_gemma":[0.0013001795,0.00069920515,0.026824098,0.0005329455,0.0000679417,0.00013164006,0.00007364287,0.04966562,0.0002901344,0.9015023,0.017789738,0.0011225279],"about_ca_topic_score_codex":0.000013188356,"about_ca_topic_score_gemma":0.000006183227,"teacher_disagreement_score":0.67301613,"about_ca_system_score_codex":0.000019048262,"about_ca_system_score_gemma":0.00014028886,"threshold_uncertainty_score":0.76517373},"labels":[],"label_agreement":null},{"id":"W2908868776","doi":"10.1007/s00373-018-02004-z","title":"Improved Bounds for Guarding Plane Graphs with Edges","year":2019,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Combinatorics; Mathematics; Quadrilateral; Vertex (graph theory); Planar graph; Upper and lower bounds; Graph; Discrete mathematics; Physics; Mathematical analysis","score_opus":0.008659670553227234,"score_gpt":0.20812081277172628,"score_spread":0.19946114221849906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908868776","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.64807737,0.00078164804,0.34834614,0.0002819623,0.001136353,0.0004368642,0.000005102719,0.0001343795,0.00080016284],"genre_scores_gemma":[0.99403393,0.00004046695,0.0054231063,0.00012485049,0.000014672987,0.000026087704,0.000011739452,0.000006881283,0.00031823502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925184,0.000013189804,0.000116091,0.00028947837,0.00014502312,0.000184353],"domain_scores_gemma":[0.9994634,0.00009164823,0.00006071648,0.00020058909,0.00011798425,0.00006568314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015941678,0.000114224626,0.00013191473,0.0001468121,0.00016765899,0.00018163519,0.00019495601,0.000044572258,0.0000014465742],"category_scores_gemma":[0.000007078726,0.0000962766,0.000043223357,0.0005028101,0.000019284202,0.00026077428,0.00005428213,0.00006347536,0.0000018340182],"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.000017744333,0.000042617805,0.0034656813,0.000035360536,0.000025874071,0.0000010004788,0.0001226519,0.00006866105,0.00053655077,0.9785753,0.00028568052,0.016822884],"study_design_scores_gemma":[0.003289981,0.0018536836,0.009859098,0.0000416764,0.0000321897,0.00004959239,0.00009323027,0.09164399,0.0037917832,0.8721466,0.016554857,0.00064331654],"about_ca_topic_score_codex":0.0000062784666,"about_ca_topic_score_gemma":0.0000020165023,"teacher_disagreement_score":0.34595656,"about_ca_system_score_codex":0.000010432903,"about_ca_system_score_gemma":0.000036948128,"threshold_uncertainty_score":0.39260456},"labels":[],"label_agreement":null},{"id":"W2911394913","doi":"10.1007/s00373-008-0799-3","title":"Silver Cubes","year":2008,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Cartesian product; Prime power; Vertex (graph theory); Neighbourhood (mathematics); Algebraic number; Discrete mathematics; Graph; Prime (order theory)","score_opus":0.008022328700756318,"score_gpt":0.1595524250601304,"score_spread":0.1515300963593741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911394913","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.9832342,0.0024286292,0.00008146586,0.00000640263,0.0006302605,0.00005012339,0.0000019817523,0.0002540822,0.01331281],"genre_scores_gemma":[0.9990415,0.0006569339,0.000008453782,0.000017204045,0.000010261068,0.000008103144,0.0000013798664,0.000013713381,0.00024245714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958277,0.000010907512,0.00009584283,0.000086392254,0.000080112724,0.00014399375],"domain_scores_gemma":[0.9997693,0.000017756327,0.00000870367,0.00012239453,0.000015569449,0.000066304354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000050833627,0.00009569835,0.0001099849,0.00006307048,0.00011074202,0.000011161846,0.00006439667,0.00005400482,0.000010757896],"category_scores_gemma":[0.0000025358033,0.00008988084,0.000041977975,0.00021007983,0.000045506953,0.000064285865,0.000010964609,0.00008237445,0.000014383366],"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.000003923352,0.000039346676,0.029291978,0.000072773575,0.000049290764,0.000040919553,0.00067722466,0.000078049714,0.00065778336,0.96193624,0.006350771,0.0008017083],"study_design_scores_gemma":[0.0015549818,0.00018961713,0.055285532,0.000052569805,0.000041541585,0.00035511656,0.0004542955,0.0060147485,0.0033689549,0.8530667,0.07860306,0.0010129198],"about_ca_topic_score_codex":0.0000040965842,"about_ca_topic_score_gemma":4.74e-7,"teacher_disagreement_score":0.10886957,"about_ca_system_score_codex":0.000005313457,"about_ca_system_score_gemma":0.0000027164142,"threshold_uncertainty_score":0.36652344},"labels":[],"label_agreement":null},{"id":"W2912574978","doi":"10.1007/s00373-015-1553-2","title":"Isoperimetric Enclosures","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Carleton University","funders":"","keywords":"Isoperimetric inequality; Mathematics; Combinatorics; Perimeter; Polygon (computer graphics); Regular polygon; Plane (geometry); Constant (computer programming); Polygonal chain; Geometry","score_opus":0.027204253585567377,"score_gpt":0.234674053817538,"score_spread":0.20746980023197062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912574978","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.58181363,0.009402778,0.38851526,0.0010330272,0.002737899,0.00020492461,0.0000016710484,0.00035316873,0.015937636],"genre_scores_gemma":[0.99607,0.00005829831,0.0034374932,0.00015159574,0.000015640302,0.0000042409943,0.0000019520646,0.000002620199,0.00025815633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993969,0.000026520283,0.000092686896,0.00016967808,0.00020727319,0.00010689485],"domain_scores_gemma":[0.99953735,0.000033825105,0.000028919318,0.00014929933,0.00012402702,0.00012658333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020375174,0.00006709414,0.00007174095,0.0001913609,0.00007927211,0.000113491544,0.0001927,0.000030315858,0.0000011946482],"category_scores_gemma":[0.000041646083,0.00006130069,0.000022030912,0.0011409681,0.000015651774,0.00022883891,0.00009957951,0.00005040752,0.000009779462],"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.0000011333041,0.0000370764,0.0017173045,0.000002254906,0.000004207682,0.000003015174,0.00012921309,0.000050657556,0.000019995645,0.9811839,0.002571569,0.01427967],"study_design_scores_gemma":[0.0005290541,0.00022395006,0.007533451,0.0000027723747,0.000004348488,0.000024788045,0.000027764438,0.014217119,0.00068020035,0.9507447,0.025834098,0.00017776358],"about_ca_topic_score_codex":0.000009486894,"about_ca_topic_score_gemma":3.9233882e-7,"teacher_disagreement_score":0.41425636,"about_ca_system_score_codex":0.000011484181,"about_ca_system_score_gemma":0.000047167436,"threshold_uncertainty_score":0.24997696},"labels":[],"label_agreement":null},{"id":"W2939719063","doi":"10.1007/s00373-019-02123-1","title":"The Intersection of Two Vertex Coloring Problems","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","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":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Induced subgraph; Graph coloring; Complete coloring; Chordal graph; Greedy coloring; Graph; Discrete mathematics; Graph power; Line graph","score_opus":0.02231037702462028,"score_gpt":0.2768498994107605,"score_spread":0.2545395223861402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939719063","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.74616593,0.0070588435,0.225105,0.00042156875,0.011254772,0.0019993247,0.000011244327,0.00033768066,0.0076456214],"genre_scores_gemma":[0.99852943,0.000765098,0.00039521462,0.000010606774,0.0000065931713,0.000056909073,0.000001697297,0.000013412939,0.0002210426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846125,0.00012188127,0.00028119638,0.000454088,0.00037924448,0.00030232075],"domain_scores_gemma":[0.9982413,0.00030185012,0.00022406998,0.0009347126,0.0002267673,0.00007130209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007045778,0.00019266135,0.0002597983,0.00014618738,0.0002124631,0.00018888916,0.0012619434,0.00011566711,6.902087e-7],"category_scores_gemma":[0.000043715543,0.00014675237,0.00011886246,0.0005126668,0.00016543642,0.00015212057,0.002024988,0.00066349504,0.0000028192835],"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.000008655558,0.00003485263,0.0018883516,0.00011717667,0.00004106288,0.0000013785052,0.00029266058,0.00030587305,0.00007631031,0.98823184,0.000064395565,0.008937464],"study_design_scores_gemma":[0.00033304663,0.00015207865,0.0008265028,0.000101874124,0.0000074858003,0.000004495338,0.00004827663,0.016027989,0.0003808712,0.98140144,0.0005558876,0.00016006807],"about_ca_topic_score_codex":0.000043307344,"about_ca_topic_score_gemma":0.000008595171,"teacher_disagreement_score":0.25236347,"about_ca_system_score_codex":0.000060389328,"about_ca_system_score_gemma":0.000093131785,"threshold_uncertainty_score":0.5984388},"labels":[],"label_agreement":null},{"id":"W2947712626","doi":"10.1007/s00373-019-02110-6","title":"Cospectral Bipartite Graphs with the Same Degree Sequences but with Different Number of Large Cycles","year":2019,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"Error Correcting Code Techniques","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":"Carleton University","funders":"","keywords":"Bipartite graph; Combinatorics; Mathematics; Adjacency matrix; Degree (music); Tanner graph; Discrete mathematics; Odd graph; Multiplicity (mathematics); Low-density parity-check code; Graph; Line graph; 1-planar graph; Decoding methods; Algorithm; Physics","score_opus":0.020632343594461828,"score_gpt":0.2576696587519261,"score_spread":0.23703731515746426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947712626","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.9746008,0.0007038346,0.021689152,0.0004270937,0.00051550183,0.000591546,0.000022961616,0.00040479243,0.001044346],"genre_scores_gemma":[0.9969018,0.00041807492,0.0023394302,0.000094892595,0.000009213336,0.00008242814,0.0000062958366,0.000032207943,0.00011566593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976104,0.00013750036,0.00032227405,0.0007680501,0.00067153637,0.0004902531],"domain_scores_gemma":[0.9976047,0.0001925265,0.0005018138,0.0013404209,0.00025119886,0.000109332505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036645224,0.0004952132,0.0006143075,0.00017279506,0.00020263118,0.00024843385,0.0015701633,0.00021675134,0.000003380528],"category_scores_gemma":[0.000011069541,0.0002830472,0.00015015501,0.00061542075,0.00027995525,0.00016537214,0.0009899542,0.0008407453,0.0000016263193],"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.000031509073,0.00020979739,0.3316864,0.00020929577,0.00016224178,0.00002201599,0.0010972584,0.000018820936,0.000042430045,0.6654212,0.00032208976,0.0007769575],"study_design_scores_gemma":[0.0010765162,0.0010685957,0.13227272,0.000898757,0.0002021944,0.00015725564,0.00043897767,0.0030029058,0.00542148,0.85389096,0.00022974005,0.0013399168],"about_ca_topic_score_codex":0.00036652677,"about_ca_topic_score_gemma":0.0002523202,"teacher_disagreement_score":0.19941369,"about_ca_system_score_codex":0.000042854797,"about_ca_system_score_gemma":0.00012881195,"threshold_uncertainty_score":0.99996215},"labels":[],"label_agreement":null},{"id":"W2963598847","doi":"10.1007/s00373-018-1946-0","title":"Optimal Graphs for Independence and k-Independence Polynomials","year":2018,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Independence number; Independence (probability theory); Cardinality (data modeling); Chordal graph; Independent set; Graph","score_opus":0.030098859468858253,"score_gpt":0.2980547611719911,"score_spread":0.2679559017031328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963598847","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.99463403,0.00031431703,0.0029807829,0.00014621322,0.00020854738,0.00048561487,0.0000309667,0.000100822705,0.0010986981],"genre_scores_gemma":[0.9958915,0.00014389619,0.0034560899,0.00008813329,0.000025551784,0.00011585812,0.000002781158,0.000022022285,0.00025417985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988524,0.000036208374,0.00024812235,0.00036844402,0.00019978362,0.0002950753],"domain_scores_gemma":[0.998865,0.00035265533,0.000121980614,0.00032041428,0.00019150645,0.00014842572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005851751,0.00018973777,0.0002400857,0.00013044996,0.0004982048,0.00008065338,0.00020785864,0.0001753386,0.00001445631],"category_scores_gemma":[0.0001175961,0.00017682325,0.00007318685,0.00032942987,0.0003342565,0.00013982582,0.00009238163,0.00016331689,0.0000032048806],"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.000028021945,0.00008354179,0.001855927,0.000044755245,0.000024894181,8.697524e-7,0.00027877677,6.2801455e-8,0.0003968717,0.99550045,0.000807798,0.0009780065],"study_design_scores_gemma":[0.00061783515,0.00024606488,0.0012840308,0.000021018666,0.00005410885,0.000022880782,0.00021580824,0.000083022496,0.0022486814,0.9935726,0.0014072083,0.00022675208],"about_ca_topic_score_codex":0.0000117409845,"about_ca_topic_score_gemma":0.000008286171,"teacher_disagreement_score":0.0019278858,"about_ca_system_score_codex":0.000007570146,"about_ca_system_score_gemma":0.000026635293,"threshold_uncertainty_score":0.72106427},"labels":[],"label_agreement":null},{"id":"W2963649630","doi":"10.1007/s00373-017-1807-2","title":"Analogues of Cliques for (m, n)-Colored Mixed Graphs","year":2017,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"University of Victoria; Dalhousie University","funders":"","keywords":"Combinatorics; Mathematics; Colored; Graph; Vertex (graph theory); Discrete mathematics; Clique number","score_opus":0.03279238096370085,"score_gpt":0.3089552431641388,"score_spread":0.27616286220043795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963649630","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.92314756,0.0014041471,0.071327455,0.00057865423,0.00088755455,0.0006905233,0.00003147488,0.00018113779,0.0017515043],"genre_scores_gemma":[0.99414045,0.00039950848,0.005280912,0.000027265793,0.0000053511067,0.000048615155,0.00000307008,0.000010558201,0.0000842786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881417,0.000052386175,0.00022211003,0.00035510096,0.00023357083,0.0003226504],"domain_scores_gemma":[0.99820507,0.00020535917,0.00022152672,0.0009658423,0.0002801402,0.000122041034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052124273,0.00014532244,0.00027254203,0.00022551401,0.00055438,0.00017873706,0.0013235171,0.000082205705,7.453941e-7],"category_scores_gemma":[0.0001772002,0.00013115485,0.00013453426,0.00026345646,0.00035087578,0.00048564997,0.000372303,0.00011328211,6.389528e-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.00002393227,0.00006806865,0.009380737,0.000040329043,0.000026977144,0.0000030398674,0.000104926665,4.904089e-7,0.0003801217,0.980631,0.00023306036,0.009107327],"study_design_scores_gemma":[0.0006674276,0.00038764076,0.023219347,0.000016784727,0.000007807779,0.0000025769548,0.000029051636,0.00070897816,0.005732173,0.96829575,0.0007808352,0.00015162809],"about_ca_topic_score_codex":0.00002268926,"about_ca_topic_score_gemma":0.000010288177,"teacher_disagreement_score":0.070992894,"about_ca_system_score_codex":0.000008855251,"about_ca_system_score_gemma":0.000032859505,"threshold_uncertainty_score":0.53483397},"labels":[],"label_agreement":null},{"id":"W2964618873","doi":"10.1007/s00373-023-02650-y","title":"Girth Conditions and Rota’s Basis Conjecture","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Disjoint sets; Rainbow; Conjecture; Matroid; Basis (linear algebra); Rank (graph theory); Discrete mathematics; Physics","score_opus":0.03481245392482759,"score_gpt":0.31082126605410865,"score_spread":0.2760088121292811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964618873","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.9960156,0.00022200374,0.00014576182,0.0010425143,0.00006914218,0.00020338256,0.000049372666,0.00019162329,0.002060596],"genre_scores_gemma":[0.9986444,0.00050333387,0.000117966854,0.00008434451,0.0000067139586,0.00006620345,0.000019773415,0.000014729372,0.00054252084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994352,0.000026585029,0.00012633683,0.0001634984,0.0000991403,0.00014927879],"domain_scores_gemma":[0.9992927,0.00033701162,0.000045108725,0.00019194862,0.000049518465,0.00008376606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107098305,0.000107253894,0.0001451427,0.00011597356,0.00029253526,0.00004515308,0.000070815455,0.000055547567,0.000033864948],"category_scores_gemma":[0.0000432005,0.00009605443,0.00003522394,0.0005584337,0.00009238946,0.000054531625,0.000054564058,0.000112969006,0.000011958659],"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.000001025694,0.000032388103,0.004128322,0.000029046389,0.000023544548,0.000002318762,0.00056750857,8.331367e-8,0.0000481608,0.98352486,0.011028511,0.0006142263],"study_design_scores_gemma":[0.00032500917,0.000041396677,0.03035262,0.000009856651,0.000033866338,0.000008598084,0.00032353596,0.000090812406,0.00009492523,0.9642971,0.004304243,0.00011800107],"about_ca_topic_score_codex":0.0000085215,"about_ca_topic_score_gemma":0.000009630362,"teacher_disagreement_score":0.026224298,"about_ca_system_score_codex":0.0000066133734,"about_ca_system_score_gemma":0.000011647439,"threshold_uncertainty_score":0.3916986},"labels":[],"label_agreement":null},{"id":"W2971858457","doi":"10.1007/s00373-022-02460-8","title":"Meyniel Extremal Families of Abelian Cayley Graphs","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Cayley graph; Mathematics; Abelian group; Cayley's theorem; Conjecture; Multiplicative function; Bounded function; Discrete mathematics; Vertex-transitive graph; Upper and lower bounds; Graph; Graph power; Voltage graph; Line graph","score_opus":0.021568265017199655,"score_gpt":0.2512202940871714,"score_spread":0.22965202906997173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971858457","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.99070007,0.0014307081,0.000028692253,0.000046464113,0.0007902682,0.00018086415,0.000047801685,0.00007735519,0.0066977935],"genre_scores_gemma":[0.9988637,0.0003388934,0.00031188957,0.00007780719,0.000007287492,0.000031897394,0.000004903681,0.000026950012,0.00033668333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858093,0.00011463345,0.00034898173,0.0002674783,0.00041807792,0.00026988628],"domain_scores_gemma":[0.9990127,0.00022533919,0.00017725643,0.0004220196,0.00007403453,0.00008863358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041257747,0.00020092582,0.00034903162,0.00029480804,0.000641822,0.000016904838,0.00031949108,0.000068860616,0.00008776183],"category_scores_gemma":[0.000056387013,0.00017919946,0.00016913713,0.0006588143,0.00019115342,0.000059046157,0.00037415128,0.00028794896,2.5428477e-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.000027313681,0.00013706679,0.009728352,0.00008906986,0.00006419109,0.000009280007,0.0016345239,0.0000015674196,0.000116553056,0.9855244,0.0015025319,0.0011651103],"study_design_scores_gemma":[0.0005876539,0.00021973766,0.002571587,0.000009336184,0.00005780581,0.000023094006,0.0017632897,0.000029472538,0.00025753304,0.99143636,0.0028285389,0.00021558194],"about_ca_topic_score_codex":0.000044998713,"about_ca_topic_score_gemma":0.000004460063,"teacher_disagreement_score":0.008163636,"about_ca_system_score_codex":0.000016364198,"about_ca_system_score_gemma":0.00002318114,"threshold_uncertainty_score":0.7307542},"labels":[],"label_agreement":null},{"id":"W3006775530","doi":"10.1007/s00373-021-02414-6","title":"Local Balance in Graph Decompositions","year":2022,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Null graph; Graph; Butterfly graph; Windmill graph; Voltage graph; Mathematics; Colored; Vertex (graph theory); Line graph; Combinatorics; Graph property; Discrete mathematics","score_opus":0.0066739414426932086,"score_gpt":0.20054254986837353,"score_spread":0.19386860842568032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006775530","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.9635984,0.015847012,0.0030733643,0.00003261279,0.0047659148,0.00045254568,0.000116776704,0.00052272464,0.0115907015],"genre_scores_gemma":[0.99818677,0.0013994101,0.00002853282,0.000021613045,0.000009161437,0.00021319278,0.00006371318,0.00003775058,0.000039863502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988724,0.00007222197,0.00030295702,0.0003033308,0.00017183984,0.000277266],"domain_scores_gemma":[0.9994362,0.000046735437,0.000044131535,0.00036034646,0.000018762874,0.00009379846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020731334,0.00027116537,0.0003528639,0.00036383647,0.00011443636,0.000053160475,0.00026816296,0.00019978522,0.000039294024],"category_scores_gemma":[0.0000023478356,0.00031590823,0.00012994395,0.00052026915,0.0000651101,0.00004401161,0.00022445031,0.00088290917,0.0000025747247],"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.000010294292,0.00012948706,0.010182404,0.0006068528,0.00009741345,0.00007670802,0.0005095085,0.027529456,0.000036221438,0.9587889,0.0012442684,0.000788539],"study_design_scores_gemma":[0.0004375745,0.000042379972,0.006239861,0.000113632705,0.00002689223,0.000016800022,0.00030510835,0.008400723,0.00004126175,0.98030555,0.003562178,0.000508044],"about_ca_topic_score_codex":0.000053439395,"about_ca_topic_score_gemma":0.000015736214,"teacher_disagreement_score":0.034588415,"about_ca_system_score_codex":0.00007634,"about_ca_system_score_gemma":0.000015356403,"threshold_uncertainty_score":0.9999293},"labels":[],"label_agreement":null},{"id":"W3011118259","doi":"10.1007/s00373-020-02160-1","title":"Maximum Modulus of Independence Roots of Graphs and Trees","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"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 Guelph; Dalhousie University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Independence number; Independence (probability theory); Upper and lower bounds; Graph; Polynomial; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.029511971833910473,"score_gpt":0.2578558294510321,"score_spread":0.22834385761712162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011118259","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.9977687,0.00055884226,0.00028035374,0.00016564252,0.00003843191,0.00015317531,0.000020366953,0.00003542672,0.0009790785],"genre_scores_gemma":[0.9992966,0.00025697952,0.00036792146,0.000031201904,0.0000019874453,0.000011160671,0.0000015048455,0.000010318206,0.000022305365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992485,0.00003078049,0.00025357408,0.00018101998,0.00017036707,0.000115742994],"domain_scores_gemma":[0.9993547,0.00011673676,0.00015129629,0.00019369312,0.00008293283,0.00010060735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001514877,0.00011485728,0.0002566667,0.00007460547,0.00006739682,0.000009557296,0.0001383009,0.00007969513,0.0000073433907],"category_scores_gemma":[0.000058780643,0.00010520579,0.00006297542,0.000463887,0.00016254192,0.000059127746,0.000071337665,0.00011466252,3.9855294e-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.000015433892,0.000110061635,0.007455513,0.00015321733,0.000027554757,0.00000104298,0.00043735825,4.357368e-7,0.0016405777,0.9889973,0.00019543484,0.0009660714],"study_design_scores_gemma":[0.00041098913,0.00014736537,0.0086206235,0.000021621061,0.000046392306,0.0000031445438,0.00028327198,0.00008964658,0.0032291717,0.98695725,0.000088051995,0.00010245217],"about_ca_topic_score_codex":0.000010512774,"about_ca_topic_score_gemma":0.0000034840218,"teacher_disagreement_score":0.0020400286,"about_ca_system_score_codex":0.0000017737435,"about_ca_system_score_gemma":0.000011023041,"threshold_uncertainty_score":0.42901677},"labels":[],"label_agreement":null},{"id":"W3019256901","doi":"10.1007/s00373-020-02171-y","title":"p-Adic Roots of Chromatic Polynomials","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"advanced mathematical theories","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 Alberta","funders":"","keywords":"Mathematics; Divisibility rule; Chromatic polynomial; Chromatic scale; Combinatorics; Graph; Abelian group; Discrete mathematics","score_opus":0.04934869320755813,"score_gpt":0.2912965101092947,"score_spread":0.24194781690173656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019256901","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.9850182,0.00081928633,0.008172073,0.0005113898,0.00013775092,0.00033835045,0.0000117977115,0.00017602873,0.0048150993],"genre_scores_gemma":[0.9957703,0.000062326544,0.0039738757,0.000088531626,0.000011518272,0.000009740931,7.523968e-7,0.000022545153,0.000060419727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910414,0.000033843942,0.0003477126,0.00016409361,0.00017873428,0.0001714709],"domain_scores_gemma":[0.9990072,0.00043438224,0.00016158864,0.00020587294,0.000051788873,0.00013913398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015247794,0.00014328444,0.00041008,0.00003878443,0.0000548965,0.000013952779,0.00014296868,0.00006228585,0.000033159595],"category_scores_gemma":[0.00066327234,0.0001224822,0.00007364528,0.00031335265,0.00012780765,0.00007775464,0.000083045576,0.00009667604,0.0000059307017],"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.0000093530325,0.00007048701,0.00017128198,0.00048829475,0.000025692116,0.00000300736,0.00043624055,3.800246e-7,0.00072149833,0.9972978,0.00043824883,0.00033767094],"study_design_scores_gemma":[0.00041340376,0.00015028797,0.0001345826,0.00004609893,0.00004264688,0.000003971926,0.00019299262,0.00014130969,0.002973413,0.9955915,0.00017970923,0.00013008177],"about_ca_topic_score_codex":0.000001032147,"about_ca_topic_score_gemma":1.818085e-7,"teacher_disagreement_score":0.010752066,"about_ca_system_score_codex":0.000008292071,"about_ca_system_score_gemma":0.000015200061,"threshold_uncertainty_score":0.49946797},"labels":[],"label_agreement":null},{"id":"W3083401482","doi":"10.1007/s00373-020-02226-0","title":"On 0-Rotatable Graceful Caterpillars","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Combinatorics; Mathematics; Conjecture; Tree (set theory); Vertex (graph theory); Graph","score_opus":0.013567465246669089,"score_gpt":0.19355580303783934,"score_spread":0.17998833779117024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083401482","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.9762393,0.001959814,0.0063519287,0.009123789,0.0010938608,0.00027410543,0.000004856299,0.00077811896,0.004174191],"genre_scores_gemma":[0.9962431,0.00013386225,0.0007445032,0.0027980052,0.0000019162323,0.0000067710084,0.0000016170613,0.000008441727,0.00006176835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898446,0.00002856828,0.00014909847,0.0003732691,0.00022773116,0.00023687616],"domain_scores_gemma":[0.9993212,0.000046215875,0.000049810642,0.00028906163,0.00005860326,0.00023508248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011508117,0.00013632119,0.00014798802,0.000075191056,0.0001778432,0.00014258035,0.00034376318,0.0000505588,0.0000036224992],"category_scores_gemma":[0.000028856926,0.00011799483,0.000047809037,0.0006903779,0.0000387259,0.00014945201,0.00015038776,0.00014186988,0.000035615907],"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.0000037405305,0.0000388006,0.00074610545,0.000011582679,0.000007285582,0.000013353138,0.00020635332,0.000017487862,0.00019288066,0.9924844,0.004815704,0.0014623073],"study_design_scores_gemma":[0.00051385764,0.00038143076,0.00036766086,0.000012130964,0.000005517127,0.000006265678,0.000017746615,0.0043179267,0.001009864,0.98907644,0.004086229,0.00020491422],"about_ca_topic_score_codex":0.000014155658,"about_ca_topic_score_gemma":2.8970229e-7,"teacher_disagreement_score":0.020003779,"about_ca_system_score_codex":0.000005265566,"about_ca_system_score_gemma":0.000018515122,"threshold_uncertainty_score":0.48116896},"labels":[],"label_agreement":null},{"id":"W3084989205","doi":"10.1007/s00373-020-02219-z","title":"Correction to: Properties of a q-Analogue of Zero Forcing","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Mathematics, Computing, and Information Processing","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 Regina","funders":"","keywords":"Mathematics; Zero (linguistics); Forcing (mathematics); Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis; Linguistics","score_opus":0.025567366599493623,"score_gpt":0.20790321593673006,"score_spread":0.18233584933723643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084989205","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.22436528,0.00024109874,0.77257097,0.00024258245,0.00053957367,0.000117118354,4.574097e-7,0.00006855362,0.0018543673],"genre_scores_gemma":[0.9974832,0.0000128035545,0.0023003323,0.000173623,0.0000034501004,0.000001785335,2.395142e-7,0.0000026418236,0.000021941452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993788,0.000010678663,0.0002767612,0.000097687225,0.00015136958,0.00008468537],"domain_scores_gemma":[0.9994817,0.000022581069,0.00017295935,0.0001106397,0.0001524577,0.000059694503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000131777,0.00006367721,0.00015397606,0.000076987155,0.0000621518,0.00004003365,0.00020467647,0.000019898083,6.723544e-7],"category_scores_gemma":[0.00009906888,0.000054217075,0.00003450591,0.00047161992,0.000020875845,0.00024216308,0.00011473275,0.00005156964,8.291645e-7],"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.000008424921,0.0000747035,0.0016430394,0.0009732683,0.000026266192,5.058249e-7,0.02722943,0.00028656994,0.001753694,0.9418867,0.0026792276,0.023438128],"study_design_scores_gemma":[0.00058674155,0.0005793751,0.0007849516,0.00043485887,0.00002077312,0.00001038951,0.0008189161,0.76205516,0.06699131,0.16662341,0.0007723823,0.000321756],"about_ca_topic_score_codex":0.000012123692,"about_ca_topic_score_gemma":3.0398928e-7,"teacher_disagreement_score":0.7752633,"about_ca_system_score_codex":0.0000044513617,"about_ca_system_score_gemma":0.000026486805,"threshold_uncertainty_score":0.22109081},"labels":[],"label_agreement":null},{"id":"W3086607644","doi":"10.1007/s00373-022-02564-1","title":"On Weak Flexibility in Planar Graphs","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"National Science Foundation of Sri Lanka; European Commission; National Science Foundation; Iowa State University; H2020 European Research Council; Simon Fraser University","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Graph; List coloring; Discrete mathematics; Graph power; Line graph","score_opus":0.021900158038334727,"score_gpt":0.2719491916626957,"score_spread":0.250049033624361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3086607644","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.98813766,0.0007720568,0.0031963468,0.00059737725,0.0006872909,0.00038619462,0.000014179738,0.00021005995,0.0059988257],"genre_scores_gemma":[0.99917334,0.00006275648,0.00031370137,0.000197248,0.0000017574112,0.00007586353,0.000002846847,0.000009522282,0.00016296202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981026,0.00024506464,0.00019779721,0.00053691905,0.0005210667,0.0003965362],"domain_scores_gemma":[0.99888337,0.00024142908,0.00005138342,0.00066454255,0.000034172685,0.00012511712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081770966,0.00014767847,0.00018217324,0.00048513652,0.0003949332,0.00005937464,0.0008643418,0.000036744517,0.000016590728],"category_scores_gemma":[0.000041289797,0.00015009807,0.000065816945,0.002063015,0.000092319504,0.00018763049,0.00043856245,0.00052140496,0.000004011489],"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.00003124952,0.00021956938,0.0069193277,0.00000776573,0.000005179561,0.000032197873,0.0001783895,0.00007390815,0.000027214981,0.9890053,0.00031263227,0.0031872573],"study_design_scores_gemma":[0.0005962808,0.0004338578,0.007015789,0.0000039840575,0.0000010793989,0.0000109495895,0.00010940632,0.0015084681,0.000053609354,0.9884584,0.001636517,0.00017164645],"about_ca_topic_score_codex":0.000027454296,"about_ca_topic_score_gemma":0.0000064869387,"teacher_disagreement_score":0.011035673,"about_ca_system_score_codex":0.00007034475,"about_ca_system_score_gemma":0.000039384024,"threshold_uncertainty_score":0.6120822},"labels":[],"label_agreement":null},{"id":"W3098805720","doi":"10.1007/s00373-022-02514-x","title":"The Sandpile Group of Polygon Rings and Twisted Polygon Rings","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Canada Excellence Research Chairs, Government of Canada; National Natural Science Foundation of China","keywords":"Combinatorics; Polygon (computer graphics); Mathematics; Ring (chemistry); Rectilinear polygon; Monotone polygon; Simple polygon; Geometry; Computer science","score_opus":0.002683420830118621,"score_gpt":0.17885551255070778,"score_spread":0.17617209172058915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098805720","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.99612474,0.00049173954,0.00023697462,0.00014410255,0.00015368093,0.00008811814,0.000027012175,0.000016152004,0.0027174505],"genre_scores_gemma":[0.9997732,0.0000146443845,0.000014224356,0.000035832054,0.000018191631,0.000020855012,0.000010769252,0.000009323893,0.00010293256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933064,0.000038004226,0.00015021038,0.00015184759,0.0001743039,0.00015501997],"domain_scores_gemma":[0.9995869,0.00012888419,0.000082697225,0.0001101568,0.000031619275,0.000059747803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001184876,0.0001014214,0.00012726682,0.000027959106,0.0004704045,0.000038638293,0.000120353856,0.00001258428,0.000021962076],"category_scores_gemma":[0.0000017682584,0.00008052444,0.000056145283,0.00022402107,0.00014028183,0.000041095704,0.00019484697,0.00015557955,5.1661806e-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.000023931441,0.000094004834,0.013475929,0.0000069353687,0.000027842798,3.1688253e-7,0.0001511196,0.0000058096657,0.00013223491,0.9768427,0.00010694574,0.009132206],"study_design_scores_gemma":[0.00046162697,0.0001581786,0.018528897,0.000004231638,0.000019653142,0.0000011918762,0.0004613296,0.00030735612,0.00021029594,0.97709244,0.0026454453,0.000109368055],"about_ca_topic_score_codex":0.00009199371,"about_ca_topic_score_gemma":2.5774747e-7,"teacher_disagreement_score":0.009022838,"about_ca_system_score_codex":0.0000064336664,"about_ca_system_score_gemma":0.000011281702,"threshold_uncertainty_score":0.3618019},"labels":[],"label_agreement":null},{"id":"W3117130829","doi":"10.1007/s00373-022-02487-x","title":"On the Unimodality of Domination Polynomials","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unimodality; Mathematics; Combinatorics; Multipartite; Domination analysis; Graph; Polynomial; Cardinality (data modeling); Discrete mathematics; Vertex (graph theory)","score_opus":0.017295990982832958,"score_gpt":0.2514579524417743,"score_spread":0.23416196145894136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117130829","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.9862027,0.0002680683,0.008485091,0.0017536085,0.0003825986,0.00025547022,0.0000090137,0.000048205853,0.0025952337],"genre_scores_gemma":[0.9996226,0.00002353805,0.000089900386,0.0001287607,0.0000017977688,0.000032888285,6.976835e-7,0.000003657393,0.000096204494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99895024,0.0002548117,0.00012288585,0.00017542808,0.0003595471,0.00013709179],"domain_scores_gemma":[0.99897754,0.00044187455,0.00007626592,0.00041382422,0.000054732078,0.000035771503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000941966,0.000064059794,0.000094683826,0.00012168063,0.0003758142,0.000027376382,0.0006214493,0.000014831433,0.000013787945],"category_scores_gemma":[0.00006177818,0.000048291575,0.00004251051,0.0008426493,0.000087364686,0.00008824573,0.0004090662,0.00017196056,7.1579285e-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.000011587076,0.000068099565,0.00034215805,0.0000035232933,0.000005601219,0.0000012884692,0.00017224748,0.000023263072,0.0002000734,0.9964663,0.00022336535,0.0024825316],"study_design_scores_gemma":[0.00021895189,0.00020715973,0.0017908181,0.0000016226398,0.0000015016526,0.0000024020937,0.00009027645,0.0009862707,0.0012091243,0.99483776,0.000596919,0.00005718834],"about_ca_topic_score_codex":0.0000105605,"about_ca_topic_score_gemma":3.171463e-7,"teacher_disagreement_score":0.013419845,"about_ca_system_score_codex":0.00002422221,"about_ca_system_score_gemma":0.000025898269,"threshold_uncertainty_score":0.2890497},"labels":[],"label_agreement":null},{"id":"W3123622571","doi":"10.1007/s00373-020-02182-9","title":"Burning the Plane","year":2020,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":9,"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 Manitoba; Toronto Metropolitan University","funders":"","keywords":"Combinatorics; Mathematics; Grid; Plane (geometry); Graph; Dimension (graph theory); Sequence (biology); Cartesian coordinate system; Discrete mathematics; Geometry","score_opus":0.048425584420624,"score_gpt":0.2630287888099712,"score_spread":0.2146032043893472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123622571","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.9478863,0.0007045582,0.008137635,0.008096923,0.00025371628,0.00041567098,0.000014030502,0.00023987413,0.034251314],"genre_scores_gemma":[0.9989355,0.00007120304,0.00036736912,0.000474802,0.000015030282,0.000006525919,0.0000014008353,0.000011840667,0.000116316514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943024,0.000020895257,0.00015148248,0.00011652795,0.00014620219,0.00013463169],"domain_scores_gemma":[0.9993871,0.00030403232,0.000057177087,0.00013014048,0.00002425155,0.000097292344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015114245,0.00009177028,0.00014807362,0.000013438991,0.00012778844,0.000051498708,0.00013009805,0.000042358828,0.000038809027],"category_scores_gemma":[0.00017972518,0.00005653096,0.000044547913,0.0001675088,0.00004237048,0.000029005765,0.000064870816,0.00015231191,0.000007928692],"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.0000026083785,0.000024925976,0.0003211606,0.000057135392,0.000013121339,0.000004468157,0.00043291118,1.5755187e-7,0.000022371725,0.99677354,0.0018588677,0.00048871303],"study_design_scores_gemma":[0.00017096626,0.000054788543,0.00016702438,0.000009555496,0.000020809723,0.000005685583,0.00015438012,0.003441169,0.000018376963,0.9917587,0.0041114273,0.00008710887],"about_ca_topic_score_codex":0.0000020578318,"about_ca_topic_score_gemma":3.7095927e-7,"teacher_disagreement_score":0.051049232,"about_ca_system_score_codex":0.0000030010026,"about_ca_system_score_gemma":0.0000053410636,"threshold_uncertainty_score":0.23052657},"labels":[],"label_agreement":null},{"id":"W3140783139","doi":"10.1007/s00373-022-02478-y","title":"Predominating a Vertex in the Connected Domination Game","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Vertex connectivity; Discrete mathematics","score_opus":0.01243350273283779,"score_gpt":0.24614587311416752,"score_spread":0.23371237038132975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3140783139","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.98535895,0.00072709227,0.010141638,0.0010248476,0.00035721625,0.00047573968,0.0000034951656,0.00009642027,0.0018145768],"genre_scores_gemma":[0.9993802,0.0000295999,0.000216581,0.00015934177,0.0000021148703,0.00014637584,0.0000022616996,0.0000057018397,0.000057844678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985067,0.00038968294,0.00015112407,0.00026803932,0.00043464074,0.00024978875],"domain_scores_gemma":[0.9990366,0.00046633033,0.000058897796,0.0003491695,0.00005215719,0.0000368561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011111456,0.00009027205,0.00010628591,0.0002445218,0.0003561973,0.000099080295,0.0008437887,0.00002161497,0.000007913285],"category_scores_gemma":[0.00010721846,0.00007546958,0.000034964407,0.0018513778,0.000057247238,0.00022762995,0.00041254697,0.00033368715,0.0000012807874],"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.000009097024,0.00009238757,0.0010473279,0.0000057570555,0.0000033154254,0.00002259398,0.00211017,0.000030314677,0.00009144461,0.9870176,0.00008076698,0.009489235],"study_design_scores_gemma":[0.00084887154,0.00020269121,0.0068493537,0.0000040035825,0.0000019969882,0.000035647932,0.000858435,0.022024207,0.00005969205,0.9680596,0.00094055117,0.00011497436],"about_ca_topic_score_codex":0.000009594462,"about_ca_topic_score_gemma":0.000002203464,"teacher_disagreement_score":0.021993892,"about_ca_system_score_codex":0.000043256296,"about_ca_system_score_gemma":0.000027483002,"threshold_uncertainty_score":0.307756},"labels":[],"label_agreement":null},{"id":"W3152744231","doi":"10.1007/s00373-023-02638-8","title":"The Explorer–Director Game on Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Queen's University","funders":"","keywords":"Combinatorics; Security token; Vertex (graph theory); Graph; Mathematics; Computer science; Square lattice; Wheel graph; Discrete mathematics; Graph power; Line graph","score_opus":0.029609282595315527,"score_gpt":0.277482437763077,"score_spread":0.24787315516776148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3152744231","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.9757474,0.0025246819,0.0043601533,0.0044430364,0.0035056425,0.0007755596,0.000009430531,0.0021832103,0.0064509003],"genre_scores_gemma":[0.9967966,0.0021074144,0.000085512016,0.0001415374,0.000010262104,0.00008516492,0.0000017649118,0.000019289519,0.00075245777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820423,0.00012447612,0.00017210486,0.00043060756,0.0005109468,0.0005576318],"domain_scores_gemma":[0.9982223,0.0006518308,0.000053833508,0.00080322794,0.000094439994,0.00017438926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065781234,0.00017428302,0.00015042606,0.0003054124,0.0006056016,0.0002581796,0.0010365716,0.000057971723,0.0000018252099],"category_scores_gemma":[0.000102595244,0.00012122583,0.0000973841,0.0027899775,0.00019434033,0.0002243617,0.0003684714,0.00027961904,0.00007978096],"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.000010325328,0.00002832821,0.0007135101,0.0000053939843,0.000014115435,0.000020624511,0.00025218987,0.000004864382,0.000054895987,0.9764112,0.0018709466,0.020613583],"study_design_scores_gemma":[0.00029574096,0.00020098806,0.0051326915,0.000010307162,0.0000021114865,0.0000043227224,0.00008973597,0.0013601908,0.00041002475,0.97582805,0.016499689,0.00016616352],"about_ca_topic_score_codex":0.0000040355853,"about_ca_topic_score_gemma":0.0000015944923,"teacher_disagreement_score":0.021049213,"about_ca_system_score_codex":0.000020258964,"about_ca_system_score_gemma":0.000027076812,"threshold_uncertainty_score":0.4943446},"labels":[],"label_agreement":null},{"id":"W3153372228","doi":"10.1007/s00373-022-02574-z","title":"From One to Many Rainbow Hamiltonian Cycles","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamiltonian (control theory); Bijection; Hamiltonian path; Bounded function; Transversal (combinatorics); Graph; Discrete mathematics; Mathematical analysis","score_opus":0.027067669601035647,"score_gpt":0.26304833320814464,"score_spread":0.23598066360710898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153372228","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.99474216,0.00047623165,0.000112031645,0.00033525293,0.00083673483,0.0002107707,0.000078207595,0.0001138467,0.0030947402],"genre_scores_gemma":[0.9975688,0.000048299582,0.0012697406,0.00050635677,0.00003496806,0.000050910592,0.00000788196,0.0000303243,0.0004827319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987859,0.00009287755,0.00021378777,0.00030283825,0.00034482227,0.00025973533],"domain_scores_gemma":[0.99913514,0.0002042313,0.000070725124,0.00041132426,0.000032495354,0.00014607274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026144527,0.00016701463,0.00025263702,0.00015168393,0.0007907758,0.000044523757,0.00031176402,0.000052379914,0.00020867928],"category_scores_gemma":[0.000049965864,0.00016255984,0.00008931566,0.0003806419,0.000055294146,0.00004034013,0.00052230246,0.0002561928,0.0000021284225],"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.00002542362,0.00011344049,0.0020574827,0.000014594427,0.000056819692,0.000011983306,0.002424671,0.000001452593,0.00008631906,0.988864,0.0043592905,0.0019845276],"study_design_scores_gemma":[0.00045411589,0.00013340137,0.005604413,0.000007814419,0.000037846236,0.0000055860396,0.00075146527,0.000021807404,0.00010202452,0.9804798,0.012174596,0.00022717292],"about_ca_topic_score_codex":0.000060774248,"about_ca_topic_score_gemma":0.000003670642,"teacher_disagreement_score":0.008384238,"about_ca_system_score_codex":0.000031879008,"about_ca_system_score_gemma":0.000012650545,"threshold_uncertainty_score":0.6628998},"labels":[],"label_agreement":null},{"id":"W3157591363","doi":"10.1007/pl00007242","title":"On Fixed Edges and Edge-Reconstruction of Series-Parallel Networks","year":2001,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Interconnection Networks and Systems","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 Victoria","funders":"","keywords":"Mathematics; Series (stratigraphy); Combinatorics; Enhanced Data Rates for GSM Evolution; Graph; Series and parallel circuits; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.010195947134003418,"score_gpt":0.1984105735703931,"score_spread":0.18821462643638967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157591363","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.77130467,0.0020328623,0.21411094,0.00033941848,0.0049904827,0.0002456314,0.0000012203344,0.00014701489,0.0068277847],"genre_scores_gemma":[0.99852526,0.0008289701,0.00026618943,0.000055133627,0.000029773815,0.000007093905,6.7727103e-7,0.0000050596677,0.00028181932],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927056,0.000043911965,0.00019978886,0.00022569427,0.00010256935,0.00015745714],"domain_scores_gemma":[0.99949145,0.000059199767,0.00009520325,0.00020759198,0.00007807167,0.000068488305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016249123,0.000111347894,0.00018009235,0.0000959472,0.00013712072,0.00007774864,0.00013837712,0.00008403367,0.000003543999],"category_scores_gemma":[0.000008111763,0.00009789947,0.000042462885,0.00033871934,0.000060814727,0.00021620191,0.000058470454,0.00010715115,7.4960764e-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.000018182338,0.000033819182,0.005570754,0.000011607778,0.000017182108,0.000004031947,0.000100003694,0.00021749009,0.000008312097,0.96733654,0.0010988532,0.02558322],"study_design_scores_gemma":[0.0025891215,0.0020585316,0.023819022,0.00026727762,0.000029750288,0.0010925493,0.00035509554,0.2242484,0.00019446661,0.7338864,0.010644798,0.000814573],"about_ca_topic_score_codex":0.000019704556,"about_ca_topic_score_gemma":0.000006383722,"teacher_disagreement_score":0.23345011,"about_ca_system_score_codex":0.000008961792,"about_ca_system_score_gemma":0.000008341628,"threshold_uncertainty_score":0.39922246},"labels":[],"label_agreement":null},{"id":"W3159107677","doi":"10.1007/s00373-023-02637-9","title":"Upper Bounds on the Average Number of Colors in the Non-equivalent Colorings of a Graph","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Labeling and Dimension Problems","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":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Combinatorics; Mathematics; Partition (number theory); Fractional coloring; Vertex (graph theory); Greedy coloring; Complete coloring; Graph; Edge coloring; List coloring; Discrete mathematics; Upper and lower bounds; Graph power; Line graph","score_opus":0.01736158579766832,"score_gpt":0.24347185915124925,"score_spread":0.22611027335358092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159107677","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.9959523,0.00007375872,0.000042495056,0.0010729791,0.00024185455,0.00018255762,0.0000022592008,0.000035093424,0.0023966657],"genre_scores_gemma":[0.9993611,0.00023080899,0.000042455566,0.00025447193,7.289245e-7,0.000028659699,8.54055e-7,0.0000055265155,0.00007541672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881417,0.000084295156,0.000265986,0.00021865097,0.00039041313,0.00022651024],"domain_scores_gemma":[0.9989654,0.00034220418,0.000117530704,0.0004601384,0.00007769341,0.00003704408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009638162,0.00011844467,0.00018134354,0.00019116852,0.00014293421,0.000047086407,0.0006034536,0.000056365803,0.0000030426431],"category_scores_gemma":[0.000029847344,0.00006911547,0.000095695264,0.002286942,0.0001495778,0.000069907124,0.00015884118,0.00016979851,0.0000057432185],"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.00000656023,0.00011663373,0.019211603,0.000022962307,0.000012175425,0.0000055815117,0.0013230399,0.000032973534,0.00011073826,0.978023,0.0010134737,0.00012123569],"study_design_scores_gemma":[0.00051202596,0.00024693026,0.032554407,0.000057876663,0.000007578756,0.000005025139,0.00030067778,0.0011437929,0.0006394684,0.96393853,0.00048122354,0.00011245568],"about_ca_topic_score_codex":0.000081192265,"about_ca_topic_score_gemma":0.0000027739618,"teacher_disagreement_score":0.0140844835,"about_ca_system_score_codex":0.0000061418204,"about_ca_system_score_gemma":0.000025576468,"threshold_uncertainty_score":0.2818447},"labels":[],"label_agreement":null},{"id":"W3160796411","doi":"10.1007/s00373-023-02632-0","title":"Emanation Graph: A Plane Geometric Spanner with Steiner Points","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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 Saskatchewan","funders":"","keywords":"Combinatorics; Spanner; Mathematics; Delaunay triangulation; Bounded function; Graph; Spatial network; Discrete mathematics; Computer science","score_opus":0.011711263359977644,"score_gpt":0.20990743026467532,"score_spread":0.19819616690469766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160796411","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.8485877,0.00040686235,0.14743884,0.0012202186,0.00071290584,0.00022191046,0.0000049862088,0.00045820515,0.0009483485],"genre_scores_gemma":[0.99786663,0.00014603267,0.0012521476,0.00013952222,0.000017812046,0.000017603597,0.00003892799,0.000007737145,0.00051361107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998939,0.00003103449,0.0001409576,0.0003075498,0.00037294795,0.00020855042],"domain_scores_gemma":[0.9994077,0.000089342764,0.00006315406,0.00020909573,0.00013703771,0.00009367123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002613678,0.00012182917,0.00011822492,0.0009800993,0.00018894143,0.00014622009,0.00020575293,0.000047132704,0.0000034619886],"category_scores_gemma":[0.000022099157,0.00010134974,0.00003195593,0.0056437594,0.000023957242,0.00031388318,0.00009154115,0.000085506006,0.00002397278],"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.000009279956,0.000078002646,0.004828973,0.000025624484,0.000034288794,0.00003350131,0.00018840929,0.00074296276,0.000047147547,0.9706227,0.0040964847,0.019292621],"study_design_scores_gemma":[0.0021489197,0.00079748605,0.20645139,0.000034744273,0.000031624306,0.00008126455,0.00008944095,0.044983678,0.0007279623,0.73455226,0.009428968,0.0006722845],"about_ca_topic_score_codex":0.000011823394,"about_ca_topic_score_gemma":0.000003939913,"teacher_disagreement_score":0.23607045,"about_ca_system_score_codex":0.000012160861,"about_ca_system_score_gemma":0.000027055987,"threshold_uncertainty_score":0.41329226},"labels":[],"label_agreement":null},{"id":"W3183008868","doi":"10.1007/s00373-021-02367-w","title":"Characterizing Bipartite Graphs Which Admit a k-NU Polymorphism via Absolute Retracts","year":2021,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bipartite graph; Mathematics; Combinatorics; Unanimity; Homomorphism; Discrete mathematics; Graph","score_opus":0.017797393203278264,"score_gpt":0.2520450839134008,"score_spread":0.23424769071012252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183008868","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.9404018,0.0073135765,0.040616203,0.003555548,0.0019722865,0.00046372972,0.00001923254,0.00084056315,0.004817043],"genre_scores_gemma":[0.9954745,0.0011576986,0.0021643955,0.0004971481,0.000021764841,0.000033616714,0.000011098722,0.00003289104,0.0006068896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714965,0.00017602796,0.0003790101,0.0008482407,0.0006292252,0.0008178338],"domain_scores_gemma":[0.99770814,0.0001761607,0.00014969386,0.0010746337,0.00044410396,0.00044724144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005517244,0.00031130298,0.00036734674,0.0004002502,0.00051599246,0.00038168608,0.00081350363,0.00016973226,0.000021557742],"category_scores_gemma":[0.00012533633,0.00032122538,0.0001450754,0.0036623417,0.00011861262,0.00091160444,0.0006362738,0.0005602772,0.000031288055],"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.000015822214,0.00019063862,0.0023266915,0.000043653865,0.000056742112,0.0002519347,0.00040349428,0.0000014741606,0.015333102,0.97249794,0.00023701538,0.008641494],"study_design_scores_gemma":[0.00081327464,0.00019085033,0.018332107,0.00006359049,0.000017884031,0.00022153958,0.000039425395,0.0019035871,0.013182255,0.95863575,0.0060324054,0.0005673568],"about_ca_topic_score_codex":0.0000166217,"about_ca_topic_score_gemma":0.000008491081,"teacher_disagreement_score":0.05507268,"about_ca_system_score_codex":0.000035705096,"about_ca_system_score_gemma":0.00013335008,"threshold_uncertainty_score":0.999924},"labels":[],"label_agreement":null},{"id":"W3194363479","doi":"10.1007/s00373-021-02394-7","title":"Bounding the Number of Non-duplicates of the q-Side in Simple Drawings of $$K_{p,q}$$","year":2021,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Combinatorics; Mathematics; Bounded function; Integer (computer science); Simple (philosophy); Bipartite graph; Sigma; Crossing number (knot theory); Generating function; Discrete mathematics; Physics; Graph; Mathematical analysis","score_opus":0.007882593795185031,"score_gpt":0.24240336477951416,"score_spread":0.23452077098432914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194363479","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.9920752,0.00025278062,0.006638106,0.00029473743,0.00017835794,0.00005916159,0.0000014452166,0.0000037645525,0.0004964147],"genre_scores_gemma":[0.99935305,0.000046002413,0.0005101966,0.000044301025,0.0000038821768,0.0000031681186,0.0000011351675,0.0000021189944,0.00003614652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993698,0.000040642044,0.00021241372,0.0001190688,0.00017784252,0.00008023557],"domain_scores_gemma":[0.99932206,0.0001582696,0.00012455894,0.00023695196,0.00014226248,0.00001590976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023524663,0.00005354565,0.00011858909,0.00004327364,0.000068631896,0.00002134192,0.00025970052,0.000026310043,0.0000019455988],"category_scores_gemma":[0.000044080887,0.00003633074,0.000053809606,0.0011728052,0.000058469457,0.000082948354,0.00017271307,0.000063410254,1.7580679e-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.0000019305128,0.000092300295,0.08426116,0.000044081928,0.000012223181,8.139857e-7,0.0008219577,0.00026291565,0.005577012,0.9054288,0.00009010649,0.0034066797],"study_design_scores_gemma":[0.00034656317,0.000027185743,0.24048047,0.00003691777,0.000009268581,0.0000104104565,0.00014196428,0.0099658985,0.06996659,0.6785215,0.00041443077,0.00007876908],"about_ca_topic_score_codex":0.000048025864,"about_ca_topic_score_gemma":0.000008819373,"teacher_disagreement_score":0.2269073,"about_ca_system_score_codex":0.0000063011735,"about_ca_system_score_gemma":0.000064278924,"threshold_uncertainty_score":0.14815246},"labels":[],"label_agreement":null},{"id":"W4235786133","doi":"10.1007/s003730200003","title":"Shattering News","year":2002,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":42,"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; Mathematical proof; Lemma (botany); Combinatorics; Algebraic number; Order (exchange); Interpretation (philosophy); Discrete mathematics; Combinatorial proof; Computer science","score_opus":0.018612892200936995,"score_gpt":0.19836112661229355,"score_spread":0.17974823441135657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235786133","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.51659423,0.0037369276,0.4593231,0.0030759885,0.0019637246,0.0001756421,0.0000012984436,0.00037790122,0.014751163],"genre_scores_gemma":[0.9970476,0.00019860815,0.0020373329,0.00033036855,0.000014222504,0.0000040907216,8.059981e-7,0.0000025488546,0.0003644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995294,0.000012419638,0.00008219292,0.00015984997,0.00011256113,0.00010356553],"domain_scores_gemma":[0.9997313,0.00002298862,0.000023606715,0.00013500868,0.000030662322,0.000056461056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000048747093,0.000059909245,0.000057204492,0.00008514346,0.00011431321,0.00011588722,0.0001475238,0.000022729435,0.000012403837],"category_scores_gemma":[0.0000059895224,0.00005885453,0.00002258014,0.00041156381,0.000009896603,0.00021855214,0.000074493306,0.00004668707,0.000015152492],"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":[2.4566418e-7,0.000033819433,0.0010224293,0.0000047098824,0.0000038986714,0.000003988952,0.00017011048,0.00003771544,0.00007136146,0.9262872,0.0021307017,0.07023387],"study_design_scores_gemma":[0.00065149245,0.0001688595,0.00963151,0.0000115631665,0.000006402652,0.000054682932,0.000027534337,0.20265038,0.00047938683,0.73664516,0.04930889,0.00036415577],"about_ca_topic_score_codex":0.0000036861777,"about_ca_topic_score_gemma":5.616875e-7,"teacher_disagreement_score":0.48045337,"about_ca_system_score_codex":0.0000057288016,"about_ca_system_score_gemma":0.0000029500459,"threshold_uncertainty_score":0.24000181},"labels":[],"label_agreement":null},{"id":"W4250290902","doi":"10.1007/s003730050014","title":"Group Connectivity of 3-Edge-Connected Chordal Graphs","year":2000,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":71,"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":"Combinatorics; Mathematics; Path graph; Induced subgraph; Connectivity; Bound graph; Vertex connectivity; Wheel graph; Chordal graph; Induced path; Hamiltonian path; Graph; Discrete mathematics; Graph power; Vertex (graph theory); Line graph; Longest path problem","score_opus":0.011794593628280486,"score_gpt":0.24316710782463466,"score_spread":0.23137251419635418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250290902","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.9865296,0.00085642905,0.008719432,0.00010025743,0.0002385521,0.00023726044,0.000007171887,0.00019672693,0.0031145674],"genre_scores_gemma":[0.9981459,0.0004722262,0.0011506121,0.000055395125,0.0000054608254,0.000022005537,0.0000028194584,0.000014566572,0.00013102962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981832,0.00017701967,0.00027653849,0.00051718537,0.0003976455,0.00044839762],"domain_scores_gemma":[0.9985589,0.0003061443,0.00008653245,0.0007001283,0.00014785319,0.00020046474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048627023,0.00021321746,0.00032605635,0.00029650866,0.00022557047,0.00007304696,0.00077763986,0.00010485671,0.00004984622],"category_scores_gemma":[0.000055270837,0.00020328136,0.00012581074,0.0019508991,0.00027331928,0.00047564114,0.00017740366,0.0002780205,0.000008303357],"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.000031543343,0.00020371875,0.0063935104,0.000023870658,0.000026843261,0.000011550522,0.00018381522,0.0000028744653,0.00058581197,0.9556747,0.00007906364,0.036782667],"study_design_scores_gemma":[0.00094371167,0.0003864594,0.021110814,0.000016010059,0.0000072809817,0.00002005158,0.000025793037,0.00088764227,0.0014761321,0.9739019,0.00097328075,0.00025088942],"about_ca_topic_score_codex":0.000037534563,"about_ca_topic_score_gemma":0.000006464685,"teacher_disagreement_score":0.036531776,"about_ca_system_score_codex":0.000016959677,"about_ca_system_score_gemma":0.000029352988,"threshold_uncertainty_score":0.8289573},"labels":[],"label_agreement":null},{"id":"W4283376037","doi":"10.1007/s00373-022-02511-0","title":"Constructions of Sarvate-Beam Group Divisible Designs","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Block (permutation group theory); Group (periodic table); Combinatorics; Set (abstract data type); Constant (computer programming); Interval (graph theory); Beam (structure); Block size; Discrete mathematics; Computer science; Physics; Optics","score_opus":0.010082170307835883,"score_gpt":0.1746189271279651,"score_spread":0.1645367568201292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283376037","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.9920967,0.0014865965,0.00050312135,0.000004712839,0.0010929188,0.00011956863,0.000030175039,0.00015473175,0.004511433],"genre_scores_gemma":[0.9997619,0.00008372543,0.000029981285,0.000007212555,0.0000043241957,0.0000414215,0.000006409327,0.000014825772,0.00005024251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941415,0.000036342473,0.0001705953,0.00010267595,0.00013095727,0.00014530799],"domain_scores_gemma":[0.99970764,0.000037703627,0.000032125514,0.00015254425,0.00001808346,0.00005190654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016672103,0.00009543488,0.00015391405,0.00013554224,0.00021574197,0.000009384432,0.00010663853,0.000030008385,0.00004325464],"category_scores_gemma":[0.0000026325247,0.00010402602,0.000059564896,0.0005250739,0.000057299345,0.000053718206,0.00004511745,0.00014010996,0.0000010305013],"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.0000047512135,0.00005071544,0.014279288,0.0000650542,0.00004845996,0.0000030377148,0.00021350305,0.0005371168,0.0019151048,0.98189354,0.00047183115,0.0005175804],"study_design_scores_gemma":[0.0012246951,0.0004344881,0.0091210725,0.000023778071,0.000070078015,0.00010295059,0.0027682383,0.0013945211,0.0036543983,0.9670981,0.013599368,0.00050826464],"about_ca_topic_score_codex":0.000012416024,"about_ca_topic_score_gemma":8.614248e-7,"teacher_disagreement_score":0.01479541,"about_ca_system_score_codex":0.000014277579,"about_ca_system_score_gemma":0.0000053736567,"threshold_uncertainty_score":0.42420578},"labels":[],"label_agreement":null},{"id":"W4286716144","doi":"10.1007/s00373-022-02517-8","title":"On the Structure of Graphs Without Claw, $$4K_1$$ and co-R","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Claw; Split graph; Induced subgraph; Vertex (graph theory); Indifference graph; Cograph; Discrete mathematics; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.013209525833009866,"score_gpt":0.25861029588980816,"score_spread":0.2454007700567983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286716144","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.9967702,0.00067079783,0.0010154062,0.00033042525,0.00021200105,0.00024466327,0.000025810637,0.000050460796,0.0006802298],"genre_scores_gemma":[0.9994214,0.0001016482,0.00016529165,0.00022170934,0.000002060335,0.00001180003,0.000001832365,0.000009836063,0.0000644134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857897,0.0001994094,0.00015156464,0.0003250117,0.0004987376,0.00024628406],"domain_scores_gemma":[0.9989297,0.0002950259,0.000091179296,0.00053843454,0.000059435653,0.00008621916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035085637,0.00013855268,0.00017506677,0.00019977719,0.00058604067,0.000060607243,0.0007063604,0.000034819528,0.000019163352],"category_scores_gemma":[0.00002527804,0.000100803016,0.000050260758,0.0009697342,0.0002548623,0.00011457854,0.00045607195,0.0004003395,3.608321e-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.000019338111,0.00004114256,0.0058664097,0.000010859954,0.000016665696,0.0000042432307,0.00032439083,0.000011497621,0.0005391849,0.9915162,0.00025649206,0.0013935913],"study_design_scores_gemma":[0.00037735648,0.00039933668,0.0024485774,0.000004465934,0.000004300787,0.000020610678,0.00015906786,0.00056153786,0.0008937947,0.99413747,0.00087053125,0.00012298112],"about_ca_topic_score_codex":0.000007767202,"about_ca_topic_score_gemma":0.0000013128674,"teacher_disagreement_score":0.0034178323,"about_ca_system_score_codex":0.000013329602,"about_ca_system_score_gemma":0.000027070506,"threshold_uncertainty_score":0.45074102},"labels":[],"label_agreement":null},{"id":"W4293375766","doi":"10.1007/s00373-022-02545-4","title":"Fusions of the generalized Hamming scheme on a strongly-regular graph","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Hamming graph; Graph; Scheme (mathematics); Discrete mathematics; Hamming code; Algorithm; Block code","score_opus":0.044089540166208224,"score_gpt":0.2844332925373647,"score_spread":0.2403437523711565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293375766","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.9974358,0.00024554165,0.00003389521,0.00021297125,0.00024996678,0.00028862568,0.000026880896,0.00003800323,0.0014683363],"genre_scores_gemma":[0.99878114,0.00003127491,0.00036333562,0.000044613593,0.0000063894213,0.00006880182,0.0000030537021,0.00002552322,0.00067584036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984154,0.0002696612,0.00023243867,0.00020697847,0.00061486184,0.000260648],"domain_scores_gemma":[0.9988842,0.0002995825,0.00012068903,0.0005605186,0.00006789685,0.00006714154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067949545,0.00013493023,0.0002165881,0.00017836754,0.00061863096,0.000020121985,0.00041241138,0.000042971336,0.000110651694],"category_scores_gemma":[0.00014165095,0.00010262044,0.00015445738,0.00090599066,0.00013761262,0.000029321776,0.0005028878,0.00037891642,8.214417e-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.00003577024,0.00025249485,0.0023744488,0.000039222097,0.000037014706,0.0000035106825,0.00032674542,0.0000072764815,0.0010913706,0.99451935,0.0011058747,0.00020692911],"study_design_scores_gemma":[0.0008826722,0.0002265575,0.0007811174,0.000016658722,0.000023422956,0.0000070209244,0.0005835709,0.00021953817,0.00077070924,0.99438804,0.0019746798,0.00012600711],"about_ca_topic_score_codex":0.000015800795,"about_ca_topic_score_gemma":0.0000025444845,"teacher_disagreement_score":0.0015933315,"about_ca_system_score_codex":0.000033098542,"about_ca_system_score_gemma":0.000038028276,"threshold_uncertainty_score":0.4758072},"labels":[],"label_agreement":null},{"id":"W4304692595","doi":"10.1007/s00373-022-02576-x","title":"Counterexamples to Hedetniemi’s Conjecture with Large Fractional Chromatic Numbers","year":2022,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Limits and Structures in Graph Theory","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":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Combinatorics; Counterexample; Conjecture; Chromatic scale; Value (mathematics); Discrete mathematics; Statistics","score_opus":0.01471567413436825,"score_gpt":0.25568655270044993,"score_spread":0.24097087856608168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304692595","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.99480724,0.00021744758,0.00069937145,0.00022645024,0.0005188479,0.00030506513,0.000089549525,0.00010899228,0.0030270563],"genre_scores_gemma":[0.9983756,0.000015428097,0.00057304266,0.0006349266,0.000017615565,0.00007421359,0.000012518493,0.000030767154,0.00026590473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987229,0.0000767385,0.00019325137,0.0002722276,0.00044510383,0.0002897961],"domain_scores_gemma":[0.99919033,0.0002459665,0.000099937104,0.00028833703,0.000050872717,0.00012457954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002922937,0.00019567879,0.0002523742,0.0001295522,0.001001658,0.000046335077,0.00020448088,0.000050606028,0.00033462443],"category_scores_gemma":[0.00003725907,0.00015557752,0.00006402423,0.00041465173,0.000056960485,0.000060679533,0.0002227228,0.00030288752,0.0000012806127],"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.000047724403,0.0001148944,0.0060604042,0.000054682725,0.00007763954,0.000017876084,0.0014277138,0.000008556719,0.00000848161,0.9866548,0.0054352027,0.00009201077],"study_design_scores_gemma":[0.0008176505,0.00029599504,0.0024804103,0.000014221789,0.00004624667,0.00013681494,0.0013718934,0.000039653074,0.000019050167,0.9659527,0.028572055,0.00025329107],"about_ca_topic_score_codex":0.000016493164,"about_ca_topic_score_gemma":0.000013033159,"teacher_disagreement_score":0.023136852,"about_ca_system_score_codex":0.000051171122,"about_ca_system_score_gemma":0.00003255413,"threshold_uncertainty_score":0.7704045},"labels":[],"label_agreement":null},{"id":"W4376618462","doi":"10.1007/s00373-023-02644-w","title":"On Reconfiguration Graphs of Independent Sets Under Token Sliding","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Control reconfiguration; Bipartite graph; Discrete mathematics; Graph; Computer science","score_opus":0.03079598120794812,"score_gpt":0.2877690375327042,"score_spread":0.2569730563247561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376618462","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.9844149,0.00017259507,0.011212539,0.00034893566,0.0006361224,0.00025484205,0.000005363371,0.00026283885,0.0026919015],"genre_scores_gemma":[0.99932855,0.00027467427,0.00015832072,0.00006298434,0.0000023954988,0.000016784987,0.000006089607,0.000010618551,0.0001395685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986059,0.000091439026,0.00021461333,0.00034213817,0.00044811296,0.0002977926],"domain_scores_gemma":[0.99901944,0.0002590122,0.00009187253,0.00042237545,0.00010071617,0.000106568514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053468836,0.0001310394,0.0001682606,0.0005559594,0.00017848458,0.00007275835,0.00044925147,0.0000772919,0.0000046197583],"category_scores_gemma":[0.000043045246,0.00012371314,0.0000685478,0.0018915696,0.000050820243,0.00028995745,0.00017456974,0.0001944498,0.0000109053635],"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.000009407332,0.000040235864,0.000872061,0.00001761884,0.000015335916,0.000008075219,0.00020894775,0.000071715556,0.0006708399,0.9926799,0.00023360403,0.0051722745],"study_design_scores_gemma":[0.00038605722,0.00021591013,0.007018832,0.000022630982,0.0000029911937,0.0000044071808,0.00010975115,0.0026744613,0.0029307455,0.98641247,0.00008553313,0.00013620354],"about_ca_topic_score_codex":0.000006934344,"about_ca_topic_score_gemma":0.000001910601,"teacher_disagreement_score":0.014913701,"about_ca_system_score_codex":0.000021215983,"about_ca_system_score_gemma":0.000028531982,"threshold_uncertainty_score":0.5044875},"labels":[],"label_agreement":null},{"id":"W4385381069","doi":"10.1007/s00373-023-02684-2","title":"Correction to: On Reconfiguration Graphs of Independent Sets Under Token Sliding","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph Theory and Algorithms","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":"McGill University","funders":"","keywords":"Security token; Control reconfiguration; Mathematics; Combinatorics; Discrete mathematics; Computer science; Computer network","score_opus":0.018274318225183397,"score_gpt":0.24557428510548163,"score_spread":0.22729996688029824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385381069","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.9742628,0.00005620236,0.01620964,0.00035005403,0.0059273792,0.00024102376,0.0000041848843,0.00030465596,0.0026440772],"genre_scores_gemma":[0.99942404,0.00007936034,0.00010055582,0.00013735513,0.000005711148,0.000014255608,0.000005979136,0.00000747754,0.00022525972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989668,0.00006715338,0.00019885994,0.00030016713,0.00026145505,0.00020557288],"domain_scores_gemma":[0.99933,0.00014124693,0.00008354981,0.00027228254,0.000072047675,0.000100896286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041220855,0.00012446569,0.00014669489,0.00046179284,0.0001850544,0.00007940436,0.00026244103,0.00006043454,0.0000028519687],"category_scores_gemma":[0.000027674178,0.000119580596,0.00006766902,0.0017100908,0.00001860123,0.00020694465,0.00008616054,0.00013789328,0.000012176444],"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.000008167033,0.000050992327,0.00085568766,0.000009742959,0.000014834395,0.000004248281,0.00052670017,0.00015309444,0.0005863271,0.98072785,0.0012879493,0.0157744],"study_design_scores_gemma":[0.0003702822,0.00044509312,0.026045889,0.000056798075,0.000007648522,0.000009101117,0.00028361115,0.009132339,0.006438433,0.95676166,0.00023441162,0.00021475193],"about_ca_topic_score_codex":0.000015012494,"about_ca_topic_score_gemma":0.0000031110071,"teacher_disagreement_score":0.0251902,"about_ca_system_score_codex":0.000015842066,"about_ca_system_score_gemma":0.000017479102,"threshold_uncertainty_score":0.48763552},"labels":[],"label_agreement":null},{"id":"W4385953094","doi":"10.1007/s00373-023-02699-9","title":"An Exponential Bound for Simultaneous Embeddings of Planar Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia Graduate School","keywords":"Combinatorics; Mathematics; Planar graph; Embedding; Planar; Plane (geometry); Upper and lower bounds; Exponential function; Planar straight-line graph; Book embedding; Point (geometry); Set (abstract data type); Discrete mathematics; 1-planar graph; Graph; Chordal graph; Geometry; Mathematical analysis; Computer science","score_opus":0.014387758586334556,"score_gpt":0.26162944264807203,"score_spread":0.24724168406173747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385953094","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.855787,0.00015048563,0.1428227,0.00010161242,0.0007327045,0.00017796466,0.000014058554,0.00015185171,0.0000616181],"genre_scores_gemma":[0.9970764,0.00006480831,0.0026590452,0.00004544429,0.00001601961,0.000016228907,0.000041605876,0.0000064157753,0.000074027936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991739,0.000021870943,0.00017671776,0.00025341168,0.0002006257,0.00017348665],"domain_scores_gemma":[0.99931806,0.00019807577,0.000073661504,0.00018912321,0.00013906363,0.00008202536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021909976,0.00009477194,0.00012845862,0.0002693657,0.0001865684,0.00009220371,0.0002520743,0.00005119601,0.000001045368],"category_scores_gemma":[0.000031592135,0.000096653814,0.000058620753,0.00096301985,0.00003225521,0.00021984612,0.000039205715,0.000044558925,0.0000015582502],"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.0000126372615,0.00007654481,0.00028071794,0.00003095572,0.000015866719,0.0000056913395,0.0003878611,0.0008203315,0.0019172786,0.98658663,0.0006828051,0.009182698],"study_design_scores_gemma":[0.0005318357,0.00041624025,0.0011096363,0.000007035839,0.000010006696,0.000006843071,0.00005364194,0.19722733,0.0019407442,0.79707503,0.0014675932,0.00015404318],"about_ca_topic_score_codex":0.000008788286,"about_ca_topic_score_gemma":0.0000018264633,"teacher_disagreement_score":0.19640699,"about_ca_system_score_codex":0.0000060567295,"about_ca_system_score_gemma":0.000028680215,"threshold_uncertainty_score":0.3941428},"labels":[],"label_agreement":null},{"id":"W4385986349","doi":"10.1007/s00373-023-02696-y","title":"A Note on $$\\Delta $$-Critical Graphs","year":2023,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Conjecture; Delta; Critical graph; Graph; Discrete mathematics; Line graph; Graph power; Physics","score_opus":0.025462665368886868,"score_gpt":0.3117780709124376,"score_spread":0.2863154055435507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385986349","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.80970067,0.0020873935,0.13224342,0.016569981,0.0070446776,0.0014850681,0.00007165794,0.0060738814,0.02472324],"genre_scores_gemma":[0.9983218,0.00032390218,0.0007750411,0.0002809704,0.000009120349,0.00003503889,0.0000035946875,0.000018507184,0.00023202958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980474,0.00009905821,0.00018252434,0.0005406363,0.0005339088,0.00059647276],"domain_scores_gemma":[0.9982848,0.00062283926,0.000029258783,0.0006815753,0.0001168706,0.00026462873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004936598,0.00018683393,0.00019396144,0.0005583401,0.0003603451,0.0001692724,0.0007671992,0.00009257313,0.0000044873027],"category_scores_gemma":[0.0002116282,0.00017179135,0.00009789211,0.0030404802,0.0002112055,0.00029322566,0.00040581712,0.00033874853,0.00009782164],"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.0000095557325,0.00006434775,0.0005771328,0.000016887143,0.000006892757,0.00007697174,0.00013693582,0.000004770763,0.00008074374,0.98804164,0.0010354455,0.00994867],"study_design_scores_gemma":[0.00035885524,0.00029872297,0.002586047,0.000018190312,0.0000032226976,0.000011336469,0.000025837528,0.0044105276,0.00029319027,0.9888621,0.002918861,0.00021310155],"about_ca_topic_score_codex":0.000005619178,"about_ca_topic_score_gemma":0.0000011646605,"teacher_disagreement_score":0.18862112,"about_ca_system_score_codex":0.000017665794,"about_ca_system_score_gemma":0.00003225095,"threshold_uncertainty_score":0.70054483},"labels":[],"label_agreement":null},{"id":"W4391716630","doi":"10.1007/s00373-023-02747-4","title":"Parallel Connectivity in Edge-Colored Complete Graphs: Complexity Results","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Dawson College","funders":"","keywords":"Combinatorics; Disjoint sets; Mathematics; Colored; Vertex (graph theory); Graph; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science","score_opus":0.050015451489095294,"score_gpt":0.2940527677184181,"score_spread":0.2440373162293228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391716630","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.8979119,0.0075159646,0.07772027,0.0034379931,0.0026138083,0.0013498117,0.00013321864,0.0014498775,0.007867148],"genre_scores_gemma":[0.9969633,0.0003769722,0.002372575,0.00009583557,0.000009044141,0.000053111806,0.000011013694,0.000018905348,0.000099234494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997346,0.00027633167,0.00040011393,0.00089657836,0.00044640002,0.00063457125],"domain_scores_gemma":[0.9982126,0.0006775803,0.00006251323,0.00071597804,0.00011071478,0.00022065542],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011036018,0.0002778853,0.00037415946,0.0006538007,0.0002551662,0.00035515265,0.00086863677,0.000119065735,0.0000036722756],"category_scores_gemma":[0.00011518124,0.00026248518,0.00012724934,0.002877686,0.00040986185,0.0006202667,0.00050271675,0.0005894565,0.000018340186],"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.000059275935,0.00012703105,0.0015443957,0.000059271882,0.000024335233,0.00013110605,0.0005543858,0.000017356917,0.0000852532,0.9927572,0.00048413582,0.0041562486],"study_design_scores_gemma":[0.0011131826,0.00022874303,0.019274134,0.000057697816,0.000004502702,0.00002661871,0.00004297298,0.022021687,0.000058646725,0.95336854,0.0034928126,0.0003104359],"about_ca_topic_score_codex":0.000096224234,"about_ca_topic_score_gemma":0.000078585515,"teacher_disagreement_score":0.0990514,"about_ca_system_score_codex":0.000066992696,"about_ca_system_score_gemma":0.00007456058,"threshold_uncertainty_score":0.9999827},"labels":[],"label_agreement":null},{"id":"W4392144194","doi":"10.1007/s00373-024-02756-x","title":"Infinite Families of k-Vertex-Critical ($$P_5$$, $$C_5$$)-Free Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.015829665010986597,"score_gpt":0.2788217830343118,"score_spread":0.2629921180233252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392144194","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.76533407,0.0499851,0.13267955,0.0055640703,0.008396908,0.0011855687,0.00015944558,0.0025753116,0.034119956],"genre_scores_gemma":[0.99616337,0.0015164342,0.0020492352,0.00007663607,0.0000064540186,0.000021691061,0.000002001062,0.000021372474,0.00014279275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979533,0.00010573373,0.00033533823,0.0005470217,0.0005782025,0.000480382],"domain_scores_gemma":[0.9977825,0.0008327469,0.000035935052,0.0009411598,0.00020159049,0.00020603866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048071143,0.00023091584,0.00030100686,0.0007004202,0.00017630192,0.00022442751,0.0011900957,0.00011469121,0.00000877203],"category_scores_gemma":[0.00025751872,0.00020819697,0.00015999444,0.00252986,0.000519056,0.00061802776,0.0007319748,0.00038866716,0.000008919687],"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.0000079790325,0.000073790936,0.00106541,0.00017398712,0.000033085387,0.000050855324,0.00033118756,0.0000011726373,0.00032351582,0.9861614,0.0008746275,0.010902979],"study_design_scores_gemma":[0.00030357644,0.00026468153,0.0011860374,0.000086686836,0.000013117362,0.000029165412,0.00009533507,0.0027870974,0.00073360687,0.9910735,0.0031920108,0.00023521761],"about_ca_topic_score_codex":0.000018071147,"about_ca_topic_score_gemma":0.0000033172387,"teacher_disagreement_score":0.2308293,"about_ca_system_score_codex":0.000017838129,"about_ca_system_score_gemma":0.000083277555,"threshold_uncertainty_score":0.8490026},"labels":[],"label_agreement":null},{"id":"W4392429288","doi":"10.1007/s00373-024-02760-1","title":"On Restricted Intersections and the Sunflower Problem","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Mathematics and Applications","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 Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Sunflower; Discrete mathematics","score_opus":0.018933223367362778,"score_gpt":0.2727877647784131,"score_spread":0.25385454141105035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392429288","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.9204389,0.0020948322,0.005201775,0.0061843437,0.00066816417,0.0014752386,0.000026894208,0.00058466976,0.06332522],"genre_scores_gemma":[0.9978229,0.00028713688,0.00037830012,0.000050907725,0.000008636156,0.00010227818,0.0000012493498,0.000014094753,0.001334511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950385,0.000020917349,0.00014130239,0.00014140172,0.0000983564,0.00009419667],"domain_scores_gemma":[0.99912745,0.00059860677,0.000026705498,0.00017917747,0.000028495147,0.00003954386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001650676,0.00008833831,0.00010782499,0.000071967166,0.0001739323,0.00012384701,0.00006548847,0.000039708102,0.000011685646],"category_scores_gemma":[0.00005317454,0.00005284435,0.00004188811,0.00032767854,0.000089949615,0.000026897578,0.00004005582,0.00015432699,0.000004176259],"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.0000037978398,0.000055185566,0.000009496954,0.00007535423,0.0000235365,0.0000010786035,0.00052349706,9.5944074e-8,0.0000057260836,0.9794913,0.019497769,0.0003131587],"study_design_scores_gemma":[0.00029156337,0.00004095956,0.00003223145,0.000057840578,0.000040978244,0.000010965351,0.00013637726,0.0012060591,0.000010098789,0.99050343,0.0076019824,0.00006748355],"about_ca_topic_score_codex":0.000010373999,"about_ca_topic_score_gemma":0.0000040223676,"teacher_disagreement_score":0.077384025,"about_ca_system_score_codex":0.000007503929,"about_ca_system_score_gemma":0.000008950411,"threshold_uncertainty_score":0.215493},"labels":[],"label_agreement":null},{"id":"W4392734384","doi":"10.1007/s00373-023-02745-6","title":"The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Graph theory and applications","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":"University of Regina","funders":"Medical Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Property (philosophy); Graph; Discrete mathematics","score_opus":0.026094945186521293,"score_gpt":0.2735957473646457,"score_spread":0.24750080217812442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392734384","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.98965836,0.004032697,0.00065762224,0.0009989135,0.00024326183,0.00048208452,0.00005275271,0.00015039425,0.003723925],"genre_scores_gemma":[0.9976961,0.001460083,0.00023699577,0.000013786448,0.0000079335505,0.00009750658,0.000003993141,0.000015015581,0.00046861323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920166,0.000051975203,0.0002431575,0.00019973621,0.00012206526,0.00018141391],"domain_scores_gemma":[0.9993133,0.00026286105,0.000028929791,0.0002551426,0.000062664076,0.0000771312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029691638,0.0001281917,0.00013896739,0.00010114425,0.0005806876,0.00013533048,0.00011634072,0.000052342457,0.000008471548],"category_scores_gemma":[0.000032241125,0.000074419746,0.00008611355,0.00056913384,0.00031129038,0.00010778644,0.00004211538,0.00016641886,0.0000014268076],"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.0000028314857,0.0000764134,0.00043759297,0.0000627113,0.000052057378,0.0000010427406,0.00027862698,0.000001476183,0.00016862713,0.99744004,0.00094479654,0.0005337615],"study_design_scores_gemma":[0.00013183603,0.00007078407,0.0007053788,0.000039601666,0.00008237049,0.000010516486,0.00038037307,0.0003178513,0.00029173645,0.9950508,0.002810209,0.000108547385],"about_ca_topic_score_codex":0.000017077844,"about_ca_topic_score_gemma":0.000040730145,"teacher_disagreement_score":0.008037724,"about_ca_system_score_codex":0.0000050864683,"about_ca_system_score_gemma":0.000024910958,"threshold_uncertainty_score":0.4466238},"labels":[],"label_agreement":null},{"id":"W4394881837","doi":"10.1007/s00373-024-02778-5","title":"Semi-strict Chordality of Digraphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.014632078909479816,"score_gpt":0.2712885078436402,"score_spread":0.2566564289341604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394881837","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.7585604,0.03039301,0.19223534,0.0008595321,0.0022577713,0.0005725676,0.00003643484,0.0010694924,0.01401541],"genre_scores_gemma":[0.9982687,0.00087962113,0.00061158737,0.000023281138,0.0000058241008,0.0000115323965,0.0000013622529,0.000009501486,0.00018854652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868464,0.00008881629,0.00020946328,0.00038827612,0.00034937658,0.00027943272],"domain_scores_gemma":[0.9989656,0.00028264849,0.000036750054,0.0004960251,0.00009264655,0.00012631292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005753896,0.00013463508,0.00018223349,0.0003510791,0.000095979594,0.00013017966,0.0005707211,0.000063313586,0.000004652118],"category_scores_gemma":[0.00004465603,0.00011706664,0.00010688715,0.00228149,0.00014763033,0.00037060195,0.00026584254,0.00022770457,0.000004186382],"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.000004239452,0.00004374329,0.0031122398,0.00008225413,0.000023445393,0.000018497347,0.00015160126,0.0000016182906,0.00022285315,0.9828171,0.00027268773,0.013249711],"study_design_scores_gemma":[0.00015831304,0.00013083563,0.003993185,0.00003365555,0.0000062757777,0.000012836818,0.000023080313,0.002466531,0.0012960327,0.98754114,0.004196522,0.00014156655],"about_ca_topic_score_codex":0.000014012749,"about_ca_topic_score_gemma":7.859111e-7,"teacher_disagreement_score":0.2397083,"about_ca_system_score_codex":0.000014127856,"about_ca_system_score_gemma":0.000045854515,"threshold_uncertainty_score":0.47738388},"labels":[],"label_agreement":null},{"id":"W4396584860","doi":"10.1007/s00373-024-02788-3","title":"Ternary Extremal Four-Negacirculant Self-Dual Codes","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":3,"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 Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Dual (grammatical number); Ternary operation; Discrete mathematics; Computer science","score_opus":0.013059801209253449,"score_gpt":0.21164270032346905,"score_spread":0.1985828991142156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396584860","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.8786006,0.013079791,0.08956346,0.0010048121,0.004623813,0.0002899636,0.0000140275615,0.0031740114,0.009649532],"genre_scores_gemma":[0.9982506,0.0003557999,0.001145499,0.000108690525,0.00002960311,0.000011675017,0.0000014547068,0.0000112380085,0.00008540934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988728,0.000057116427,0.00015611088,0.00041147557,0.00022907347,0.00027340563],"domain_scores_gemma":[0.9993512,0.000122615,0.00002608202,0.0003428294,0.00003333782,0.00012394738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029549116,0.00017007532,0.00015181767,0.00023076811,0.00019509457,0.00046273018,0.0003632931,0.000069106674,0.000006521048],"category_scores_gemma":[0.00000557537,0.00014853835,0.00012391184,0.0008114488,0.000054486867,0.00033405225,0.00020887212,0.00018820186,0.000013889032],"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.0000026353628,0.00006004164,0.0019398403,0.000049432954,0.000048737904,0.00023110583,0.00044200252,7.239377e-7,0.0000901596,0.9852845,0.0006480929,0.011202694],"study_design_scores_gemma":[0.00020645806,0.00016846322,0.0025042442,0.00005458988,0.000027324577,0.00026381877,0.000032180542,0.011893154,0.00012193292,0.9685391,0.015909173,0.00027952975],"about_ca_topic_score_codex":0.0000073594483,"about_ca_topic_score_gemma":8.2388283e-7,"teacher_disagreement_score":0.11965004,"about_ca_system_score_codex":0.000013325292,"about_ca_system_score_gemma":0.000033583867,"threshold_uncertainty_score":0.60572183},"labels":[],"label_agreement":null},{"id":"W4396652747","doi":"10.1007/s00373-024-02789-2","title":"Parameters of Quotient-Polynomial Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Finite Group Theory Research","field":"Mathematics","cited_by":0,"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 Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quotient; Combinatorics; Polynomial; Discrete mathematics; Mathematical analysis","score_opus":0.048939320582943674,"score_gpt":0.30986114695045425,"score_spread":0.2609218263675106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396652747","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.9942937,0.0015129253,0.00009391997,0.00007484936,0.00066566776,0.0001947607,0.000019909792,0.00012697172,0.0030173326],"genre_scores_gemma":[0.99885523,0.00022399919,0.00049196964,0.000012680092,0.0000068563,0.000016514605,0.0000032928617,0.000031093095,0.00035837077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987849,0.000076673794,0.00028081506,0.00025447243,0.00032289483,0.00028026846],"domain_scores_gemma":[0.9988756,0.00060634094,0.000047248865,0.00029802506,0.00006497973,0.00010780672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049577607,0.00015361306,0.0002516055,0.00034211506,0.000070099304,0.00006866534,0.00019303021,0.00009991234,0.000026357759],"category_scores_gemma":[0.0001315805,0.00013370182,0.00014332643,0.000763136,0.00020397018,0.000093514245,0.00010103973,0.00024749382,0.000008606851],"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.000025457033,0.000106896696,0.001575145,0.00037570912,0.000074264644,0.000013850685,0.00046188783,1.7383198e-7,0.00022363475,0.98996407,0.0044550905,0.002723793],"study_design_scores_gemma":[0.00032048547,0.00024140932,0.00023623409,0.00007569371,0.000042084157,0.0000109781595,0.00018901665,0.00023165134,0.0011561301,0.99616355,0.0011827671,0.00014999854],"about_ca_topic_score_codex":0.000020105428,"about_ca_topic_score_gemma":0.0000019562456,"teacher_disagreement_score":0.006199455,"about_ca_system_score_codex":0.000019260046,"about_ca_system_score_gemma":0.000035551795,"threshold_uncertainty_score":0.5452202},"labels":[],"label_agreement":null},{"id":"W4399552751","doi":"10.1007/s00373-024-02808-2","title":"Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"University of Guelph; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum degree spanning tree; Graph; Geometric graph theory; Trémaux tree; Discrete mathematics; Line graph; Voltage graph; Pathwidth","score_opus":0.022334004117094065,"score_gpt":0.2883388245521849,"score_spread":0.2660048204350908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399552751","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.076842375,0.052532513,0.86170185,0.0042137518,0.0022177785,0.0012296176,0.000034986762,0.00038340274,0.0008437152],"genre_scores_gemma":[0.9980694,0.0009330132,0.0006855323,0.00005296383,0.000015307303,0.00005807685,9.228459e-7,0.000013317605,0.00017143996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998822,0.00007525703,0.00018518571,0.0003047023,0.00030810176,0.00030477098],"domain_scores_gemma":[0.99783593,0.0013973655,0.000049416114,0.0005464042,0.00011219834,0.000058677615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008449348,0.00014244029,0.00015978908,0.00017696219,0.00043297053,0.00024483164,0.0010000503,0.000043791624,0.0000013007469],"category_scores_gemma":[0.000060329607,0.00007560818,0.00015724894,0.0014232652,0.000329521,0.0002104598,0.00023001691,0.00021545513,8.6428594e-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.00000799175,0.000023386609,0.0005478722,0.000050820105,0.000051634448,0.0000022197999,0.00074540015,0.000021974784,0.00018485646,0.97595954,0.0005422842,0.021862026],"study_design_scores_gemma":[0.00019476464,0.00017922513,0.0010706378,0.000042033862,0.000020103414,0.000009471378,0.00027610155,0.011621643,0.0007175792,0.97832346,0.007434044,0.00011094513],"about_ca_topic_score_codex":0.00001952541,"about_ca_topic_score_gemma":0.000006136464,"teacher_disagreement_score":0.92122704,"about_ca_system_score_codex":0.000008259423,"about_ca_system_score_gemma":0.00003799186,"threshold_uncertainty_score":0.33301032},"labels":[],"label_agreement":null},{"id":"W4401823787","doi":"10.1007/s00373-024-02829-x","title":"Existential Closure in Line Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Closure (psychology); Combinatorics; Line (geometry); Discrete mathematics; Geometry; Political science","score_opus":0.018311866831261008,"score_gpt":0.28131773073709204,"score_spread":0.263005863905831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401823787","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.8923068,0.026850449,0.061505903,0.0020052143,0.0044001807,0.0007047384,0.000015101267,0.0012036012,0.011008009],"genre_scores_gemma":[0.99784005,0.001005718,0.00073303183,0.000053645632,0.00001147381,0.000022449463,0.0000022598267,0.000014208981,0.0003171831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985387,0.00007608851,0.00020667654,0.00048158664,0.0003214724,0.0003755313],"domain_scores_gemma":[0.9992748,0.00012302442,0.000021324417,0.00039942493,0.000055459535,0.00012595188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044346254,0.00015653607,0.00016975997,0.000631609,0.000100054756,0.00026334875,0.0005424685,0.00008568745,0.000006178442],"category_scores_gemma":[0.000022159315,0.00014183426,0.00009238353,0.0025928018,0.00010397412,0.00042284623,0.00027168804,0.0003735372,0.000012219345],"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.000005752071,0.00005385229,0.002226732,0.0000475286,0.000012131154,0.00014771706,0.00020088202,0.0000048089823,0.000068917114,0.98582906,0.00020283247,0.011199808],"study_design_scores_gemma":[0.0003298637,0.00015064229,0.0016810903,0.000044269105,0.0000036396693,0.000026439327,0.000026518153,0.004700045,0.00019016067,0.9879353,0.004735271,0.00017678134],"about_ca_topic_score_codex":0.000016618045,"about_ca_topic_score_gemma":0.00000911908,"teacher_disagreement_score":0.10553323,"about_ca_system_score_codex":0.000020817477,"about_ca_system_score_gemma":0.00004899794,"threshold_uncertainty_score":0.5783833},"labels":[],"label_agreement":null},{"id":"W4403276054","doi":"10.1007/s00373-024-02841-1","title":"Integral and rational graphs in the plane","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Finite Group Theory Research","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mathematisches Forschungsinstitut Oberwolfach; Hungarian Scientific Research Fund","keywords":"Mathematics; Combinatorics; Plane (geometry); Discrete mathematics; Geometry","score_opus":0.0454011709186197,"score_gpt":0.3145116601538646,"score_spread":0.26911048923524494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403276054","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.9932401,0.00206725,0.000050791376,0.0006512354,0.0001847934,0.00019568809,0.00001218487,0.00005330189,0.0035446526],"genre_scores_gemma":[0.999327,0.00027957195,0.00008244922,0.00006135149,0.000009648662,0.000027176804,0.0000072539187,0.000011712577,0.00019383825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915296,0.00010536561,0.00014644032,0.00017412537,0.0002448964,0.0001762291],"domain_scores_gemma":[0.9988317,0.0009432212,0.00001433965,0.00014529379,0.000024301316,0.00004116955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008260451,0.00010439318,0.000115813724,0.00020548132,0.00008860504,0.00016100916,0.00013491843,0.00006169056,0.000017878498],"category_scores_gemma":[0.00009583632,0.00006789953,0.000033288372,0.00053578865,0.00012026896,0.00008386522,0.000051747644,0.00032922754,0.0000038710177],"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.000010225847,0.00004835653,0.0028619003,0.00009437605,0.000013043166,0.000038525388,0.0011146624,3.249073e-8,0.000017583998,0.99270225,0.0020359133,0.0010631211],"study_design_scores_gemma":[0.00022645485,0.00008967267,0.0028887037,0.000038462502,0.000009969173,0.00004999792,0.0005571109,0.00028283862,0.000014268497,0.99408185,0.0016760837,0.00008456332],"about_ca_topic_score_codex":0.000014595558,"about_ca_topic_score_gemma":0.00001761585,"teacher_disagreement_score":0.006086895,"about_ca_system_score_codex":0.000010248835,"about_ca_system_score_gemma":0.000020907555,"threshold_uncertainty_score":0.27688622},"labels":[],"label_agreement":null},{"id":"W4403346558","doi":"10.1007/s00373-025-02985-8","title":"Noncrossing Longest Paths and Cycles","year":2025,"lang":"en","type":"preprint","venue":"Graphs and Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky; National Science Foundation","keywords":"Computer science","score_opus":0.013885332897482968,"score_gpt":0.25185364523867687,"score_spread":0.2379683123411939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403346558","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.6628662,0.018508926,0.3077697,0.0016416888,0.0048707873,0.00047563107,0.00003848403,0.000359347,0.0034692637],"genre_scores_gemma":[0.99212474,0.0012777444,0.0059997845,0.0001863182,0.000033416716,0.000018517498,0.000021260492,0.000005081699,0.00033313857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891394,0.000043271306,0.0001934659,0.0005002853,0.00018900719,0.0001600039],"domain_scores_gemma":[0.9992898,0.0000970151,0.0000970932,0.00030866565,0.0001207779,0.00008660864],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020382981,0.00019092979,0.00020735085,0.00023099432,0.00027778433,0.0006188261,0.00029521887,0.00016139096,6.651819e-7],"category_scores_gemma":[0.000021375728,0.00019611967,0.000051678133,0.00037515926,0.000054956483,0.00013865478,0.0010700959,0.00027171566,6.507426e-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.0000021289557,0.00005039801,0.002618063,0.00016842778,0.000025896068,0.0000095941095,0.0003759866,0.00025172785,0.000014379006,0.90140855,0.00037449214,0.094700344],"study_design_scores_gemma":[0.00030984107,0.000049313665,0.021049513,0.00012701543,0.000022890907,0.00001357377,0.000016698757,0.04015957,0.0001572355,0.93498486,0.00277132,0.00033818628],"about_ca_topic_score_codex":0.00002242096,"about_ca_topic_score_gemma":0.0000035379962,"teacher_disagreement_score":0.32925853,"about_ca_system_score_codex":0.000018131554,"about_ca_system_score_gemma":0.00012215432,"threshold_uncertainty_score":0.7997528},"labels":[],"label_agreement":null},{"id":"W4403637605","doi":"10.1007/s00373-024-02845-x","title":"Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Mitacs","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.01602689210105394,"score_gpt":0.23156828375907143,"score_spread":0.2155413916580175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403637605","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.96724325,0.0066884253,0.02415911,0.00044018863,0.0008870158,0.00013303015,0.0000032917105,0.00014158423,0.00030411806],"genre_scores_gemma":[0.99850875,0.0005304729,0.0007749365,0.00009194967,0.00001263374,0.0000100290645,0.0000038384137,0.0000057370694,0.000061669845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914974,0.000037340644,0.00018504725,0.00031248553,0.00014487247,0.00017050093],"domain_scores_gemma":[0.9996495,0.00011456094,0.000025253,0.00011614153,0.000027454087,0.0000670735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026300663,0.00011082382,0.0001297121,0.0003766734,0.000101244295,0.0004203248,0.000117707896,0.000042557032,0.0000017750027],"category_scores_gemma":[0.000010922699,0.0001037071,0.000037497815,0.0010542606,0.000024757788,0.0004130108,0.000097635624,0.00011054492,0.0000019157737],"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.0000038635058,0.000023492104,0.0019773412,0.000051139916,0.000011673713,0.00003379213,0.00053688127,0.00012639217,0.0003971553,0.9657188,0.00009712179,0.031022366],"study_design_scores_gemma":[0.00065250514,0.0001131218,0.018114137,0.00009093417,0.000008092997,0.000036606863,0.000024701174,0.120251276,0.00022210235,0.8526798,0.007559132,0.00024757927],"about_ca_topic_score_codex":0.00001705753,"about_ca_topic_score_gemma":0.000007494646,"teacher_disagreement_score":0.120124884,"about_ca_system_score_codex":0.000014084298,"about_ca_system_score_gemma":0.000023820745,"threshold_uncertainty_score":0.42290527},"labels":[],"label_agreement":null},{"id":"W4405897696","doi":"10.1007/s00373-024-02870-w","title":"Correction: Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs","year":2024,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Modular Robots and Swarm Intelligence","field":"Engineering","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 British Columbia, Okanagan Campus; University of British Columbia","funders":"Technische Universiteit Delft","keywords":"Combinatorics; Mathematics; Discrete mathematics","score_opus":0.014017363287268067,"score_gpt":0.21173725957937856,"score_spread":0.19771989629211048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405897696","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.9779879,0.014489122,0.002350097,0.00004307512,0.003368481,0.00014324636,0.0000053580343,0.0003132837,0.0012994468],"genre_scores_gemma":[0.9961744,0.0036094165,0.000033147517,0.00001798151,0.000014042528,0.000012747737,0.0000027379986,0.000022013175,0.00011351755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.000014811125,0.00019886951,0.00020546213,0.00009371037,0.00020637886],"domain_scores_gemma":[0.9997437,0.00006220422,0.000011032985,0.00010158329,0.0000135386645,0.00006795567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013494455,0.00014656887,0.00017303681,0.00022763305,0.00006364616,0.00017728147,0.000055223136,0.00006696709,0.000011319193],"category_scores_gemma":[0.0000070211267,0.0001376092,0.00004205847,0.0004831337,0.000031692874,0.00014846267,0.000025681664,0.0002004155,0.0000029503472],"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.000050459053,0.00011921657,0.039485894,0.0015167147,0.00026891517,0.00051829015,0.0058165723,0.010954608,0.003779074,0.6694216,0.0047790143,0.26328963],"study_design_scores_gemma":[0.001301484,0.00028994726,0.030586028,0.001021065,0.00007401381,0.00018953203,0.00043902788,0.5707926,0.0025028968,0.34737673,0.04408541,0.0013412243],"about_ca_topic_score_codex":0.000042657743,"about_ca_topic_score_gemma":0.00002819345,"teacher_disagreement_score":0.55983806,"about_ca_system_score_codex":0.000020491847,"about_ca_system_score_gemma":0.0000056358176,"threshold_uncertainty_score":0.56115407},"labels":[],"label_agreement":null},{"id":"W4406673696","doi":"10.1007/s00373-025-02895-9","title":"A Note on Additive Bases of Abelian Groups of Rank 2","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Rings, Modules, and Algebras","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":"Brock University","funders":"Natural Science Foundation of Henan Province","keywords":"Mathematics; Rank of an abelian group; Abelian group; Combinatorics; Rank (graph theory); Elementary abelian group; Pure mathematics; Discrete mathematics","score_opus":0.015386877239338636,"score_gpt":0.259499709896657,"score_spread":0.24411283265731837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406673696","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.9888737,0.00035888984,0.00028104303,0.00009298756,0.00028212948,0.00016179524,0.00004299971,0.000032553035,0.009873862],"genre_scores_gemma":[0.9990642,0.00033247113,0.00023156211,0.00006749333,0.000006061824,0.000008521962,0.0000035106477,0.000009443816,0.00027673476],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992659,0.000029056782,0.00025618947,0.00016101522,0.00015825011,0.00012958435],"domain_scores_gemma":[0.99910337,0.00037992292,0.00013241876,0.00023295234,0.00011448815,0.00003683368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014555514,0.0001205313,0.00030007475,0.00018667163,0.000055094148,0.000009194235,0.00011081022,0.000067373454,0.000014300816],"category_scores_gemma":[0.00017181647,0.00010547359,0.00009334817,0.00037042476,0.00009735497,0.00004291739,0.000041871295,0.000096673364,8.25287e-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.000030464154,0.00029069197,0.0011539528,0.00023329798,0.00004392308,0.0000022324361,0.00028065976,1.4325194e-7,0.0001468426,0.9916989,0.0030433591,0.0030755324],"study_design_scores_gemma":[0.00081137853,0.00019873779,0.0041125906,0.00024212056,0.0000557353,6.6486615e-7,0.00016326195,0.000034647004,0.011738453,0.9815533,0.0009869614,0.00010213026],"about_ca_topic_score_codex":0.000027795944,"about_ca_topic_score_gemma":0.0000057378393,"teacher_disagreement_score":0.0115916105,"about_ca_system_score_codex":0.000010100264,"about_ca_system_score_gemma":0.000026377696,"threshold_uncertainty_score":0.43010882},"labels":[],"label_agreement":null},{"id":"W4408397455","doi":"10.1007/s00373-025-02901-0","title":"Veto Interval Graphs and Variations","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Simon Fraser University","funders":"Division of Mathematical Sciences","keywords":"Mathematics; Combinatorics; Interval (graph theory); Veto; Discrete mathematics; Interval graph; Indifference graph; Chordal graph; Graph; 1-planar graph","score_opus":0.01242007600694425,"score_gpt":0.27290333408641954,"score_spread":0.2604832580794753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408397455","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.41515946,0.006916482,0.5555855,0.0037184712,0.0021788236,0.00070686714,0.000012737163,0.00071870507,0.015002976],"genre_scores_gemma":[0.99673444,0.0004329164,0.0021462243,0.00020944765,0.0000021604742,0.000024627576,0.0000012188796,0.000005714093,0.00044326682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998989,0.000071691684,0.00015776377,0.00035528478,0.00016952069,0.0002567467],"domain_scores_gemma":[0.9991727,0.0001776242,0.000036698122,0.00040133332,0.000104253144,0.00010741881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029437814,0.00012613814,0.00015356313,0.00038051975,0.00029887774,0.0001841644,0.0004422123,0.00006152984,0.000002194229],"category_scores_gemma":[0.00005407557,0.00012050778,0.000047719765,0.0014003033,0.00013243359,0.00030932514,0.00045120064,0.00019440624,0.0000020547864],"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.000004391632,0.000046877474,0.005398254,0.000018125193,0.000021734118,0.0000046909636,0.00017485762,7.36708e-7,0.000050683688,0.98212564,0.0003062666,0.011847737],"study_design_scores_gemma":[0.0003961071,0.00008447452,0.011730096,0.00001868055,0.000007262801,0.0000059380013,0.0000414899,0.0019939402,0.000100223464,0.9834587,0.0020441287,0.00011894367],"about_ca_topic_score_codex":0.0000111325535,"about_ca_topic_score_gemma":0.0000028491534,"teacher_disagreement_score":0.581575,"about_ca_system_score_codex":0.000014548569,"about_ca_system_score_gemma":0.000036053883,"threshold_uncertainty_score":0.49141648},"labels":[],"label_agreement":null},{"id":"W4408734169","doi":"10.1007/s00373-025-02912-x","title":"Unbiased Hadamard Matrices and Ternary Self-dual Codes","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","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":"University of Lethbridge","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hadamard transform; Ternary operation; Combinatorics; Dual (grammatical number); Complex Hadamard matrix; Discrete mathematics; Hadamard matrix; Computer science","score_opus":0.003005978694838545,"score_gpt":0.17769162327630803,"score_spread":0.17468564458146948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408734169","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.98380446,0.008733923,0.00010504039,0.000031504373,0.0006735352,0.00010996952,0.000008656295,0.00037791007,0.0061549717],"genre_scores_gemma":[0.9984091,0.0013142487,0.000040518775,0.00003670103,0.0000081511635,0.000014023661,0.0000030167914,0.000011593924,0.00016265882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942714,0.000027710044,0.00014985647,0.0001468143,0.00008128696,0.00016716954],"domain_scores_gemma":[0.9996943,0.00006800777,0.000019001869,0.00013429984,0.000020859407,0.00006354168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013002142,0.00014244864,0.00017919896,0.00015749421,0.000115691466,0.000072269686,0.00007243875,0.000082750135,0.0000027284573],"category_scores_gemma":[0.00000399327,0.00013561103,0.00003659717,0.00035895276,0.000038206086,0.00007818943,0.000033617904,0.000110439716,0.0000015723615],"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.000015345611,0.00006917305,0.06266939,0.0006211192,0.00021581161,0.000030555635,0.0004095646,0.000029585317,0.0003713557,0.9290011,0.0038148179,0.0027521667],"study_design_scores_gemma":[0.002651357,0.00022565572,0.06448081,0.0002978983,0.00025805106,0.00006717549,0.0011903858,0.009912002,0.0018497211,0.87190944,0.046200957,0.00095652964],"about_ca_topic_score_codex":0.000013828895,"about_ca_topic_score_gemma":0.0000024644849,"teacher_disagreement_score":0.057091665,"about_ca_system_score_codex":0.000009934144,"about_ca_system_score_gemma":0.000006601417,"threshold_uncertainty_score":0.55300575},"labels":[],"label_agreement":null},{"id":"W4416155004","doi":"10.1007/s00373-025-02990-x","title":"On the d-independence number in 1-planar graphs","year":2025,"lang":"en","type":"article","venue":"Graphs and Combinatorics","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":"Carleton University; University of Waterloo","funders":"","keywords":"Degree (music); Upper and lower bounds; Vertex (graph theory); Planar graph; Graph; Independent set; 1-planar graph; Plane (geometry)","score_opus":0.008663963256194446,"score_gpt":0.23374193039480787,"score_spread":0.22507796713861342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416155004","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.9157355,0.0005198936,0.054740757,0.0048158406,0.0014420447,0.0002907605,0.0000018653409,0.000106744614,0.022346582],"genre_scores_gemma":[0.9983677,0.00007837309,0.00022386541,0.0009771063,0.0000027665333,0.00001557164,0.0000012600767,0.0000018377331,0.00033146652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.000054597298,0.00012439443,0.00022348213,0.00019990533,0.00013297428],"domain_scores_gemma":[0.9994176,0.00024466726,0.000029621826,0.00022562353,0.00005304268,0.00002945724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002961541,0.000085421656,0.00008014006,0.00016090788,0.00016045864,0.000105712505,0.00031626047,0.000047871305,0.0000046049868],"category_scores_gemma":[0.000035781086,0.000064380954,0.000030490764,0.0013788944,0.000024915518,0.0001173351,0.00006171688,0.00015740735,0.000008516033],"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.0000025157965,0.00004639435,0.0044029225,0.000004061818,0.0000047680305,0.0000041423086,0.00006263791,0.000047748264,0.0000123558175,0.99015164,0.0017335681,0.00352725],"study_design_scores_gemma":[0.00020978496,0.000026437378,0.021878231,0.000016533797,0.0000018899092,0.000003305815,0.000015759175,0.0045666895,0.00015081424,0.9718881,0.0011677989,0.00007465508],"about_ca_topic_score_codex":0.000021034142,"about_ca_topic_score_gemma":0.0000094087945,"teacher_disagreement_score":0.08263224,"about_ca_system_score_codex":0.000014318869,"about_ca_system_score_gemma":0.000041102954,"threshold_uncertainty_score":0.2625379},"labels":[],"label_agreement":null},{"id":"W600271645","doi":"10.1007/s00373-015-1582-x","title":"A Cyclic Solution for an Infinite Class of Hamilton–Waterloo Problems","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"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; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Mathematics; Class (philosophy); Factorization; Integer (computer science); Combinatorics; Composition (language); Algorithm; Computer science; Artificial intelligence","score_opus":0.02871495167170536,"score_gpt":0.217056275594567,"score_spread":0.18834132392286163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W600271645","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.99524945,0.000873383,0.001557,0.0000064556593,0.000642199,0.0002785277,0.000014461507,0.00014818333,0.0012303429],"genre_scores_gemma":[0.9996976,0.000065886954,0.000062139494,0.0000078614585,0.000012071745,0.000057214267,0.00001526518,0.000020216814,0.000061728744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935424,0.00002715829,0.00021063279,0.00011871411,0.0001027147,0.00018651523],"domain_scores_gemma":[0.9995674,0.000021628483,0.00004139723,0.00017096646,0.00007905963,0.00011955829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028740434,0.000119868826,0.00018325464,0.000112896014,0.00004752275,0.000022952765,0.000092494935,0.00009563648,4.6039233e-7],"category_scores_gemma":[0.000006553062,0.00011270561,0.000051846542,0.00022442358,0.0000411485,0.00013781757,0.000010198,0.000068675254,0.000001078024],"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.000057902318,0.0002129522,0.008264726,0.00083652564,0.00012091107,0.0000014852665,0.006626785,0.0012000231,0.009389856,0.9677725,0.0016137834,0.0039025734],"study_design_scores_gemma":[0.0025307722,0.0010586065,0.0012454871,0.00008776476,0.00006137291,0.000015124496,0.000677488,0.032967664,0.0031817285,0.939886,0.017818267,0.00046973868],"about_ca_topic_score_codex":0.000026724583,"about_ca_topic_score_gemma":0.000013541827,"teacher_disagreement_score":0.03176764,"about_ca_system_score_codex":0.000012718703,"about_ca_system_score_gemma":0.000007552122,"threshold_uncertainty_score":0.45960012},"labels":[],"label_agreement":null},{"id":"W868478150","doi":"10.1007/s00373-015-1604-8","title":"Generating and Enumerating Digitally Convex Sets of Trees","year":2015,"lang":"en","type":"article","venue":"Graphs and Combinatorics","topic":"Digital Image Processing Techniques","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 British Columbia; University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Convex set; Regular polygon; Convex combination; Subderivative; Convex polytope; Discrete mathematics; Graph; Convex optimization","score_opus":0.022965215779435815,"score_gpt":0.2469225674137485,"score_spread":0.22395735163431268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W868478150","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.8709478,0.0038942273,0.115593694,0.000221794,0.0002302612,0.00015159277,0.0000038058668,0.00045176738,0.008505105],"genre_scores_gemma":[0.9714803,0.000029974364,0.028368145,0.000070250004,0.0000030225945,0.000004517659,9.832924e-7,0.000006201951,0.000036566544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930215,0.000016313828,0.00017284103,0.0002040517,0.00017281846,0.0001318033],"domain_scores_gemma":[0.9994365,0.000038513354,0.000094152165,0.00017544112,0.00015327758,0.00010212238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019223242,0.00010168965,0.00015048699,0.00007419165,0.00006188003,0.00041671563,0.00022016783,0.000036965914,9.858264e-8],"category_scores_gemma":[0.00007771104,0.00009375673,0.000018123745,0.00025474912,0.00007770405,0.00078913156,0.00025748808,0.000060378803,2.2946101e-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.0000033671724,0.00012302685,0.018618194,0.00007955545,0.000021548622,0.000019552659,0.0016783171,0.0000060386087,0.0011932686,0.7552536,0.00092980464,0.22207369],"study_design_scores_gemma":[0.0004996286,0.0003756818,0.0010981571,0.00007005022,0.000007486545,0.000049622504,0.00011209343,0.037460208,0.008356411,0.9512577,0.00040334975,0.0003095789],"about_ca_topic_score_codex":0.000008151534,"about_ca_topic_score_gemma":0.0000011998912,"teacher_disagreement_score":0.22176412,"about_ca_system_score_codex":0.0000064988303,"about_ca_system_score_gemma":0.000040444975,"threshold_uncertainty_score":0.40183985},"labels":[],"label_agreement":null}]}