{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19832462,0.010389362,0.6749588,0.014535212,0.00078849925,0.0003067836,0.0051864567,0.006103227,0.08940702],"genre_scores_gemma":[0.8170845,0.0048466497,0.13225336,0.0034991736,0.002039533,0.00040162224,0.003208047,0.0035829484,0.033084154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9872519,0.0020773697,0.0005367725,0.0042076567,0.0027971703,0.0031292154],"domain_scores_gemma":[0.87425584,0.08889214,0.0038575388,0.01800029,0.0052000447,0.009794113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072458033,0.0034979393,0.0065822876,0.0055525075,0.005022813,0.012433963,0.012357853,0.0056617092,0.02603579],"category_scores_gemma":[0.07158722,0.0037936626,0.0037850353,0.008049802,0.005842702,0.037469864,0.008409084,0.013667097,0.00448624],"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.002141235,0.0011053655,0.0064269737,0.0016088841,0.0004788531,0.00075851893,0.003229963,0.12664735,0.02040623,0.7011934,0.038551595,0.09745166],"study_design_scores_gemma":[0.00008940831,0.00016420227,0.0015654683,0.00016497202,0.00029497585,0.000518647,0.00028345917,0.24028379,0.0049654497,0.7402844,0.011275561,0.000109572306],"about_ca_topic_score_codex":0.007011942,"about_ca_topic_score_gemma":0.00615424,"teacher_disagreement_score":0.02603579,"about_ca_system_score_codex":0.005846362,"about_ca_system_score_gemma":0.0039101723,"threshold_uncertainty_score":0.08709836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06392266,0.023757204,0.5899647,0.012710398,0.0012001602,0.0005269431,0.0049680714,0.0046432046,0.29830673],"genre_scores_gemma":[0.74937415,0.022497222,0.15665473,0.0053709303,0.003593606,0.0018584324,0.0049995705,0.0044077695,0.051243592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9874213,0.0022220144,0.000685525,0.002695347,0.0037133005,0.0032625538],"domain_scores_gemma":[0.8831928,0.08873212,0.0039178543,0.013743077,0.0050577605,0.005356397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010980649,0.0066403737,0.0052313944,0.010764208,0.004778838,0.016863411,0.014903591,0.0063227233,0.03895318],"category_scores_gemma":[0.067958854,0.003933148,0.0033393994,0.013269479,0.006594465,0.036976453,0.013247203,0.022469906,0.011962102],"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.00094887253,0.00053353724,0.003857511,0.001217648,0.00027426478,0.00024815075,0.0010017987,0.045738295,0.00828033,0.8178604,0.028673412,0.09136587],"study_design_scores_gemma":[0.00005578819,0.00005057063,0.00081966864,0.0003172987,0.0001559375,0.00034026767,0.00017691111,0.036741123,0.004161368,0.9430205,0.01405765,0.0001028563],"about_ca_topic_score_codex":0.0016715125,"about_ca_topic_score_gemma":0.003050998,"teacher_disagreement_score":0.03895318,"about_ca_system_score_codex":0.009647615,"about_ca_system_score_gemma":0.0033887879,"threshold_uncertainty_score":0.13031137},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4234522,0.00048619532,0.558867,0.0004725828,0.000087433604,0.0001723596,0.001745475,0.0016806138,0.013036172],"genre_scores_gemma":[0.55420333,0.0004530547,0.4311099,0.00014347612,0.000044718647,0.000113309055,0.005208351,0.00064939994,0.008074398],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991824,0.00015113468,0.00006941036,0.00022777951,0.00020654293,0.00016266563],"domain_scores_gemma":[0.9939569,0.004023727,0.00040774362,0.00094570394,0.00042090408,0.0002450735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068826065,0.0008960497,0.0010731407,0.0018354285,0.0012210197,0.0020277328,0.0015903367,0.0012566557,0.007998476],"category_scores_gemma":[0.008403333,0.0010185145,0.0013234768,0.0026139265,0.0015652312,0.005096577,0.0025537347,0.0019701358,0.0010660889],"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.00047956142,0.00045492552,0.025514036,0.0010241698,0.00013482798,0.00078827195,0.0019484053,0.21930107,0.018074213,0.2856834,0.013406251,0.4331909],"study_design_scores_gemma":[0.000030997184,0.00013714566,0.003711721,0.00014935315,0.000098388664,0.0004028979,0.0010961117,0.34793746,0.012786824,0.62458354,0.009030603,0.00003492966],"about_ca_topic_score_codex":0.0015007792,"about_ca_topic_score_gemma":0.0039359885,"teacher_disagreement_score":0.007998476,"about_ca_system_score_codex":0.000827015,"about_ca_system_score_gemma":0.00064734765,"threshold_uncertainty_score":0.026757538},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8210725,0.00022689957,0.15361069,0.00034155181,0.00005110947,0.000038794627,0.0005124799,0.00036186562,0.023784146],"genre_scores_gemma":[0.9336699,0.00021058478,0.062108655,0.00008591539,0.000034222234,0.00004663385,0.00076875405,0.00016413127,0.002911127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950457,0.00009355295,0.00002242168,0.00010966986,0.00014304736,0.00012664692],"domain_scores_gemma":[0.9986308,0.0006695687,0.00012677997,0.00019901663,0.00012624572,0.00024758148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005739768,0.0006772901,0.00063379435,0.0024749103,0.0016029113,0.0020185595,0.0008182653,0.0011051097,0.0045628357],"category_scores_gemma":[0.0026202106,0.00065216667,0.00086340914,0.001415899,0.0016186251,0.0019437956,0.0016660279,0.000991604,0.0005880635],"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.0005023236,0.00022999599,0.004549042,0.00017726146,0.000040826046,0.00068501255,0.0012225005,0.050609317,0.019503566,0.8692124,0.006127664,0.047140036],"study_design_scores_gemma":[0.000049638664,0.00007059519,0.0013452267,0.00004618051,0.000020823249,0.00044145904,0.0005755858,0.18008198,0.0050919023,0.8094197,0.002828592,0.000028237604],"about_ca_topic_score_codex":0.0011871945,"about_ca_topic_score_gemma":0.001143149,"teacher_disagreement_score":0.0045628357,"about_ca_system_score_codex":0.00075948855,"about_ca_system_score_gemma":0.00056182884,"threshold_uncertainty_score":0.0152641535},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4171674,0.0018557296,0.5224572,0.012039002,0.0002714278,0.00025450205,0.0010215015,0.00092620985,0.044007137],"genre_scores_gemma":[0.9554788,0.0016436008,0.01978203,0.0010096211,0.00080828334,0.00044569458,0.00035136737,0.00023284575,0.020247748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99308395,0.00330819,0.00028124882,0.0011840273,0.0013475653,0.0007950036],"domain_scores_gemma":[0.9196189,0.060731854,0.005601459,0.0069897217,0.0024517193,0.0046063913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007777191,0.0013603158,0.0032017103,0.004221379,0.0025070978,0.008546856,0.004456642,0.0044330857,0.008306511],"category_scores_gemma":[0.05376832,0.0022231224,0.0018086426,0.0037299977,0.009772315,0.020435072,0.006121377,0.006598274,0.001061175],"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.000040105097,0.00003308243,0.00030094862,0.000029145483,0.000011998013,0.00008322158,0.00017188418,0.005312333,0.00021959971,0.99200517,0.0005627095,0.0012298297],"study_design_scores_gemma":[0.000035788027,0.000010858315,0.00011770387,0.000015932572,0.000014825262,0.00009646223,0.00007430332,0.041817423,0.00021730678,0.95698524,0.00059594325,0.000018259312],"about_ca_topic_score_codex":0.0019121744,"about_ca_topic_score_gemma":0.0016544587,"teacher_disagreement_score":0.008546856,"about_ca_system_score_codex":0.0033599667,"about_ca_system_score_gemma":0.0015552716,"threshold_uncertainty_score":0.041130185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59492606,0.0039383117,0.31336132,0.00794992,0.0004961725,0.00009656012,0.0008228327,0.00089485914,0.07751398],"genre_scores_gemma":[0.9686261,0.002050113,0.017687678,0.00058208965,0.00083327864,0.00013060067,0.00047117192,0.000222902,0.009396194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979791,0.0008921662,0.00008292035,0.00030126068,0.00048233825,0.0002623133],"domain_scores_gemma":[0.9591371,0.033579856,0.0015248606,0.0020268334,0.0017426134,0.0019888121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027941042,0.00072439836,0.0018911003,0.004075898,0.0027471075,0.004089557,0.0024932364,0.0022097297,0.011245769],"category_scores_gemma":[0.033765867,0.0012825815,0.00080935477,0.0036658796,0.006214881,0.012128531,0.004089425,0.0035251034,0.00082773797],"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.00006513272,0.000036749872,0.00088920287,0.00007035532,0.000008968062,0.000057803652,0.00034068918,0.002600625,0.00035004845,0.9874721,0.001538065,0.006570295],"study_design_scores_gemma":[0.000012039286,0.000012757904,0.00039017486,0.000023894348,0.000009347056,0.00011383039,0.000104469,0.016834743,0.00021138908,0.98145735,0.0008162785,0.000013787626],"about_ca_topic_score_codex":0.0021445162,"about_ca_topic_score_gemma":0.0015227341,"teacher_disagreement_score":0.011245769,"about_ca_system_score_codex":0.0020378248,"about_ca_system_score_gemma":0.00090710097,"threshold_uncertainty_score":0.037620783},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6409417,0.00223757,0.22430488,0.0011362088,0.00034871022,0.00012764391,0.0005054767,0.0005682244,0.12982963],"genre_scores_gemma":[0.9334419,0.0012790299,0.036269415,0.00030036984,0.00027879892,0.00008196125,0.00081389176,0.00028791072,0.027246743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908566,0.00024147626,0.000046922753,0.0002608425,0.0001894422,0.00017558341],"domain_scores_gemma":[0.99609286,0.00191478,0.00046522255,0.00034361507,0.0006076361,0.00057592243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012570651,0.0010651113,0.0012118067,0.0033526837,0.0021711416,0.0029139898,0.0012091058,0.00097620615,0.008883497],"category_scores_gemma":[0.004387491,0.00094556186,0.0010612918,0.0023720688,0.0038237441,0.005548438,0.0027423056,0.0018782538,0.0009438485],"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.00006321184,0.000016047748,0.0004535444,0.000045634675,0.000008738675,0.00013572177,0.0005192026,0.00085004594,0.0005176255,0.99267596,0.0011466666,0.0035676088],"study_design_scores_gemma":[0.000012685984,0.000017759958,0.0002520426,0.000018325922,0.000014340488,0.00014812032,0.0001668692,0.0023963258,0.00031464823,0.99380916,0.002840285,0.000009477237],"about_ca_topic_score_codex":0.0022509827,"about_ca_topic_score_gemma":0.002451317,"teacher_disagreement_score":0.008883497,"about_ca_system_score_codex":0.0013706614,"about_ca_system_score_gemma":0.00058032863,"threshold_uncertainty_score":0.02971828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78231674,0.001702053,0.122221544,0.0011003312,0.00018472958,0.00006825817,0.0005004661,0.00038380633,0.09152198],"genre_scores_gemma":[0.9844773,0.00033011867,0.0067944927,0.00010538112,0.0001144246,0.000057137466,0.0002807522,0.00006444818,0.0077759847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909806,0.00016840792,0.00005984348,0.00026832626,0.0002297534,0.00017569866],"domain_scores_gemma":[0.99746096,0.0012258714,0.00027656637,0.00035500378,0.00026339508,0.00041817184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007086071,0.0005750467,0.00073941157,0.0021942703,0.002449571,0.004755728,0.0008054763,0.0009114258,0.0054288586],"category_scores_gemma":[0.002773031,0.0006107809,0.00082294375,0.0020367438,0.0042719203,0.007266065,0.0036447,0.0018087297,0.00041253451],"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.000056129433,0.000017140384,0.0006849674,0.00003360241,0.0000074543773,0.00009702691,0.0006022734,0.00050147326,0.0009867862,0.99274445,0.0005026401,0.0037660475],"study_design_scores_gemma":[0.000013070305,0.000018607623,0.00071025325,0.000011199664,0.000020803509,0.00022506392,0.00033405237,0.0019886985,0.001071774,0.99142444,0.0041676858,0.000014345834],"about_ca_topic_score_codex":0.001142665,"about_ca_topic_score_gemma":0.0010070384,"teacher_disagreement_score":0.0054288586,"about_ca_system_score_codex":0.0011409476,"about_ca_system_score_gemma":0.0004554574,"threshold_uncertainty_score":0.018161297},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34075356,0.0014205526,0.6011994,0.0028037452,0.0003277693,0.00046133567,0.0017781063,0.005254494,0.04600111],"genre_scores_gemma":[0.68485737,0.0007422398,0.29381365,0.00050783774,0.00010812855,0.00025258557,0.001532741,0.00047856153,0.017706998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799585,0.0004498321,0.00013829184,0.00050259987,0.00048623234,0.0004272834],"domain_scores_gemma":[0.99706346,0.0011483995,0.00025183122,0.0010927963,0.0002126486,0.00023079332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090206583,0.0011573023,0.0026830838,0.0013052454,0.0017269843,0.0038427808,0.0036493766,0.0024763825,0.011077258],"category_scores_gemma":[0.005170639,0.00073833147,0.0011236052,0.0038846922,0.0012563588,0.008936671,0.0043924116,0.0017472235,0.002964672],"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.0022470702,0.0010670016,0.0032320216,0.0012035561,0.00033673103,0.00036147077,0.00064981676,0.17240866,0.025670921,0.39856288,0.033705484,0.3605544],"study_design_scores_gemma":[0.0003090526,0.00018845561,0.00067245826,0.000045928726,0.00015774177,0.0002497142,0.0003002383,0.39449665,0.009987272,0.5861783,0.007358825,0.000055350763],"about_ca_topic_score_codex":0.0023295349,"about_ca_topic_score_gemma":0.0032200054,"teacher_disagreement_score":0.011077258,"about_ca_system_score_codex":0.0017718568,"about_ca_system_score_gemma":0.0018737671,"threshold_uncertainty_score":0.0370571},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7996196,0.00072095136,0.13167821,0.0006843778,0.000115190225,0.00006268377,0.00044284304,0.00026685777,0.06640924],"genre_scores_gemma":[0.9703782,0.00045686218,0.017951101,0.00015599685,0.000088381305,0.0000558492,0.00038665198,0.00013506816,0.010391944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943346,0.00012842723,0.00003226307,0.00012042205,0.000115276875,0.00017001078],"domain_scores_gemma":[0.9972024,0.0013132681,0.000453154,0.000460935,0.00021191819,0.00035825936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000633388,0.0005591393,0.00095521443,0.0017358003,0.001673729,0.0030052927,0.0011085576,0.0010634334,0.0077486997],"category_scores_gemma":[0.002850941,0.0007249456,0.0006337358,0.002337253,0.0018663496,0.0038398688,0.001567652,0.0020947075,0.0006909947],"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.00021521725,0.000045028813,0.001212762,0.00007151554,0.000017847182,0.00019042386,0.0005358734,0.010169484,0.007036961,0.9658942,0.0023200742,0.012290539],"study_design_scores_gemma":[0.000028484483,0.000025994648,0.0010059299,0.000019698098,0.000023877015,0.0002021927,0.00017845469,0.03178143,0.0027659182,0.961171,0.0027766747,0.000020298667],"about_ca_topic_score_codex":0.0020553137,"about_ca_topic_score_gemma":0.0033588682,"teacher_disagreement_score":0.0077486997,"about_ca_system_score_codex":0.0016761012,"about_ca_system_score_gemma":0.00060301065,"threshold_uncertainty_score":0.02592194},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5816825,0.002686118,0.24199936,0.06419182,0.0029489647,0.000197457,0.0037913802,0.0010086073,0.101493716],"genre_scores_gemma":[0.89752674,0.0012860001,0.0725867,0.0035672076,0.0022656135,0.00028306927,0.0027815348,0.00042906933,0.019274058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980702,0.0006685406,0.000105919855,0.0006242812,0.00023039534,0.00030077598],"domain_scores_gemma":[0.9752398,0.019524746,0.0010096888,0.00195474,0.0011412819,0.0011297199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023716039,0.001079301,0.0020130589,0.0014602385,0.0031218138,0.004552484,0.0030472844,0.004428132,0.014680807],"category_scores_gemma":[0.026157552,0.0012822957,0.002197598,0.002014878,0.00491796,0.010378176,0.0037219687,0.0063947523,0.0013384147],"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.0004191042,0.000157823,0.0013536813,0.00047766487,0.00009273079,0.00019528539,0.0007525072,0.026537078,0.0009948245,0.93269616,0.023419894,0.012903276],"study_design_scores_gemma":[0.000057222616,0.000022864751,0.00022535797,0.000029874771,0.000018400293,0.000052727057,0.00016604467,0.022172237,0.000295566,0.9748668,0.0020729017,0.000019967218],"about_ca_topic_score_codex":0.0021182923,"about_ca_topic_score_gemma":0.0019260654,"teacher_disagreement_score":0.014680807,"about_ca_system_score_codex":0.0023717654,"about_ca_system_score_gemma":0.0017632119,"threshold_uncertainty_score":0.0491122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66393226,0.00059074076,0.318574,0.0008619213,0.00010085673,0.00015038518,0.00064939447,0.0004772381,0.014663193],"genre_scores_gemma":[0.89501214,0.0011061269,0.09288923,0.0002483926,0.00014338933,0.00016649038,0.0010972323,0.00025846067,0.009078605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940586,0.00013123879,0.000049713817,0.00014519344,0.00016931343,0.00009879299],"domain_scores_gemma":[0.9946386,0.0027110598,0.0008697795,0.00070823054,0.00048083012,0.00059142325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066292327,0.00050467666,0.00085270155,0.0012842304,0.0010207065,0.0017119756,0.0013441113,0.0009805887,0.0022180902],"category_scores_gemma":[0.00822238,0.0008550705,0.00059564266,0.002253353,0.0008431543,0.0035509262,0.0015036352,0.0012404007,0.0004775845],"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.00072293216,0.00037256733,0.0063362876,0.0006805677,0.00013087658,0.0007713365,0.0018527097,0.08288621,0.050955378,0.68170786,0.009126199,0.164457],"study_design_scores_gemma":[0.000079739155,0.00016251883,0.0021523063,0.000057923175,0.00011736062,0.00091809046,0.00054645305,0.14070255,0.011762496,0.8373385,0.0061335755,0.00002851716],"about_ca_topic_score_codex":0.00063090905,"about_ca_topic_score_gemma":0.0012094048,"teacher_disagreement_score":0.0022180902,"about_ca_system_score_codex":0.000531406,"about_ca_system_score_gemma":0.00050609896,"threshold_uncertainty_score":0.0074203014},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37357622,0.0075815367,0.34478942,0.010733332,0.0010209274,0.00018435938,0.0032623366,0.00049104536,0.25836083],"genre_scores_gemma":[0.88142085,0.0052769445,0.055094745,0.0014288919,0.00057484943,0.00016538225,0.0016270579,0.00015435254,0.05425701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994487,0.00013533089,0.000028846167,0.000210803,0.000097658965,0.00007857879],"domain_scores_gemma":[0.9982937,0.00082909124,0.0001548213,0.00022124824,0.00025608204,0.0002450366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049988757,0.00069393206,0.00082373456,0.0011434524,0.0013820655,0.0029256218,0.0011311581,0.0011039459,0.005159437],"category_scores_gemma":[0.0030944515,0.00052385655,0.00050208205,0.0013663599,0.0021185,0.0040387525,0.0015002255,0.0015526356,0.0013546402],"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.00012146168,0.000027728725,0.00059075997,0.0002301702,0.000028166436,0.00017160464,0.0003002332,0.0077158455,0.0031670053,0.9497231,0.0096472,0.028276678],"study_design_scores_gemma":[0.000021085229,0.00001706824,0.00036430563,0.00003055345,0.000019219422,0.0002865471,0.00008699668,0.012555063,0.0008135331,0.96838456,0.017406275,0.000014856377],"about_ca_topic_score_codex":0.0009951835,"about_ca_topic_score_gemma":0.0007367328,"teacher_disagreement_score":0.005159437,"about_ca_system_score_codex":0.00106026,"about_ca_system_score_gemma":0.0008162456,"threshold_uncertainty_score":0.017260015},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4666554,0.0008716585,0.34103224,0.0017361547,0.00033056864,0.00007236941,0.00072607293,0.000602123,0.1879734],"genre_scores_gemma":[0.94526696,0.00063808705,0.021627331,0.0002818694,0.0004019543,0.000076715645,0.00042478935,0.00020526764,0.03107706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999585,0.00008600465,0.000016064574,0.00007176336,0.00015254253,0.00008862285],"domain_scores_gemma":[0.9992298,0.00031569746,0.000103706625,0.00012151447,0.0001227225,0.000106517065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054077955,0.0005394652,0.0005818379,0.0019220739,0.001084715,0.0027483995,0.000988256,0.00065648044,0.011316453],"category_scores_gemma":[0.0019765415,0.00034305267,0.00051361194,0.0019483328,0.0014804355,0.003415201,0.0015783934,0.0019316062,0.0012577856],"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.000025642697,0.000017023905,0.00011592594,0.000019738134,0.0000036652402,0.000038327686,0.0002044228,0.000926387,0.0007917203,0.9860508,0.0011597377,0.0106466105],"study_design_scores_gemma":[0.000006244559,0.0000067321357,0.00011437762,0.0000076771,0.0000047727385,0.0000710474,0.000063265026,0.0060980343,0.0004610948,0.99100834,0.0021513742,0.0000070829187],"about_ca_topic_score_codex":0.0005552711,"about_ca_topic_score_gemma":0.0008644917,"teacher_disagreement_score":0.011316453,"about_ca_system_score_codex":0.0008792593,"about_ca_system_score_gemma":0.00037497378,"threshold_uncertainty_score":0.037857294},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39466515,0.0013484447,0.5475037,0.004370261,0.00046959735,0.0006054672,0.001327791,0.0016366051,0.048073046],"genre_scores_gemma":[0.659429,0.00080531713,0.3152454,0.0009126048,0.0003143326,0.00043288225,0.0026191736,0.0009447329,0.019296486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780196,0.00080542255,0.00010448858,0.0004619761,0.0003197466,0.00050651905],"domain_scores_gemma":[0.9903868,0.007389697,0.00040839837,0.000982931,0.000327832,0.0005043595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021672093,0.0016466939,0.0022213832,0.001620019,0.0023922417,0.004953372,0.0036719944,0.004500977,0.016047629],"category_scores_gemma":[0.016468005,0.001635208,0.00247579,0.0029891673,0.003287216,0.010554243,0.0049047493,0.005245864,0.0017110573],"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.0019226721,0.001294225,0.0024987368,0.0015324656,0.00029878106,0.0005111366,0.0014974029,0.35699993,0.0075741895,0.43756402,0.034834653,0.15347186],"study_design_scores_gemma":[0.00026399753,0.0001385628,0.00028078523,0.000081725164,0.000089235786,0.00012223753,0.00048241054,0.20731123,0.0024654162,0.78452206,0.0042090663,0.000033287088],"about_ca_topic_score_codex":0.0034771664,"about_ca_topic_score_gemma":0.005212413,"teacher_disagreement_score":0.016047629,"about_ca_system_score_codex":0.0017982962,"about_ca_system_score_gemma":0.0017007021,"threshold_uncertainty_score":0.05368465},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23831865,0.04182041,0.3416555,0.04106797,0.011305058,0.00020991758,0.0025148455,0.0015988469,0.3215088],"genre_scores_gemma":[0.8511946,0.02574281,0.069056705,0.0054448657,0.01797128,0.00015420404,0.001696992,0.0005524007,0.02818613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920183,0.00016010349,0.00005531847,0.000273383,0.00023110595,0.00007830641],"domain_scores_gemma":[0.9878313,0.0094610015,0.00045496426,0.0013287669,0.0005640617,0.00035990204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783863,0.00072593044,0.0010459308,0.0018641079,0.001342294,0.00236913,0.0019544277,0.0015006592,0.008207697],"category_scores_gemma":[0.009791533,0.00050314463,0.0010524538,0.003847762,0.0029284898,0.0071318615,0.0017860925,0.0031632113,0.00095648295],"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.00034177,0.00014055362,0.0023635332,0.00093643414,0.000091794755,0.0014090507,0.0007040615,0.008259847,0.010595748,0.84976155,0.040365167,0.08503046],"study_design_scores_gemma":[0.00002036137,0.0000707471,0.0012551553,0.000055118864,0.000064530446,0.0005015001,0.00014978161,0.0067494093,0.0021243843,0.9563908,0.032576744,0.00004130839],"about_ca_topic_score_codex":0.0016339772,"about_ca_topic_score_gemma":0.0014605138,"teacher_disagreement_score":0.008207697,"about_ca_system_score_codex":0.0008386157,"about_ca_system_score_gemma":0.0004374864,"threshold_uncertainty_score":0.027457535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6067004,0.0005015348,0.24846283,0.0013297868,0.0009900621,0.0009024424,0.0042056176,0.0013276542,0.1355797],"genre_scores_gemma":[0.7302218,0.0008013498,0.18690325,0.00048535073,0.00013528389,0.00044424646,0.004043635,0.0002946416,0.076670416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947923,0.00006622466,0.000053066546,0.00012950128,0.00012155489,0.00015049944],"domain_scores_gemma":[0.99687034,0.0007576126,0.00042405928,0.0006555605,0.0007076169,0.00058478053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048173376,0.00049461005,0.00054171414,0.0017659157,0.002546793,0.0027806868,0.0012207667,0.0013461546,0.019574225],"category_scores_gemma":[0.004313244,0.000648878,0.0005892953,0.002188191,0.0007890445,0.0029443423,0.0019027276,0.0013831359,0.0032722636],"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.0012919218,0.0008840061,0.006963373,0.001188083,0.00016707879,0.0022774555,0.0017395172,0.010727387,0.034887355,0.71586245,0.023615709,0.2003956],"study_design_scores_gemma":[0.0002302513,0.0004682202,0.00404578,0.0006187321,0.00033374768,0.0021549389,0.0022463428,0.039320365,0.036941186,0.82667315,0.086881675,0.00008563171],"about_ca_topic_score_codex":0.0007700906,"about_ca_topic_score_gemma":0.0020209202,"teacher_disagreement_score":0.019574225,"about_ca_system_score_codex":0.0005745334,"about_ca_system_score_gemma":0.0010539909,"threshold_uncertainty_score":0.06548232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9370196,0.00021508645,0.037778527,0.00021760895,0.000042926884,0.000039132556,0.0004616651,0.00024045963,0.023985002],"genre_scores_gemma":[0.98939973,0.00018994686,0.0060590473,0.00006304078,0.000029013434,0.000037898906,0.00061327,0.000043105847,0.0035648562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99983215,0.000039282528,0.000010992965,0.000043494445,0.000038416965,0.000035698045],"domain_scores_gemma":[0.99872017,0.00056094246,0.0002878532,0.0001236736,0.00015879399,0.00014856212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014002046,0.00023702387,0.00022634414,0.00085750764,0.00065191096,0.0010973708,0.00063663675,0.00055991235,0.0067037456],"category_scores_gemma":[0.0013480869,0.00025839932,0.00023507373,0.0013069572,0.0005383762,0.0009130647,0.00043325653,0.00044690652,0.0003708864],"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.00036692835,0.00015186169,0.0073103127,0.00024379048,0.00006142974,0.0015701287,0.0010624048,0.04346445,0.034890693,0.8511183,0.0066222725,0.053137444],"study_design_scores_gemma":[0.000106280604,0.00013617268,0.0054487125,0.000047340767,0.000083174746,0.00078967,0.0006386099,0.15059353,0.013857779,0.81814224,0.010108634,0.00004777663],"about_ca_topic_score_codex":0.0015876717,"about_ca_topic_score_gemma":0.0028877615,"teacher_disagreement_score":0.0067037456,"about_ca_system_score_codex":0.00037295168,"about_ca_system_score_gemma":0.00038780557,"threshold_uncertainty_score":0.022426248},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07468495,0.12089335,0.37105912,0.07893888,0.025515785,0.00015225074,0.0027304126,0.0019901528,0.32403502],"genre_scores_gemma":[0.572865,0.10482799,0.16921109,0.017214753,0.050485056,0.00040963304,0.001441898,0.0024058358,0.08113865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832684,0.000494861,0.00012913442,0.00037574154,0.00052742974,0.00014593966],"domain_scores_gemma":[0.9809301,0.0151164355,0.0006103056,0.00147594,0.001161637,0.00070558285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021725397,0.0013004619,0.0015463553,0.0042521516,0.0025231843,0.0042295186,0.0030422227,0.0022289557,0.008631871],"category_scores_gemma":[0.016476726,0.00092594186,0.0011242931,0.008806717,0.0053817797,0.020912979,0.0032405898,0.0078461245,0.0021291238],"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.00006559371,0.00004095783,0.00056673295,0.00029441502,0.000019723842,0.00009724048,0.00039624938,0.0032661345,0.0009670152,0.9277214,0.030103095,0.03646155],"study_design_scores_gemma":[0.000005480052,0.000011663282,0.0001923371,0.000050807077,0.000012220519,0.000044682096,0.00007089148,0.00171127,0.00029818862,0.9668267,0.030757545,0.000018201126],"about_ca_topic_score_codex":0.002379193,"about_ca_topic_score_gemma":0.0025434822,"teacher_disagreement_score":0.008631871,"about_ca_system_score_codex":0.0025148739,"about_ca_system_score_gemma":0.0008777505,"threshold_uncertainty_score":0.028876543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7179055,0.0005424658,0.18493055,0.0009688004,0.00041071064,0.0002173967,0.0007876847,0.0012160498,0.09302094],"genre_scores_gemma":[0.9152832,0.0005169685,0.044839628,0.00028375824,0.000081148835,0.0001515314,0.0006755658,0.00046854417,0.037699588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994037,0.00012205785,0.000033087654,0.000098129465,0.00015878543,0.00018418043],"domain_scores_gemma":[0.99784493,0.00086460303,0.00035684337,0.00033154892,0.00027834834,0.0003236944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052403286,0.00044132443,0.00058126973,0.0019566799,0.0019934904,0.002204535,0.0011628402,0.0016603511,0.016295336],"category_scores_gemma":[0.003963072,0.00079463836,0.00060836057,0.0017428288,0.002581486,0.002708986,0.0027717513,0.002024889,0.0021374698],"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.00024710924,0.00008481105,0.00097619864,0.00013457268,0.000011214394,0.00046047164,0.000793208,0.007461544,0.006116476,0.9463218,0.004592687,0.032799967],"study_design_scores_gemma":[0.00006524521,0.00004837924,0.0006605814,0.00006792139,0.000021764889,0.00022856628,0.0007404393,0.022551699,0.003428985,0.9658431,0.0063147764,0.000028659924],"about_ca_topic_score_codex":0.002527993,"about_ca_topic_score_gemma":0.0043801796,"teacher_disagreement_score":0.016295336,"about_ca_system_score_codex":0.0009881147,"about_ca_system_score_gemma":0.00052322407,"threshold_uncertainty_score":0.054513335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77839977,0.0010876444,0.15957928,0.00133884,0.00025702638,0.000093271134,0.00042721233,0.00059632555,0.058220726],"genre_scores_gemma":[0.9085582,0.0010524021,0.06025016,0.00033696878,0.00020655435,0.00011841763,0.000734016,0.00028126535,0.028462019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960464,0.000095297364,0.000014946731,0.000076800956,0.00009433661,0.00011402186],"domain_scores_gemma":[0.9984981,0.0009095607,0.00014778925,0.00015214882,0.00011868634,0.00017371551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030682964,0.0005289947,0.0006168293,0.0009107283,0.0012413741,0.0027014678,0.0011650937,0.00088314805,0.0058397143],"category_scores_gemma":[0.0023076697,0.00068388414,0.00042138787,0.001124849,0.0015507251,0.0023664988,0.0013544274,0.001790294,0.0007048344],"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.0004278618,0.00012937823,0.0031604143,0.00023602176,0.00003567595,0.00042723966,0.0014588308,0.024097104,0.015240252,0.8680017,0.008711936,0.07807356],"study_design_scores_gemma":[0.000044890377,0.000038988943,0.0012329941,0.000027557902,0.000035825993,0.00019122192,0.0006691218,0.022499885,0.004308131,0.96436757,0.0065612886,0.000022569675],"about_ca_topic_score_codex":0.0031056597,"about_ca_topic_score_gemma":0.005269891,"teacher_disagreement_score":0.0058397143,"about_ca_system_score_codex":0.0010878878,"about_ca_system_score_gemma":0.0005487799,"threshold_uncertainty_score":0.01953578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5766516,0.0012646687,0.15784322,0.0025232097,0.00088582025,0.00016226446,0.0010733866,0.0009312507,0.25866464],"genre_scores_gemma":[0.87517095,0.00080928986,0.045995496,0.00074696686,0.00017305872,0.00013452643,0.0008061686,0.00027896787,0.07588458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993543,0.00012141956,0.000046986243,0.00020717824,0.000106611136,0.0001635029],"domain_scores_gemma":[0.9978656,0.00059513515,0.00030369463,0.00055653596,0.00042402098,0.0002549519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005251064,0.0009004458,0.0010365058,0.0017871489,0.0033097318,0.003228236,0.0015126135,0.0017253277,0.009978699],"category_scores_gemma":[0.0023490475,0.0007059624,0.0009278521,0.0017216392,0.002793395,0.00535517,0.0020917829,0.0031350637,0.0019009047],"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.000059778307,0.000018078732,0.00041832362,0.00004655868,0.000015352896,0.0002480513,0.00020660636,0.00036332474,0.0012094908,0.98795694,0.0020037661,0.007453749],"study_design_scores_gemma":[0.000015173617,0.000011680685,0.00039176212,0.000023771718,0.000019663854,0.00040524593,0.00026163744,0.0014733475,0.0011991558,0.9862412,0.009942459,0.00001491585],"about_ca_topic_score_codex":0.0011305345,"about_ca_topic_score_gemma":0.0018383388,"teacher_disagreement_score":0.009978699,"about_ca_system_score_codex":0.00087511534,"about_ca_system_score_gemma":0.0005852947,"threshold_uncertainty_score":0.033382118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5595187,0.0032425795,0.28281024,0.008148622,0.00037714545,0.00025787335,0.0018641205,0.00055694376,0.14322379],"genre_scores_gemma":[0.8777738,0.0027425224,0.09426522,0.00061055325,0.00045344394,0.00019292162,0.0033474145,0.0004866683,0.020127445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977417,0.00080474775,0.00012767919,0.00036780932,0.0004741718,0.0004839507],"domain_scores_gemma":[0.98498684,0.012030187,0.0008212807,0.0007702837,0.0008106472,0.00058078504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024252175,0.0011861551,0.0026468944,0.0027290923,0.0036965495,0.008281046,0.003031104,0.004486218,0.021165026],"category_scores_gemma":[0.015701467,0.0015286081,0.0016921278,0.005605096,0.0036451782,0.017747782,0.004213855,0.004961049,0.0012975939],"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.0005525105,0.00025909676,0.001449318,0.00034830088,0.00009255426,0.00039893057,0.0008024993,0.071705274,0.00095849676,0.86824065,0.015426903,0.0397655],"study_design_scores_gemma":[0.000050694045,0.000040451443,0.0002836678,0.000065688364,0.000037687998,0.00017261002,0.0006864018,0.092281,0.00053547084,0.90248936,0.0033299848,0.00002696354],"about_ca_topic_score_codex":0.004431261,"about_ca_topic_score_gemma":0.0039461525,"teacher_disagreement_score":0.021165026,"about_ca_system_score_codex":0.0034331472,"about_ca_system_score_gemma":0.001804115,"threshold_uncertainty_score":0.070804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06463175,0.0006898252,0.78289914,0.0015362508,0.00034134465,0.00018742944,0.002707493,0.003122122,0.14388464],"genre_scores_gemma":[0.6888068,0.001310236,0.24987446,0.00064097054,0.00041357658,0.00058360974,0.0042417897,0.00094323093,0.05318539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.00007919614,0.000015555239,0.000059403766,0.00006424059,0.00006507226],"domain_scores_gemma":[0.9994803,0.0001441133,0.00009334339,0.00009671315,0.00011817368,0.00006741416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023137625,0.00080595765,0.00051522173,0.0019576484,0.00071405765,0.0034227967,0.0010395343,0.0010201256,0.036975704],"category_scores_gemma":[0.0012407233,0.0003927334,0.00069543,0.0017810999,0.0007712793,0.002332854,0.0009582553,0.0012592953,0.0042163585],"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.000052426578,0.000027389397,0.000104109284,0.0000646885,0.0000061691267,0.00010746182,0.00029432226,0.0040829317,0.0017338002,0.9638147,0.005925868,0.023786277],"study_design_scores_gemma":[0.000032812986,0.000036041936,0.00020341828,0.00006410517,0.000022077591,0.00014701791,0.00026957644,0.03685428,0.0013565501,0.9178143,0.04317814,0.000021723976],"about_ca_topic_score_codex":0.0012742522,"about_ca_topic_score_gemma":0.0015858911,"teacher_disagreement_score":0.036975704,"about_ca_system_score_codex":0.0006776904,"about_ca_system_score_gemma":0.00036578177,"threshold_uncertainty_score":0.12369609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.577843,0.00039737823,0.3781675,0.0014713047,0.00012909356,0.00026456633,0.00037491904,0.0010730936,0.040279057],"genre_scores_gemma":[0.9240576,0.0003045607,0.05286359,0.0002520588,0.00007045832,0.00022843391,0.00038759582,0.00033224726,0.021503434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970811,0.00079758296,0.00016014825,0.00040527302,0.00075461366,0.00080131117],"domain_scores_gemma":[0.9849258,0.010794198,0.0009288835,0.0012117386,0.0007273431,0.00141203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003351054,0.0014821981,0.002714127,0.0016941017,0.0023796626,0.004901634,0.003306265,0.0026730797,0.009024154],"category_scores_gemma":[0.016774522,0.0013436959,0.0014722575,0.0015475898,0.0022952098,0.0071223294,0.0038309526,0.0048075984,0.0014192875],"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.0012373576,0.00036558122,0.0025177062,0.0002866384,0.0001159336,0.00046591516,0.00095464115,0.0449893,0.006534694,0.89704543,0.0058110217,0.039675772],"study_design_scores_gemma":[0.00019162401,0.00008369821,0.0004193398,0.000022152071,0.000048141916,0.00013466833,0.00015204008,0.12755515,0.0013790022,0.8687814,0.0012014837,0.000031396525],"about_ca_topic_score_codex":0.003364586,"about_ca_topic_score_gemma":0.005281482,"teacher_disagreement_score":0.009024154,"about_ca_system_score_codex":0.0018642411,"about_ca_system_score_gemma":0.0024734184,"threshold_uncertainty_score":0.03018874},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6952358,0.005481063,0.09964805,0.00490083,0.00078392075,0.000052347677,0.00032259608,0.00031415647,0.19326131],"genre_scores_gemma":[0.97160226,0.0011044877,0.012103206,0.00029504352,0.00038457816,0.000041776686,0.0001389448,0.00004665952,0.014283083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989322,0.00036069934,0.000060585397,0.00023624083,0.00024270172,0.00016758007],"domain_scores_gemma":[0.9969234,0.001527106,0.0003808078,0.00030381238,0.00034264452,0.0005222911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019963803,0.0006202071,0.0009400912,0.003707961,0.00203908,0.0042743916,0.0013389998,0.0012408758,0.0049469788],"category_scores_gemma":[0.0049723936,0.00060976186,0.0005897105,0.0026013015,0.0072006127,0.008716781,0.0026369598,0.0024743632,0.00060672156],"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.000010411093,0.0000045070947,0.00009105367,0.000008520722,0.0000015153621,0.000016030566,0.0001004486,0.00024522416,0.00007373737,0.9980855,0.00026348332,0.0010994914],"study_design_scores_gemma":[0.0000040666,0.0000040200202,0.00006830623,0.0000049347077,0.00000184497,0.000030847106,0.000035956255,0.0005346809,0.00008345662,0.9981976,0.0010296224,0.0000047089557],"about_ca_topic_score_codex":0.0012726609,"about_ca_topic_score_gemma":0.0008811384,"teacher_disagreement_score":0.0049469788,"about_ca_system_score_codex":0.0018335669,"about_ca_system_score_gemma":0.00083256804,"threshold_uncertainty_score":0.01654929},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5951847,0.00040474132,0.066325955,0.0020275218,0.0009068863,0.00016834887,0.0007278857,0.0006969992,0.333557],"genre_scores_gemma":[0.9479408,0.00044165077,0.0142392,0.0008288489,0.00026008187,0.00013714569,0.00093610596,0.00017176483,0.035044286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991684,0.00016061135,0.00003740668,0.00013173936,0.00018642884,0.00031548727],"domain_scores_gemma":[0.9990933,0.0002593255,0.00021658036,0.0001183741,0.00015599519,0.00015649198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004758956,0.00093599333,0.00059875863,0.0020374455,0.0020710288,0.0034222405,0.00079821405,0.0015113996,0.015749145],"category_scores_gemma":[0.0018488457,0.00048276092,0.0006673854,0.0013909129,0.002342019,0.0036389332,0.0013625796,0.0018292955,0.0024690737],"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.00027072662,0.00008096479,0.00063063775,0.0000681422,0.000024968003,0.00070287805,0.0003513005,0.00059272774,0.0057596383,0.96626174,0.0047337343,0.02052255],"study_design_scores_gemma":[0.000048100595,0.00006564416,0.0023666555,0.000022248289,0.000034354252,0.00065603387,0.0006258311,0.0015449628,0.0073931534,0.97095037,0.016240207,0.00005239107],"about_ca_topic_score_codex":0.0007062693,"about_ca_topic_score_gemma":0.0010883103,"teacher_disagreement_score":0.015749145,"about_ca_system_score_codex":0.00084316597,"about_ca_system_score_gemma":0.0007454523,"threshold_uncertainty_score":0.052686155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6696019,0.0008141309,0.124911875,0.0013559863,0.00037523158,0.00023311072,0.00060463714,0.000555044,0.20154808],"genre_scores_gemma":[0.95883286,0.00022299778,0.01565836,0.00030728002,0.00010759041,0.000113076516,0.00040249137,0.00008705287,0.024268303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996125,0.00008174096,0.000011807996,0.00008921781,0.000100195444,0.00010451857],"domain_scores_gemma":[0.9978382,0.0008590031,0.00020359737,0.0002265262,0.00038245314,0.0004901917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038729038,0.00044862813,0.0004944045,0.0021717078,0.0021861317,0.002176376,0.0009619403,0.0007874475,0.012605206],"category_scores_gemma":[0.002591842,0.0004681509,0.00030528544,0.0010773132,0.0012902158,0.0023633295,0.0017725739,0.0015871138,0.00074120593],"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.00010823662,0.000036735895,0.0010058362,0.00006462913,0.000015551694,0.00032453882,0.00026094567,0.0010916156,0.003582391,0.977776,0.0041889604,0.011544618],"study_design_scores_gemma":[0.00005724563,0.000034581877,0.0007129065,0.000043249365,0.000032878917,0.0006055384,0.00033897776,0.007858435,0.0047049588,0.9750636,0.010530098,0.000017353259],"about_ca_topic_score_codex":0.00045700764,"about_ca_topic_score_gemma":0.0008868864,"teacher_disagreement_score":0.012605206,"about_ca_system_score_codex":0.0008398464,"about_ca_system_score_gemma":0.00050529663,"threshold_uncertainty_score":0.042168677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90034384,0.0007376557,0.040044267,0.0007625819,0.000104875864,0.000066868495,0.00029906057,0.00013837649,0.057502538],"genre_scores_gemma":[0.9719363,0.0009795708,0.016583866,0.0003284933,0.000112178226,0.00010487869,0.0006417997,0.0000941483,0.009218809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951553,0.00014971154,0.00002435981,0.00009456131,0.00010717519,0.000108717286],"domain_scores_gemma":[0.99682,0.0017436518,0.00051220047,0.00025399783,0.00029978078,0.00037036595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047163473,0.00043663062,0.0006648042,0.0014268414,0.0022860025,0.0017682381,0.0010863779,0.00095493725,0.0076053366],"category_scores_gemma":[0.0028254932,0.0005121705,0.00055074674,0.0013348699,0.0019093824,0.002144911,0.001887306,0.0009764973,0.0004590258],"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.00026847675,0.00007508345,0.003948779,0.00017548613,0.00003867738,0.0005033114,0.0012153797,0.012758192,0.0048469943,0.95020175,0.0049400385,0.021027934],"study_design_scores_gemma":[0.00008147594,0.00009469961,0.0043737045,0.000092194554,0.00006270213,0.0006415428,0.0016452792,0.0403232,0.0033282991,0.9399188,0.009396713,0.000041353083],"about_ca_topic_score_codex":0.0027322685,"about_ca_topic_score_gemma":0.0038554934,"teacher_disagreement_score":0.0076053366,"about_ca_system_score_codex":0.0006191089,"about_ca_system_score_gemma":0.00043724853,"threshold_uncertainty_score":0.025442421},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21344279,0.0011693207,0.4444593,0.0032158971,0.00042584605,0.00011954628,0.00042427483,0.00070103694,0.33604205],"genre_scores_gemma":[0.89969164,0.00079981727,0.057575736,0.00068830594,0.00027069662,0.00030081894,0.0004504575,0.0004051437,0.03981735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977119,0.0009569418,0.00009799419,0.00046243818,0.00044112763,0.00032953118],"domain_scores_gemma":[0.99634296,0.002120699,0.00024755977,0.0007207887,0.0002703311,0.00029770331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014909443,0.0011229455,0.0010602004,0.0026285243,0.0046631144,0.004908221,0.0019578263,0.0020137154,0.015360177],"category_scores_gemma":[0.0039500794,0.0012649562,0.0014497056,0.002895628,0.0063286074,0.008874798,0.004644065,0.0047275773,0.0016436802],"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.0000057112193,0.000005801042,0.000030585747,0.000007705769,0.000001591606,0.000028356579,0.00009154174,0.0001630357,0.00010509405,0.9983308,0.0002828931,0.00094687764],"study_design_scores_gemma":[0.0000037647692,0.0000030062165,0.000021624892,0.0000064825563,0.0000041051685,0.00007621899,0.00005158464,0.00084603933,0.00024350097,0.9968867,0.0018516005,0.0000054807265],"about_ca_topic_score_codex":0.0006777146,"about_ca_topic_score_gemma":0.00071564736,"teacher_disagreement_score":0.015360177,"about_ca_system_score_codex":0.0012229553,"about_ca_system_score_gemma":0.0008094083,"threshold_uncertainty_score":0.051384926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8259933,0.000557732,0.10245025,0.0014247778,0.00011959179,0.00013343949,0.0004912287,0.0005125924,0.06831704],"genre_scores_gemma":[0.96390945,0.00028726287,0.015671851,0.00034089797,0.0000799914,0.00011005292,0.00059155974,0.00012890463,0.018880079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987307,0.0002444146,0.0000636879,0.0003219247,0.0003061106,0.00033319223],"domain_scores_gemma":[0.99449015,0.0030120572,0.00056490453,0.00053056615,0.0005399116,0.0008624016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009903224,0.00068062736,0.00096548453,0.002592593,0.0041235476,0.004164984,0.0022459305,0.001756528,0.009136864],"category_scores_gemma":[0.005401953,0.00112479,0.00078572845,0.0031643796,0.0031077643,0.0065411367,0.003356695,0.0024919666,0.0009811546],"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.00022840369,0.00020428335,0.0033797286,0.00019953401,0.000056090288,0.00083962426,0.0017982002,0.005277473,0.0056561087,0.947198,0.0044865515,0.030676099],"study_design_scores_gemma":[0.00005688039,0.000025863983,0.00078803516,0.00003866673,0.00004648232,0.00045267574,0.00050675694,0.009846571,0.0031526801,0.98118883,0.003867031,0.00002953247],"about_ca_topic_score_codex":0.0024443134,"about_ca_topic_score_gemma":0.004382778,"teacher_disagreement_score":0.009136864,"about_ca_system_score_codex":0.0013031667,"about_ca_system_score_gemma":0.0011678815,"threshold_uncertainty_score":0.030565798},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22687152,0.0038790882,0.28653774,0.0097026,0.0015289326,0.00009013913,0.00044238914,0.00079888594,0.47014883],"genre_scores_gemma":[0.9365466,0.0018491771,0.024277056,0.001528016,0.0017660906,0.00014133002,0.00018688792,0.0002141183,0.033490613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994672,0.00016241356,0.000021829812,0.00012971826,0.00014347374,0.00007539338],"domain_scores_gemma":[0.9982566,0.0009453723,0.0001237326,0.00020601747,0.0002925327,0.00017568468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008650021,0.0006841397,0.00083533616,0.0026688043,0.0015573573,0.0020145406,0.0010900352,0.0011517851,0.008611794],"category_scores_gemma":[0.0038660804,0.0003141452,0.00097214093,0.0013685374,0.0031805963,0.006197564,0.002672466,0.002561999,0.0009978062],"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.000015529244,0.000010239828,0.0001088017,0.000028793285,0.0000041567423,0.000045241813,0.0001487072,0.00093119935,0.00031521902,0.9899559,0.0020377534,0.0063985446],"study_design_scores_gemma":[0.0000042342917,0.00000628161,0.00013827215,0.000006654003,0.000003105728,0.000042762833,0.000023534763,0.003304015,0.00018383359,0.99201363,0.004267565,0.0000060399393],"about_ca_topic_score_codex":0.0006892245,"about_ca_topic_score_gemma":0.00051794545,"teacher_disagreement_score":0.008611794,"about_ca_system_score_codex":0.0010782522,"about_ca_system_score_gemma":0.0005219598,"threshold_uncertainty_score":0.028809309},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10607864,0.00045589817,0.88423246,0.00043381177,0.00016158009,0.000054177337,0.0003000628,0.0008086041,0.0074746693],"genre_scores_gemma":[0.76632184,0.00034534684,0.23036972,0.00014742049,0.000091833455,0.000044763987,0.00033771657,0.00013970622,0.0022016468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988117,0.00039282447,0.000040571576,0.00030928833,0.00030776122,0.00013782507],"domain_scores_gemma":[0.99820304,0.0006848647,0.00030765083,0.0004395583,0.00024709574,0.000117814845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007934243,0.00068911194,0.0009897533,0.0012769994,0.00046968245,0.0015349407,0.0010477094,0.0009850904,0.0020985345],"category_scores_gemma":[0.004987201,0.00060800003,0.0005677273,0.001842868,0.0008006487,0.0024469155,0.0017729038,0.001052181,0.000549019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015176567,0.00017830783,0.014464798,0.00018764273,0.00020469713,0.00034828242,0.00042793434,0.5144386,0.060449447,0.0625657,0.0077346736,0.3374823],"study_design_scores_gemma":[0.000036955345,0.00011290727,0.0019664494,0.000016594546,0.00003516994,0.00013648953,0.00014083226,0.959297,0.009796101,0.024936613,0.0034943204,0.00003058976],"about_ca_topic_score_codex":0.0016937789,"about_ca_topic_score_gemma":0.0017294358,"teacher_disagreement_score":0.0020985345,"about_ca_system_score_codex":0.0005380266,"about_ca_system_score_gemma":0.0005031746,"threshold_uncertainty_score":0.0070202947},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45047286,0.0024832506,0.49278784,0.0012308531,0.0003059687,0.00012855975,0.00055544014,0.00075672596,0.05127845],"genre_scores_gemma":[0.85534745,0.0017718197,0.12313095,0.0002381893,0.00024890495,0.00010805325,0.001089578,0.00042781723,0.01763726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992812,0.00018323271,0.000040408195,0.00014223318,0.00022632586,0.00012665968],"domain_scores_gemma":[0.997419,0.001519515,0.00030264675,0.00046104915,0.00013153392,0.00016632804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042822128,0.00061652367,0.0010042198,0.0015484485,0.0012958173,0.0025762024,0.0013388615,0.0018323654,0.00853193],"category_scores_gemma":[0.0060680015,0.0009771786,0.0009581822,0.0033170336,0.0021563002,0.004143886,0.0026792078,0.0016338114,0.00096521777],"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.00026381382,0.000121028956,0.002303213,0.00031849774,0.0000299947,0.00052826817,0.0011213461,0.099481255,0.0046446207,0.7545179,0.0086968085,0.12797321],"study_design_scores_gemma":[0.000033776938,0.000052151558,0.00087191956,0.00005733992,0.000027089203,0.0004991525,0.00038123762,0.16103283,0.0031828561,0.8248292,0.009012619,0.000019871972],"about_ca_topic_score_codex":0.0016898682,"about_ca_topic_score_gemma":0.0013967116,"teacher_disagreement_score":0.00853193,"about_ca_system_score_codex":0.0006295189,"about_ca_system_score_gemma":0.00032074592,"threshold_uncertainty_score":0.028542161},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016305696,0.71301556,0.12414125,0.033846643,0.009815825,0.000073324016,0.00036512918,0.00037603188,0.10206053],"genre_scores_gemma":[0.20574854,0.61228544,0.094741,0.008601346,0.04725742,0.00014543628,0.00076131715,0.00029184963,0.030167634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887806,0.00035042985,0.00007643127,0.0002982903,0.00029915865,0.00009762191],"domain_scores_gemma":[0.99341327,0.0047447584,0.00024252279,0.00052751193,0.0007755972,0.00029636064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031131876,0.0010723093,0.0012842531,0.004154722,0.0015525188,0.0039734435,0.0021864148,0.002086398,0.0064667887],"category_scores_gemma":[0.00804512,0.0006078969,0.00097628246,0.007620554,0.0054901806,0.00914024,0.0023969419,0.0043113953,0.0021450622],"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.00009099136,0.000119412696,0.00084512157,0.0019690795,0.000051524778,0.00016445309,0.0004947169,0.0029779787,0.001064594,0.740546,0.03438351,0.21729265],"study_design_scores_gemma":[0.000013721565,0.000050152743,0.00056342065,0.00020598403,0.000030971725,0.00025565593,0.00019659106,0.004053659,0.0004895847,0.8171568,0.17695333,0.000030163776],"about_ca_topic_score_codex":0.0009917156,"about_ca_topic_score_gemma":0.0010977826,"teacher_disagreement_score":0.0064667887,"about_ca_system_score_codex":0.0017936204,"about_ca_system_score_gemma":0.000874409,"threshold_uncertainty_score":0.021633506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9297163,0.0012648196,0.041156672,0.0009888016,0.00008111038,0.000092682305,0.0008841577,0.0004647153,0.025350738],"genre_scores_gemma":[0.9674246,0.0007975895,0.01638059,0.00041591542,0.00008934917,0.00011517058,0.0012072168,0.00018517658,0.013384385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936885,0.00010334429,0.000044294426,0.00016514417,0.0001582929,0.00016004001],"domain_scores_gemma":[0.995968,0.0020013403,0.0006892012,0.00029401007,0.00042400748,0.00062342925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044372556,0.0007134961,0.0007748588,0.0028457267,0.0020900278,0.002777418,0.0015602665,0.0013276942,0.0059773372],"category_scores_gemma":[0.0039270404,0.001046141,0.0005990035,0.0036341802,0.0014941535,0.004626366,0.0020599274,0.001239623,0.0006384325],"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.00073883036,0.00026054168,0.0069409506,0.00068189343,0.00012931754,0.0008864616,0.0021579643,0.018949566,0.01760135,0.8660512,0.009677511,0.07592437],"study_design_scores_gemma":[0.000058516052,0.000056524284,0.0018395965,0.00006270281,0.000060709463,0.0003414642,0.00046435808,0.016102655,0.0034067284,0.97259605,0.0049775303,0.000033113887],"about_ca_topic_score_codex":0.0031877777,"about_ca_topic_score_gemma":0.0062562954,"teacher_disagreement_score":0.0059773372,"about_ca_system_score_codex":0.0013103893,"about_ca_system_score_gemma":0.0008444939,"threshold_uncertainty_score":0.019996166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72741103,0.0008896578,0.13252532,0.0032799426,0.000307837,0.00011395425,0.0012238987,0.000647113,0.13360126],"genre_scores_gemma":[0.9598181,0.00059330266,0.010607623,0.0008645186,0.0004729231,0.00014510727,0.0012349349,0.00036826404,0.025895229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986155,0.00023103181,0.00006650037,0.00030007082,0.00041390152,0.0003729386],"domain_scores_gemma":[0.99570256,0.0017663104,0.0007800588,0.00039215517,0.00055172417,0.00080720766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890592,0.0015551153,0.0011579077,0.0035114735,0.0020470377,0.0049795024,0.0020098658,0.002201975,0.011687467],"category_scores_gemma":[0.0048727603,0.0009205175,0.0012043857,0.0026784306,0.0033091577,0.007155034,0.0032820704,0.0038810628,0.0014496166],"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.00008291169,0.000029441222,0.0003323446,0.000026046686,0.0000074691798,0.000066940935,0.00022033398,0.0007647021,0.0014128034,0.9923564,0.0012290122,0.0034714928],"study_design_scores_gemma":[0.000020613503,0.000040605744,0.00072964665,0.00002514024,0.000016471562,0.0003034831,0.00015233348,0.009412845,0.001165175,0.9844588,0.0036346707,0.000040261246],"about_ca_topic_score_codex":0.00089035573,"about_ca_topic_score_gemma":0.000768219,"teacher_disagreement_score":0.011687467,"about_ca_system_score_codex":0.0022533133,"about_ca_system_score_gemma":0.0007876022,"threshold_uncertainty_score":0.03909844},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24485795,0.0018768874,0.58415085,0.0022257515,0.0003487001,0.0002154093,0.0015747752,0.00034719458,0.16440251],"genre_scores_gemma":[0.6451322,0.0028852643,0.26229838,0.000996479,0.00041261388,0.0002707201,0.0042508063,0.00050179084,0.08325175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995167,0.00013271708,0.000022004195,0.0001182718,0.00010883038,0.00010143304],"domain_scores_gemma":[0.99868447,0.0005110375,0.00013714215,0.0002229568,0.00021317803,0.00023122167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058776955,0.0010425895,0.0008232296,0.0019769478,0.001332956,0.0027022902,0.00091750093,0.0009065056,0.008995799],"category_scores_gemma":[0.0019679132,0.00065575883,0.0012386629,0.0018348756,0.0017760778,0.0037466146,0.0020227432,0.0022722776,0.0011642267],"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.00005753459,0.000039249062,0.00022689602,0.00008012637,0.000017912247,0.00009399893,0.00032900233,0.0049071116,0.0013508322,0.97334903,0.0049353032,0.01461309],"study_design_scores_gemma":[0.000010777696,0.0000094436855,0.00017424587,0.00003942652,0.000012514728,0.000058456248,0.00012039045,0.009687909,0.00023876717,0.9833015,0.0063415575,0.000005005913],"about_ca_topic_score_codex":0.0018024817,"about_ca_topic_score_gemma":0.0025902563,"teacher_disagreement_score":0.008995799,"about_ca_system_score_codex":0.0011096124,"about_ca_system_score_gemma":0.00054459594,"threshold_uncertainty_score":0.030093968},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6228656,0.0008090564,0.29217666,0.0009157465,0.000371134,0.00018534776,0.000420791,0.0010790984,0.08117657],"genre_scores_gemma":[0.9134146,0.0005608431,0.06841454,0.00026889404,0.00009273722,0.00012791269,0.00030762688,0.00035696843,0.016455878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99967,0.00009209741,0.00001697795,0.000060328264,0.00008494572,0.00007563512],"domain_scores_gemma":[0.99873644,0.0006142735,0.00013630357,0.00023823418,0.00011558649,0.00015914589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002930008,0.00051481376,0.00074372586,0.0009523546,0.0012602353,0.0017882856,0.00078994274,0.0009291764,0.007915263],"category_scores_gemma":[0.0017379251,0.0006704039,0.0006567639,0.0014131374,0.0013494999,0.0019745633,0.0019730483,0.0018568513,0.0009167534],"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.0003337851,0.00008242314,0.0007791482,0.00025382522,0.000035631932,0.0003353797,0.0006744975,0.045607932,0.027440963,0.86492896,0.00766484,0.05186251],"study_design_scores_gemma":[0.000084424704,0.000082119295,0.00045642484,0.000042803378,0.000030326735,0.0002942289,0.00030007056,0.12242296,0.009163932,0.8575013,0.00958078,0.000040668598],"about_ca_topic_score_codex":0.002155856,"about_ca_topic_score_gemma":0.0035787905,"teacher_disagreement_score":0.007915263,"about_ca_system_score_codex":0.0009815701,"about_ca_system_score_gemma":0.0005801705,"threshold_uncertainty_score":0.026479185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.691989,0.0011726606,0.17836586,0.002291077,0.00032560984,0.000043706503,0.00026265322,0.00023355882,0.12531589],"genre_scores_gemma":[0.9725752,0.0005318619,0.01687238,0.00039081305,0.00030185236,0.00006201112,0.00013529368,0.00011278904,0.009017708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990458,0.00033520162,0.000037928425,0.00013513502,0.00026197583,0.0001839381],"domain_scores_gemma":[0.99689937,0.0017629936,0.00037795666,0.00035330994,0.00031422137,0.00029226678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001073408,0.00066301617,0.00051018037,0.0030196558,0.0011862377,0.0029239014,0.0006646316,0.0014979579,0.006029677],"category_scores_gemma":[0.004229866,0.00051542016,0.00043541077,0.001315379,0.0028553186,0.002657651,0.0014375993,0.0010714624,0.00065123563],"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.000051572017,0.000016340819,0.00021001017,0.000014607013,0.0000028841694,0.000058029505,0.00011611973,0.0012389903,0.0025524937,0.9913229,0.0004970487,0.003918987],"study_design_scores_gemma":[0.000016665952,0.000016172402,0.00032105675,0.00002390737,0.000005400827,0.00018541193,0.00011514245,0.018920453,0.0011002799,0.97779626,0.0014774626,0.00002171955],"about_ca_topic_score_codex":0.0005461476,"about_ca_topic_score_gemma":0.0005657549,"teacher_disagreement_score":0.006029677,"about_ca_system_score_codex":0.0007696383,"about_ca_system_score_gemma":0.00047117367,"threshold_uncertainty_score":0.020171225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49582174,0.00032979442,0.4280171,0.0005870828,0.00012206654,0.0001758308,0.00057841983,0.0005877416,0.07378025],"genre_scores_gemma":[0.90840364,0.0003576417,0.068986796,0.00023206518,0.00007004511,0.00015266394,0.000726155,0.00034192798,0.020728964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991295,0.00020848998,0.000060661605,0.00014744361,0.0002090943,0.00024482067],"domain_scores_gemma":[0.99740124,0.001071798,0.00025299005,0.0006948577,0.00030724108,0.00027186016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008026758,0.00055955997,0.00092140597,0.0012634889,0.0016576414,0.002205349,0.0010199302,0.0010964391,0.012648598],"category_scores_gemma":[0.0035392935,0.0006132208,0.0005623483,0.0019124327,0.0013238286,0.0042888965,0.0023875092,0.0019197526,0.0011416705],"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.00026762346,0.00009804651,0.0007033041,0.00013579502,0.00002166203,0.00031261952,0.00060529035,0.013620729,0.010632339,0.9323165,0.0034865702,0.037799522],"study_design_scores_gemma":[0.000034432967,0.000045765206,0.00038410848,0.000029473853,0.000027710921,0.0002581714,0.00024800227,0.031823467,0.0055553634,0.9550305,0.006544158,0.000018793184],"about_ca_topic_score_codex":0.00082218694,"about_ca_topic_score_gemma":0.001785038,"teacher_disagreement_score":0.012648598,"about_ca_system_score_codex":0.0010866377,"about_ca_system_score_gemma":0.0006146023,"threshold_uncertainty_score":0.042313814},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27217224,0.00094445696,0.6624035,0.0015277326,0.000135364,0.00019918522,0.0016708361,0.0021129185,0.05883373],"genre_scores_gemma":[0.7276518,0.0006353564,0.25331175,0.00032255938,0.000077692785,0.00021251747,0.0027039212,0.0008352084,0.014249184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835545,0.00040277865,0.00009294518,0.00038044178,0.00042584204,0.0003425122],"domain_scores_gemma":[0.99367964,0.0042349705,0.00040713782,0.0009885399,0.000383749,0.0003058583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013617404,0.0015371302,0.001573402,0.0032287284,0.0029818038,0.0037101652,0.003758226,0.0025664344,0.014353056],"category_scores_gemma":[0.011237432,0.0012888581,0.0018995508,0.0041278596,0.0026175925,0.008843374,0.004922819,0.0042202706,0.0012986066],"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.0001225071,0.000121767225,0.0012241764,0.00031019593,0.000042108124,0.00015431386,0.00045324088,0.04617897,0.0018693353,0.88630235,0.0054519614,0.05776908],"study_design_scores_gemma":[0.000011725518,0.000018148736,0.00019266066,0.000044216504,0.000027611144,0.000099587945,0.00018192864,0.04790393,0.0009791331,0.9475403,0.0029843708,0.000016349237],"about_ca_topic_score_codex":0.002240979,"about_ca_topic_score_gemma":0.00644003,"teacher_disagreement_score":0.014353056,"about_ca_system_score_codex":0.0016332926,"about_ca_system_score_gemma":0.0013676996,"threshold_uncertainty_score":0.048015773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87643415,0.00083005417,0.08205655,0.0010858114,0.000052516,0.000037757916,0.0007926621,0.000455649,0.038254824],"genre_scores_gemma":[0.9794408,0.00037750736,0.015988534,0.00010152772,0.00006709401,0.00005908977,0.0002951509,0.00015406971,0.0035161627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926347,0.0001579243,0.000039787654,0.00022378647,0.00016150862,0.0001535339],"domain_scores_gemma":[0.99065685,0.0053252736,0.0012689333,0.00081441144,0.00053396757,0.0014006405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017942659,0.0006605022,0.0008631434,0.0036028274,0.0020166382,0.0051600323,0.0022758436,0.0014182917,0.0044672666],"category_scores_gemma":[0.009312269,0.00084103795,0.0005080826,0.002454057,0.0025684494,0.0062140767,0.001532312,0.0014592571,0.0004907355],"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.00095280795,0.00016011995,0.011646086,0.00034142833,0.00010463355,0.0002203811,0.0012779945,0.04364716,0.022589028,0.8878155,0.004655701,0.026589235],"study_design_scores_gemma":[0.000052640506,0.000080571815,0.0047401767,0.00009062156,0.0000813698,0.00038264747,0.0004993547,0.117469355,0.009078856,0.8641277,0.0033355555,0.00006118],"about_ca_topic_score_codex":0.0015334965,"about_ca_topic_score_gemma":0.0025951145,"teacher_disagreement_score":0.0051600323,"about_ca_system_score_codex":0.0036011264,"about_ca_system_score_gemma":0.0012242532,"threshold_uncertainty_score":0.026128054},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13549891,0.008088638,0.2922118,0.029791277,0.010394818,0.00020333599,0.0005946542,0.00040545932,0.5228111],"genre_scores_gemma":[0.7464399,0.010001126,0.07331722,0.003645685,0.0061530946,0.00027651797,0.000517638,0.0005224482,0.15912637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907243,0.00030166548,0.000040427807,0.00019959817,0.00024045802,0.00014549702],"domain_scores_gemma":[0.998338,0.0011271898,0.00007152293,0.00014634128,0.000110524044,0.00020633375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078383606,0.0014348433,0.001955841,0.0011664507,0.0026849539,0.0039054204,0.0026293772,0.0033348033,0.010976109],"category_scores_gemma":[0.004626208,0.00061700924,0.0014601065,0.0017630871,0.004192444,0.008940794,0.004066376,0.0052339607,0.0015554759],"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.0000694815,0.000046595473,0.00016787887,0.00013559352,0.000027348007,0.00036207616,0.00026900572,0.012988786,0.0012460377,0.9595374,0.015459739,0.009690054],"study_design_scores_gemma":[0.000016678108,0.00002954567,0.00017214709,0.000036358884,0.000016405558,0.00008435847,0.00015853609,0.0159363,0.00031298024,0.9650272,0.018178893,0.000030525818],"about_ca_topic_score_codex":0.0057957773,"about_ca_topic_score_gemma":0.0069269612,"teacher_disagreement_score":0.010976109,"about_ca_system_score_codex":0.0020919424,"about_ca_system_score_gemma":0.0008971244,"threshold_uncertainty_score":0.036718726},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8092224,0.0005101474,0.041569237,0.0014972605,0.0004278773,0.00006175578,0.00087927026,0.00055001455,0.14528207],"genre_scores_gemma":[0.9717727,0.000276639,0.0126165375,0.00022793781,0.00007881558,0.000055836565,0.0005371622,0.0002438106,0.014190688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938226,0.00011439061,0.00002325902,0.00016477559,0.0001598608,0.0001554812],"domain_scores_gemma":[0.99807405,0.00092168816,0.00031891093,0.00020353522,0.00015118184,0.0003306448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080393226,0.0005392555,0.0003634835,0.0026590114,0.001899944,0.0029764345,0.0009145527,0.0014340939,0.012864219],"category_scores_gemma":[0.004166713,0.00036585395,0.00038142715,0.0018629745,0.0016053941,0.0021998,0.0011856441,0.0014109147,0.0013180852],"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.0004695506,0.00014590652,0.0075289914,0.0001548805,0.000046235666,0.00092749804,0.00059495267,0.016245306,0.01916803,0.87786347,0.017045408,0.05980978],"study_design_scores_gemma":[0.000047024772,0.000103507446,0.008934655,0.000091794034,0.000059233233,0.0020800754,0.00059478654,0.07263006,0.01803857,0.86961263,0.027730305,0.00007740684],"about_ca_topic_score_codex":0.001087749,"about_ca_topic_score_gemma":0.0015347784,"teacher_disagreement_score":0.012864219,"about_ca_system_score_codex":0.0012948329,"about_ca_system_score_gemma":0.00058947393,"threshold_uncertainty_score":0.04303515},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57490456,0.00080803165,0.1528967,0.0011872272,0.0004901422,0.000108218235,0.00041627872,0.00041614933,0.26877257],"genre_scores_gemma":[0.9526753,0.00036801616,0.025713688,0.0003200142,0.000086572145,0.000070246526,0.00031729168,0.000048465503,0.02040042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997744,0.00006570957,0.000011468781,0.00004055665,0.000064298125,0.00004361592],"domain_scores_gemma":[0.99967134,0.00007921636,0.000048552403,0.0000655224,0.000057166173,0.000078279954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014647513,0.0003414213,0.0005248227,0.0008479381,0.0008781474,0.0013934001,0.00054840633,0.0009473839,0.011565201],"category_scores_gemma":[0.00073921535,0.00031051665,0.00031426022,0.00072750216,0.0006644188,0.001181893,0.001031088,0.0008796473,0.0011209416],"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.00010548681,0.000034643897,0.00036227654,0.00007554356,0.000014241495,0.00034342892,0.00012691805,0.008096348,0.0062899017,0.9700828,0.0029119025,0.011556484],"study_design_scores_gemma":[0.000051275754,0.000052097836,0.00068383454,0.000028308792,0.000015935331,0.00066152745,0.00032645487,0.046910882,0.0029460022,0.9382094,0.010088701,0.000025573374],"about_ca_topic_score_codex":0.00031677136,"about_ca_topic_score_gemma":0.00052899093,"teacher_disagreement_score":0.011565201,"about_ca_system_score_codex":0.0003368157,"about_ca_system_score_gemma":0.00027598784,"threshold_uncertainty_score":0.038689494},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7871278,0.0013998592,0.12547404,0.0027895868,0.00012645051,0.00009336075,0.00080948434,0.00043533143,0.08174413],"genre_scores_gemma":[0.96445215,0.0010289828,0.021082858,0.00047930656,0.000249933,0.00026248817,0.00066245085,0.0001592296,0.011622644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757165,0.00070631533,0.00012020942,0.000602188,0.00045871266,0.00054098136],"domain_scores_gemma":[0.98245066,0.011771133,0.0021603485,0.0012056961,0.0005980512,0.0018141923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020578983,0.0014136389,0.0018774406,0.0048346883,0.0047513517,0.0077199475,0.0028937953,0.002720253,0.0043506343],"category_scores_gemma":[0.010188227,0.0014043113,0.0016262742,0.004997177,0.009412052,0.014265563,0.005473885,0.0037342366,0.0007895462],"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.00011284399,0.00004691019,0.0006816588,0.00006842834,0.000015290776,0.00018446881,0.0005903537,0.0024103606,0.0010796122,0.99096406,0.0007975458,0.0030483531],"study_design_scores_gemma":[0.000018354287,0.000011138448,0.00029009394,0.000033801996,0.000015743168,0.00014370994,0.00020125942,0.005643733,0.00044546995,0.9925264,0.0006546358,0.000015536549],"about_ca_topic_score_codex":0.001668123,"about_ca_topic_score_gemma":0.0017747529,"teacher_disagreement_score":0.0077199475,"about_ca_system_score_codex":0.0030999342,"about_ca_system_score_gemma":0.0012087419,"threshold_uncertainty_score":0.022491693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.788127,0.00055755256,0.13557652,0.0012303219,0.00034103575,0.00009132053,0.00047893642,0.0005546027,0.07304265],"genre_scores_gemma":[0.96706825,0.00020539596,0.022319572,0.00027154057,0.000126238,0.00006579679,0.00023803227,0.00011904592,0.009586121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992525,0.00019563832,0.000042932654,0.000108294684,0.00023415711,0.0001664975],"domain_scores_gemma":[0.9980015,0.00091875286,0.0002808547,0.00030460395,0.0002532696,0.00024098565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006181331,0.0005781193,0.00070492737,0.0023729028,0.0016775747,0.002633264,0.00083246845,0.0016149845,0.0050849314],"category_scores_gemma":[0.0037418674,0.0004954982,0.00048325074,0.0011290164,0.0017524995,0.0018066431,0.0018394995,0.0017780504,0.0007987755],"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.00019853136,0.000043611133,0.00048088687,0.00005245068,0.000009649729,0.00021008363,0.00017169696,0.003606547,0.006600241,0.9791606,0.0013977794,0.008067857],"study_design_scores_gemma":[0.000066870096,0.000050870483,0.000570769,0.000059677073,0.000026417372,0.0007628685,0.00015305958,0.04683028,0.0123052355,0.9355597,0.0035591696,0.00005518238],"about_ca_topic_score_codex":0.00037231686,"about_ca_topic_score_gemma":0.00072012155,"teacher_disagreement_score":0.0050849314,"about_ca_system_score_codex":0.00097619917,"about_ca_system_score_gemma":0.0007390495,"threshold_uncertainty_score":0.017010808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4390591,0.0065621776,0.21021956,0.009412669,0.0008130234,0.00006944435,0.0005850361,0.000441055,0.33283794],"genre_scores_gemma":[0.946195,0.0029515622,0.012964594,0.00053703424,0.00090927654,0.00004630688,0.0002507328,0.00016501191,0.035980552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933726,0.0001787539,0.00001657773,0.000111804155,0.00018035872,0.0001752191],"domain_scores_gemma":[0.9952578,0.003517419,0.00029620613,0.00029229437,0.0003409497,0.00029530807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008278093,0.0006193276,0.0008344388,0.0021817717,0.0015349224,0.0021365606,0.0010861647,0.0009935764,0.010173038],"category_scores_gemma":[0.008664157,0.0004297888,0.0004410927,0.0025856332,0.0036150855,0.004921574,0.0020775748,0.0038151208,0.0015522076],"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.00004827033,0.000025714975,0.00033979316,0.000053560987,0.00000616971,0.000068732035,0.00033522674,0.0034279441,0.00072844053,0.9733224,0.0034766719,0.018167045],"study_design_scores_gemma":[0.00000891236,0.0000051513334,0.00018189441,0.000015317915,0.0000036792103,0.00004419891,0.00006206507,0.0041051432,0.00017654728,0.9925107,0.002878973,0.00000740298],"about_ca_topic_score_codex":0.001962531,"about_ca_topic_score_gemma":0.002478222,"teacher_disagreement_score":0.010173038,"about_ca_system_score_codex":0.0014900033,"about_ca_system_score_gemma":0.0006982703,"threshold_uncertainty_score":0.034032226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15626031,0.00064047024,0.7882944,0.001398348,0.0002924471,0.0004097106,0.0019729377,0.027157316,0.023574047],"genre_scores_gemma":[0.39597386,0.000245159,0.57329786,0.00058746006,0.00008584938,0.000338388,0.0081440015,0.0016238791,0.01970363],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989396,0.000101405705,0.000074557545,0.00041399538,0.00021522731,0.00025535413],"domain_scores_gemma":[0.99831736,0.00057118374,0.000096518386,0.00063433603,0.00023040337,0.0001502431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039862763,0.0012541446,0.0012774415,0.0011338606,0.0012948969,0.0025539994,0.002769688,0.0015489807,0.017906843],"category_scores_gemma":[0.0017626818,0.0008310082,0.0014210106,0.0017661739,0.00075907685,0.004706406,0.0028817893,0.001648067,0.006171021],"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.0009724003,0.00047285587,0.0032192538,0.00046966274,0.0001048721,0.00029363178,0.00034456307,0.025386944,0.045858704,0.016899178,0.041610353,0.8643675],"study_design_scores_gemma":[0.00048766262,0.00031331592,0.004091641,0.00009136439,0.0002456889,0.00085684686,0.0009766571,0.73740774,0.0945001,0.122930974,0.037931353,0.00016674139],"about_ca_topic_score_codex":0.0060161115,"about_ca_topic_score_gemma":0.010837719,"teacher_disagreement_score":0.017906843,"about_ca_system_score_codex":0.001574071,"about_ca_system_score_gemma":0.0019161571,"threshold_uncertainty_score":0.059904337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4196138,0.0010677673,0.37212288,0.0082679065,0.00044825886,0.00049534993,0.006911251,0.0019217841,0.189151],"genre_scores_gemma":[0.76951426,0.00065580214,0.18388583,0.0010424278,0.000311428,0.0006063831,0.0043230965,0.00064051215,0.039020278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981086,0.00043735336,0.00012888391,0.0005324867,0.00043092322,0.0003617463],"domain_scores_gemma":[0.9925874,0.0031463432,0.00086179137,0.0014194277,0.00076532736,0.0012198157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009866299,0.0016022887,0.0024353073,0.0018439393,0.0042868196,0.0056446404,0.004268471,0.0022381595,0.018763436],"category_scores_gemma":[0.0063263434,0.0019770872,0.0017049903,0.0022555336,0.0035610045,0.008756776,0.0032251365,0.004140373,0.0026467848],"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.0003385933,0.000083904444,0.0008003596,0.00025260757,0.0000727217,0.00025308333,0.00022305618,0.0037989987,0.0046517127,0.97138464,0.0065733213,0.0115669435],"study_design_scores_gemma":[0.00007063353,0.00003155437,0.00071894616,0.000051127958,0.000070246264,0.0004653012,0.00020912381,0.009007524,0.0035692253,0.9785169,0.007259136,0.000030242376],"about_ca_topic_score_codex":0.0012219143,"about_ca_topic_score_gemma":0.0022538085,"teacher_disagreement_score":0.018763436,"about_ca_system_score_codex":0.0022021185,"about_ca_system_score_gemma":0.0015124233,"threshold_uncertainty_score":0.06276989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49612954,0.005571716,0.44289863,0.0030997861,0.00038658245,0.000063145024,0.00078700983,0.00043880584,0.05062479],"genre_scores_gemma":[0.9599195,0.0013108853,0.03266765,0.00035932992,0.0005914517,0.00008631833,0.00033438337,0.00029157673,0.0044388697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99599755,0.0014314922,0.00015343558,0.0010204694,0.00080927886,0.00058784836],"domain_scores_gemma":[0.88788706,0.090527415,0.007252944,0.005556843,0.004406763,0.0043689613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046881214,0.001065793,0.0015298525,0.0062776557,0.0020968795,0.006394695,0.0044726157,0.0022657865,0.0071679545],"category_scores_gemma":[0.06220528,0.0010675869,0.00087500026,0.0065600467,0.0058964547,0.0125483405,0.003219779,0.005414683,0.0007794697],"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.00014465429,0.00006611208,0.0033881355,0.00016036433,0.000075466574,0.00015667864,0.00068106403,0.02386464,0.0030009074,0.95717585,0.0020337675,0.009252389],"study_design_scores_gemma":[0.000016812155,0.000032166638,0.0021635112,0.000046634963,0.000070851514,0.0001716183,0.00019149767,0.060181163,0.00087495655,0.93440574,0.0017883601,0.000056558525],"about_ca_topic_score_codex":0.0028176457,"about_ca_topic_score_gemma":0.003583679,"teacher_disagreement_score":0.0071679545,"about_ca_system_score_codex":0.0026527164,"about_ca_system_score_gemma":0.00089441746,"threshold_uncertainty_score":0.024793506},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054834537,0.0031302634,0.5990602,0.012395503,0.0048764287,0.0006072142,0.002706986,0.016923295,0.30546564],"genre_scores_gemma":[0.37872267,0.0017385721,0.35064563,0.0055978033,0.00096153596,0.0004430172,0.00516193,0.01010359,0.24662521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663025,0.00071360456,0.0001712419,0.0009663415,0.00091813214,0.0006004284],"domain_scores_gemma":[0.99106824,0.0016567219,0.00030577712,0.005542041,0.0010630079,0.00036418438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019052811,0.0011774095,0.0015036352,0.0034190998,0.00496698,0.0051119854,0.0025194078,0.0035899624,0.07163704],"category_scores_gemma":[0.01686809,0.0013270495,0.001980334,0.002321079,0.0032852977,0.011167848,0.0074853622,0.0042335046,0.021272808],"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.00066141214,0.00023157863,0.0024079762,0.00062252395,0.00020631691,0.0009903754,0.0020966518,0.0067610107,0.011259952,0.45712233,0.15991054,0.3577294],"study_design_scores_gemma":[0.00004625367,0.00009148389,0.0010291782,0.00030905879,0.00011121019,0.0007829426,0.0016622429,0.016969092,0.012156014,0.55309963,0.41363612,0.00010672635],"about_ca_topic_score_codex":0.0022097847,"about_ca_topic_score_gemma":0.002948615,"teacher_disagreement_score":0.07163704,"about_ca_system_score_codex":0.0008659711,"about_ca_system_score_gemma":0.0012107274,"threshold_uncertainty_score":0.23964977},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016079336,0.00047713047,0.8636667,0.0020644115,0.0017035146,0.00014809908,0.00020855106,0.0009789452,0.114673294],"genre_scores_gemma":[0.47562048,0.00074664457,0.42577732,0.0018591392,0.0019144438,0.00077433704,0.00029273395,0.0020533656,0.090961576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991716,0.00023115671,0.000053147236,0.00020956708,0.00025270347,0.00008182874],"domain_scores_gemma":[0.9985146,0.0006010991,0.000079993595,0.0003176121,0.00037212344,0.000114641276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013520302,0.0008661143,0.00070119643,0.0034182228,0.0030695158,0.0020597342,0.00200291,0.0013451024,0.015598139],"category_scores_gemma":[0.0054678763,0.00046795455,0.000785737,0.0013365593,0.003715831,0.0043820245,0.0025643993,0.0030027523,0.0035856836],"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.000055018885,0.000022679475,0.00006617048,0.00005780217,0.0000063664934,0.000034695047,0.00013959454,0.0005097746,0.003639321,0.96590924,0.0040778816,0.025481464],"study_design_scores_gemma":[0.000029106644,0.000048308975,0.00018555159,0.00003207345,0.000024732519,0.0001844781,0.00010030015,0.01073188,0.008605755,0.94711405,0.03289419,0.000049597464],"about_ca_topic_score_codex":0.0006714832,"about_ca_topic_score_gemma":0.0009111072,"teacher_disagreement_score":0.015598139,"about_ca_system_score_codex":0.0012055379,"about_ca_system_score_gemma":0.00075220433,"threshold_uncertainty_score":0.052181005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112616435,0.0005867748,0.5988878,0.0011973277,0.0007059869,0.0005324375,0.0012555644,0.0011208971,0.28309682],"genre_scores_gemma":[0.699192,0.000968925,0.15138626,0.001250747,0.0004100054,0.000608546,0.0015226505,0.000446305,0.14421462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984977,0.0004481135,0.00006542795,0.0004062773,0.00038435258,0.00019809091],"domain_scores_gemma":[0.9978357,0.0005232389,0.00021293592,0.00075212505,0.00048666738,0.00018934417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173076,0.0008442139,0.0006173089,0.0014409133,0.0012392417,0.0022164993,0.00095713243,0.0011498897,0.026368707],"category_scores_gemma":[0.0028675213,0.00053286605,0.00071671954,0.0011188426,0.0011281553,0.0028394607,0.0015843388,0.001155609,0.005577838],"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.00005314596,0.000046940117,0.00012228076,0.000055229066,0.000012199485,0.000049268456,0.00007165852,0.0013373302,0.0028807695,0.9665359,0.004234263,0.024600992],"study_design_scores_gemma":[0.000047688238,0.00006820817,0.00013679473,0.00003087647,0.000029393546,0.00021204932,0.000084947016,0.008860822,0.004896888,0.95738876,0.02822594,0.000017610724],"about_ca_topic_score_codex":0.00038943323,"about_ca_topic_score_gemma":0.00071765285,"teacher_disagreement_score":0.026368707,"about_ca_system_score_codex":0.00096845237,"about_ca_system_score_gemma":0.0011510684,"threshold_uncertainty_score":0.08821213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7199883,0.0019516185,0.20378216,0.005352996,0.00041392684,0.000093823415,0.00072160736,0.0005955603,0.06710004],"genre_scores_gemma":[0.94066375,0.0011162494,0.037553716,0.00058092957,0.00043648633,0.0001229947,0.0005220569,0.00022139109,0.01878258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987746,0.00042962184,0.0000659265,0.00029105728,0.00020913508,0.00022950952],"domain_scores_gemma":[0.99169147,0.005618772,0.0006483485,0.0006979639,0.00037346067,0.00096998014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016385698,0.00083935313,0.0013265521,0.0028666123,0.0036353094,0.0057351333,0.0023356425,0.0018850438,0.007929152],"category_scores_gemma":[0.0075581027,0.0010501452,0.0010074654,0.0027180172,0.004884008,0.011495637,0.0032613687,0.0036704717,0.0006845252],"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.000057757632,0.000040586987,0.00036864847,0.000060782837,0.000007760787,0.000028040202,0.00018889314,0.0025854423,0.00040772252,0.9879853,0.0015596144,0.006709344],"study_design_scores_gemma":[0.000010111368,0.0000035372523,0.00007597642,0.000010840077,0.000006542614,0.000029718625,0.000073084426,0.0052720318,0.0002787514,0.99341667,0.0008163299,0.0000064885044],"about_ca_topic_score_codex":0.001270216,"about_ca_topic_score_gemma":0.001577957,"teacher_disagreement_score":0.007929152,"about_ca_system_score_codex":0.0020960316,"about_ca_system_score_gemma":0.0009318171,"threshold_uncertainty_score":0.026525617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37049025,0.0015639971,0.2930626,0.0020395606,0.0005591032,0.00021740605,0.0027259886,0.00154195,0.32779917],"genre_scores_gemma":[0.8638227,0.0010936853,0.04932257,0.0009253487,0.00028000824,0.00015901057,0.002878733,0.00043806277,0.08107999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992292,0.00017154377,0.00004816901,0.00028329378,0.00012895245,0.00013885667],"domain_scores_gemma":[0.99785477,0.0006193182,0.00020979867,0.0005279718,0.00039359974,0.00039442134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048377202,0.0006020301,0.0008245544,0.0014613298,0.0019700534,0.0021301098,0.0010729138,0.0008099152,0.018328149],"category_scores_gemma":[0.002973562,0.00056184304,0.0006681179,0.0021730473,0.0012795043,0.004437878,0.0025251482,0.0015529001,0.0025176182],"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.0001055459,0.00003246282,0.00043628816,0.00007047206,0.000013067996,0.000059270853,0.0001406186,0.00088452856,0.0012123347,0.97706044,0.005436383,0.01454862],"study_design_scores_gemma":[0.000019498471,0.000024480363,0.00052184175,0.000016756778,0.000022419541,0.00018185836,0.00011984425,0.0049272734,0.0014783463,0.9809598,0.011717462,0.000010450075],"about_ca_topic_score_codex":0.00083522836,"about_ca_topic_score_gemma":0.0012740259,"teacher_disagreement_score":0.018328149,"about_ca_system_score_codex":0.0007743369,"about_ca_system_score_gemma":0.00047789168,"threshold_uncertainty_score":0.061313808},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8627747,0.0005116582,0.10224326,0.0005336364,0.00004259382,0.000055603537,0.0006127029,0.00050327956,0.03272248],"genre_scores_gemma":[0.98015964,0.00027847843,0.012061751,0.00009886009,0.000062567335,0.0000576106,0.00056618993,0.00012210572,0.0065928227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991186,0.00020842807,0.00005887922,0.00020471508,0.00023512548,0.00017422225],"domain_scores_gemma":[0.98806787,0.009304722,0.0007693072,0.00086225144,0.00055249076,0.00044337093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006742275,0.0004448468,0.00064976665,0.0018288061,0.0015239067,0.003374625,0.0015261517,0.0010001904,0.0063643875],"category_scores_gemma":[0.007054614,0.00043642777,0.0006570773,0.0021877508,0.0019621497,0.004954999,0.0015328928,0.0016100568,0.0005116257],"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.00015002218,0.00012075827,0.0026053493,0.000128852,0.000023260665,0.0003379163,0.0012564678,0.0075091263,0.008675388,0.9567875,0.001355766,0.02104945],"study_design_scores_gemma":[0.000024708414,0.000024591884,0.00074876583,0.000020162495,0.000029175662,0.00020851691,0.00019999783,0.020295413,0.0035280848,0.97319216,0.0017107006,0.000017767346],"about_ca_topic_score_codex":0.001059038,"about_ca_topic_score_gemma":0.0017326155,"teacher_disagreement_score":0.0063643875,"about_ca_system_score_codex":0.001325141,"about_ca_system_score_gemma":0.00069902634,"threshold_uncertainty_score":0.021290958},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15628509,0.003345892,0.6666844,0.0032445923,0.00061664655,0.00015400852,0.00033393365,0.00053665333,0.1687988],"genre_scores_gemma":[0.76754856,0.002790167,0.17522657,0.0013250108,0.000554729,0.00031704383,0.0004038681,0.00027440058,0.051559657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985006,0.0005935968,0.00006290704,0.0003095513,0.00035069702,0.00018278287],"domain_scores_gemma":[0.9971438,0.0014031396,0.00029821636,0.0007529129,0.0002086286,0.00019331663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009771409,0.0012492851,0.0008825357,0.0021449917,0.0022315895,0.003786911,0.0012586364,0.0019528414,0.012549576],"category_scores_gemma":[0.004105815,0.0010709015,0.0007939542,0.0034014322,0.00297151,0.005615093,0.0031079296,0.0033685106,0.0014800972],"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.000016820797,0.00001594803,0.000067398985,0.000028053504,0.0000034703933,0.000026866694,0.0001005716,0.0011024645,0.00041304328,0.9907663,0.0008088036,0.006650316],"study_design_scores_gemma":[0.000008212702,0.000011704182,0.000042860862,0.0000233271,0.000006072739,0.000074607015,0.00005442055,0.0035318504,0.0006374621,0.99012977,0.0054724915,0.000007278091],"about_ca_topic_score_codex":0.00047608477,"about_ca_topic_score_gemma":0.0007567436,"teacher_disagreement_score":0.012549576,"about_ca_system_score_codex":0.001491734,"about_ca_system_score_gemma":0.00064194604,"threshold_uncertainty_score":0.04198253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64995885,0.0006304217,0.30723765,0.0005901105,0.00009356977,0.0001654945,0.0007039727,0.00041511853,0.04020481],"genre_scores_gemma":[0.84023005,0.0005574463,0.1388101,0.00020579521,0.00005268565,0.00016197462,0.001108239,0.0002770495,0.018596712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994993,0.00009264807,0.0000332395,0.00011834555,0.00018170397,0.00007474325],"domain_scores_gemma":[0.9988281,0.00049126166,0.00021192952,0.00016970393,0.00018350525,0.00011552909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003178083,0.0005191034,0.00071156124,0.002081853,0.0012453758,0.0022574433,0.001299386,0.0012137041,0.007362382],"category_scores_gemma":[0.0027933088,0.0007779307,0.0005552179,0.0026736837,0.0013889762,0.0021676167,0.0018676557,0.0013844438,0.0010128336],"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.00012285433,0.00006501965,0.0017819167,0.000197155,0.000028274173,0.00040512648,0.0008398888,0.03572613,0.006322506,0.89591444,0.0041039623,0.054492783],"study_design_scores_gemma":[0.000033421285,0.00004208484,0.0012068386,0.00007952865,0.000032755925,0.0004871465,0.0006352482,0.091165386,0.0041368613,0.892398,0.009759851,0.000022885168],"about_ca_topic_score_codex":0.001849798,"about_ca_topic_score_gemma":0.0023677803,"teacher_disagreement_score":0.007362382,"about_ca_system_score_codex":0.00082473323,"about_ca_system_score_gemma":0.0003367816,"threshold_uncertainty_score":0.024629653},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81946194,0.0008030921,0.1065526,0.0016301916,0.00028622357,0.000068337016,0.00044444043,0.0004027094,0.07035055],"genre_scores_gemma":[0.935085,0.0006450055,0.04604249,0.00028940558,0.00009174736,0.00007338095,0.00041927863,0.00020081805,0.0171529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994147,0.00018482083,0.000034685992,0.0000973446,0.00012545081,0.00014298403],"domain_scores_gemma":[0.99823207,0.0008208127,0.00021223637,0.00029357692,0.00020006577,0.000241278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053641596,0.0005018773,0.0007845998,0.001243381,0.0016020135,0.002724112,0.0012122517,0.0010547985,0.0059786295],"category_scores_gemma":[0.0030170484,0.00075634883,0.0007075904,0.0013277688,0.0018183144,0.0030814575,0.002168769,0.0015183527,0.00072000147],"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.00014366065,0.00003859471,0.0009956585,0.00007416162,0.00001739124,0.00012687697,0.0003952837,0.0109555125,0.004135291,0.9676302,0.00292992,0.012557366],"study_design_scores_gemma":[0.00004240469,0.000017996761,0.00054149725,0.00002802546,0.000019216684,0.0001104836,0.00040339737,0.026750803,0.0019992245,0.9653791,0.0046839607,0.000023889814],"about_ca_topic_score_codex":0.0024119136,"about_ca_topic_score_gemma":0.004712405,"teacher_disagreement_score":0.0059786295,"about_ca_system_score_codex":0.0017244009,"about_ca_system_score_gemma":0.0006280129,"threshold_uncertainty_score":0.020000577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5774451,0.0012018821,0.33714265,0.0038318941,0.00032261212,0.00017930061,0.00057950744,0.0023005235,0.07699648],"genre_scores_gemma":[0.8236811,0.0004454128,0.15353411,0.0004442381,0.00007600315,0.00007958669,0.0006340803,0.00051787676,0.020587612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993278,0.00014203985,0.00003403265,0.0002490907,0.00010033029,0.00014668795],"domain_scores_gemma":[0.9971836,0.0014334846,0.00020361968,0.0006268353,0.00017705892,0.00037542617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007158936,0.00068225473,0.0011439524,0.0011382999,0.003474737,0.0022577,0.0016278024,0.0019602505,0.009668837],"category_scores_gemma":[0.0038682004,0.001196905,0.001258532,0.0015292234,0.0030073468,0.007860313,0.0037673942,0.0028794608,0.0016773504],"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.00055173493,0.00030782388,0.0069903214,0.00072193885,0.000106962456,0.0008508811,0.002791651,0.025248636,0.010502321,0.79001385,0.017567823,0.14434598],"study_design_scores_gemma":[0.000027282542,0.000059353923,0.0005674834,0.00005172752,0.000046262372,0.00026700366,0.00071040436,0.016352832,0.0045038876,0.96926516,0.008129333,0.000019145607],"about_ca_topic_score_codex":0.0016736885,"about_ca_topic_score_gemma":0.004238213,"teacher_disagreement_score":0.009668837,"about_ca_system_score_codex":0.00091184664,"about_ca_system_score_gemma":0.0007746794,"threshold_uncertainty_score":0.032345474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3894091,0.00043292413,0.5279174,0.0010769404,0.00035067656,0.0002353992,0.0018351845,0.0010371335,0.07770537],"genre_scores_gemma":[0.75706816,0.0004254487,0.20787871,0.0003899835,0.00011212956,0.00024576162,0.0035891675,0.0005952638,0.029695401],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994522,0.00006849619,0.000034889075,0.00015078657,0.00020414773,0.00008952581],"domain_scores_gemma":[0.99862385,0.00043816018,0.00014716115,0.00041299296,0.00024106052,0.00013684368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002620284,0.0007537909,0.0011942015,0.0013762605,0.0018885271,0.0019501268,0.0012645351,0.0011940683,0.012331906],"category_scores_gemma":[0.0018247362,0.00078967476,0.0009438355,0.002235013,0.001533723,0.002611321,0.0024755758,0.0017252399,0.0022571834],"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.0008515045,0.00032559753,0.011166127,0.00091087073,0.00023304339,0.0039829444,0.00085303705,0.10514549,0.042120848,0.59368944,0.02554949,0.21517158],"study_design_scores_gemma":[0.00010808399,0.00019365542,0.0050537894,0.00015328465,0.00012081075,0.0028651112,0.0017558049,0.15733625,0.030346384,0.75366914,0.04829067,0.00010699462],"about_ca_topic_score_codex":0.00059227145,"about_ca_topic_score_gemma":0.0008291352,"teacher_disagreement_score":0.012331906,"about_ca_system_score_codex":0.00044248815,"about_ca_system_score_gemma":0.00029284385,"threshold_uncertainty_score":0.04125434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73303956,0.0015694567,0.16276953,0.0038829076,0.0003426835,0.00007837545,0.00070765347,0.00043143376,0.09717829],"genre_scores_gemma":[0.9462394,0.0007657878,0.038872097,0.00042643773,0.00036578442,0.00010140576,0.00064624724,0.00023740223,0.012345447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99817896,0.0005743805,0.00010700003,0.00041393822,0.00038632238,0.00033934286],"domain_scores_gemma":[0.99199027,0.0047661634,0.0009665736,0.0009277301,0.0004193952,0.00092974113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015696214,0.0011049033,0.00155142,0.0036430277,0.003855195,0.005075583,0.0028781535,0.002875168,0.008917378],"category_scores_gemma":[0.007900355,0.0015673117,0.001538207,0.003133507,0.005890789,0.009861424,0.003610247,0.006013612,0.0012468998],"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.000097745746,0.00003911267,0.0005852974,0.000047782523,0.000007944531,0.00004058182,0.00033547828,0.0031907721,0.0011724579,0.9877523,0.00142847,0.00530201],"study_design_scores_gemma":[0.000017479402,0.000012646874,0.0005162632,0.000018965644,0.000010793065,0.0000629628,0.00018997912,0.008797424,0.00080489,0.988076,0.0014740613,0.000018558561],"about_ca_topic_score_codex":0.0014181209,"about_ca_topic_score_gemma":0.0019915048,"teacher_disagreement_score":0.008917378,"about_ca_system_score_codex":0.0020792226,"about_ca_system_score_gemma":0.0008976861,"threshold_uncertainty_score":0.029831648},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7303087,0.0019015289,0.13433062,0.009328006,0.000342253,0.00015432689,0.0010887976,0.0006989272,0.12184674],"genre_scores_gemma":[0.95779413,0.0010093972,0.022311617,0.0009009564,0.00038954697,0.00023286349,0.0008518662,0.00022878523,0.016280796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991328,0.00021373207,0.000032073556,0.0001704583,0.00026079855,0.00019017285],"domain_scores_gemma":[0.9947476,0.0036729006,0.00028627133,0.00044455053,0.00024745558,0.00060119695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010873631,0.0007161822,0.0016685154,0.0015923853,0.0018882009,0.0046832315,0.0023301868,0.0025565908,0.014837662],"category_scores_gemma":[0.00721341,0.00072916725,0.0009046554,0.0018989353,0.0022509068,0.008675563,0.0029476294,0.004063768,0.00095420383],"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.00024798219,0.00012525056,0.0005597651,0.00018958953,0.000025530737,0.00010243039,0.00027847852,0.0048968997,0.001657789,0.97085124,0.006031866,0.01503323],"study_design_scores_gemma":[0.000046016587,0.000016996124,0.00020106236,0.00001500674,0.000014313524,0.000058031397,0.00007586512,0.011204635,0.00035484185,0.98694605,0.001059652,0.0000076355245],"about_ca_topic_score_codex":0.0008159151,"about_ca_topic_score_gemma":0.0009438773,"teacher_disagreement_score":0.014837662,"about_ca_system_score_codex":0.002168186,"about_ca_system_score_gemma":0.0010057315,"threshold_uncertainty_score":0.0496369},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0853217,0.0016472636,0.9023254,0.0010213049,0.00025808805,0.00031004153,0.001887994,0.0027394516,0.0044887816],"genre_scores_gemma":[0.3399721,0.0007828365,0.64874595,0.0003954374,0.0002465944,0.0005207865,0.004482145,0.000507856,0.0043463055],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965263,0.0006217357,0.00042643986,0.0010348747,0.0011096086,0.00028098057],"domain_scores_gemma":[0.99116933,0.0048368513,0.00075947284,0.0021681606,0.0007149231,0.00035115425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020409003,0.0014690448,0.0027917137,0.0056517962,0.0017814584,0.0029866744,0.0039412975,0.0030517217,0.0068103564],"category_scores_gemma":[0.021755239,0.00087514747,0.0015906343,0.007621138,0.0019119867,0.008839072,0.0034942615,0.0032004535,0.002448209],"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.0020139674,0.000751233,0.0041757203,0.001142646,0.0002582275,0.00022685263,0.0006501891,0.13259286,0.013936824,0.1773695,0.018049262,0.64883274],"study_design_scores_gemma":[0.00018801777,0.00029605126,0.0008305696,0.00013712732,0.00012339099,0.0004596972,0.0002694362,0.52253026,0.009467504,0.45976567,0.00585948,0.0000728466],"about_ca_topic_score_codex":0.0015883937,"about_ca_topic_score_gemma":0.0027986837,"teacher_disagreement_score":0.0068103564,"about_ca_system_score_codex":0.001992904,"about_ca_system_score_gemma":0.0018697743,"threshold_uncertainty_score":0.022782922},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04920254,0.0037397027,0.7679801,0.005697066,0.0038184475,0.00027515914,0.0013381762,0.0011830308,0.16676576],"genre_scores_gemma":[0.5617711,0.007571107,0.3398171,0.007051434,0.005973994,0.0006310272,0.002913,0.0020231567,0.07224818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948256,0.0014253376,0.00032341928,0.0016318565,0.0013355234,0.00045838865],"domain_scores_gemma":[0.9777728,0.01336908,0.0007629286,0.0042443573,0.0029059255,0.00094493764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004409565,0.0020908944,0.002587183,0.0055738064,0.0038548508,0.004412488,0.0052237744,0.0024411087,0.015897416],"category_scores_gemma":[0.029272992,0.0012751245,0.0046108873,0.00555212,0.0062511507,0.016498307,0.00926694,0.010255056,0.0032522406],"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.00008535845,0.000045552864,0.0004406947,0.00025912147,0.00004513251,0.00016056492,0.00043839464,0.0022490276,0.0013537378,0.9681805,0.0075774183,0.019164493],"study_design_scores_gemma":[0.000029342085,0.00003284707,0.00027129476,0.000056301433,0.00005438764,0.00014853978,0.000117203024,0.006542854,0.0008653271,0.97275907,0.019099977,0.000022964017],"about_ca_topic_score_codex":0.0055165756,"about_ca_topic_score_gemma":0.003669696,"teacher_disagreement_score":0.015897416,"about_ca_system_score_codex":0.0030445606,"about_ca_system_score_gemma":0.0016082964,"threshold_uncertainty_score":0.053182185},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030084534,0.01318306,0.86527985,0.020114107,0.0008314964,0.00006739151,0.0006896529,0.00024939087,0.06950056],"genre_scores_gemma":[0.7586446,0.018048903,0.16825512,0.0058369422,0.006882483,0.00028887892,0.00096655794,0.000769587,0.040306967],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9957123,0.0019020578,0.0001817517,0.00087011076,0.0010829809,0.00025078052],"domain_scores_gemma":[0.9851505,0.010317964,0.001101003,0.0018059531,0.00096473406,0.0006598271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005088549,0.0014679786,0.0019931383,0.0049720914,0.0025936672,0.0088420715,0.0046841516,0.006452399,0.0110652605],"category_scores_gemma":[0.018784866,0.0016338627,0.001645676,0.0044619404,0.01183766,0.02402645,0.0047572223,0.00749863,0.0012813323],"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.000005527589,0.0000062375943,0.00008881246,0.000031133233,0.0000056395625,0.000013603438,0.000036812777,0.0016230505,0.000066068904,0.9956767,0.00058513467,0.001861188],"study_design_scores_gemma":[0.0000020880088,0.0000020528967,0.000029207262,0.000012344568,0.0000031453544,0.000029344992,0.000016457438,0.004063029,0.00003548026,0.9944208,0.0013818059,0.0000041732847],"about_ca_topic_score_codex":0.0011977485,"about_ca_topic_score_gemma":0.0010725902,"teacher_disagreement_score":0.0110652605,"about_ca_system_score_codex":0.0026237099,"about_ca_system_score_gemma":0.0010723977,"threshold_uncertainty_score":0.037017047},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117989816,0.009540262,0.60763115,0.014995561,0.0017224053,0.00024108899,0.003017971,0.0029485028,0.24191329],"genre_scores_gemma":[0.71132517,0.007980645,0.21274784,0.004951643,0.003759611,0.0008438011,0.0036873666,0.0033467212,0.051357184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948774,0.0010613143,0.00023283104,0.0014477076,0.001361478,0.0010192294],"domain_scores_gemma":[0.9562739,0.032022882,0.0015897925,0.005238049,0.0020722132,0.0028031266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040438673,0.0034826845,0.0033781133,0.0053654104,0.003888996,0.010671075,0.0101576075,0.00466656,0.028367545],"category_scores_gemma":[0.030502403,0.0021075015,0.0027382062,0.006470861,0.0076702107,0.025433233,0.010274254,0.014585786,0.0059172506],"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.00023529811,0.00017322168,0.0013625629,0.00039300777,0.000044836477,0.00010177226,0.0005381717,0.011713257,0.0022715135,0.9283419,0.018740263,0.03608425],"study_design_scores_gemma":[0.00002217866,0.000018156796,0.00034053167,0.000070577335,0.000051189014,0.00007593761,0.00009113192,0.02406222,0.000787159,0.9673986,0.0070530777,0.000029473555],"about_ca_topic_score_codex":0.003052031,"about_ca_topic_score_gemma":0.005095149,"teacher_disagreement_score":0.028367545,"about_ca_system_score_codex":0.0072149336,"about_ca_system_score_gemma":0.0019547225,"threshold_uncertainty_score":0.09489888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6284331,0.00033301063,0.3082222,0.0011623856,0.00018896957,0.000102533544,0.00035033494,0.0004792911,0.060728204],"genre_scores_gemma":[0.9185887,0.00054760143,0.061794046,0.00023097674,0.00014466622,0.0001430629,0.00037495533,0.0001883039,0.017987719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938786,0.00012482677,0.00004117751,0.00014295007,0.00016452748,0.00013856242],"domain_scores_gemma":[0.9974464,0.001087802,0.00038231973,0.00035815433,0.0002328835,0.00049245567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073112943,0.00053961796,0.000650253,0.002238558,0.0024291258,0.002714744,0.0013240669,0.0013099656,0.008420499],"category_scores_gemma":[0.0042112307,0.00068034424,0.0010711419,0.0015923126,0.0027195506,0.0056164027,0.002845417,0.002878155,0.000848552],"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.000022502625,0.000031678002,0.00033094466,0.000031580574,0.0000039738325,0.00019119789,0.0003726147,0.0016645595,0.0010291479,0.9900535,0.00040463245,0.005863735],"study_design_scores_gemma":[0.000009575033,0.000010483293,0.00018844203,0.000020070906,0.0000074740237,0.00011099244,0.00023527998,0.0061557298,0.00048195955,0.9910521,0.0017191083,0.000008886049],"about_ca_topic_score_codex":0.0011399895,"about_ca_topic_score_gemma":0.001641676,"teacher_disagreement_score":0.008420499,"about_ca_system_score_codex":0.0007672098,"about_ca_system_score_gemma":0.00065891,"threshold_uncertainty_score":0.028169394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44905972,0.004405194,0.15328696,0.009333345,0.0016537218,0.00006270448,0.00048450276,0.00037884404,0.381335],"genre_scores_gemma":[0.9367247,0.002410011,0.011307188,0.0009689128,0.00093625346,0.000041015766,0.0002186374,0.0001922439,0.04720096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949825,0.00016542693,0.000016324264,0.00008796976,0.00012565672,0.000106256484],"domain_scores_gemma":[0.99836415,0.0009138087,0.00020300693,0.00013569009,0.00020285828,0.0001805457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078883325,0.00083514367,0.00071486854,0.0021264309,0.001419055,0.0028457243,0.0009655134,0.0010218901,0.012030361],"category_scores_gemma":[0.004439947,0.00042809517,0.00050267414,0.0018195274,0.0046337717,0.0038906957,0.001925301,0.0033039453,0.0019925865],"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.000020412825,0.000007282861,0.000081690945,0.000021765885,0.0000025925701,0.000036933747,0.00010472004,0.0007469012,0.00034029037,0.99263614,0.0012346617,0.0047665886],"study_design_scores_gemma":[0.000005631107,0.000003843452,0.000073401854,0.000011055949,0.0000019744907,0.0000310454,0.00005383855,0.0016999363,0.000099214056,0.99634886,0.0016654644,0.000005740117],"about_ca_topic_score_codex":0.0019028952,"about_ca_topic_score_gemma":0.001793365,"teacher_disagreement_score":0.012030361,"about_ca_system_score_codex":0.0013529841,"about_ca_system_score_gemma":0.000687744,"threshold_uncertainty_score":0.040245593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80623466,0.00054071273,0.12228892,0.0010889145,0.00018526238,0.00006661544,0.0006223735,0.00076124945,0.068211325],"genre_scores_gemma":[0.9564572,0.00040921906,0.02382761,0.00017293682,0.0001563199,0.00012531044,0.0004305539,0.00019223479,0.01822858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.00009592976,0.000035610312,0.00022110913,0.00013311798,0.0001627253],"domain_scores_gemma":[0.9948619,0.0023560708,0.0006298949,0.00057332835,0.00044973733,0.0011291131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008022839,0.00055707374,0.0008462185,0.0030220842,0.002359426,0.0035333703,0.0017324763,0.0014554198,0.01685798],"category_scores_gemma":[0.004844876,0.0004608466,0.0008468222,0.0017228002,0.0036349122,0.0059946785,0.0018408779,0.0020899514,0.0013387563],"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.000099465484,0.000046266647,0.0011803823,0.00007056839,0.000009854581,0.00007028389,0.0003332228,0.0018874919,0.0032995858,0.9813519,0.0012299129,0.010421031],"study_design_scores_gemma":[0.000020058136,0.000034753404,0.001345193,0.00003453587,0.000015523217,0.00015360324,0.00020457561,0.008945306,0.0022294142,0.9837624,0.0032265396,0.000028107173],"about_ca_topic_score_codex":0.000706845,"about_ca_topic_score_gemma":0.0009386023,"teacher_disagreement_score":0.01685798,"about_ca_system_score_codex":0.0010819276,"about_ca_system_score_gemma":0.0006004955,"threshold_uncertainty_score":0.05639559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62922704,0.0040347558,0.23374128,0.004133684,0.00047065524,0.00008645016,0.0010637802,0.00057020586,0.12667213],"genre_scores_gemma":[0.92114556,0.0028819004,0.0328311,0.00076225464,0.00057123613,0.000135289,0.0012140111,0.00044271114,0.040015996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783933,0.00060458435,0.00012287052,0.000521322,0.00055984355,0.00035201618],"domain_scores_gemma":[0.9939779,0.003592253,0.00048210393,0.00069197494,0.0006805943,0.00057512283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017359606,0.0014740223,0.0015148801,0.004281136,0.0029199217,0.004660252,0.001377978,0.0017233184,0.010253009],"category_scores_gemma":[0.005873786,0.0016793326,0.0013305303,0.004987887,0.0049212845,0.015040339,0.0057656504,0.0037584228,0.0014177543],"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.000044429875,0.000017954442,0.00039991693,0.000052742365,0.000009970925,0.00012519176,0.0007286766,0.0006389235,0.00040703508,0.99180025,0.0011935394,0.0045813555],"study_design_scores_gemma":[0.000008885096,0.000013103075,0.0002555642,0.000020418802,0.000014681467,0.00019120787,0.00018149301,0.0014279289,0.00022941378,0.99487174,0.0027749373,0.0000107418455],"about_ca_topic_score_codex":0.0014903445,"about_ca_topic_score_gemma":0.0015443234,"teacher_disagreement_score":0.010253009,"about_ca_system_score_codex":0.0015311504,"about_ca_system_score_gemma":0.00058840576,"threshold_uncertainty_score":0.03429973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47376648,0.0013408295,0.095607385,0.003997454,0.0005521494,0.00009408644,0.0014523917,0.0008959953,0.42229325],"genre_scores_gemma":[0.8904808,0.0007928733,0.027942516,0.00082936254,0.00028130139,0.00014116718,0.0011845999,0.0004381373,0.07790921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908483,0.0001438885,0.000048646798,0.0002292944,0.00018173673,0.00031163107],"domain_scores_gemma":[0.9989197,0.00044130208,0.000137876,0.00019947653,0.00015263083,0.00014896721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004989875,0.0008466799,0.00093945686,0.002193305,0.0035245589,0.004288442,0.0015448196,0.001538845,0.023139847],"category_scores_gemma":[0.0023109217,0.0006817332,0.0010292458,0.0018776022,0.0030466556,0.005733711,0.0032725781,0.002452448,0.0025690077],"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.00006474726,0.000021580188,0.00022295509,0.00004473925,0.000009508772,0.0000844988,0.00013578647,0.0010318535,0.0010054166,0.98684233,0.00309976,0.0074367994],"study_design_scores_gemma":[0.000012288775,0.000008343995,0.00032866292,0.00002340435,0.00001973842,0.0001681466,0.000121436555,0.0036668654,0.0013346199,0.98167586,0.012626598,0.00001407309],"about_ca_topic_score_codex":0.001698382,"about_ca_topic_score_gemma":0.0017714797,"teacher_disagreement_score":0.023139847,"about_ca_system_score_codex":0.002092928,"about_ca_system_score_gemma":0.0006259731,"threshold_uncertainty_score":0.07741046},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35720745,0.003333071,0.080635615,0.043830406,0.0017242681,0.0000702345,0.0006184335,0.00040024993,0.51218027],"genre_scores_gemma":[0.9487033,0.0021423553,0.012875517,0.002698873,0.0014762711,0.00010718939,0.0006191704,0.00014890789,0.031228572],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881065,0.00033271717,0.000051890103,0.0002776713,0.00030647512,0.00022057004],"domain_scores_gemma":[0.994645,0.0030607064,0.00038610856,0.0009421874,0.00057241315,0.00039356528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025524986,0.0008131825,0.0010351978,0.0026598752,0.0036317208,0.004192416,0.0017168851,0.0028135679,0.011007387],"category_scores_gemma":[0.011755846,0.00063602236,0.001160397,0.0028484464,0.0073738657,0.012517707,0.0050893193,0.0041897194,0.0016045162],"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.000034981356,0.000017464583,0.00050282414,0.000030380788,0.00000729676,0.000046572175,0.00027794734,0.0006966167,0.00014917259,0.9915228,0.0030331665,0.0036807384],"study_design_scores_gemma":[0.0000059339022,0.0000022531833,0.00018025812,0.000009288636,0.000004876991,0.000028405122,0.000099924175,0.0010640328,0.00007467171,0.99606127,0.002464329,0.000004701778],"about_ca_topic_score_codex":0.0024638518,"about_ca_topic_score_gemma":0.0024784436,"teacher_disagreement_score":0.011007387,"about_ca_system_score_codex":0.001464004,"about_ca_system_score_gemma":0.00087065937,"threshold_uncertainty_score":0.036823392},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77983665,0.0009506453,0.15583566,0.002638933,0.0003223324,0.00010674726,0.00035546132,0.0009816604,0.058971815],"genre_scores_gemma":[0.9636355,0.00059521507,0.019765373,0.00041151882,0.00022766012,0.00009956002,0.0002879634,0.0003386915,0.014638486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996222,0.000121622026,0.000008590411,0.00008976796,0.000078640944,0.00007908521],"domain_scores_gemma":[0.99299026,0.0042856648,0.0007484621,0.00061003456,0.0004067537,0.000958807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063082454,0.0011133421,0.00082265085,0.0021126904,0.001578253,0.0021871491,0.0015643918,0.001449108,0.009130589],"category_scores_gemma":[0.007278155,0.00082563306,0.0005733786,0.0014543737,0.0032037743,0.0037289187,0.0021454145,0.0027240796,0.0007266824],"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.00020679261,0.000084774416,0.0018650638,0.00012726401,0.000026161923,0.0003032685,0.00040552483,0.039034218,0.006450063,0.93395966,0.0059983064,0.011538878],"study_design_scores_gemma":[0.000040524454,0.000029713881,0.0010145115,0.000027202526,0.000023232144,0.00014660346,0.00020388338,0.07460219,0.0010131283,0.92071855,0.002156577,0.000023710676],"about_ca_topic_score_codex":0.002376692,"about_ca_topic_score_gemma":0.0038572978,"teacher_disagreement_score":0.009130589,"about_ca_system_score_codex":0.001836324,"about_ca_system_score_gemma":0.00061120396,"threshold_uncertainty_score":0.030544877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45873716,0.0009291836,0.3024422,0.006860966,0.0006420064,0.00026023053,0.0031915477,0.0011692676,0.2257674],"genre_scores_gemma":[0.942921,0.00042155368,0.029017132,0.0015943324,0.00028276956,0.00034956864,0.0016187816,0.0002799874,0.023514744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986621,0.00029320465,0.00012882841,0.00040117776,0.00023061354,0.00028403604],"domain_scores_gemma":[0.99483323,0.0029709535,0.00032065678,0.0004888891,0.0007077843,0.0006784376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014534862,0.00060071243,0.0014787666,0.0022968887,0.0033071153,0.003691476,0.001644755,0.0027744041,0.021423671],"category_scores_gemma":[0.00978086,0.0008881201,0.0010642897,0.0025445132,0.0025344833,0.007882041,0.0037131363,0.003959377,0.0026269897],"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.0001062439,0.00003496839,0.0005597104,0.000062874045,0.000009346196,0.00011133988,0.00033465307,0.0006722802,0.0018623965,0.9880184,0.003092064,0.0051357504],"study_design_scores_gemma":[0.000047921385,0.000024472536,0.00031377588,0.000026672878,0.0000150134565,0.00015791567,0.00021301817,0.0042402544,0.0013151302,0.98965317,0.003973677,0.000019069794],"about_ca_topic_score_codex":0.0013098601,"about_ca_topic_score_gemma":0.0016691206,"teacher_disagreement_score":0.021423671,"about_ca_system_score_codex":0.001376756,"about_ca_system_score_gemma":0.0009314358,"threshold_uncertainty_score":0.07166928},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6897125,0.003832971,0.0801396,0.0057424237,0.0006679368,0.000052475905,0.001054595,0.00034772005,0.21844968],"genre_scores_gemma":[0.9643346,0.0011351735,0.004156918,0.00031442163,0.0003823088,0.000027035665,0.00030894094,0.00005486192,0.029285643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998331,0.000051396746,0.0000045933966,0.00003499279,0.000036893372,0.000038827315],"domain_scores_gemma":[0.9994618,0.00027798297,0.000071033755,0.000047387326,0.0000572078,0.00008458434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032738355,0.0006557966,0.00031254013,0.0019609362,0.00090786844,0.0021805293,0.0006138459,0.00071327854,0.009600598],"category_scores_gemma":[0.0012693282,0.00029018213,0.00027106283,0.0018112926,0.0015119251,0.0026204265,0.0008634787,0.0014977005,0.00082141603],"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.000036687517,0.000027331273,0.000377734,0.000029439465,0.0000068883064,0.000040561226,0.00017147383,0.0011413608,0.00080269354,0.98643976,0.0026550686,0.008270964],"study_design_scores_gemma":[0.0000105355275,0.000004949255,0.00039689368,0.0000076440065,0.0000067993874,0.00003816496,0.00008563318,0.0026338894,0.00032965155,0.9930708,0.0034082904,0.00000680459],"about_ca_topic_score_codex":0.0019441821,"about_ca_topic_score_gemma":0.0017614361,"teacher_disagreement_score":0.009600598,"about_ca_system_score_codex":0.001337394,"about_ca_system_score_gemma":0.0004947018,"threshold_uncertainty_score":0.032117248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11927013,0.0040754625,0.5843719,0.010301063,0.0006586992,0.00015673523,0.001568963,0.0021741749,0.27742282],"genre_scores_gemma":[0.7737121,0.002688849,0.13952522,0.0021575652,0.0009840636,0.00034211867,0.0033260405,0.0011259192,0.07613824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862266,0.00030846457,0.00007110826,0.00039301108,0.0004476036,0.00015720174],"domain_scores_gemma":[0.9955337,0.0024546557,0.00014358366,0.0012358944,0.00043998743,0.0001922227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091792986,0.0008512756,0.0011157007,0.0016683986,0.001845353,0.004565108,0.0018723159,0.0016251295,0.02257713],"category_scores_gemma":[0.0074132206,0.00061858044,0.0012741564,0.0029399754,0.0025204974,0.009003705,0.0034214032,0.004158074,0.0029504353],"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.00003129682,0.000032204174,0.00042241075,0.00007663068,0.000016540826,0.000037303595,0.0001444354,0.0058310563,0.00037992522,0.9526409,0.0088102715,0.031577054],"study_design_scores_gemma":[0.0000040432365,0.0000034583963,0.00008448406,0.000009710391,0.000006286839,0.00003268075,0.00002747076,0.008928956,0.00026549722,0.9850277,0.005605922,0.0000038879866],"about_ca_topic_score_codex":0.0011527066,"about_ca_topic_score_gemma":0.0012624309,"teacher_disagreement_score":0.02257713,"about_ca_system_score_codex":0.0025295012,"about_ca_system_score_gemma":0.0011195457,"threshold_uncertainty_score":0.075528026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027207553,0.0064837863,0.9289687,0.0034776076,0.00044056537,0.000067222,0.00022589928,0.00046293694,0.032665674],"genre_scores_gemma":[0.6259644,0.013448784,0.28573188,0.0021752883,0.0033099395,0.0010645391,0.00087084,0.0011343156,0.066299945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99649197,0.0022136355,0.00008903764,0.00032396658,0.00071275886,0.00016857185],"domain_scores_gemma":[0.9782547,0.017286636,0.00072367996,0.00200731,0.0009866122,0.0007410782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056133494,0.0015758774,0.0026138942,0.006253942,0.0015595261,0.0032040486,0.0031934618,0.0024892539,0.006400257],"category_scores_gemma":[0.024316303,0.0013389162,0.0016534525,0.00402197,0.0065889535,0.008535114,0.003974976,0.0065954807,0.0013993698],"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.000009122291,0.00001692343,0.00008628254,0.00004215804,0.0000118393955,0.000009031589,0.000047209454,0.0030921518,0.000080020145,0.99160516,0.0008893786,0.0041107708],"study_design_scores_gemma":[0.0000069179982,0.0000036472711,0.00003941462,0.000018522142,0.0000037955292,0.000010957839,0.000010958873,0.021621807,0.00005503879,0.97691226,0.0013110576,0.0000057066604],"about_ca_topic_score_codex":0.0014231896,"about_ca_topic_score_gemma":0.0016033112,"teacher_disagreement_score":0.006400257,"about_ca_system_score_codex":0.001996364,"about_ca_system_score_gemma":0.0011004641,"threshold_uncertainty_score":0.02968657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9155866,0.0010827696,0.036441166,0.0019272068,0.00012152045,0.000031633128,0.00044593826,0.00018727832,0.044175915],"genre_scores_gemma":[0.98154217,0.00057302904,0.006868909,0.00036419005,0.00009307199,0.000025737894,0.00039673658,0.00007473304,0.010061428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970883,0.00007457776,0.000011219372,0.00006671808,0.000056969286,0.00008162443],"domain_scores_gemma":[0.9979894,0.0010384341,0.0003264177,0.0001848872,0.00017665784,0.00028415048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003828926,0.0004856449,0.00058169983,0.0020273535,0.0016034296,0.002732041,0.0010628828,0.0011128543,0.0065303743],"category_scores_gemma":[0.0021124664,0.00050119817,0.00034219277,0.0015990897,0.0025327166,0.0041448204,0.0018253312,0.0014650514,0.00071581244],"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.00010526448,0.000043454445,0.0011260832,0.0000897853,0.000012772381,0.00024907535,0.0010685278,0.0037383582,0.0024905507,0.9802013,0.0024212296,0.008453517],"study_design_scores_gemma":[0.000010676543,0.000014331607,0.0006261808,0.000021694157,0.000008827023,0.000080316364,0.00028333144,0.0038714262,0.00033295414,0.9931104,0.0016276835,0.000012213838],"about_ca_topic_score_codex":0.0011866717,"about_ca_topic_score_gemma":0.002078344,"teacher_disagreement_score":0.0065303743,"about_ca_system_score_codex":0.00075845676,"about_ca_system_score_gemma":0.00044625896,"threshold_uncertainty_score":0.021846294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44482926,0.004360499,0.2789665,0.0068778195,0.00075474265,0.000105000014,0.0010489437,0.0006456081,0.26241168],"genre_scores_gemma":[0.95303476,0.0014548148,0.024741406,0.0006379219,0.00045807695,0.0000921478,0.00057774514,0.00018478704,0.018818345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985826,0.00049655314,0.00006516069,0.00029378026,0.0002827222,0.00027927017],"domain_scores_gemma":[0.99717677,0.0014594039,0.00032307135,0.0003774393,0.00028503253,0.0003782757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013589102,0.00078698393,0.00104986,0.0028929256,0.0031599952,0.0038504314,0.0021471106,0.002672466,0.012019173],"category_scores_gemma":[0.0060161636,0.00073197234,0.0012241073,0.0022151794,0.004803179,0.00786334,0.0043050135,0.003747647,0.0010858099],"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.0000148653435,0.0000067746823,0.000060850387,0.000019244633,0.0000033031686,0.000019001769,0.00009673851,0.0010243362,0.000115348266,0.9969928,0.00037737977,0.001269231],"study_design_scores_gemma":[0.000004409691,0.0000046918503,0.000086944594,0.000010382752,0.0000035048663,0.000018525665,0.000060899467,0.0025543948,0.000048941234,0.99611217,0.0010885553,0.0000065131626],"about_ca_topic_score_codex":0.0026577762,"about_ca_topic_score_gemma":0.002331361,"teacher_disagreement_score":0.012019173,"about_ca_system_score_codex":0.0016705785,"about_ca_system_score_gemma":0.0008419822,"threshold_uncertainty_score":0.04020816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5088586,0.0058477,0.1625807,0.026127156,0.0021268532,0.00013091078,0.0031080665,0.0024092293,0.2888108],"genre_scores_gemma":[0.92838526,0.0030327218,0.021412585,0.0027157587,0.0008950515,0.00008652494,0.0015502833,0.001100938,0.040820915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987638,0.00030716593,0.000056584857,0.00036739185,0.00020049867,0.00030456285],"domain_scores_gemma":[0.99312955,0.0030356026,0.0009932681,0.0013571854,0.0009479006,0.0005364009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808168,0.00076704496,0.0010577327,0.0024967089,0.0023834014,0.008100547,0.0021663588,0.00257539,0.026338547],"category_scores_gemma":[0.008682948,0.0009800055,0.0009362654,0.004358333,0.00401188,0.018941924,0.0019877004,0.0020515528,0.0064975894],"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.000064519154,0.000035236913,0.0023142146,0.000114083785,0.000019156314,0.00015582477,0.0006858988,0.00053847884,0.00057657564,0.9610724,0.012382971,0.022040596],"study_design_scores_gemma":[0.000006359563,0.0000030999947,0.00034542562,0.000045656514,0.000017031298,0.00020061011,0.0007672572,0.0010379128,0.0006356389,0.9842651,0.012665958,0.0000099347235],"about_ca_topic_score_codex":0.0016924161,"about_ca_topic_score_gemma":0.0021967136,"teacher_disagreement_score":0.026338547,"about_ca_system_score_codex":0.0014435373,"about_ca_system_score_gemma":0.0007331595,"threshold_uncertainty_score":0.08811122},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49699473,0.001949972,0.27868047,0.012682189,0.00042454718,0.00055072707,0.0032822725,0.0028702435,0.20256488],"genre_scores_gemma":[0.9078868,0.00028268062,0.052392583,0.0007823121,0.00014319476,0.00012103037,0.0028698982,0.00028581693,0.035235707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768925,0.00044413575,0.00011579147,0.0007926397,0.0004943827,0.0004637002],"domain_scores_gemma":[0.9964085,0.0015960074,0.00032922064,0.00088515755,0.00036034163,0.0004206357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010071233,0.00087071036,0.0016107644,0.0010023467,0.0023262457,0.004885823,0.0024102125,0.0048029283,0.022277985],"category_scores_gemma":[0.008743652,0.00070959434,0.0016708061,0.00081588275,0.002927887,0.0058817905,0.004287058,0.002686655,0.0027230617],"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.0014869953,0.00043351742,0.0047612307,0.0006823345,0.000272825,0.0013155622,0.001629955,0.14381947,0.00880007,0.61215407,0.101109505,0.12353448],"study_design_scores_gemma":[0.00016529651,0.00012509286,0.0022514234,0.00009029214,0.00006146916,0.0007480475,0.0007084844,0.4163275,0.0050239214,0.55118847,0.023216994,0.00009297229],"about_ca_topic_score_codex":0.010975715,"about_ca_topic_score_gemma":0.0058721015,"teacher_disagreement_score":0.022277985,"about_ca_system_score_codex":0.002372913,"about_ca_system_score_gemma":0.00095005,"threshold_uncertainty_score":0.07452726},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08485471,0.003764078,0.8047413,0.0035868713,0.001132435,0.00045906566,0.0024666728,0.0046975696,0.09429725],"genre_scores_gemma":[0.48648682,0.0043826546,0.46097302,0.0020300935,0.0012014876,0.00081864005,0.005363801,0.0042540617,0.034489438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99357456,0.0012591145,0.00029696105,0.0010763442,0.002181353,0.0016116564],"domain_scores_gemma":[0.9656348,0.023245122,0.0013680516,0.0061861295,0.002078645,0.0014873466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052874577,0.0049186274,0.0035475704,0.00506778,0.0023550808,0.007366938,0.009376995,0.0032087609,0.03213329],"category_scores_gemma":[0.030895181,0.0020403524,0.0038646797,0.006396837,0.005043806,0.018752387,0.010888689,0.009902083,0.0064725233],"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.0018215565,0.00069828355,0.0026284123,0.0014658332,0.00026564955,0.00042998817,0.00091198937,0.29091656,0.011401976,0.4899454,0.04585589,0.15365852],"study_design_scores_gemma":[0.00012553409,0.00017872867,0.00065620523,0.00027562812,0.00023685087,0.00017398142,0.00021163614,0.42200673,0.006946003,0.5570346,0.012076354,0.00007766371],"about_ca_topic_score_codex":0.006128041,"about_ca_topic_score_gemma":0.009129989,"teacher_disagreement_score":0.03213329,"about_ca_system_score_codex":0.005106074,"about_ca_system_score_gemma":0.0029996336,"threshold_uncertainty_score":0.10749656},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039231874,0.00076421845,0.2439289,0.0015920254,0.001810536,0.00024196845,0.0013433477,0.0029588905,0.7081283],"genre_scores_gemma":[0.35030478,0.00096795434,0.16498464,0.0021966621,0.0004323709,0.0005243556,0.0035692395,0.0018027666,0.47521725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994198,0.00006705986,0.000025480107,0.00017078148,0.00019666055,0.00012013078],"domain_scores_gemma":[0.99940443,0.00007766373,0.000042710228,0.00017593229,0.00019808463,0.0001012086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020042334,0.0008879649,0.0008012769,0.0014639386,0.0018337284,0.0028943757,0.001380974,0.0012540036,0.07871469],"category_scores_gemma":[0.0013760843,0.00047244556,0.00075073773,0.0010454182,0.001131786,0.0031410246,0.003169531,0.0020937526,0.025797319],"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.00032963158,0.000084899555,0.00040129363,0.0001814041,0.00003179088,0.00036687925,0.00022833208,0.002894808,0.011879617,0.8013973,0.06402173,0.11818234],"study_design_scores_gemma":[0.000059549886,0.00008599851,0.00034911235,0.00007578969,0.000029266579,0.0007335775,0.00042097174,0.016292384,0.012378247,0.66988236,0.29965746,0.000035209032],"about_ca_topic_score_codex":0.0011534612,"about_ca_topic_score_gemma":0.0015606477,"teacher_disagreement_score":0.07871469,"about_ca_system_score_codex":0.00058185396,"about_ca_system_score_gemma":0.0006302591,"threshold_uncertainty_score":0.26332688},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2602092,0.00069937203,0.597404,0.0007892059,0.00022565588,0.00014476497,0.0009846482,0.0009317551,0.13861133],"genre_scores_gemma":[0.7689601,0.0007073295,0.15861584,0.000308138,0.00019694086,0.00019573857,0.0015869129,0.0008143118,0.06861481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990521,0.000119372155,0.000051515435,0.000261726,0.00043089435,0.00008435178],"domain_scores_gemma":[0.99740714,0.00095571566,0.0003228983,0.00071383436,0.00031937056,0.00028102144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043471772,0.00060483796,0.00068991655,0.0019661298,0.0010727369,0.002143287,0.0013255652,0.0011636767,0.014824857],"category_scores_gemma":[0.0044576093,0.0006718254,0.0005381249,0.0012221867,0.0014896074,0.003492263,0.0034993887,0.0027019393,0.0026661085],"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.00010568228,0.00007511799,0.0012897811,0.0001320424,0.000023544906,0.00028194147,0.0003560629,0.011559484,0.009648814,0.8979702,0.004121918,0.0744353],"study_design_scores_gemma":[0.000037597827,0.00013649437,0.0026369803,0.00010146903,0.000038953087,0.0012819415,0.00041542272,0.07095849,0.018354872,0.8517491,0.054250274,0.000038449227],"about_ca_topic_score_codex":0.00031339077,"about_ca_topic_score_gemma":0.000463022,"teacher_disagreement_score":0.014824857,"about_ca_system_score_codex":0.00042221116,"about_ca_system_score_gemma":0.00021914537,"threshold_uncertainty_score":0.049594104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55857444,0.0024000418,0.21236877,0.011134309,0.0005990902,0.0002085113,0.002025274,0.0006859291,0.21200363],"genre_scores_gemma":[0.9159165,0.0012071483,0.053948212,0.00070284633,0.00039060877,0.00017400176,0.00290097,0.00025550835,0.024504239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964169,0.001394342,0.000153632,0.0007002829,0.00064832513,0.0006865807],"domain_scores_gemma":[0.9873081,0.009103951,0.00069548475,0.0008687092,0.00090622716,0.0011174949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019944515,0.0009672854,0.0015323128,0.0023203327,0.0030267902,0.007918907,0.0029630375,0.0036707665,0.017406514],"category_scores_gemma":[0.013740196,0.0010168459,0.0014630891,0.0034995521,0.0029423733,0.009279268,0.0043477747,0.0056751124,0.0013388558],"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.00074531883,0.00029362153,0.0017906803,0.0002832931,0.00008021649,0.00036013484,0.00068518316,0.009243359,0.0013724634,0.9343381,0.012022392,0.038785253],"study_design_scores_gemma":[0.00007838889,0.00004094064,0.00057707675,0.00007002331,0.000048584654,0.00025789498,0.00058904954,0.031788636,0.0015084046,0.95811355,0.0069032535,0.000024328388],"about_ca_topic_score_codex":0.0017593674,"about_ca_topic_score_gemma":0.0011406124,"teacher_disagreement_score":0.017406514,"about_ca_system_score_codex":0.0025914686,"about_ca_system_score_gemma":0.0018318668,"threshold_uncertainty_score":0.05823064},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7299073,0.00042962626,0.21309496,0.0019422026,0.00032158423,0.00014897973,0.0015103957,0.001118331,0.051526595],"genre_scores_gemma":[0.94013864,0.00033136786,0.046859805,0.0005865684,0.00010111967,0.00017191033,0.0011062732,0.00033120293,0.010373092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992323,0.00023475876,0.000036106638,0.00019281764,0.00017402902,0.00013000813],"domain_scores_gemma":[0.9946813,0.002312445,0.000647406,0.00119555,0.00081872573,0.00034450385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066491327,0.00067172584,0.00046964173,0.0019288431,0.0012652267,0.0018769858,0.0008735308,0.0016052941,0.007977784],"category_scores_gemma":[0.005297114,0.0005073183,0.0003604383,0.0018297918,0.0012221128,0.0026798258,0.00093020924,0.0012321151,0.00067083107],"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.00054094614,0.00024403312,0.0031915882,0.00023694898,0.000060712555,0.00041230986,0.00033653932,0.04054404,0.031319804,0.88354635,0.007284889,0.032281812],"study_design_scores_gemma":[0.00017425074,0.00008159035,0.0031593728,0.00009137791,0.00009339236,0.0008373373,0.00039919652,0.31196773,0.039040536,0.6314208,0.012647031,0.00008738345],"about_ca_topic_score_codex":0.0012119458,"about_ca_topic_score_gemma":0.0021172937,"teacher_disagreement_score":0.007977784,"about_ca_system_score_codex":0.0010613872,"about_ca_system_score_gemma":0.0007655867,"threshold_uncertainty_score":0.026688337},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35471448,0.001671894,0.4893837,0.0073594353,0.00038775415,0.00018873771,0.0020522035,0.00074362574,0.14349818],"genre_scores_gemma":[0.9045877,0.0016118913,0.06562569,0.0010509037,0.00060050073,0.00020146566,0.0014790156,0.0005129634,0.024329858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822146,0.00049240794,0.000060706025,0.000476926,0.00034489264,0.00040363992],"domain_scores_gemma":[0.9902485,0.006284025,0.0008490893,0.001106833,0.00062840816,0.0008831691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001247997,0.001056629,0.0013469139,0.0015792684,0.0025252886,0.003762735,0.0022434955,0.0017579092,0.01509768],"category_scores_gemma":[0.012205494,0.0013344486,0.0012888071,0.002532113,0.0034693254,0.009224894,0.0030682334,0.0056599993,0.0016298038],"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.00014151771,0.00009972753,0.00043696558,0.00012961711,0.000020813039,0.000056351157,0.00026137123,0.009094695,0.00094912614,0.9668728,0.0059646596,0.015972413],"study_design_scores_gemma":[0.000020730871,0.000009215451,0.00028731025,0.000013662016,0.00001472441,0.000046876576,0.000061049905,0.010669961,0.00037720436,0.98670006,0.0017881299,0.000011126647],"about_ca_topic_score_codex":0.0023054609,"about_ca_topic_score_gemma":0.003791517,"teacher_disagreement_score":0.01509768,"about_ca_system_score_codex":0.0024941096,"about_ca_system_score_gemma":0.0016999074,"threshold_uncertainty_score":0.05050677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4311965,0.00090102263,0.31800824,0.0022363372,0.00087830325,0.00032992332,0.0011672861,0.00062430283,0.24465808],"genre_scores_gemma":[0.88235015,0.00039045385,0.08841476,0.00060096034,0.00039276638,0.00028436817,0.00079270994,0.00028237567,0.026491392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848324,0.00054762914,0.00007191564,0.0004103998,0.00025295746,0.00023388606],"domain_scores_gemma":[0.9959235,0.0016913839,0.0007719557,0.0005933801,0.00029860964,0.0007211844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013097036,0.00065832277,0.0006609197,0.0014334652,0.0021410945,0.0042861337,0.0019690606,0.0015376514,0.011673558],"category_scores_gemma":[0.0054176114,0.00093253294,0.0015813141,0.0011804586,0.0024226878,0.0035002355,0.002553618,0.0029824064,0.0008266502],"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.00006614937,0.000033044056,0.00024374164,0.000042813273,0.0000091704915,0.000115906914,0.00018139913,0.00085378747,0.0014987853,0.9931108,0.0013853264,0.0024591223],"study_design_scores_gemma":[0.00006743769,0.00004086435,0.0009161831,0.000039898052,0.000028172948,0.00034593442,0.00017902702,0.013499649,0.0012640631,0.9748359,0.008754766,0.000027995591],"about_ca_topic_score_codex":0.0013170061,"about_ca_topic_score_gemma":0.0021925515,"teacher_disagreement_score":0.011673558,"about_ca_system_score_codex":0.0013229576,"about_ca_system_score_gemma":0.0005973576,"threshold_uncertainty_score":0.03905201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6115974,0.0020653638,0.054236893,0.016261516,0.0012968184,0.000103809936,0.0011852591,0.0008891126,0.3123638],"genre_scores_gemma":[0.97504175,0.0007050142,0.0075389473,0.0010500554,0.00072721206,0.000092802504,0.0006733076,0.00022506634,0.013945903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783367,0.00061443145,0.00009375771,0.000457011,0.0004896402,0.00051160913],"domain_scores_gemma":[0.99314404,0.0043356633,0.00045914884,0.0009378802,0.0004457427,0.00067751884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024644146,0.0009864363,0.0023810838,0.0026941604,0.0042659594,0.0055828765,0.0028454862,0.0033472166,0.02063526],"category_scores_gemma":[0.008851972,0.0012110745,0.0014161546,0.0033511128,0.007604254,0.012407075,0.0067872666,0.0071268016,0.0027208999],"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.00009535378,0.000030986703,0.00029050757,0.000038833983,0.0000073823203,0.000057718178,0.00025202046,0.0005327928,0.00033992596,0.99316555,0.0024763937,0.0027123576],"study_design_scores_gemma":[0.00001706592,0.000006245988,0.000096634416,0.000008445384,0.0000052123473,0.00004131838,0.00007759694,0.0007260688,0.00016594458,0.99787366,0.0009744482,0.0000072781822],"about_ca_topic_score_codex":0.0012218899,"about_ca_topic_score_gemma":0.0009317686,"teacher_disagreement_score":0.02063526,"about_ca_system_score_codex":0.0015615536,"about_ca_system_score_gemma":0.0010078767,"threshold_uncertainty_score":0.069031775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86639726,0.00084636046,0.030821584,0.0016407048,0.00014078539,0.000028355811,0.00019378826,0.00023870806,0.099692486],"genre_scores_gemma":[0.9848934,0.00034580572,0.003489699,0.00017567501,0.00011793497,0.000036723395,0.00013537904,0.000056315403,0.010749143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999453,0.0001758506,0.000021370566,0.00008826822,0.00013022871,0.00013134553],"domain_scores_gemma":[0.9982936,0.0007811591,0.00024434563,0.00013619076,0.0001906586,0.00035411076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088558334,0.00055291015,0.00076424645,0.0035407804,0.002936945,0.003217287,0.0011452608,0.0011896606,0.0062301545],"category_scores_gemma":[0.0032202366,0.00059997773,0.0005409894,0.0014642843,0.0027253067,0.004173301,0.0021450375,0.002075734,0.00048791128],"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.00003308988,0.000013430963,0.00038793983,0.000012583517,0.000005555611,0.00010711392,0.00023579708,0.00064975745,0.00041643786,0.9958062,0.0006280305,0.0017041302],"study_design_scores_gemma":[0.000011883613,0.0000073526844,0.0004421271,0.00001307003,0.0000070589003,0.0001375926,0.00021397063,0.0035856552,0.000279573,0.99389714,0.0013952405,0.000009345148],"about_ca_topic_score_codex":0.0016585096,"about_ca_topic_score_gemma":0.0021138226,"teacher_disagreement_score":0.0062301545,"about_ca_system_score_codex":0.0016347069,"about_ca_system_score_gemma":0.00044309994,"threshold_uncertainty_score":0.020841897},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43622822,0.0016477498,0.4510435,0.0018148806,0.00018467136,0.0001221862,0.000582885,0.00064460875,0.10773133],"genre_scores_gemma":[0.9315123,0.0006088062,0.02936951,0.000331321,0.00020307886,0.00018216566,0.0004786285,0.00035652157,0.036957726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941766,0.0001859098,0.000020983078,0.00014486074,0.00012729641,0.00010332292],"domain_scores_gemma":[0.99784553,0.0011199561,0.00023591207,0.00023189715,0.00025086018,0.00031580476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009067554,0.00064495334,0.00094138284,0.0028475812,0.0013779497,0.0034027821,0.0008658242,0.0011069746,0.012810959],"category_scores_gemma":[0.0043107527,0.0007025938,0.00058239774,0.0016387079,0.0016074383,0.004844559,0.0018379365,0.0016608197,0.0011459684],"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.000060357623,0.000042126776,0.00034178773,0.000056528243,0.00001268042,0.000051090883,0.00022902936,0.00595625,0.0016815834,0.97982085,0.00190937,0.009838283],"study_design_scores_gemma":[0.000015971384,0.000008425113,0.00019631327,0.000016472777,0.000009866992,0.00004207241,0.00011001742,0.024519188,0.00062499824,0.97262055,0.0018307572,0.0000053682647],"about_ca_topic_score_codex":0.0011012953,"about_ca_topic_score_gemma":0.0012274395,"teacher_disagreement_score":0.012810959,"about_ca_system_score_codex":0.0012640246,"about_ca_system_score_gemma":0.00041341424,"threshold_uncertainty_score":0.042856872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6083681,0.0024677354,0.18299812,0.008059063,0.00044123482,0.00009365734,0.002193879,0.0006945674,0.19468357],"genre_scores_gemma":[0.9602311,0.0011495962,0.018345902,0.0004891273,0.0009084792,0.00013692088,0.00074540277,0.00022150583,0.017771948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999113,0.00021837745,0.000039826722,0.00023946908,0.00024487617,0.00014451882],"domain_scores_gemma":[0.9836821,0.012553821,0.0010894852,0.0006842551,0.00056982716,0.0014204906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012384062,0.0007775053,0.0010775987,0.0023163005,0.0015357456,0.003145233,0.0014341283,0.0012656781,0.013861068],"category_scores_gemma":[0.014130143,0.00095740205,0.0007045903,0.0019491174,0.0028096975,0.0068137147,0.0026581176,0.0044050682,0.0018800918],"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.0002864951,0.00006444618,0.0014264826,0.00021285981,0.000032740507,0.00010716255,0.00057252316,0.0020162908,0.0047924323,0.968159,0.0050071795,0.017322404],"study_design_scores_gemma":[0.000032465403,0.000023473302,0.0015723682,0.00002641889,0.00002454968,0.00019985368,0.000098887765,0.0039284453,0.0013324448,0.9902047,0.0025409306,0.000015426867],"about_ca_topic_score_codex":0.0003182531,"about_ca_topic_score_gemma":0.0005711679,"teacher_disagreement_score":0.013861068,"about_ca_system_score_codex":0.0010477244,"about_ca_system_score_gemma":0.0005539012,"threshold_uncertainty_score":0.04636985},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4505818,0.0024206294,0.105018824,0.0061893156,0.0013237001,0.00007515953,0.00070226466,0.0004302477,0.43325806],"genre_scores_gemma":[0.94800156,0.0009594831,0.008489713,0.00041080927,0.00065817643,0.000037025056,0.0001958941,0.000102455306,0.041144818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995995,0.00008948924,0.000011954986,0.00009688855,0.00010538699,0.0000968503],"domain_scores_gemma":[0.9989355,0.0005130917,0.0001524809,0.00010933473,0.00013833045,0.00015129185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047333355,0.00080115855,0.0005322782,0.0025924721,0.0020858154,0.0034324655,0.0011517989,0.001090818,0.010641651],"category_scores_gemma":[0.0026123147,0.00056935137,0.0004476249,0.0024242671,0.004181519,0.004428054,0.0017492924,0.003829119,0.0015911872],"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.000015464171,0.000010530884,0.0001115763,0.000016318845,0.0000022368645,0.00003485895,0.00012154097,0.0003778152,0.00035011594,0.9950263,0.00096785877,0.0029653246],"study_design_scores_gemma":[0.0000068914724,0.0000035020535,0.00016016132,0.0000072461266,0.0000034135471,0.00004460688,0.000046565972,0.00086607924,0.00018144399,0.9965133,0.0021612525,0.0000056610015],"about_ca_topic_score_codex":0.002108305,"about_ca_topic_score_gemma":0.0026233143,"teacher_disagreement_score":0.010641651,"about_ca_system_score_codex":0.0019875292,"about_ca_system_score_gemma":0.000671544,"threshold_uncertainty_score":0.035599887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7461472,0.00080702436,0.13069817,0.0017218319,0.00040544337,0.00012704692,0.0008100158,0.0012496321,0.118033685],"genre_scores_gemma":[0.92655414,0.000816835,0.02750012,0.0006870759,0.00022124324,0.00009470631,0.00080966175,0.00053296366,0.04278334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993223,0.0001264679,0.00002817919,0.00017129343,0.00010560422,0.0002462045],"domain_scores_gemma":[0.9980876,0.0007842349,0.00034518528,0.0003766236,0.000096618634,0.00030972649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004933992,0.0010883347,0.0010090686,0.0013268056,0.0026948457,0.002579055,0.0016816518,0.0016176422,0.01714369],"category_scores_gemma":[0.0021075488,0.00074746046,0.0010228568,0.0020486533,0.0031021438,0.004620055,0.003651739,0.002008618,0.0019456189],"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.00029356396,0.000076669814,0.00057777984,0.000117546646,0.000015757729,0.00030670647,0.00050301704,0.01309974,0.0051376284,0.9580641,0.00579375,0.01601391],"study_design_scores_gemma":[0.000048727008,0.000051503634,0.00039393347,0.00004117694,0.000017610444,0.00012527521,0.0002872302,0.012676558,0.0019520528,0.9785967,0.005774433,0.000034860866],"about_ca_topic_score_codex":0.0020785253,"about_ca_topic_score_gemma":0.0025917718,"teacher_disagreement_score":0.01714369,"about_ca_system_score_codex":0.0012151373,"about_ca_system_score_gemma":0.00046673216,"threshold_uncertainty_score":0.05735135},"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":"editorial","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094284205,0.001139295,0.0036579682,0.11489213,0.86621,0.000029700694,0.00091484055,0.0006918331,0.011521346],"genre_scores_gemma":[0.11336819,0.0064507276,0.012276443,0.10613161,0.53310734,0.00018124944,0.0016092304,0.0018870657,0.22498825],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977689,0.00036235055,0.00030270583,0.0004940036,0.0007495954,0.00032255243],"domain_scores_gemma":[0.9812289,0.005706041,0.000840093,0.0019436937,0.009125396,0.0011558817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020059978,0.0012224849,0.0015424981,0.002889911,0.0035851847,0.0036747414,0.0034453818,0.0062058805,0.05897073],"category_scores_gemma":[0.041052166,0.00077216583,0.0012716055,0.002170748,0.004048635,0.0045242268,0.002081643,0.007517241,0.019085139],"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.00011058936,0.000012136526,0.00017060156,0.0002713017,0.00003310604,0.0007754868,0.00012398715,0.00016451042,0.00019274073,0.023883663,0.96303356,0.011228194],"study_design_scores_gemma":[0.000080048325,0.000034881054,0.0009545364,0.00017873815,0.000042496722,0.0015680065,0.00014155406,0.00079478766,0.0007272749,0.043858357,0.9515427,0.00007658396],"about_ca_topic_score_codex":0.0055775815,"about_ca_topic_score_gemma":0.007840232,"teacher_disagreement_score":0.05897073,"about_ca_system_score_codex":0.0040785177,"about_ca_system_score_gemma":0.0033295078,"threshold_uncertainty_score":0.19727677},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5539188,0.003026251,0.32753614,0.0058639534,0.00041627642,0.00022052407,0.0014383268,0.0014484297,0.10613136],"genre_scores_gemma":[0.9642081,0.0009957867,0.021973701,0.00095314503,0.00048769318,0.00016078373,0.00068704074,0.0002509992,0.010282781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967063,0.00087094697,0.00015432459,0.00090276793,0.0006762864,0.0006893064],"domain_scores_gemma":[0.98659664,0.008104728,0.0013798319,0.0019927556,0.0006734792,0.001252599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018038274,0.0011875418,0.0011295737,0.0027831,0.0021965601,0.0025748315,0.002076557,0.0013551784,0.01096042],"category_scores_gemma":[0.014086337,0.0008453111,0.0018837515,0.0023776926,0.0048107933,0.008624554,0.0070283655,0.003506118,0.0011900748],"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.00040311672,0.00005222878,0.0019630739,0.00028313455,0.00006429061,0.00048297644,0.00091905385,0.028085653,0.0040758313,0.9361968,0.004228511,0.023245301],"study_design_scores_gemma":[0.000053261076,0.00010155902,0.00092952105,0.000073217016,0.00005293784,0.00037028876,0.00030167834,0.033949655,0.0015098843,0.9503167,0.012284648,0.00005664337],"about_ca_topic_score_codex":0.001627271,"about_ca_topic_score_gemma":0.0010020102,"teacher_disagreement_score":0.01096042,"about_ca_system_score_codex":0.0017590625,"about_ca_system_score_gemma":0.00057287625,"threshold_uncertainty_score":0.036666274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76832294,0.0012088405,0.09651027,0.0014172682,0.00029686544,0.00007787901,0.00037060468,0.00031389794,0.1314815],"genre_scores_gemma":[0.9743094,0.00058668654,0.008774798,0.0001620259,0.0001879675,0.00004260478,0.0001744334,0.000057777128,0.01570436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995881,0.00011027832,0.000018755192,0.00007948718,0.00009305621,0.00011037617],"domain_scores_gemma":[0.9990326,0.00031102664,0.00022634315,0.00013389661,0.00008452052,0.00021150363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043252614,0.00048133187,0.0006790843,0.001706058,0.001656589,0.0030604838,0.00074820477,0.00072327117,0.008161358],"category_scores_gemma":[0.0020212498,0.00033336776,0.00053092634,0.0015459108,0.0032222255,0.0041662105,0.0018995263,0.0011966297,0.0008674267],"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.000051692667,0.000008743001,0.00021746765,0.000019509731,0.0000050495037,0.00007568281,0.00021087538,0.0012549589,0.000543742,0.99254143,0.0005691274,0.0045017153],"study_design_scores_gemma":[0.000015948666,0.000016438542,0.00025768927,0.0000086041855,0.000007449407,0.000111747984,0.00016260879,0.002800224,0.0005485948,0.9918961,0.0041631996,0.000011386016],"about_ca_topic_score_codex":0.0011164092,"about_ca_topic_score_gemma":0.0007713109,"teacher_disagreement_score":0.008161358,"about_ca_system_score_codex":0.00066977384,"about_ca_system_score_gemma":0.0005002043,"threshold_uncertainty_score":0.027302504},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5856719,0.004204774,0.2330974,0.008174653,0.0003441641,0.00005353815,0.00074608764,0.0003287719,0.1673787],"genre_scores_gemma":[0.9725945,0.0017630775,0.010164565,0.00059970794,0.0006672047,0.000042911295,0.0002640477,0.00011626417,0.013787627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998665,0.00041511428,0.000045149372,0.0002891083,0.00029605944,0.0002895716],"domain_scores_gemma":[0.9809498,0.015232788,0.0009328388,0.00082735706,0.0011097048,0.0009474349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002223957,0.00060092774,0.0011156533,0.0030913462,0.0019489374,0.00361478,0.0016349287,0.0010462666,0.009929216],"category_scores_gemma":[0.015552334,0.0006904642,0.00066678366,0.003431888,0.0053202915,0.007426035,0.0026879343,0.0048392606,0.0008157778],"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.000070672424,0.0000399503,0.0005942207,0.000060352442,0.000009831026,0.000061077546,0.00035101964,0.002275016,0.0007969738,0.98232263,0.0018075698,0.011610673],"study_design_scores_gemma":[0.00000780817,0.000007213186,0.00027405075,0.000011921125,0.0000057293732,0.000054752207,0.000064868116,0.0057666544,0.00019492485,0.99270624,0.00089629524,0.000009582732],"about_ca_topic_score_codex":0.002452854,"about_ca_topic_score_gemma":0.0021915731,"teacher_disagreement_score":0.009929216,"about_ca_system_score_codex":0.0020650052,"about_ca_system_score_gemma":0.000867246,"threshold_uncertainty_score":0.033216536},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09516549,0.008241765,0.055394787,0.019195762,0.0027523662,0.000051388146,0.00051815767,0.00039226565,0.8182879],"genre_scores_gemma":[0.79715174,0.004722296,0.01517866,0.0042150603,0.00083403254,0.00007628122,0.00036746214,0.00044672334,0.1770078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964285,0.000077356235,0.000009808816,0.00009973421,0.000094351824,0.00007586807],"domain_scores_gemma":[0.9995432,0.00010187422,0.00003992946,0.00015552832,0.00007799444,0.000081474966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038861067,0.00039531165,0.00056501385,0.0011132886,0.0023580424,0.0038036488,0.0006625888,0.0015986207,0.028950874],"category_scores_gemma":[0.0021750035,0.00027135116,0.00042781266,0.00084809895,0.004285432,0.006466512,0.0024297303,0.0028117301,0.0043217465],"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.000028850576,0.0000059186896,0.000065511136,0.000018308834,0.000004060542,0.000024305951,0.00015437324,0.00042921957,0.00039476863,0.98605067,0.0063222283,0.0065018167],"study_design_scores_gemma":[0.000011439077,0.000009810223,0.00010601297,0.00003279297,0.0000046972027,0.00008372109,0.00038120185,0.0011210071,0.00034370946,0.93525636,0.06264235,0.000006886114],"about_ca_topic_score_codex":0.0011330303,"about_ca_topic_score_gemma":0.0009915465,"teacher_disagreement_score":0.028950874,"about_ca_system_score_codex":0.0011802156,"about_ca_system_score_gemma":0.00054541824,"threshold_uncertainty_score":0.096850336},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73838437,0.00040840093,0.13175648,0.0026504854,0.00012010216,0.0001879385,0.00028442932,0.0002217703,0.12598611],"genre_scores_gemma":[0.9741718,0.00019347461,0.00893758,0.00025005118,0.000047185556,0.000092192524,0.000096088115,0.000053685802,0.016158018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998002,0.000925448,0.00006907078,0.00026244717,0.00035565664,0.0003853866],"domain_scores_gemma":[0.9925908,0.005104429,0.0003664273,0.00031940627,0.00039821403,0.0012207949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001899796,0.00077047414,0.0011903329,0.0010873663,0.00227385,0.004229926,0.002074784,0.002412834,0.0064387154],"category_scores_gemma":[0.0087721655,0.0005177078,0.0005228484,0.0012780664,0.0028452114,0.0043665613,0.0024194538,0.0019462567,0.00062545034],"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.0005170596,0.000119934724,0.001193029,0.000114320326,0.000044066637,0.00040455855,0.0009114607,0.009289185,0.004907567,0.9672531,0.0026043602,0.012641334],"study_design_scores_gemma":[0.00010177477,0.00004856062,0.00029209713,0.000020594576,0.000031155152,0.00022251628,0.00033578885,0.03991561,0.0010642026,0.9558705,0.0020751045,0.000022048385],"about_ca_topic_score_codex":0.0024999625,"about_ca_topic_score_gemma":0.0027912213,"teacher_disagreement_score":0.0064387154,"about_ca_system_score_codex":0.001341001,"about_ca_system_score_gemma":0.0012639096,"threshold_uncertainty_score":0.021539629},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58285934,0.00061833835,0.18236035,0.007136657,0.00018452122,0.00021305693,0.00055749284,0.00037538615,0.22569488],"genre_scores_gemma":[0.95353234,0.00032698226,0.017296826,0.0003580538,0.000060105263,0.00009541635,0.00018641232,0.00007985148,0.028064035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998767,0.0006930244,0.00003495258,0.00014613953,0.00014387099,0.00021504756],"domain_scores_gemma":[0.9956157,0.0028221954,0.00025199345,0.00030365906,0.00012367236,0.00088282936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095568824,0.00064428244,0.0009263949,0.0006323713,0.0016657369,0.0032550446,0.0015717107,0.0027425038,0.011755215],"category_scores_gemma":[0.006126267,0.0004011983,0.00047915473,0.00078064116,0.002747409,0.0062726396,0.0027173,0.0020825318,0.0007706489],"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.0003350714,0.00007249468,0.00049092306,0.0000788615,0.00002242102,0.00016886975,0.00038477487,0.012935623,0.001788401,0.96740246,0.004654695,0.011665427],"study_design_scores_gemma":[0.000083550905,0.000042512118,0.00020485274,0.000016783888,0.00001175458,0.00009324803,0.00029085498,0.046551395,0.0004265603,0.94639575,0.0058646896,0.000017933202],"about_ca_topic_score_codex":0.00295461,"about_ca_topic_score_gemma":0.003215139,"teacher_disagreement_score":0.011755215,"about_ca_system_score_codex":0.0011532261,"about_ca_system_score_gemma":0.0009081941,"threshold_uncertainty_score":0.039325178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4962264,0.0038462395,0.15392917,0.0075238706,0.0009640781,0.00009794753,0.0004911662,0.000998942,0.33592212],"genre_scores_gemma":[0.9440339,0.0013137094,0.019485744,0.0010047007,0.00035423893,0.00008922746,0.00022125433,0.00024998342,0.033247177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943763,0.00016070058,0.0000266066,0.00013617855,0.00013527443,0.00010364366],"domain_scores_gemma":[0.9981376,0.0008311282,0.00013684592,0.0004167919,0.00020715682,0.0002705178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272162,0.00045719036,0.0007758755,0.0015249795,0.0025672195,0.003053395,0.0013711152,0.0015104025,0.0118029835],"category_scores_gemma":[0.0043070717,0.00057113904,0.00059886056,0.0009838111,0.0040173787,0.010009288,0.0032546408,0.0023925593,0.000860637],"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.000017314296,0.000017644614,0.00019669566,0.00004124802,0.0000043409796,0.00007118222,0.0002124371,0.00047671475,0.0003939622,0.9918677,0.0015086352,0.0051922114],"study_design_scores_gemma":[0.000004542451,0.0000039742195,0.00006186846,0.00001584114,0.000003942604,0.000073872274,0.00011986264,0.00097561034,0.00013657902,0.99685425,0.001744461,0.000005153485],"about_ca_topic_score_codex":0.00082219404,"about_ca_topic_score_gemma":0.001509057,"teacher_disagreement_score":0.0118029835,"about_ca_system_score_codex":0.0010499295,"about_ca_system_score_gemma":0.0006181464,"threshold_uncertainty_score":0.03948486},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40170127,0.0018330159,0.5652569,0.0016421963,0.00015481206,0.00007899414,0.00040512573,0.00038580393,0.028541883],"genre_scores_gemma":[0.8920769,0.002736674,0.08914105,0.0003238123,0.000253788,0.00007304049,0.0007664238,0.00020324542,0.0144250905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992988,0.00030626106,0.000030656567,0.00014828275,0.00014063223,0.000075352356],"domain_scores_gemma":[0.99234515,0.0052225576,0.00082194334,0.0007716772,0.00050296,0.00033572756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011905613,0.00087306526,0.0009480651,0.0017016279,0.0009839915,0.0018709529,0.0018248516,0.001864895,0.0051606903],"category_scores_gemma":[0.013855516,0.00090693164,0.0008363592,0.0018891592,0.002787831,0.0040828004,0.0015823367,0.0023559032,0.00047248567],"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.0002680454,0.0000753763,0.0013916858,0.0001433838,0.000046897647,0.00018547299,0.00030037484,0.12898582,0.0019580394,0.8313803,0.0025687045,0.032695923],"study_design_scores_gemma":[0.000022875489,0.000035835823,0.0003579661,0.00002974469,0.000019313844,0.00009465544,0.000090189766,0.22843617,0.0008677015,0.76849693,0.0015291855,0.000019423156],"about_ca_topic_score_codex":0.0017997066,"about_ca_topic_score_gemma":0.0016985793,"teacher_disagreement_score":0.0051606903,"about_ca_system_score_codex":0.0008600402,"about_ca_system_score_gemma":0.00044577834,"threshold_uncertainty_score":0.017264247},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39450616,0.0132493125,0.49425054,0.008516044,0.0012315463,0.00025640358,0.0058809672,0.0035372463,0.078571774],"genre_scores_gemma":[0.8479874,0.0045540463,0.13002814,0.0013416326,0.001265332,0.0003579477,0.0035359387,0.0016087972,0.009320693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9919778,0.0018404474,0.00045219337,0.002127422,0.001682427,0.0019197272],"domain_scores_gemma":[0.8896797,0.08567567,0.0033987348,0.012659978,0.0039914763,0.0045945165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005895558,0.0038385156,0.0037069132,0.0042148675,0.003335163,0.009244972,0.008807278,0.0031844596,0.012075091],"category_scores_gemma":[0.043201648,0.0023231127,0.002993899,0.0054119825,0.0042342907,0.014885156,0.005635863,0.006555555,0.0017186276],"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.0046784854,0.0013592321,0.018049976,0.0020602117,0.000710298,0.00048292635,0.00084541005,0.48443276,0.03874558,0.30218437,0.024918409,0.12153234],"study_design_scores_gemma":[0.00016873103,0.00022092237,0.0051682116,0.00016194192,0.00028268504,0.0005877904,0.0002713964,0.63302577,0.009291183,0.34499404,0.0056995084,0.00012784933],"about_ca_topic_score_codex":0.0029372524,"about_ca_topic_score_gemma":0.006909271,"teacher_disagreement_score":0.012075091,"about_ca_system_score_codex":0.007150395,"about_ca_system_score_gemma":0.0026950638,"threshold_uncertainty_score":0.051880002},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20597097,0.00027005942,0.70618397,0.0007031155,0.0002148146,0.00025709183,0.0021097448,0.0021271375,0.08216315],"genre_scores_gemma":[0.5862228,0.00054038723,0.3577056,0.000270611,0.000073744886,0.00016135268,0.0037062943,0.0007758561,0.05054339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996946,0.00003198514,0.000016372343,0.00010722414,0.000104813036,0.00004497994],"domain_scores_gemma":[0.9997402,0.000040612078,0.000047780402,0.00007258275,0.000049344668,0.000049437036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013468855,0.0007777076,0.00060331076,0.0009711666,0.0006833454,0.0010888444,0.0012004308,0.0011241549,0.013943952],"category_scores_gemma":[0.0004930689,0.00037465824,0.00061366806,0.0012266412,0.0009055277,0.0017387244,0.0018570935,0.0011266909,0.0034438497],"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.00054463634,0.0002964486,0.0023096628,0.00044679537,0.00010272422,0.0026251785,0.0006381319,0.087568134,0.08138659,0.57856005,0.018908868,0.22661278],"study_design_scores_gemma":[0.00015279041,0.00049819896,0.0044695465,0.00013345949,0.00016099193,0.005560295,0.0010289475,0.30043924,0.074129395,0.46236262,0.1509252,0.0001392355],"about_ca_topic_score_codex":0.00086826883,"about_ca_topic_score_gemma":0.000986713,"teacher_disagreement_score":0.013943952,"about_ca_system_score_codex":0.00036030618,"about_ca_system_score_gemma":0.0003843126,"threshold_uncertainty_score":0.04664713},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76819,0.0002800736,0.19800165,0.0014211216,0.00008900881,0.00008783887,0.00053361355,0.0013523147,0.030044459],"genre_scores_gemma":[0.9740812,0.00011666832,0.019599298,0.00021994988,0.000053091244,0.00004890006,0.00035985807,0.0002720869,0.0052489107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790764,0.00049625826,0.00013455874,0.000674173,0.00037448536,0.0004129586],"domain_scores_gemma":[0.98931795,0.0060188905,0.0011669119,0.0019664185,0.0007102487,0.0008196763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018822638,0.00064052205,0.001098167,0.0015546425,0.0022078508,0.004767913,0.002339784,0.0022312626,0.005710641],"category_scores_gemma":[0.012012522,0.0009585018,0.001048251,0.002272496,0.0042438353,0.01032632,0.004470763,0.0036637539,0.000918128],"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.00038094845,0.00015646771,0.0058989143,0.00016454289,0.000031108877,0.00043435305,0.0017903605,0.007122296,0.009733102,0.9488583,0.0019378158,0.023491867],"study_design_scores_gemma":[0.000022435246,0.000055517492,0.0010114124,0.00004065242,0.00003352234,0.0006058779,0.0010413969,0.019601818,0.004397227,0.96972567,0.0034258068,0.000038689694],"about_ca_topic_score_codex":0.0009465087,"about_ca_topic_score_gemma":0.0010625361,"teacher_disagreement_score":0.005710641,"about_ca_system_score_codex":0.001281493,"about_ca_system_score_gemma":0.00092655787,"threshold_uncertainty_score":0.019103944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6323227,0.0010470658,0.31001392,0.0025591075,0.00024811501,0.00021866067,0.002264119,0.0015115698,0.04981459],"genre_scores_gemma":[0.83023196,0.00055554585,0.15376557,0.00029703855,0.00009140967,0.00015751486,0.0020842974,0.0005941561,0.012222469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971506,0.00068405655,0.00014741904,0.0006137617,0.0009109104,0.0004932909],"domain_scores_gemma":[0.9827627,0.011689585,0.001642816,0.0017866499,0.0013390593,0.0007791266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016800979,0.0012578813,0.0010856816,0.0014972357,0.0016023824,0.004073665,0.0038355556,0.0024654698,0.009560257],"category_scores_gemma":[0.017229192,0.0011999907,0.0009401181,0.0019833662,0.0016364254,0.005294507,0.0025145414,0.0017604001,0.0015675878],"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.0013893851,0.0003917997,0.021611854,0.0012072638,0.00031855688,0.0013836741,0.0010142387,0.41863796,0.043576088,0.39428216,0.028600784,0.08758617],"study_design_scores_gemma":[0.00007258175,0.00011674093,0.0028226166,0.00008066443,0.00010563495,0.0008060445,0.00029118176,0.74446064,0.016723093,0.229161,0.0053037778,0.000055964425],"about_ca_topic_score_codex":0.002938378,"about_ca_topic_score_gemma":0.005852124,"teacher_disagreement_score":0.009560257,"about_ca_system_score_codex":0.002158112,"about_ca_system_score_gemma":0.0012366122,"threshold_uncertainty_score":0.031982243},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016116471,0.020857722,0.0029100035,0.19418883,0.3779455,0.00008311185,0.0012369632,0.0018160008,0.39935017],"genre_scores_gemma":[0.0066407095,0.007200988,0.0009983062,0.0475965,0.05201471,0.000037667127,0.0009244427,0.0006544776,0.88393223],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795026,0.00020794981,0.00007740819,0.00024976305,0.0011802254,0.00033436753],"domain_scores_gemma":[0.9941048,0.0010814625,0.00025984942,0.0009332027,0.0019996348,0.0016209473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023173508,0.0011144489,0.00083628873,0.0023111273,0.002113526,0.007649127,0.0015128462,0.0045980215,0.20164113],"category_scores_gemma":[0.009718227,0.0005083714,0.00075035513,0.0015685405,0.001717903,0.005398506,0.0031714477,0.0067469133,0.13858348],"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.000027927626,0.000008112495,0.000034323963,0.00003473823,0.0000022170716,0.000041690968,0.000016786542,0.000020637344,0.00012840315,0.0025726394,0.972973,0.024139524],"study_design_scores_gemma":[0.0000053319573,0.0000093319695,0.000090248,0.000041366413,0.0000018809425,0.000034144858,0.00003857543,0.000037987513,0.00008772742,0.0018790698,0.99777114,0.0000032311225],"about_ca_topic_score_codex":0.0019212753,"about_ca_topic_score_gemma":0.0052243196,"teacher_disagreement_score":0.20164113,"about_ca_system_score_codex":0.0015315016,"about_ca_system_score_gemma":0.0016645518,"threshold_uncertainty_score":0.67455673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9402027,0.00030841728,0.023191689,0.00063029723,0.000046300967,0.00007931772,0.00051928364,0.00016334788,0.03485869],"genre_scores_gemma":[0.9904274,0.00023447446,0.006083806,0.000109169254,0.000034665853,0.00005855682,0.00045832325,0.000028461585,0.0025650496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971074,0.000058436297,0.000016488279,0.00007608175,0.00006114943,0.00007715203],"domain_scores_gemma":[0.99785304,0.00093518605,0.00048795942,0.0001948292,0.00022148089,0.00030754798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020178262,0.00028504874,0.00049989397,0.0012976798,0.0011475906,0.0018240554,0.0011063362,0.0009549237,0.0085787345],"category_scores_gemma":[0.002164603,0.00025192383,0.00026672112,0.0013731145,0.0012106685,0.0020882722,0.0010257526,0.0007852385,0.00053247664],"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.0011990179,0.00025138797,0.010134985,0.000536042,0.00007434431,0.0011551866,0.004060638,0.015162811,0.031323466,0.87094975,0.007617465,0.05753497],"study_design_scores_gemma":[0.0001612052,0.0001113331,0.005413383,0.000057022928,0.00005125028,0.0005183873,0.0016256286,0.022893207,0.005381759,0.95595235,0.0078050303,0.000029475503],"about_ca_topic_score_codex":0.0014802472,"about_ca_topic_score_gemma":0.0013909539,"teacher_disagreement_score":0.0085787345,"about_ca_system_score_codex":0.00050736155,"about_ca_system_score_gemma":0.00034043565,"threshold_uncertainty_score":0.028698742},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15901169,0.0003509841,0.7529369,0.0008792399,0.00020896946,0.00022386911,0.00030614863,0.00059310836,0.08548909],"genre_scores_gemma":[0.6117988,0.00040211453,0.35087988,0.0005629764,0.000107551314,0.00046642547,0.00040497415,0.00018357665,0.035193663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987978,0.00049215544,0.000061589664,0.0001687706,0.0002913484,0.00018841802],"domain_scores_gemma":[0.99842936,0.0005703363,0.00014405418,0.00045014318,0.00022499198,0.00018112731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011948592,0.00075456314,0.0007086476,0.0015346709,0.0013484458,0.0021139213,0.001053631,0.0012583702,0.00930649],"category_scores_gemma":[0.0027755431,0.00068591215,0.000894282,0.0012792203,0.0014188341,0.001630732,0.0027494426,0.0018685769,0.0020631903],"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.0000847387,0.00003110289,0.0001942765,0.000038165523,0.000013147079,0.000076518096,0.00020716294,0.0021996563,0.0042833583,0.97740376,0.0010566816,0.014411301],"study_design_scores_gemma":[0.00011743193,0.00013392781,0.00019078032,0.00006451421,0.00003270893,0.00030922642,0.00014508088,0.021303382,0.010011816,0.94657284,0.021081671,0.000036642257],"about_ca_topic_score_codex":0.00022143603,"about_ca_topic_score_gemma":0.0004907231,"teacher_disagreement_score":0.00930649,"about_ca_system_score_codex":0.0008647532,"about_ca_system_score_gemma":0.000838533,"threshold_uncertainty_score":0.031133294},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48976254,0.0045065214,0.15066908,0.01948502,0.0010020577,0.00013217899,0.0017746448,0.0011591256,0.3315088],"genre_scores_gemma":[0.89914644,0.002093823,0.03944373,0.0029531831,0.0007117623,0.0001211624,0.0018200856,0.0006085892,0.053101365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993512,0.00019560277,0.0000270478,0.0002084897,0.00008933111,0.00012827174],"domain_scores_gemma":[0.9963625,0.0017741248,0.0004896028,0.0005532641,0.00044594708,0.0003745733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082695193,0.0007035818,0.0007443108,0.002663731,0.004608502,0.004476499,0.0018376871,0.001879258,0.013586993],"category_scores_gemma":[0.004044471,0.00071447354,0.0008022747,0.0026886414,0.004831117,0.009345259,0.0028166387,0.0029649087,0.0026107272],"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.00004342795,0.000017505947,0.00019949346,0.00004135006,0.000004444037,0.000055653734,0.00040006882,0.00053758523,0.0005427699,0.98762286,0.0036435942,0.006891161],"study_design_scores_gemma":[0.000006297762,0.000005919512,0.00020979182,0.000017391663,0.0000058436062,0.00006316279,0.00015407315,0.0013566659,0.00025904475,0.9923948,0.005516675,0.000010283496],"about_ca_topic_score_codex":0.0032595498,"about_ca_topic_score_gemma":0.00438641,"teacher_disagreement_score":0.013586993,"about_ca_system_score_codex":0.0017962765,"about_ca_system_score_gemma":0.0011969365,"threshold_uncertainty_score":0.045453012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8864168,0.00017029695,0.077695444,0.0006202652,0.0001586838,0.0000705836,0.00026542522,0.00027077284,0.034331653],"genre_scores_gemma":[0.9735677,0.00013196106,0.011424811,0.000106729865,0.00008136121,0.000033886266,0.00016390557,0.000105724306,0.014383786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992493,0.00016820578,0.000037401504,0.00015772383,0.00018443548,0.00020297425],"domain_scores_gemma":[0.9988226,0.00026476372,0.0001922389,0.00022987367,0.00013761093,0.000352796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082210667,0.0005846407,0.00088996004,0.0020778507,0.002021577,0.0021705786,0.0010255324,0.0011152305,0.0066669574],"category_scores_gemma":[0.0015658821,0.0003982628,0.0010331052,0.0011181356,0.0028292385,0.0037507762,0.002841495,0.0015587244,0.0007509631],"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.00004717666,0.000011676609,0.00016836036,0.000010889891,0.0000052843748,0.00007697733,0.000160329,0.0010237397,0.0015493549,0.9949722,0.00023269074,0.0017413485],"study_design_scores_gemma":[0.000018270292,0.00003149234,0.00037253433,0.000009617618,0.000010176186,0.00009720465,0.00012876013,0.00877615,0.0015162815,0.98769987,0.0013190898,0.000020575642],"about_ca_topic_score_codex":0.0015638184,"about_ca_topic_score_gemma":0.001353459,"teacher_disagreement_score":0.0066669574,"about_ca_system_score_codex":0.001349895,"about_ca_system_score_gemma":0.00054946955,"threshold_uncertainty_score":0.022303224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67654824,0.0017879328,0.046399757,0.035508078,0.0012238927,0.00009209209,0.0007823342,0.00077920686,0.23687851],"genre_scores_gemma":[0.98225015,0.00038480744,0.0067911604,0.001154272,0.00043012746,0.00007834153,0.00025681048,0.000092854876,0.008561559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984597,0.000387976,0.000060176662,0.00042054098,0.00037781466,0.00029382258],"domain_scores_gemma":[0.9879605,0.008908351,0.0006907073,0.0012896343,0.00049644354,0.0006542907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020538364,0.0007742831,0.0014669271,0.0028013024,0.0041390653,0.0047728005,0.0026899278,0.004796114,0.015413939],"category_scores_gemma":[0.017502004,0.00088851876,0.0008587321,0.0032093022,0.008891204,0.010429509,0.0046897926,0.0043704854,0.0010174244],"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.00012878608,0.000037605554,0.000600048,0.0000623947,0.000009688329,0.0001359623,0.00036313676,0.0016458101,0.00040874787,0.98970747,0.0045140292,0.0023863595],"study_design_scores_gemma":[0.00006157514,0.00000858578,0.00033724456,0.00002041437,0.000010558344,0.00012252164,0.00022244212,0.0079606045,0.00043964686,0.98742664,0.0033750762,0.000014707048],"about_ca_topic_score_codex":0.0021054659,"about_ca_topic_score_gemma":0.0018078645,"teacher_disagreement_score":0.015413939,"about_ca_system_score_codex":0.002383433,"about_ca_system_score_gemma":0.0008029554,"threshold_uncertainty_score":0.051564753},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62729883,0.0007884069,0.28336355,0.001960921,0.0003067976,0.00023289243,0.0007074078,0.001308689,0.08403248],"genre_scores_gemma":[0.9534243,0.0006661285,0.028752448,0.00039523115,0.00020334515,0.00018918439,0.00078059593,0.0003672258,0.015221478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859136,0.00035122145,0.00007872011,0.00035004137,0.00028824623,0.0003405137],"domain_scores_gemma":[0.99211794,0.0038700642,0.0013586441,0.0011800712,0.00048354216,0.0009897405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011199531,0.00090982066,0.0012448248,0.0021061632,0.0024252604,0.003139542,0.0023389738,0.0017281084,0.012576691],"category_scores_gemma":[0.0077234693,0.0009986241,0.001580359,0.0026676534,0.0036737951,0.006597527,0.003032968,0.0025283874,0.0010843709],"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.00030602928,0.00007462749,0.0009405408,0.00012682246,0.00003811803,0.00050424074,0.0007689666,0.022775758,0.004094389,0.95168084,0.0024031457,0.016286448],"study_design_scores_gemma":[0.00004146544,0.00004948198,0.0008008566,0.000036376492,0.000043837183,0.00023627434,0.00042871304,0.04272921,0.001494119,0.95176953,0.0023424143,0.000027812626],"about_ca_topic_score_codex":0.0021672568,"about_ca_topic_score_gemma":0.0016731357,"teacher_disagreement_score":0.012576691,"about_ca_system_score_codex":0.0019450993,"about_ca_system_score_gemma":0.0010398672,"threshold_uncertainty_score":0.04207325},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042461822,0.0009338787,0.0023710974,0.060529955,0.9276131,0.000026584767,0.0018142972,0.0005009915,0.0057855565],"genre_scores_gemma":[0.07399168,0.008973571,0.013210236,0.085789286,0.52545065,0.00034628774,0.0059065823,0.0031163106,0.28321546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99652183,0.00060561445,0.00041702538,0.00079201726,0.0012365908,0.00042703171],"domain_scores_gemma":[0.9686156,0.0073960065,0.0010933013,0.0030466488,0.018368172,0.0014803387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027418258,0.0022412112,0.0020508461,0.0046857037,0.0040214276,0.0042652725,0.005106597,0.005915927,0.08318632],"category_scores_gemma":[0.056211863,0.0011741879,0.0016095012,0.005103461,0.0036624137,0.004630026,0.0025633897,0.009225949,0.026501771],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052788713,0.0000045823253,0.0000623618,0.0001323843,0.000017201011,0.00011175445,0.0000411678,0.0001525729,0.000046577123,0.0042568566,0.9908757,0.0042459867],"study_design_scores_gemma":[0.00009535024,0.000020816822,0.00082393124,0.00019796673,0.00007848601,0.0004201296,0.00012169513,0.0011473257,0.00042025984,0.018009186,0.9785972,0.00006751511],"about_ca_topic_score_codex":0.023289109,"about_ca_topic_score_gemma":0.021242986,"teacher_disagreement_score":0.08318632,"about_ca_system_score_codex":0.006266133,"about_ca_system_score_gemma":0.005153432,"threshold_uncertainty_score":0.27828598},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20473373,0.005522036,0.6372857,0.01260789,0.0015819331,0.00046612564,0.0043174415,0.0064102574,0.12707484],"genre_scores_gemma":[0.70521665,0.004355871,0.226677,0.0030441904,0.001674117,0.00089607446,0.006935301,0.004341677,0.046859056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9922666,0.0011866392,0.0004134349,0.0019323335,0.0023563954,0.0018445965],"domain_scores_gemma":[0.9528374,0.032988634,0.0013711693,0.008635075,0.0021962875,0.0019713049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045297304,0.004832202,0.0030966278,0.0030038073,0.0030629872,0.010750107,0.009493678,0.004312568,0.037017137],"category_scores_gemma":[0.037642036,0.0030916973,0.0040256716,0.0055161626,0.004367826,0.039395105,0.015652757,0.010109762,0.008136803],"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.0038420998,0.001072371,0.0059670247,0.002851114,0.0004671703,0.00093384215,0.0015498754,0.12235686,0.026138334,0.54748726,0.06415479,0.2231793],"study_design_scores_gemma":[0.0002726495,0.000228629,0.0010126047,0.00019328711,0.00035948533,0.0004776015,0.00042474078,0.23431227,0.009101904,0.73896486,0.014549892,0.00010204863],"about_ca_topic_score_codex":0.0021675609,"about_ca_topic_score_gemma":0.0041022818,"teacher_disagreement_score":0.037017137,"about_ca_system_score_codex":0.0043254765,"about_ca_system_score_gemma":0.0029071565,"threshold_uncertainty_score":0.12383467},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04984313,0.016041398,0.1237531,0.058755018,0.029792478,0.00013165324,0.00058861764,0.00074192474,0.72035265],"genre_scores_gemma":[0.63165295,0.019148879,0.08031676,0.02047405,0.014798401,0.00024526037,0.00075336645,0.0011333846,0.23147699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997392,0.00007461388,0.000012158239,0.000060398128,0.00007013071,0.000043510314],"domain_scores_gemma":[0.9986609,0.00069497403,0.00005943767,0.00016780336,0.0002624622,0.00015435054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056159974,0.0006992862,0.0005794811,0.0017441765,0.0027726,0.0017637888,0.0014704318,0.001236555,0.013370412],"category_scores_gemma":[0.0027303305,0.00031347864,0.00057872984,0.0013725471,0.0021872274,0.00476992,0.0019280298,0.003220252,0.0020690607],"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.00001550692,0.000011644467,0.000107619955,0.000060951123,0.00000377776,0.00013570189,0.000090861075,0.00043902177,0.00047035277,0.9507117,0.036828514,0.011124372],"study_design_scores_gemma":[0.000004430844,0.0000070258966,0.000083836145,0.000033685603,0.000005018367,0.00015884472,0.00007809739,0.0007392072,0.00043603076,0.92294395,0.075501524,0.000008298109],"about_ca_topic_score_codex":0.0013871791,"about_ca_topic_score_gemma":0.0024237852,"teacher_disagreement_score":0.013370412,"about_ca_system_score_codex":0.001182116,"about_ca_system_score_gemma":0.0006000269,"threshold_uncertainty_score":0.044728518},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36241776,0.0017577391,0.55620563,0.006150126,0.00026652304,0.00045891988,0.0030680462,0.0010227454,0.06865249],"genre_scores_gemma":[0.8527488,0.0023693,0.11646781,0.0010019894,0.0008052746,0.0005843822,0.0038359622,0.00068800274,0.02149838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724174,0.00058580015,0.00013115595,0.0008188985,0.00081807066,0.0004044467],"domain_scores_gemma":[0.9600342,0.031201214,0.0025066733,0.0031572874,0.001562346,0.0015382504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063318,0.0017638578,0.0018344772,0.0026784523,0.0025105844,0.0064422665,0.00518131,0.0024784342,0.014516179],"category_scores_gemma":[0.02138588,0.0015087266,0.002657071,0.005199789,0.0038652855,0.017530808,0.0045937914,0.0058802655,0.0010120107],"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.0006037637,0.0007682537,0.0055845003,0.00082576985,0.00019842267,0.0003933438,0.0010563878,0.13203059,0.0061352607,0.7977305,0.014936623,0.03973652],"study_design_scores_gemma":[0.000077665994,0.00004400697,0.001000669,0.000030717012,0.00009380797,0.00018729156,0.00019448143,0.16929854,0.0016613175,0.82492006,0.002461569,0.0000297619],"about_ca_topic_score_codex":0.004148465,"about_ca_topic_score_gemma":0.0056790933,"teacher_disagreement_score":0.014516179,"about_ca_system_score_codex":0.003623293,"about_ca_system_score_gemma":0.0019048332,"threshold_uncertainty_score":0.048561454},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8701472,0.00085122307,0.053201362,0.0012856519,0.00010612239,0.000065536726,0.0007892076,0.0006283626,0.072925344],"genre_scores_gemma":[0.9806157,0.00025604523,0.0065995143,0.00020544734,0.00004304981,0.00008547454,0.0009173972,0.00016971526,0.011107671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993938,0.00010782386,0.000026988453,0.00014885553,0.00013572542,0.00018680499],"domain_scores_gemma":[0.9962457,0.0021634328,0.00028319668,0.00023831955,0.0004183466,0.0006508758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057284295,0.00066171226,0.0005273238,0.0026764073,0.0036122443,0.0028608877,0.0017900824,0.0009910756,0.008420706],"category_scores_gemma":[0.0042077526,0.00080566393,0.0006797992,0.001166379,0.002222929,0.0027552014,0.001912501,0.0015530732,0.00063475006],"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.00028914004,0.000061215,0.003263698,0.000179425,0.000037405633,0.0012842844,0.0014314636,0.003957558,0.0060317037,0.9690449,0.0061355596,0.008283551],"study_design_scores_gemma":[0.00007593908,0.000037857404,0.002942899,0.00014463867,0.000078136465,0.0014310697,0.00086729997,0.020711305,0.005516649,0.95600706,0.012125355,0.00006187845],"about_ca_topic_score_codex":0.0018369158,"about_ca_topic_score_gemma":0.0027405887,"teacher_disagreement_score":0.008420706,"about_ca_system_score_codex":0.0019395708,"about_ca_system_score_gemma":0.0007584181,"threshold_uncertainty_score":0.02817005},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5008488,0.004553439,0.18481418,0.02474041,0.0009406026,0.00014381293,0.0010337314,0.0006204835,0.28230453],"genre_scores_gemma":[0.9076525,0.00368047,0.041708022,0.0016896039,0.0015443669,0.0001737542,0.0016018831,0.00034422535,0.041605238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829453,0.00062976376,0.00006407315,0.00033105267,0.00033565593,0.000345047],"domain_scores_gemma":[0.99412113,0.004265304,0.00045803914,0.00042317424,0.00030478148,0.0004275186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020256129,0.00072548055,0.002023167,0.0022101663,0.004116729,0.0042950893,0.0024865167,0.0036306218,0.017565606],"category_scores_gemma":[0.009681045,0.00083091395,0.0012820007,0.0035544524,0.004635582,0.014694124,0.004931752,0.005568071,0.0011652795],"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.000073365285,0.00005178242,0.0002495125,0.000054784283,0.000010828419,0.00007409444,0.00019333565,0.0027122295,0.00013920678,0.9839445,0.0046870974,0.0078092585],"study_design_scores_gemma":[0.0000136255585,0.000004588955,0.00006376583,0.000010417728,0.000004490096,0.00003391781,0.00007888828,0.0032908337,0.00007212196,0.9945774,0.0018437192,0.000006162183],"about_ca_topic_score_codex":0.002110488,"about_ca_topic_score_gemma":0.0017072976,"teacher_disagreement_score":0.017565606,"about_ca_system_score_codex":0.001966491,"about_ca_system_score_gemma":0.0012181799,"threshold_uncertainty_score":0.05876279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5029598,0.0026536628,0.40515828,0.0037651267,0.0005758073,0.000073012896,0.0004045162,0.00046245733,0.08394731],"genre_scores_gemma":[0.9590662,0.0011157326,0.028986556,0.00043597652,0.0006321155,0.00010419443,0.00024595327,0.00019855791,0.009214711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898857,0.00035360616,0.000048809863,0.00026029456,0.0001979486,0.00015081368],"domain_scores_gemma":[0.9952952,0.0026743968,0.0005182296,0.0006341745,0.00040487674,0.00047312773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001222437,0.00085942994,0.0010378843,0.002785573,0.0025281492,0.00390344,0.0014476094,0.0017424942,0.0057737036],"category_scores_gemma":[0.0058438736,0.0006832051,0.0009341411,0.0026775266,0.0060258834,0.009602312,0.0028244872,0.0026547622,0.00080592046],"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.000025368152,0.00001565097,0.00014336212,0.000025644795,0.0000035653522,0.000026595839,0.00018840392,0.00076852296,0.0006130055,0.99459213,0.0005466118,0.0030511073],"study_design_scores_gemma":[0.0000045407833,0.0000067136916,0.000098890116,0.000007908904,0.000005078205,0.000040924733,0.00010009512,0.0026057295,0.00031842306,0.9959657,0.00084028544,0.0000056648123],"about_ca_topic_score_codex":0.00074391376,"about_ca_topic_score_gemma":0.000791312,"teacher_disagreement_score":0.0057737036,"about_ca_system_score_codex":0.0007671729,"about_ca_system_score_gemma":0.0006035132,"threshold_uncertainty_score":0.019314945},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7812974,0.0005430148,0.1274799,0.00073987996,0.00016386871,0.00010891416,0.0010735525,0.00027532643,0.088318236],"genre_scores_gemma":[0.9784177,0.0003521092,0.010943147,0.00015543737,0.00008863424,0.000052880114,0.00068502343,0.00007939615,0.009225579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878305,0.00023709227,0.00011227144,0.00034182242,0.00027682362,0.00024895326],"domain_scores_gemma":[0.9934232,0.0030761284,0.00064465136,0.00079799467,0.0007692639,0.001288596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000842919,0.0005183109,0.0009962559,0.0020369813,0.002406359,0.0049338536,0.001456914,0.00080223114,0.005439631],"category_scores_gemma":[0.005288551,0.0008004016,0.000978096,0.0019644222,0.0030592254,0.0050751204,0.0036480678,0.002362408,0.00066244206],"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.000096640375,0.000030415738,0.0012533554,0.000069796566,0.000019414087,0.00021778514,0.0008463801,0.0011297957,0.0020405045,0.9872584,0.00057829736,0.0064593335],"study_design_scores_gemma":[0.000022039252,0.000023823752,0.0007540321,0.000024077235,0.000018235392,0.00018394449,0.0003553539,0.0032343,0.0008625726,0.99227226,0.0022349022,0.000014479134],"about_ca_topic_score_codex":0.0015839715,"about_ca_topic_score_gemma":0.002260685,"teacher_disagreement_score":0.005439631,"about_ca_system_score_codex":0.0012071324,"about_ca_system_score_gemma":0.0006378067,"threshold_uncertainty_score":0.018197417},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7455004,0.00055281963,0.065080814,0.0027387314,0.00043353942,0.00008429582,0.0006077196,0.0004039157,0.18459783],"genre_scores_gemma":[0.9683281,0.00018593625,0.011794495,0.0005091639,0.00014555661,0.000061395665,0.00026436144,0.000089508474,0.018621465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926466,0.00018335764,0.000041241325,0.0000943783,0.00022117047,0.00019519994],"domain_scores_gemma":[0.9985386,0.0005735256,0.00018969686,0.00021542342,0.00025544426,0.00022721352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069646025,0.0005361481,0.0006927691,0.0026771775,0.002078363,0.0034602815,0.0009639128,0.0020012273,0.011186525],"category_scores_gemma":[0.0030408015,0.00037807072,0.0005338813,0.0010696999,0.00265869,0.0020867079,0.002207059,0.001876833,0.0014791384],"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.00013925711,0.00003347801,0.00036428988,0.00004301811,0.000006855207,0.00017763808,0.00013186221,0.0013497977,0.0025105039,0.98790205,0.0016131909,0.0057282345],"study_design_scores_gemma":[0.000051277555,0.000030421561,0.00046288135,0.000044140023,0.000015909787,0.0005222245,0.00016766267,0.014423513,0.0040669693,0.9763362,0.0038441354,0.000034786248],"about_ca_topic_score_codex":0.00051340566,"about_ca_topic_score_gemma":0.000743985,"teacher_disagreement_score":0.011186525,"about_ca_system_score_codex":0.001356845,"about_ca_system_score_gemma":0.0008594594,"threshold_uncertainty_score":0.037422597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7700267,0.0009420855,0.11422661,0.0037733808,0.00030315437,0.000136611,0.0010176416,0.0008143396,0.10875961],"genre_scores_gemma":[0.98032814,0.00033524603,0.0066752126,0.00021524854,0.00020950512,0.00006013222,0.0004201336,0.00025498096,0.011501434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869734,0.0003592991,0.000063794214,0.00035605754,0.00027098152,0.00025259127],"domain_scores_gemma":[0.9952484,0.0022502553,0.00067219336,0.0006726994,0.0003871459,0.00076937594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012387583,0.0010236844,0.0011149575,0.002845172,0.0018550184,0.0055028354,0.0028333326,0.001643994,0.014677275],"category_scores_gemma":[0.008606796,0.00074522,0.0007797973,0.002376727,0.005345109,0.013395756,0.0032241356,0.0034316585,0.0015121555],"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.000049956394,0.00001847014,0.00031263658,0.00002053664,0.000004341659,0.000038327013,0.00032734673,0.0009831454,0.00039138054,0.9950948,0.0005386587,0.0022204304],"study_design_scores_gemma":[0.000015572174,0.0000061966884,0.00013235894,0.000009058014,0.0000057904094,0.00003951046,0.000114454626,0.0021778485,0.0003766207,0.9958845,0.0012284999,0.000009578691],"about_ca_topic_score_codex":0.0017646285,"about_ca_topic_score_gemma":0.0012830506,"teacher_disagreement_score":0.014677275,"about_ca_system_score_codex":0.0028474825,"about_ca_system_score_gemma":0.00082117575,"threshold_uncertainty_score":0.0491004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6842626,0.00084228383,0.23992236,0.0017591187,0.00036952196,0.00013028683,0.0014799905,0.0006496864,0.07058419],"genre_scores_gemma":[0.9536513,0.0003008698,0.026243774,0.0002869105,0.000065001674,0.00008029567,0.00047793848,0.00012508853,0.018768772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997793,0.000042937674,0.000009515439,0.000045457007,0.000057956604,0.000064922926],"domain_scores_gemma":[0.99924785,0.000339792,0.00009346392,0.00012758312,0.000113707894,0.00007752533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028852638,0.00026534993,0.0003120334,0.0009353394,0.0008032634,0.001001015,0.00044319185,0.000780765,0.0064367605],"category_scores_gemma":[0.00208627,0.00016218788,0.00027448632,0.0006239854,0.0008577707,0.0010398503,0.0007642104,0.00085729477,0.0007500777],"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.00016251666,0.000032669283,0.0006118143,0.00005565235,0.0000075881208,0.00014548226,0.00027519488,0.009276644,0.0058919755,0.95074093,0.004795209,0.028004205],"study_design_scores_gemma":[0.000020015961,0.000029559735,0.00058786356,0.000038536033,0.0000084949725,0.0001690556,0.000099212484,0.041482683,0.0029334917,0.9487847,0.005826197,0.000020119614],"about_ca_topic_score_codex":0.0022754646,"about_ca_topic_score_gemma":0.0031299682,"teacher_disagreement_score":0.0064367605,"about_ca_system_score_codex":0.00087178464,"about_ca_system_score_gemma":0.00072873867,"threshold_uncertainty_score":0.021533132},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46273682,0.0021455304,0.36533335,0.005604209,0.0003410484,0.0001191231,0.0012335175,0.0015062836,0.16098012],"genre_scores_gemma":[0.95888674,0.0008662826,0.020367408,0.0005892643,0.00021194507,0.0000736559,0.00073753187,0.0003424176,0.017924815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986112,0.0004826138,0.00008886354,0.00036179007,0.00021166922,0.00024383873],"domain_scores_gemma":[0.9958923,0.0025867454,0.00037294134,0.00042841857,0.00039673437,0.00032285188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013600775,0.0007132758,0.0009702672,0.0026630433,0.0030450325,0.0054502827,0.0012286017,0.0014451665,0.0131134195],"category_scores_gemma":[0.0049264804,0.0009806779,0.0011071328,0.0034933668,0.00447245,0.0166244,0.003533011,0.004017474,0.001274265],"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.00004290067,0.000028688351,0.0003972326,0.000043575048,0.0000069440785,0.00011020404,0.00074379257,0.00044566585,0.00040108932,0.99134153,0.0011853804,0.0052529476],"study_design_scores_gemma":[0.000012435571,0.0000072461225,0.00016792666,0.000016901618,0.000013334093,0.00008767471,0.00035813046,0.0012573132,0.00041015848,0.9939976,0.003662319,0.000008940825],"about_ca_topic_score_codex":0.0016367151,"about_ca_topic_score_gemma":0.0011302765,"teacher_disagreement_score":0.0131134195,"about_ca_system_score_codex":0.0015610318,"about_ca_system_score_gemma":0.00048057316,"threshold_uncertainty_score":0.04386872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7257129,0.005295201,0.051252507,0.00619929,0.00025961373,0.000033235563,0.00040820002,0.00016169577,0.21067734],"genre_scores_gemma":[0.9803627,0.0023122188,0.004717974,0.00022474947,0.0002349306,0.0000126052755,0.00017287477,0.000033487875,0.011928508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956614,0.00011832694,0.000020365303,0.00009012688,0.00011998544,0.000085061074],"domain_scores_gemma":[0.99855703,0.0007602096,0.0002706674,0.00011921211,0.00013888083,0.00015395197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057281565,0.0005631292,0.000747303,0.0030350867,0.0013613675,0.0048044855,0.0007271109,0.0009816034,0.005790606],"category_scores_gemma":[0.002271642,0.0004157109,0.00045599783,0.0028516257,0.006196909,0.006488442,0.0014930769,0.0020903063,0.00045540987],"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.000015937956,0.0000067396986,0.00012660053,0.000014341718,0.000002424196,0.000027140997,0.00015088868,0.0006494332,0.00015505904,0.99696356,0.0002976911,0.0015902065],"study_design_scores_gemma":[0.000008334278,0.0000029042656,0.00018020997,0.000008125253,0.000005012602,0.000044862343,0.00020458866,0.0010097481,0.00010303938,0.99671495,0.0017146441,0.0000036531048],"about_ca_topic_score_codex":0.0032512532,"about_ca_topic_score_gemma":0.002520808,"teacher_disagreement_score":0.005790606,"about_ca_system_score_codex":0.0020148435,"about_ca_system_score_gemma":0.00049198745,"threshold_uncertainty_score":0.01937157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38591576,0.003402804,0.4853331,0.0023833532,0.0005153625,0.00012619555,0.0008466946,0.00052728114,0.12094948],"genre_scores_gemma":[0.8396922,0.0027677985,0.103231505,0.00039978136,0.00036304025,0.00014634451,0.0010635348,0.0003976884,0.051938105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950314,0.00012559457,0.00002335448,0.00014014826,0.00014436833,0.00006329171],"domain_scores_gemma":[0.99845004,0.00084205373,0.00020775612,0.0001953068,0.00017532901,0.00012952756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003973642,0.00070617744,0.0005570732,0.0025150042,0.0012770686,0.0028928376,0.0010031329,0.001165968,0.011193379],"category_scores_gemma":[0.003986329,0.00054288877,0.0005427537,0.002546792,0.0015809317,0.0034358338,0.0017939686,0.0013611355,0.00087513245],"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.000023568866,0.000021555856,0.0005782965,0.00007345115,0.000008290029,0.000091051326,0.00015725342,0.00654999,0.0011611861,0.96614766,0.0022079174,0.022979787],"study_design_scores_gemma":[0.0000054531347,0.0000051236407,0.00019655134,0.000020933707,0.000006415034,0.00008922703,0.00008723576,0.009896135,0.00073464366,0.9825147,0.0064381254,0.000005398313],"about_ca_topic_score_codex":0.0007980703,"about_ca_topic_score_gemma":0.0012494195,"teacher_disagreement_score":0.011193379,"about_ca_system_score_codex":0.00097446295,"about_ca_system_score_gemma":0.0004748348,"threshold_uncertainty_score":0.037445545},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64723283,0.00048454115,0.29912123,0.0007016247,0.00012582798,0.00014598375,0.00079898495,0.00040833108,0.050980628],"genre_scores_gemma":[0.89710814,0.00048138908,0.08353028,0.00017306594,0.00009630384,0.0001283987,0.0012540377,0.00023938602,0.01698883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991979,0.00022548683,0.000041734667,0.000148388,0.00023376792,0.00015273843],"domain_scores_gemma":[0.99709094,0.0013453916,0.000455365,0.0005677106,0.00022782227,0.00031273422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035335435,0.0004823559,0.0008226818,0.00092775084,0.0012722549,0.0021773218,0.0016322108,0.001555433,0.010710641],"category_scores_gemma":[0.005157308,0.0007042654,0.0007268812,0.001846865,0.0013499183,0.003036188,0.0021768596,0.0013563856,0.0011902852],"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.00036484748,0.00017311316,0.002891915,0.00030514356,0.000038956314,0.00077990536,0.0011334404,0.07866223,0.008124049,0.8133671,0.008962051,0.08519724],"study_design_scores_gemma":[0.000046781544,0.000069282796,0.0012728961,0.00005447038,0.000029478197,0.000603075,0.00058281654,0.19784883,0.0042012823,0.78855425,0.0067118187,0.000025051986],"about_ca_topic_score_codex":0.0015410468,"about_ca_topic_score_gemma":0.0015466927,"teacher_disagreement_score":0.010710641,"about_ca_system_score_codex":0.00056091446,"about_ca_system_score_gemma":0.00036089306,"threshold_uncertainty_score":0.035830617},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005053787,0.0013422783,0.0037054813,0.035901405,0.95226747,0.00003104559,0.0017723306,0.00063076976,0.0038437888],"genre_scores_gemma":[0.082395196,0.014230667,0.023143666,0.0780283,0.59993714,0.00048895366,0.005577052,0.0033386655,0.19286029],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965153,0.0006389443,0.00053692807,0.0007742733,0.0011777802,0.00035681354],"domain_scores_gemma":[0.9699957,0.007337869,0.0015352945,0.0024648032,0.017409,0.0012573438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022621222,0.002756807,0.0022294088,0.004442051,0.003331651,0.0034247376,0.0050412104,0.0066362605,0.049830154],"category_scores_gemma":[0.068954185,0.0015742232,0.0017093575,0.004228667,0.0039047883,0.0041433484,0.0021500937,0.009921324,0.02115846],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008354702,0.0000072364455,0.0001151326,0.00042176177,0.000037893453,0.00039155912,0.000074542775,0.00029641128,0.000121015175,0.00446916,0.984945,0.009036633],"study_design_scores_gemma":[0.00010237453,0.000028765102,0.00091143494,0.00030285429,0.0001020365,0.001412625,0.00013227644,0.0012418961,0.0008314569,0.011111331,0.9837474,0.00007547876],"about_ca_topic_score_codex":0.016410744,"about_ca_topic_score_gemma":0.012475593,"teacher_disagreement_score":0.049830154,"about_ca_system_score_codex":0.0036198343,"about_ca_system_score_gemma":0.0036921848,"threshold_uncertainty_score":0.16669846},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19631514,0.028058466,0.18519773,0.029385135,0.02100114,0.00007827898,0.00080262544,0.0015091202,0.5376523],"genre_scores_gemma":[0.7841117,0.014195752,0.068883434,0.005243027,0.013425901,0.00007427041,0.0005137704,0.00040709053,0.113145165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996037,0.00011164492,0.00002090377,0.00007415074,0.00011027605,0.00007950746],"domain_scores_gemma":[0.9993168,0.0003259308,0.00004169694,0.000112252936,0.00008561852,0.000117609336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069957646,0.0008263998,0.00067297084,0.0014509975,0.0014082695,0.0021714382,0.0010803158,0.0006462806,0.008402681],"category_scores_gemma":[0.0012528212,0.00030756913,0.00058207917,0.0013680481,0.002095846,0.0051208977,0.0020805805,0.0026834935,0.0014829003],"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.000058562608,0.00005483654,0.00024187932,0.00011061862,0.000011347673,0.000193272,0.00050770026,0.0006711995,0.0022528074,0.9581073,0.01586863,0.021921933],"study_design_scores_gemma":[0.0000073331103,0.00004403737,0.00033328618,0.000024087516,0.0000112545995,0.00015522145,0.00016044237,0.0010525169,0.0011180917,0.9379162,0.05915979,0.000017741737],"about_ca_topic_score_codex":0.00064756704,"about_ca_topic_score_gemma":0.0017111257,"teacher_disagreement_score":0.008402681,"about_ca_system_score_codex":0.0005156904,"about_ca_system_score_gemma":0.00039791822,"threshold_uncertainty_score":0.02810973},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33121789,0.0035893915,0.32942143,0.004012038,0.00071939355,0.000092149305,0.0009405857,0.0008149897,0.32919207],"genre_scores_gemma":[0.9401887,0.00113271,0.02374783,0.000697558,0.00054437376,0.00007273921,0.0004370884,0.00029282836,0.032886133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992717,0.00018050004,0.00002518178,0.0001966205,0.0002091121,0.000116958545],"domain_scores_gemma":[0.99738926,0.0013691309,0.0003449043,0.00035304273,0.00025326604,0.00029044523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006698814,0.00039900307,0.00076032564,0.0018469442,0.0016531739,0.0029166166,0.0014229104,0.001110924,0.01279088],"category_scores_gemma":[0.005823879,0.00043310542,0.0006392322,0.0028122144,0.002875701,0.004281051,0.0020427357,0.002922826,0.0010309234],"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.00002205456,0.000007490775,0.00012431163,0.000012802971,0.0000029462647,0.000026965954,0.00007766271,0.0010564879,0.00016247033,0.99204916,0.001104041,0.005353566],"study_design_scores_gemma":[0.0000068229733,0.000005618433,0.00013046149,0.000007978172,0.0000041330572,0.00005826447,0.000050298346,0.0031103974,0.00010111015,0.99300826,0.00351194,0.000004894562],"about_ca_topic_score_codex":0.0012769141,"about_ca_topic_score_gemma":0.000948142,"teacher_disagreement_score":0.01279088,"about_ca_system_score_codex":0.0012085359,"about_ca_system_score_gemma":0.00035634486,"threshold_uncertainty_score":0.042789757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4879793,0.0028438151,0.41419348,0.002640782,0.00046476853,0.00006447484,0.00042792645,0.00024620997,0.09113923],"genre_scores_gemma":[0.9624084,0.0008258874,0.021353627,0.00037546796,0.00027436888,0.000051989773,0.00012418527,0.00003703309,0.014549091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993581,0.00021067838,0.00003112403,0.00009996152,0.00019160782,0.00010856176],"domain_scores_gemma":[0.99784124,0.0010876947,0.00036857344,0.00023144059,0.0003391338,0.0001318613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006320812,0.00039732936,0.00046981368,0.0020825625,0.0009090989,0.0022249487,0.00049180625,0.0011636922,0.0035067277],"category_scores_gemma":[0.0035942039,0.00035277914,0.00031717992,0.0013498224,0.0015891902,0.0019041372,0.0010483174,0.0010430128,0.00049537467],"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.00002758836,0.000011634416,0.00018690045,0.000017678047,0.00000345691,0.000062597835,0.00009433621,0.0035208098,0.0011808086,0.9905642,0.0004454281,0.0038845723],"study_design_scores_gemma":[0.0000071400295,0.00000823771,0.00015143327,0.000011233337,0.000002945448,0.00010587516,0.000044624725,0.018537411,0.0009517082,0.9790668,0.001099465,0.000013051183],"about_ca_topic_score_codex":0.00070885394,"about_ca_topic_score_gemma":0.00076663936,"teacher_disagreement_score":0.0035067277,"about_ca_system_score_codex":0.00074757833,"about_ca_system_score_gemma":0.00053927395,"threshold_uncertainty_score":0.011731148},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51573116,0.0049258266,0.20368582,0.010617639,0.0008732527,0.00015562963,0.0017856603,0.0005639514,0.26166105],"genre_scores_gemma":[0.9412613,0.0035670106,0.032200746,0.0011697478,0.0012094686,0.00023401315,0.0013248533,0.0003171955,0.018715674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874276,0.00039252063,0.000054576365,0.00024996593,0.0003578219,0.00020242318],"domain_scores_gemma":[0.9759532,0.019578924,0.0013454421,0.0008586123,0.00078827894,0.0014756449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019082405,0.0012263895,0.0013090115,0.0046342467,0.002150115,0.0031730642,0.0025808525,0.0020919035,0.011363418],"category_scores_gemma":[0.015681893,0.0013384797,0.0009823092,0.0041803555,0.0044090035,0.006479021,0.0033100385,0.0054402426,0.0012634944],"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.000373908,0.0001344492,0.0032515496,0.0003308171,0.00004242814,0.00015352943,0.0003820764,0.02306105,0.002511551,0.9223155,0.012410677,0.035032526],"study_design_scores_gemma":[0.000052757867,0.00003865742,0.002255799,0.00007313425,0.000035205103,0.00017745009,0.00009024245,0.05406123,0.0011974963,0.9374698,0.004508542,0.000039681257],"about_ca_topic_score_codex":0.0017357382,"about_ca_topic_score_gemma":0.0019156055,"teacher_disagreement_score":0.011363418,"about_ca_system_score_codex":0.0022847631,"about_ca_system_score_gemma":0.0008598861,"threshold_uncertainty_score":0.038014412},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43012992,0.0016873301,0.30947128,0.009817546,0.0006302485,0.00025331875,0.0008135948,0.00039535447,0.2468014],"genre_scores_gemma":[0.87432146,0.0010144233,0.06221865,0.0014411046,0.00057810685,0.00034639603,0.00086170004,0.00018159134,0.05903662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995407,0.0001345774,0.00001826078,0.000080784,0.000097007105,0.00012871053],"domain_scores_gemma":[0.99804676,0.0011937999,0.0001645146,0.00016366299,0.0001773339,0.00025389824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060188014,0.0005982989,0.0006579066,0.00091508956,0.0019633323,0.0018916449,0.0016447151,0.0029700496,0.014497875],"category_scores_gemma":[0.0054937354,0.00044956862,0.0007974861,0.0012896495,0.0017787201,0.0020284923,0.0017773786,0.0026285632,0.0006500153],"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.000048287126,0.000043952095,0.00020570375,0.00007966639,0.000019804602,0.00011654284,0.00015531275,0.0111154225,0.0008247996,0.9700631,0.008734544,0.008592913],"study_design_scores_gemma":[0.000049263595,0.000017507777,0.00013685077,0.000025450307,0.000009422713,0.000067128,0.00008991872,0.059611615,0.00032806836,0.9355957,0.004054197,0.000014934691],"about_ca_topic_score_codex":0.003939308,"about_ca_topic_score_gemma":0.0047637285,"teacher_disagreement_score":0.014497875,"about_ca_system_score_codex":0.0013662472,"about_ca_system_score_gemma":0.0017016967,"threshold_uncertainty_score":0.04850024},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23211503,0.00027605428,0.7472559,0.00069042173,0.000055337736,0.00015105853,0.001164237,0.00065784104,0.01763416],"genre_scores_gemma":[0.5237388,0.00040307897,0.45950383,0.00019886151,0.0000652228,0.00017918533,0.0027465601,0.00036821605,0.012796201],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905294,0.00018759235,0.00007632418,0.0001755137,0.00036853214,0.00013908914],"domain_scores_gemma":[0.9939645,0.0039331815,0.0003498424,0.0009097547,0.000616455,0.00022622381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006513852,0.0004635356,0.00074980577,0.0017525561,0.0009289051,0.0026484923,0.0017687391,0.0008938245,0.0046053864],"category_scores_gemma":[0.007648157,0.0005943652,0.0010321814,0.0022486965,0.0014838086,0.003313613,0.002053633,0.0017124679,0.00073671277],"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.00018345367,0.00019172224,0.0035352046,0.00031555875,0.00004514552,0.00027888452,0.0007379116,0.13472414,0.011638572,0.69135505,0.006101436,0.15089291],"study_design_scores_gemma":[0.000025261064,0.000032351047,0.0006615048,0.00005383551,0.000031147203,0.0002141001,0.00024645,0.36291754,0.011038554,0.6200498,0.0047103576,0.000019048768],"about_ca_topic_score_codex":0.0017766342,"about_ca_topic_score_gemma":0.0043464596,"teacher_disagreement_score":0.0046053864,"about_ca_system_score_codex":0.0014532655,"about_ca_system_score_gemma":0.0010146893,"threshold_uncertainty_score":0.015406549},"labels":[],"label_agreement":null}]}