{"meta":{"query_hash":"cd63b47cb467","filters":{"venue":"Electronic Notes in Discrete Mathematics"},"cohort_total":55,"direct_labels_cover":0,"predictions_cover":55,"exported":55,"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/cd63b47cb467","api":"https://metacan.xera.ac/api/v1/cohort?venue=Electronic+Notes+in+Discrete+Mathematics"},"results":[{"id":"W1510678864","doi":"10.1016/j.endm.2007.07.091","title":"A fast algorithm to generate Beckett-Gray codes","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Algorithms and Data Compression","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 Guelph","funders":"","keywords":"Gray code; Heuristics; Gray (unit); Algorithm; Computation; Binary number; Mathematics; Computer science; Combinatorics; Arithmetic; Mathematical optimization","score_opus":0.011812435253359876,"score_gpt":0.2756582649566635,"score_spread":0.2638458297033036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510678864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016647305,0.00032822523,0.9815891,0.00035099126,0.00018605596,0.00029773446,0.000011435387,0.00014638326,0.00044278157],"genre_scores_gemma":[0.15162992,0.00004195601,0.8476004,0.00026803065,0.00018223099,0.000025927182,0.00001621499,0.000031780877,0.00020350738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975274,0.00003984029,0.0004932302,0.0004944437,0.00043859862,0.0010064408],"domain_scores_gemma":[0.99845225,0.0002834596,0.000122361,0.0009107453,0.00005832403,0.00017285626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011034578,0.00026984065,0.0003267872,0.00022463189,0.00012711737,0.00018336847,0.0012181595,0.00009154851,0.000020433727],"category_scores_gemma":[0.000119814504,0.00022502869,0.00007359749,0.0007294083,0.00004425202,0.000340429,0.00056209334,0.00031514515,0.00009323099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020959631,0.0005140295,0.00019713624,0.00012158567,0.000072619434,0.00009873551,0.0064265863,0.0011607225,0.0074109426,0.250176,0.0011237799,0.7326769],"study_design_scores_gemma":[0.00091287855,0.0004706321,0.00049126666,0.00028766302,0.0000188298,0.00010077147,0.00019035352,0.8375095,0.042833816,0.10978879,0.0062951464,0.0011003378],"about_ca_topic_score_codex":0.000054994205,"about_ca_topic_score_gemma":0.00013737906,"teacher_disagreement_score":0.8363488,"about_ca_system_score_codex":0.00018785692,"about_ca_system_score_gemma":0.00010825963,"threshold_uncertainty_score":0.9176404},"labels":[],"label_agreement":null},{"id":"W1564254624","doi":"10.1016/j.endm.2009.11.051","title":"The chromatic number of random lifts of","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Chromatic scale; Random graph; Friendship graph; Combinatorics; Lift (data mining); Discrete mathematics; Brooks' theorem; Independence number; Windmill graph; Independence (probability theory); Graph; Chordal graph; Statistics; Computer science; Graph power; 1-planar graph; Line graph","score_opus":0.011398609847135626,"score_gpt":0.3020878539338001,"score_spread":0.29068924408666447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564254624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98378766,0.0007242518,0.008212191,0.00023058351,0.00008877327,0.0005735536,0.0000062042363,0.000041760108,0.0063350284],"genre_scores_gemma":[0.98888874,0.00017478231,0.010716909,0.000024232633,0.00003648597,0.000012238583,0.0000014148408,0.000027550255,0.00011762033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99773544,0.00012848902,0.0010183891,0.00017469877,0.0004183085,0.0005246591],"domain_scores_gemma":[0.9953848,0.0031707226,0.000544062,0.00078989216,0.00007102519,0.000039504168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012827781,0.00024211756,0.00064314593,0.000073662544,0.00012839393,0.000016927635,0.0005974553,0.00011493315,0.00006767245],"category_scores_gemma":[0.0017778706,0.00014975903,0.0002252782,0.00033249124,0.00025272556,0.00006702864,0.00008366841,0.00030193268,0.0000028983945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000699604,0.00013811256,0.00021346853,0.00026098592,0.00007557894,0.0000012924083,0.002589178,0.000011349754,0.0006095247,0.993968,0.000064204534,0.0019983621],"study_design_scores_gemma":[0.00097529474,0.00012235485,0.00022828202,0.00022553922,0.00006353417,0.000019349098,0.00017049708,0.0011321271,0.008992306,0.9878513,0.000055504734,0.00016390282],"about_ca_topic_score_codex":0.000005234827,"about_ca_topic_score_gemma":0.00002069551,"teacher_disagreement_score":0.008382781,"about_ca_system_score_codex":0.000055430224,"about_ca_system_score_gemma":0.00007341071,"threshold_uncertainty_score":0.6106996},"labels":[],"label_agreement":null},{"id":"W1576691799","doi":"10.1016/j.endm.2011.05.067","title":"Near-perfect graphs with polyhedral","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"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; Polytope; Mathematics; Graph; Operator (biology); Class (philosophy); Discrete mathematics; Characterization (materials science); Computer science; Physics; Chemistry; Artificial intelligence","score_opus":0.020429043359511363,"score_gpt":0.2706849358530934,"score_spread":0.25025589249358204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576691799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3166748,0.00030871815,0.67822737,0.00011989441,0.00003763677,0.0003966018,0.000001301537,0.00020421995,0.004029455],"genre_scores_gemma":[0.83623594,0.000021722632,0.16353686,0.00004118216,0.0000088473835,0.00004525491,0.0000010814757,0.000030465206,0.00007864309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767685,0.000099961886,0.00030816035,0.0004470499,0.00041670428,0.001051247],"domain_scores_gemma":[0.9983869,0.00029397037,0.00010935636,0.0010532148,0.000048557267,0.00010800341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064296,0.00025571327,0.00029349822,0.00019781852,0.00012916955,0.00010628501,0.0013842455,0.000068903966,0.000056404337],"category_scores_gemma":[0.00012969694,0.00019355424,0.00007990671,0.0010582566,0.0002650743,0.00049404573,0.00026679662,0.0004923512,0.000056965273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003475569,0.00013525545,0.001880689,0.000043163625,0.00003404623,0.000036019854,0.0032595492,0.000059680227,0.0003446951,0.99112695,0.000004373109,0.003040809],"study_design_scores_gemma":[0.0005612043,0.0006666633,0.00068343466,0.00007841389,0.0000087443905,0.00008513323,0.00006586941,0.028315833,0.010146628,0.9589564,0.00004273657,0.00038890983],"about_ca_topic_score_codex":0.000029124654,"about_ca_topic_score_gemma":0.00010025614,"teacher_disagreement_score":0.5195612,"about_ca_system_score_codex":0.0001034926,"about_ca_system_score_gemma":0.00019274009,"threshold_uncertainty_score":0.78929126},"labels":[],"label_agreement":null},{"id":"W1967777504","doi":"10.1016/j.endm.2007.01.026","title":"Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Integer (computer science); Combinatorics; Rainbow; Arithmetic progression; Upper and lower bounds; Type (biology); Discrete mathematics; Mathematical analysis; Physics","score_opus":0.021779421701841578,"score_gpt":0.3269318068410557,"score_spread":0.30515238513921417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967777504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8951016,0.0011186732,0.10060664,0.00021242973,0.00015813638,0.0014230389,0.000019228693,0.00014741906,0.00121281],"genre_scores_gemma":[0.90587926,0.000104298364,0.09356055,0.000050316426,0.00009958655,0.00008426956,0.000008113719,0.000076780874,0.00013684605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754703,0.000052803374,0.00071124063,0.00038106288,0.00030251534,0.0010053704],"domain_scores_gemma":[0.99602985,0.0030274382,0.00025429056,0.00049898104,0.00006373777,0.00012571902],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019151677,0.00034336795,0.0005168892,0.00022321036,0.00029235586,0.000062315536,0.0003243527,0.0002166876,0.00002262377],"category_scores_gemma":[0.0020819297,0.00027013593,0.0001528658,0.00031642074,0.0002564376,0.000110932924,0.0001504338,0.00043077164,0.0000017578503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007074346,0.00014764823,0.0007497732,0.00049730786,0.00007942343,0.0000060839243,0.0023721652,0.0000025392374,0.00057197886,0.9887484,0.000089167785,0.006664798],"study_design_scores_gemma":[0.0009952971,0.00017123648,0.00022462054,0.00022220373,0.00008878424,0.00004670602,0.00048612626,0.0010946679,0.0064959214,0.9893657,0.00043655804,0.00037218485],"about_ca_topic_score_codex":0.0000047121302,"about_ca_topic_score_gemma":0.00016860581,"teacher_disagreement_score":0.010777621,"about_ca_system_score_codex":0.00011996311,"about_ca_system_score_gemma":0.00007372614,"threshold_uncertainty_score":0.9999751},"labels":[],"label_agreement":null},{"id":"W1970925480","doi":"10.1016/j.endm.2013.10.056","title":"Greedy Pancake Flipping","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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 Guelph; McGill University","funders":"","keywords":"Mathematics; Combinatorics; Greedy algorithm; Algorithm","score_opus":0.007820628795675699,"score_gpt":0.23605773178441763,"score_spread":0.22823710298874195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970925480","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709677,0.0011808733,0.02432843,0.00031569556,0.00006996936,0.0005859737,0.0000032929404,0.000030339554,0.0025177384],"genre_scores_gemma":[0.9895584,0.00018276293,0.008985767,0.00008766664,0.00013811034,0.00010950346,0.000043948465,0.000044636043,0.00084922794],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863356,0.000030140876,0.0002873246,0.00028647974,0.00016042903,0.0006020773],"domain_scores_gemma":[0.9993405,0.000028265722,0.00008535063,0.00044852757,0.000040969247,0.000056399345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021927281,0.00019397424,0.00018789397,0.000063025225,0.000043220734,0.000043397613,0.0002798398,0.00011135414,0.00020766309],"category_scores_gemma":[0.00013609462,0.00017980438,0.000078905236,0.00013955812,0.000051026662,0.0000073004444,0.00013462598,0.00015898742,0.00016173304],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001931632,0.00038763715,0.0061136354,0.00034981666,0.00029894477,0.0000071783134,0.0009987387,0.00041822382,0.9583641,0.0070430078,0.0010995306,0.02489987],"study_design_scores_gemma":[0.0077426964,0.0030034496,0.016761111,0.0006028488,0.00024186056,0.00023563979,0.002043393,0.047948122,0.62815106,0.24105032,0.04700255,0.0052169343],"about_ca_topic_score_codex":0.000027413498,"about_ca_topic_score_gemma":0.000071924835,"teacher_disagreement_score":0.330213,"about_ca_system_score_codex":0.000053678505,"about_ca_system_score_gemma":0.00005889542,"threshold_uncertainty_score":0.733221},"labels":[],"label_agreement":null},{"id":"W1974199390","doi":"10.1016/s1571-0653(04)00119-2","title":"The Domination Number of Cubic Graphs with Girth at least Five","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Mount Saint Vincent University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Domination analysis; Cubic graph; Graph; Discrete mathematics; Line graph; Vertex (graph theory); Voltage graph","score_opus":0.011223979419256062,"score_gpt":0.2711278830301002,"score_spread":0.25990390361084414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974199390","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55374146,0.0010837165,0.43746212,0.0010660467,0.000057080204,0.0007913574,0.0000044174712,0.00010091658,0.0056928825],"genre_scores_gemma":[0.9828316,0.00020239934,0.015774576,0.000013557582,0.000008692584,0.00004637997,0.0000011408249,0.000020153053,0.0011014846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981577,0.000111708774,0.00033015833,0.0002747096,0.00050839677,0.00061733276],"domain_scores_gemma":[0.9978254,0.0010433448,0.00019973869,0.000795802,0.00008801432,0.000047699603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060778216,0.0001716785,0.00021799009,0.00009883403,0.00018281242,0.00005834732,0.0010052037,0.000047307432,0.0000476079],"category_scores_gemma":[0.00021381878,0.000109389446,0.000069471476,0.000854718,0.00029158744,0.0002669544,0.000247618,0.00028590293,0.0000502223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024588835,0.000092521244,0.000530096,0.000050557777,0.000034292374,0.0000047174744,0.0020580448,0.00027266782,0.00046844748,0.9897904,0.00003264446,0.0066410233],"study_design_scores_gemma":[0.00075509655,0.0002344064,0.00015779553,0.000101471975,0.000010294348,0.00007455184,0.00013444641,0.13940644,0.0092189545,0.84945756,0.00018414363,0.00026484008],"about_ca_topic_score_codex":0.00000428965,"about_ca_topic_score_gemma":0.00012377028,"teacher_disagreement_score":0.42909014,"about_ca_system_score_codex":0.000158617,"about_ca_system_score_gemma":0.00003584929,"threshold_uncertainty_score":0.4460772},"labels":[],"label_agreement":null},{"id":"W1977677776","doi":"10.1016/s1571-0653(04)00379-8","title":"Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"University of Waterloo","funders":"","keywords":"Treewidth; Minor (academic); Mathematics; Partial k-tree; Maximization; Combinatorics; 1-planar graph; Discrete mathematics; Planar graph; Bounded function; Graph minor; Minification; Robertson–Seymour theorem; Graph; Pathwidth; Chordal graph; Mathematical optimization; Line graph; Graph power; Mathematical analysis","score_opus":0.025549136054115698,"score_gpt":0.30638295864821063,"score_spread":0.28083382259409495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977677776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031360254,0.00043936106,0.9643711,0.0010689965,0.000095328265,0.0012980463,0.000017376757,0.00026418318,0.0010853484],"genre_scores_gemma":[0.41824177,0.00022288131,0.5790252,0.000114262344,0.00011564558,0.0006747631,0.000029023999,0.000109005,0.0014674037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617326,0.00011342404,0.00073229667,0.0007429824,0.0007187267,0.001519306],"domain_scores_gemma":[0.99540836,0.00135414,0.00028592613,0.0026423591,0.00016045236,0.00014877369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013054911,0.00043081897,0.00051356235,0.00048908964,0.00023933176,0.00023767588,0.0038567274,0.00016438028,0.000052617113],"category_scores_gemma":[0.0023973347,0.00035834583,0.00020569224,0.0015399972,0.00021877358,0.0008552513,0.0009102571,0.00050180795,0.000028192426],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001071098,0.00022677837,0.00024349145,0.0002622521,0.00005424452,0.000011332021,0.0010362283,0.00016280414,0.00095307373,0.98187387,0.00026990953,0.014798914],"study_design_scores_gemma":[0.0016140114,0.00039419843,0.00003900476,0.0001083791,0.000015890933,0.00005830261,0.00013332498,0.09852235,0.0066670943,0.8909359,0.001052503,0.0004590595],"about_ca_topic_score_codex":0.000006953282,"about_ca_topic_score_gemma":0.00021891583,"teacher_disagreement_score":0.38688153,"about_ca_system_score_codex":0.00026248378,"about_ca_system_score_gemma":0.00024049662,"threshold_uncertainty_score":0.9998869},"labels":[],"label_agreement":null},{"id":"W1982828667","doi":"10.1016/j.endm.2009.07.047","title":"Codings of rotations on two intervals are full","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"semigroups and automata theory","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":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Binary number; Partition (number theory); Sequence (biology); Unit circle; Discrete mathematics; Arithmetic; Geometry; Word (group theory)","score_opus":0.013119776257716733,"score_gpt":0.2794030656433672,"score_spread":0.2662832893856505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982828667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38017762,0.00022951094,0.6155555,0.0016941804,0.00006487701,0.0002636362,0.0000053409835,0.00014272697,0.0018666073],"genre_scores_gemma":[0.9744403,0.000018360157,0.025212802,0.0002449451,0.00002064412,0.0000087738645,0.0000021663916,0.000009234668,0.000042788488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872893,0.000044977027,0.0003902439,0.00023163312,0.0002284608,0.00037575728],"domain_scores_gemma":[0.9987445,0.00038618976,0.00023899214,0.0005591199,0.000034113124,0.000037120026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044964073,0.00015348941,0.00027398643,0.00014150995,0.00004076988,0.00005473248,0.00074791204,0.000040449537,0.000019879115],"category_scores_gemma":[0.00021957513,0.00013203216,0.00008582798,0.00036370935,0.000038177153,0.00018738302,0.00007714575,0.00019679038,0.000023739098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006284936,0.00017673506,0.000032395063,0.00003268901,0.00001135272,0.0000038595667,0.0015710264,0.00024729996,0.0039125574,0.9849721,0.000059637874,0.008974058],"study_design_scores_gemma":[0.000480254,0.00046563047,0.00039347154,0.0003796476,0.000009078338,0.000014877266,0.00010545336,0.11858996,0.025760148,0.85350865,0.000058258356,0.00023457666],"about_ca_topic_score_codex":0.0000039833303,"about_ca_topic_score_gemma":0.000014756731,"teacher_disagreement_score":0.59426266,"about_ca_system_score_codex":0.000084763255,"about_ca_system_score_gemma":0.00004361148,"threshold_uncertainty_score":0.53841156},"labels":[],"label_agreement":null},{"id":"W1985423710","doi":"10.1016/s1571-0653(05)80121-0","title":"On homomorphisms to edge-coloured cycles","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Simon Fraser University; Capilano University","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Graph; Time complexity; Graph homomorphism; Monochromatic color; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph power; Line graph; Computer science; Artificial intelligence","score_opus":0.01376915242437346,"score_gpt":0.29312911589385715,"score_spread":0.27935996346948366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985423710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4569794,0.00021401045,0.5301382,0.0018732641,0.000076308075,0.00086139404,0.0000054426855,0.0002878115,0.009564175],"genre_scores_gemma":[0.94482815,0.000035815403,0.053657707,0.0003354138,0.000031446165,0.000098198536,0.000001922272,0.00003613556,0.0009752367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975301,0.00010638875,0.0003592542,0.00049534795,0.0004886352,0.0010202972],"domain_scores_gemma":[0.9978992,0.00076855725,0.000057413814,0.0010927123,0.00003322602,0.00014889977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552392,0.00024689938,0.00030356384,0.0002663517,0.00011606486,0.00011899996,0.0015573777,0.00007852217,0.00024086272],"category_scores_gemma":[0.0003410904,0.00021878032,0.00008673295,0.0009977061,0.00008372924,0.00022489401,0.00018325956,0.00044630145,0.0007334883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003254673,0.00016349755,0.000014414956,0.000019943775,0.000014332663,0.000020080637,0.0009819635,0.0027586287,0.00055158325,0.96053904,0.00006975918,0.034834176],"study_design_scores_gemma":[0.00037752892,0.00043422048,0.000093983945,0.000083411,0.000003141693,0.000017354558,0.00001681957,0.020775424,0.006456917,0.9709636,0.00047089384,0.00030671773],"about_ca_topic_score_codex":0.0000036035515,"about_ca_topic_score_gemma":0.000027216864,"teacher_disagreement_score":0.48784873,"about_ca_system_score_codex":0.00022585032,"about_ca_system_score_gemma":0.00010263228,"threshold_uncertainty_score":0.9427753},"labels":[],"label_agreement":null},{"id":"W1991595634","doi":"10.1016/j.endm.2006.06.012","title":"The structure and unlabelled enumeration of toroidal graphs with no K3,3's","year":2006,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Toroid; Combinatorics; Planar; Planar graph; Chordal graph; Discrete mathematics; Graph; Computer science; Physics","score_opus":0.004346590744890076,"score_gpt":0.23853025931039273,"score_spread":0.23418366856550266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991595634","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68969095,0.0012889589,0.30745885,0.00045400384,0.000041141066,0.00054204516,0.000005787092,0.000053835145,0.00046443424],"genre_scores_gemma":[0.9687346,0.000061801904,0.03103894,0.000007778643,0.000015743733,0.00000963283,0.0000028607255,0.000013092367,0.000115527815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986924,0.0000749985,0.00027063143,0.0002208035,0.00032123644,0.00041994487],"domain_scores_gemma":[0.9986961,0.00057369395,0.00013610454,0.00048604398,0.000081554215,0.000026519525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003867027,0.00014322184,0.00017807484,0.0000787229,0.0001400762,0.00008632015,0.00050611637,0.000045695953,0.000004829815],"category_scores_gemma":[0.00010747027,0.0000877485,0.00002776078,0.000431171,0.00020065457,0.00021324729,0.00012077705,0.00023497165,0.0000017079693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029792065,0.000030753505,0.0005317171,0.00004878257,0.000018245957,0.0000019380961,0.00034037148,0.00040772304,0.0083739385,0.9879464,0.000011605154,0.002258717],"study_design_scores_gemma":[0.00050609204,0.0002567176,0.0002680754,0.00003933836,0.0000061614614,0.000017673497,0.000027290327,0.02941188,0.026464282,0.9427167,0.0001299185,0.00015586229],"about_ca_topic_score_codex":0.000015961894,"about_ca_topic_score_gemma":0.0002686016,"teacher_disagreement_score":0.27904367,"about_ca_system_score_codex":0.000046495825,"about_ca_system_score_gemma":0.000080908794,"threshold_uncertainty_score":0.357828},"labels":[],"label_agreement":null},{"id":"W1996274033","doi":"10.1016/j.endm.2006.06.091","title":"Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms","year":2006,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Mathematics; Automatic differentiation; Matrix (chemical analysis); Algorithm; Sparse matrix; Combinatorics; Computation; Applied mathematics","score_opus":0.043405915023358665,"score_gpt":0.3179354508031987,"score_spread":0.27452953577984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996274033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037288677,0.00059653266,0.9590769,0.00015473498,0.000037948746,0.0007015176,0.000021748067,0.000099673365,0.0020223022],"genre_scores_gemma":[0.2621633,0.00016205314,0.736911,0.000005329373,0.000079318044,0.00008288827,0.000028564638,0.00006812979,0.00049937307],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977801,0.00009158057,0.00072328415,0.00034835443,0.0005217366,0.0005349687],"domain_scores_gemma":[0.99796444,0.0011866947,0.00034411967,0.00034667537,0.00010427995,0.000053798947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007776503,0.00025123823,0.00043546627,0.00037349045,0.00008261632,0.000043029777,0.00022325847,0.00013682956,0.000064343665],"category_scores_gemma":[0.0007076148,0.00023671197,0.000074771146,0.00062598556,0.00018091896,0.00023497692,0.00010557605,0.000299869,0.0000046339874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012568125,0.0028006707,0.0026818695,0.0039259074,0.00016656485,0.000034476874,0.0032897333,0.008607698,0.0029906626,0.87387186,0.00017599613,0.10132889],"study_design_scores_gemma":[0.00074096996,0.00010403942,0.0001561893,0.00013378715,0.00003505218,0.000044738797,0.00019779615,0.37782013,0.0072555686,0.6130971,0.00010575003,0.00030891047],"about_ca_topic_score_codex":0.00003673532,"about_ca_topic_score_gemma":0.00017815948,"teacher_disagreement_score":0.36921242,"about_ca_system_score_codex":0.00022658784,"about_ca_system_score_gemma":0.000107910484,"threshold_uncertainty_score":0.9652834},"labels":[],"label_agreement":null},{"id":"W1999588824","doi":"10.1016/j.endm.2011.09.046","title":"Asymptotically settling Zarankiewiczʼs Conjecture in finite time, for each m","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Conjecture; Mathematics; Combinatorics; Counterexample; Bipartite graph; Integer (computer science); Discrete mathematics; Graph","score_opus":0.01887409142288788,"score_gpt":0.25315188209365974,"score_spread":0.23427779067077187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999588824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034953173,0.00022889684,0.9630798,0.00036209697,0.000079505015,0.00042384458,0.000003847918,0.000063506195,0.00080532616],"genre_scores_gemma":[0.7523588,0.000010958187,0.24719971,0.00016519024,0.00004808191,0.000055838602,0.000019743464,0.000016130503,0.00012557773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985225,0.000047723628,0.00041637282,0.00032517515,0.00019632668,0.00049186894],"domain_scores_gemma":[0.99867827,0.0008002631,0.000104876795,0.00032080003,0.000051126517,0.000044643522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070379203,0.00017344991,0.00024460265,0.00021568459,0.000055314445,0.00006129525,0.0004922371,0.00009589661,0.00003111037],"category_scores_gemma":[0.00041983236,0.0001627037,0.00007168094,0.0005482803,0.000027616552,0.00022797778,0.00009432915,0.00023166738,0.000035691675],"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.000043159438,0.0004264345,0.0003119798,0.00021469599,0.00005413474,0.000013231212,0.009714058,0.027237602,0.0014092579,0.94619465,0.000071023926,0.014309746],"study_design_scores_gemma":[0.00052797544,0.00015562837,0.00020809741,0.00005806851,0.0000071194845,0.000009517691,0.0000085184565,0.69988835,0.0024565142,0.2962148,0.0002642494,0.0002011779],"about_ca_topic_score_codex":0.0000044573676,"about_ca_topic_score_gemma":0.000029369929,"teacher_disagreement_score":0.7174056,"about_ca_system_score_codex":0.000103044906,"about_ca_system_score_gemma":0.00017785106,"threshold_uncertainty_score":0.6634864},"labels":[],"label_agreement":null},{"id":"W2002795111","doi":"10.1016/s1571-0653(04)00257-4","title":"Perfectly Orderable P4 Composition","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"University of Alberta","funders":"","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Path (computing); Graph; Composition (language); Split graph; Discrete mathematics; Chordal graph; 1-planar graph; Computer science","score_opus":0.006189615629021227,"score_gpt":0.21348491819102486,"score_spread":0.20729530256200362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002795111","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92554665,0.001079724,0.061470896,0.000049591705,0.00013288378,0.00023920657,0.00000237416,0.0002890908,0.011189566],"genre_scores_gemma":[0.9988831,0.00016182639,0.00070250704,0.000016111222,0.00005501063,0.000035989953,0.000010469804,0.0000417975,0.0000931757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989247,0.000035883946,0.0002838445,0.00013269001,0.00013049965,0.0004923878],"domain_scores_gemma":[0.99951845,0.00012965093,0.000032093936,0.00026662825,0.000013331194,0.000039848688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029023318,0.00017564329,0.00022897952,0.00009809502,0.000057654102,0.00003937878,0.00016407255,0.00007974406,0.00013272733],"category_scores_gemma":[0.000020837573,0.0001689078,0.00006340651,0.00029565734,0.000027364793,0.00011005997,0.000016029719,0.00025852057,0.00009218889],"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.00010141975,0.0006198447,0.004273926,0.002317753,0.00043375968,0.000117335396,0.011909509,0.13936916,0.12021318,0.70939475,0.0004895937,0.010759775],"study_design_scores_gemma":[0.001793399,0.00031445577,0.0004348064,0.0007125214,0.000081201826,0.00039387887,0.00066937646,0.50795364,0.045513514,0.43682835,0.0038988132,0.0014060263],"about_ca_topic_score_codex":0.000008876025,"about_ca_topic_score_gemma":0.000052222673,"teacher_disagreement_score":0.3685845,"about_ca_system_score_codex":0.00012521702,"about_ca_system_score_gemma":0.000014121572,"threshold_uncertainty_score":0.68878603},"labels":[],"label_agreement":null},{"id":"W2008282466","doi":"10.1016/j.endm.2009.07.107","title":"On the Plane-Width of Graphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Graph; Plane (geometry); Wheel graph; Geometric graph theory; Planar graph; Discrete mathematics; Graph power; Geometry; Line graph","score_opus":0.011238106260361282,"score_gpt":0.24772357197820116,"score_spread":0.23648546571783988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008282466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24095465,0.00016544384,0.7532551,0.002592844,0.00006192805,0.00022810757,0.0000014921227,0.000042991134,0.002697437],"genre_scores_gemma":[0.9863641,0.000015765218,0.0133197475,0.0002364511,0.00001438351,0.000005002006,0.0000031469215,0.0000033042995,0.0000380874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991102,0.00004050343,0.00023426715,0.00014616009,0.00024651858,0.00022232202],"domain_scores_gemma":[0.9988855,0.00062388973,0.00009972216,0.00034594664,0.00002566044,0.000019255665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039953628,0.000095239004,0.0001234639,0.00010738134,0.000048206704,0.000033387,0.00046970297,0.000030154599,0.000013850119],"category_scores_gemma":[0.00018195363,0.00006472163,0.000048974358,0.00048489694,0.000021691101,0.00008503316,0.000032679476,0.00014150028,0.0000099167855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028539257,0.00006392516,0.0000088447805,0.0000062569347,0.000005117423,5.7029285e-7,0.00032711765,0.0027157285,0.0005529694,0.99121106,0.00005916675,0.005046402],"study_design_scores_gemma":[0.00012116,0.0002162672,0.0003656095,0.000029972905,0.000002674208,0.0000050425124,0.0000067021842,0.07427834,0.009724703,0.9151214,0.000048490565,0.000079681275],"about_ca_topic_score_codex":0.0000015806319,"about_ca_topic_score_gemma":0.0000070536153,"teacher_disagreement_score":0.7454095,"about_ca_system_score_codex":0.00003245012,"about_ca_system_score_gemma":0.000059906048,"threshold_uncertainty_score":0.26392716},"labels":[],"label_agreement":null},{"id":"W2010081197","doi":"10.1016/j.endm.2008.06.007","title":"Morphing Planar Graph Drawings with Bent Edges","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","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 Waterloo","funders":"","keywords":"Planarity testing; Bent molecular geometry; Morphing; Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Planar; Graph; Enhanced Data Rates for GSM Evolution; Time complexity; Discrete mathematics; Computer science; Computer graphics (images); Artificial intelligence","score_opus":0.014839004252097807,"score_gpt":0.23082402342235814,"score_spread":0.21598501917026033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010081197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25245747,0.00024417907,0.7463034,0.0004541466,0.000043632375,0.00013648068,7.1828174e-7,0.00007367382,0.00028634263],"genre_scores_gemma":[0.8958277,0.000051810304,0.10384388,0.00009960876,0.000052498963,0.000019070261,0.0000080815325,0.000011712769,0.00008563906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986769,0.00002937735,0.00025738194,0.00028489402,0.0003479991,0.00040343314],"domain_scores_gemma":[0.99925035,0.00022120493,0.000103642946,0.00032795593,0.000044554414,0.00005226705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498226,0.00016229415,0.00018478437,0.00019710636,0.00016377511,0.000064845444,0.00043184755,0.000042045725,0.000007902167],"category_scores_gemma":[0.00006070024,0.00013441195,0.000046724588,0.00063848105,0.00005014962,0.0003310558,0.00006476947,0.00019833076,0.000014648876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027800299,0.00041987977,0.0022050648,0.00015045678,0.00011400294,0.00012857158,0.010576337,0.04585697,0.0036360864,0.9264212,0.00035731352,0.010106301],"study_design_scores_gemma":[0.0018152003,0.0008926919,0.0043422277,0.00030649747,0.000035052224,0.0009339722,0.00012880113,0.37784517,0.042840254,0.5683696,0.0012327906,0.0012577418],"about_ca_topic_score_codex":0.000012040237,"about_ca_topic_score_gemma":0.00003526258,"teacher_disagreement_score":0.6433703,"about_ca_system_score_codex":0.00008766134,"about_ca_system_score_gemma":0.00015786069,"threshold_uncertainty_score":0.548116},"labels":[],"label_agreement":null},{"id":"W2019080419","doi":"10.1016/s1571-0653(04)00217-3","title":"Exact Enumeration of Rooted 3-connected Triangular Maps on the Projective Plane (Extended Abstract)","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","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":"Nortel (Canada); Carleton University","funders":"","keywords":"Mathematics; Projective plane; Simple (philosophy); Real projective plane; Enumeration; Blocking set; Plane (geometry); Combinatorics; Parametric statistics; Connected component; Projective test; Projective space; Pure mathematics; Geometry; Complex projective space","score_opus":0.02730068142452436,"score_gpt":0.30620264798666336,"score_spread":0.278901966562139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019080419","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9546461,0.00018551752,0.035576683,0.00089564704,0.0002550976,0.0033279893,0.00004056249,0.00027966872,0.0047927233],"genre_scores_gemma":[0.9901553,0.000060454997,0.009031837,0.00003646229,0.00011828917,0.00019725328,0.000030720923,0.00011987881,0.00024983066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99636936,0.00021322176,0.0013101669,0.00045882654,0.0007861514,0.0008622513],"domain_scores_gemma":[0.9920227,0.0055987644,0.0009384125,0.0011873667,0.00017963043,0.00007314205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014504598,0.00053143903,0.0008821267,0.00026273378,0.00014714387,0.000056342862,0.0006541464,0.00025468128,0.00019640215],"category_scores_gemma":[0.0069621652,0.00038706223,0.00020645576,0.0008546629,0.00014572826,0.00019541134,0.00009903892,0.00083583273,0.000036275615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002572033,0.0010937816,0.000028794064,0.000364557,0.00018605652,0.000024749193,0.0031651512,0.00014061067,0.005061738,0.98859954,0.00016156035,0.00091626553],"study_design_scores_gemma":[0.001509717,0.00046748333,0.00007787156,0.00045211092,0.00009279656,0.000037782385,0.0005880558,0.0028282295,0.03426576,0.95909655,0.00015751188,0.00042615147],"about_ca_topic_score_codex":0.000024881972,"about_ca_topic_score_gemma":0.0001130456,"teacher_disagreement_score":0.03550916,"about_ca_system_score_codex":0.00044491535,"about_ca_system_score_gemma":0.0002078913,"threshold_uncertainty_score":0.99985814},"labels":[],"label_agreement":null},{"id":"W2039616602","doi":"10.1016/j.endm.2010.05.094","title":"An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","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 Guelph; University of Waterloo","funders":"","keywords":"Cutting-plane method; Iterated function; Mathematics; Interior point method; Quadratic equation; Binary number; Point (geometry); Relaxation (psychology); Quadratically constrained quadratic program; Mathematical optimization; Quadratic programming; Plane (geometry); Algorithm; Applied mathematics; Mathematical analysis; Integer programming; Geometry; Arithmetic","score_opus":0.020229416231673236,"score_gpt":0.3790834266210562,"score_spread":0.35885401038938297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039616602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0090356385,0.000035502453,0.9882089,0.00035336625,0.00014290359,0.001777654,0.000028265242,0.00023387598,0.00018393114],"genre_scores_gemma":[0.04802754,0.000028744835,0.9508631,0.000053974716,0.00013173214,0.00040555254,0.00011232582,0.00016950657,0.00020749234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687374,0.0001637205,0.0009768999,0.0005859053,0.0003760119,0.0010237412],"domain_scores_gemma":[0.9958582,0.002293962,0.000419773,0.0010115249,0.0002484245,0.00016810205],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020297675,0.00041817987,0.00061884517,0.00033889632,0.00018111298,0.00014629762,0.00066497765,0.00026320913,0.00034188133],"category_scores_gemma":[0.0043229195,0.00038741156,0.00013458208,0.0004992926,0.000110018475,0.00047323536,0.000128171,0.00088563416,0.00000926472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071807654,0.0032217621,0.00013394184,0.004195048,0.0004720461,0.000033158096,0.013233269,0.2401834,0.25455835,0.45118937,0.0003780951,0.031683464],"study_design_scores_gemma":[0.00089313474,0.00041615154,0.0000013701551,0.00006694519,0.000036554076,0.000028371267,0.00026764287,0.805956,0.009378995,0.1825414,0.000048305374,0.00036510307],"about_ca_topic_score_codex":0.0000115472485,"about_ca_topic_score_gemma":0.00020494565,"teacher_disagreement_score":0.56577265,"about_ca_system_score_codex":0.00023266098,"about_ca_system_score_gemma":0.0002438766,"threshold_uncertainty_score":0.9998578},"labels":[],"label_agreement":null},{"id":"W2040214474","doi":"10.1016/s1571-0653(05)80155-6","title":"Finding the chromatic number by means of critical graphs","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Critical graph; Random graph; Graph coloring; Graph; Discrete mathematics; Induced subgraph; Benchmark (surveying); Graph power; Line graph; Vertex (graph theory)","score_opus":0.04836182007686702,"score_gpt":0.384074163802534,"score_spread":0.335712343725667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040214474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94822955,0.0007121553,0.03633823,0.0030271262,0.000106501415,0.00028244848,0.000027560058,0.000061019913,0.011215427],"genre_scores_gemma":[0.99213034,0.000035323144,0.0069181644,0.00005674646,0.000022685697,0.000019079218,0.000002933209,0.000018719784,0.00079601194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99698144,0.00020278776,0.0008942774,0.00030081597,0.0009751466,0.0006455052],"domain_scores_gemma":[0.99218553,0.006743626,0.00015119546,0.0007772512,0.00007869318,0.00006370394],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032774133,0.00017489179,0.00038999593,0.00011055303,0.00019776844,0.000121399185,0.00089325354,0.000088203466,0.0030492665],"category_scores_gemma":[0.0067441408,0.00010826535,0.00018044632,0.0011958651,0.0003863859,0.00015051792,0.000053890784,0.00036441622,0.00041589703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051680217,0.0016005256,0.0069656014,0.00021304446,0.00022013161,0.0000073505275,0.015692431,0.004700354,0.0023660124,0.94006234,0.0053105704,0.022809982],"study_design_scores_gemma":[0.0002645508,0.000055133496,0.00029516514,0.0000918405,0.00005329661,0.000026609963,0.00048736497,0.050328128,0.0018398189,0.945773,0.00058628933,0.00019877752],"about_ca_topic_score_codex":0.0000323194,"about_ca_topic_score_gemma":0.000056543628,"teacher_disagreement_score":0.045627777,"about_ca_system_score_codex":0.00005791998,"about_ca_system_score_gemma":0.000104957966,"threshold_uncertainty_score":0.9978621},"labels":[],"label_agreement":null},{"id":"W2041242280","doi":"10.1016/j.endm.2010.05.151","title":"Scheduling flexible flowshops with unit-time operations and minimum time delays","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","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":"Université du Québec à Chicoutimi","funders":"","keywords":"Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Heuristic; Unit (ring theory); Simple (philosophy); Execution time; Real-time computing; Mathematics; Parallel computing; Schedule","score_opus":0.006051890991454484,"score_gpt":0.22193491661081496,"score_spread":0.21588302561936049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041242280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79500204,0.00022331403,0.2026486,0.0001316684,0.00006449506,0.0002551805,0.0000091774555,0.00037984233,0.0012857065],"genre_scores_gemma":[0.5500898,0.000033104378,0.44931158,0.00002333741,0.00007084284,0.000030781448,0.000033452594,0.0000751065,0.00033202718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989332,0.000014066972,0.0002779133,0.00019067053,0.00015214257,0.00043203862],"domain_scores_gemma":[0.9993873,0.00016344528,0.000025747373,0.00029431758,0.00004538773,0.000083774765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002497948,0.00021979702,0.0002395285,0.0001346731,0.00009806066,0.00010780277,0.00015971878,0.00012101256,0.0001903717],"category_scores_gemma":[0.00012444705,0.00019461005,0.000027258277,0.0003306857,0.000065603694,0.00016047951,0.00003209804,0.00049996655,0.00009095403],"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.0000100173775,0.000068513735,0.00010969131,0.00010515663,0.00008746948,0.000005009403,0.0013306832,0.9672455,0.023049535,0.0064135524,0.000010997161,0.0015638724],"study_design_scores_gemma":[0.00036286123,0.00005968947,0.000011253695,0.000060077018,0.000027091834,0.00003469245,0.000060007013,0.99095625,0.006766124,0.0013548869,0.00003382403,0.0002732484],"about_ca_topic_score_codex":0.0000043643836,"about_ca_topic_score_gemma":0.000064748485,"teacher_disagreement_score":0.246663,"about_ca_system_score_codex":0.000036352405,"about_ca_system_score_gemma":0.00007147734,"threshold_uncertainty_score":0.79359674},"labels":[],"label_agreement":null},{"id":"W2055646787","doi":"10.1016/j.endm.2009.02.012","title":"Adjusted Interval Digraphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"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":"Mathematics; Interval (graph theory); Combinatorics; Discrete mathematics","score_opus":0.018577106685052972,"score_gpt":0.3012789117041017,"score_spread":0.28270180501904874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055646787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06202518,0.00058390637,0.93290883,0.0012259706,0.0000580367,0.000345457,0.0000013448035,0.00024931855,0.002601955],"genre_scores_gemma":[0.94670755,0.000044789787,0.05289229,0.00015313191,0.000023871142,0.000017133278,0.0000023412588,0.000015476739,0.00014343883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977346,0.00009477762,0.00041025184,0.0004063754,0.00040599532,0.00094800506],"domain_scores_gemma":[0.9984169,0.00038697,0.00010679476,0.00094732887,0.000048008085,0.00009401124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704743,0.00022518272,0.00029803842,0.00030137203,0.00007325279,0.00011588229,0.0015497991,0.00007672629,0.000023702562],"category_scores_gemma":[0.00035122945,0.00019711774,0.00011923584,0.0010932747,0.00008206213,0.00045669483,0.00020601258,0.0005124811,0.000049968374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011043485,0.00013791824,0.0000908421,0.000023890132,0.000010865938,0.00001698886,0.0009087167,0.00013253263,0.0012599163,0.97247636,0.000023478542,0.024907466],"study_design_scores_gemma":[0.00038488003,0.00033331456,0.0004163238,0.000062361665,0.0000041057187,0.00002825646,0.000039896055,0.048048843,0.005365784,0.9448841,0.000169316,0.00026282817],"about_ca_topic_score_codex":0.0000032027478,"about_ca_topic_score_gemma":0.00002809882,"teacher_disagreement_score":0.88468236,"about_ca_system_score_codex":0.0001457493,"about_ca_system_score_gemma":0.00008962976,"threshold_uncertainty_score":0.8038228},"labels":[],"label_agreement":null},{"id":"W2056059863","doi":"10.1016/j.endm.2012.10.032","title":"MPI Parallelization of Variable Neighborhood Search","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Benchmark (surveying); Generality; Parallel computing; Asynchronous communication; Variable neighborhood search; Scheduling (production processes); Variable (mathematics); Automatic parallelization; Multiprocessing; Heuristic; Metaheuristic; Algorithm; Mathematical optimization; Programming language; Mathematics; Artificial intelligence","score_opus":0.016105917460154974,"score_gpt":0.2769799389609048,"score_spread":0.2608740215007498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056059863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05807973,0.0006539834,0.9370629,0.000018854967,0.000072334464,0.00018834235,0.000003010793,0.00012829668,0.003792548],"genre_scores_gemma":[0.8018292,0.00008499323,0.19793572,0.0000066237394,0.000044553297,0.0000117991585,0.000009972886,0.000043901746,0.000033228636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986812,0.0000660721,0.00039025157,0.000093975745,0.0001997391,0.0005687544],"domain_scores_gemma":[0.9992812,0.00029431036,0.00005422263,0.0002810406,0.000036358444,0.000052847838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019467,0.0001410603,0.00023765142,0.00011425128,0.000024173523,0.000013484406,0.0001666623,0.000094762065,0.00012737745],"category_scores_gemma":[0.00026403763,0.00014236332,0.00003613869,0.00049458764,0.000026044012,0.00017230636,0.000038653176,0.00022127251,0.000013026511],"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.000004840912,0.00012282097,0.0068976968,0.00052398496,0.00005806293,2.538875e-7,0.0023829541,0.7920881,0.005257353,0.19060321,0.0000231087,0.0020376213],"study_design_scores_gemma":[0.0003106295,0.00003046305,0.00039499873,0.000083695566,0.0000219526,0.0000051176003,0.00008181886,0.9692826,0.01706877,0.012444237,0.00006452931,0.00021119016],"about_ca_topic_score_codex":0.0000053532463,"about_ca_topic_score_gemma":0.0000019483919,"teacher_disagreement_score":0.7437495,"about_ca_system_score_codex":0.00013836724,"about_ca_system_score_gemma":0.000040836054,"threshold_uncertainty_score":0.5805408},"labels":[],"label_agreement":null},{"id":"W2059267359","doi":"10.1016/j.endm.2009.07.067","title":"Maximum values of Szeged index and edge-Szeged index of graphs","year":2009,"lang":"hu","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Graph theory and applications","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":"Concordia University","funders":"China Scholarship Council","keywords":"Mathematics; Combinatorics; Bipartite graph; Conjecture; Wiener index; Index (typography); Generalization; Discrete mathematics; Graph; Mathematical analysis","score_opus":0.013622411942113097,"score_gpt":0.2814336909769344,"score_spread":0.26781127903482127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059267359","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96828187,0.0026885401,0.024673715,0.00044602755,0.00006516881,0.0014679851,0.0000780883,0.00007966772,0.002218957],"genre_scores_gemma":[0.99238527,0.00070381205,0.006541885,0.00003684461,0.000041030493,0.00004244551,0.000016842961,0.0000799044,0.0001519474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99554574,0.0002551683,0.0019429771,0.0005861706,0.0006324957,0.0010374434],"domain_scores_gemma":[0.9953274,0.0017191628,0.001260103,0.001349199,0.00018798346,0.000156122],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017001575,0.00066393014,0.0014736474,0.0005775193,0.00015609567,0.000050831404,0.00078147365,0.0004610046,0.00012410819],"category_scores_gemma":[0.0009096933,0.00063582696,0.00036164725,0.0012299657,0.0007010029,0.0001948201,0.00017524496,0.0009044903,0.000008398875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001388094,0.0014622834,0.0018433606,0.0016950145,0.0002501378,0.000002614865,0.0061106673,0.00007207365,0.006080598,0.9790674,0.000045557084,0.0032315236],"study_design_scores_gemma":[0.0015217332,0.00055952073,0.0018042695,0.0009545948,0.0003050914,0.0000217628,0.0010121472,0.0054601445,0.019266475,0.9685145,0.00002633564,0.0005534439],"about_ca_topic_score_codex":0.000021478467,"about_ca_topic_score_gemma":0.00007432753,"teacher_disagreement_score":0.024103438,"about_ca_system_score_codex":0.00010731522,"about_ca_system_score_gemma":0.00022587198,"threshold_uncertainty_score":0.9996093},"labels":[],"label_agreement":null},{"id":"W2060994881","doi":"10.1016/j.endm.2005.06.047","title":"Ordered 3-colorings","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.006024316810368814,"score_gpt":0.21238112792413372,"score_spread":0.20635681111376492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060994881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9616333,0.0011831624,0.019935332,0.0001999039,0.00012446102,0.0003363479,0.0000034279387,0.0004823021,0.016101737],"genre_scores_gemma":[0.9975176,0.000062903746,0.002039907,0.000019548177,0.000073416384,0.000048746,0.0000031607644,0.000046198344,0.00018854818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988626,0.000018728198,0.00032243397,0.000132723,0.000130697,0.0005327832],"domain_scores_gemma":[0.9995031,0.00012403549,0.000033500954,0.00028602514,0.000009996735,0.00004335326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028623716,0.0001794144,0.0002296486,0.000097610966,0.000033400676,0.000028329154,0.00021841213,0.00008213793,0.00009573514],"category_scores_gemma":[0.000049372014,0.00017052986,0.00006398601,0.0002467189,0.000029177723,0.00011994189,0.000022552387,0.0002602697,0.00014735073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017753562,0.00015628804,0.00042010122,0.0006443049,0.0001521455,0.00000969534,0.004523062,0.044980127,0.0101926755,0.92767775,0.0002725628,0.010953511],"study_design_scores_gemma":[0.0019388329,0.0002051673,0.0002857821,0.0004592263,0.00007009583,0.000101313715,0.0005300741,0.35682625,0.07312761,0.5307183,0.0341197,0.0016176408],"about_ca_topic_score_codex":0.000004102536,"about_ca_topic_score_gemma":0.00011156969,"teacher_disagreement_score":0.39695945,"about_ca_system_score_codex":0.00014831938,"about_ca_system_score_gemma":0.000017524922,"threshold_uncertainty_score":0.6954006},"labels":[],"label_agreement":null},{"id":"W2065185671","doi":"10.1016/j.endm.2013.05.133","title":"On the approximability of two capacitated vehicle routing problems","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orienteering; Regret; Vehicle routing problem; Mathematics; Euclidean geometry; Mathematical optimization; Chen; Combinatorics; Euclidean distance; Approximation algorithm; Discrete mathematics; Computer science; Routing (electronic design automation)","score_opus":0.02151688624129685,"score_gpt":0.2811482681370374,"score_spread":0.2596313818957406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065185671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62430775,0.000054185108,0.37306535,0.00075119786,0.00001785128,0.00081659545,0.0000010639208,0.000063115294,0.0009228604],"genre_scores_gemma":[0.9829362,0.000004537199,0.016819173,0.000042951997,0.0000075489174,0.00013423158,7.566504e-7,0.000016979306,0.00003760857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978693,0.0002322315,0.0004553606,0.00032253042,0.00042244318,0.00069813326],"domain_scores_gemma":[0.99637234,0.0022283953,0.00018468733,0.0010680641,0.000099448574,0.000047058384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001641637,0.00017472015,0.0002497526,0.00009665695,0.00009689821,0.000078986384,0.001276785,0.00004361198,0.000044370707],"category_scores_gemma":[0.0011314492,0.000113248905,0.000076345896,0.0007928454,0.00022963205,0.0002855293,0.00025999954,0.00050405454,0.000045103578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002860262,0.00012120948,0.000178963,0.000056749785,0.000014083485,4.0458812e-7,0.0017810946,0.0013133251,0.007403216,0.98746294,0.0000055317605,0.0016596018],"study_design_scores_gemma":[0.00020101918,0.000101959,0.00006945982,0.000057910947,0.0000015609528,0.0000017797997,0.00006307955,0.26924035,0.015035919,0.7151288,0.0000016855879,0.00009650505],"about_ca_topic_score_codex":0.00005188217,"about_ca_topic_score_gemma":0.00002739192,"teacher_disagreement_score":0.35862845,"about_ca_system_score_codex":0.00013522399,"about_ca_system_score_gemma":0.00008190373,"threshold_uncertainty_score":0.46181566},"labels":[],"label_agreement":null},{"id":"W2066530434","doi":"10.1016/j.endm.2007.07.020","title":"Graph coloring with no large monochromatic components","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Graph; Graph coloring; Discrete mathematics; Physics; Optics","score_opus":0.015671258234954296,"score_gpt":0.28858253892977803,"score_spread":0.27291128069482373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066530434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2728338,0.00014294994,0.7250887,0.00006178659,0.000042216267,0.0003708632,0.0000012645688,0.00013212248,0.0013262749],"genre_scores_gemma":[0.8702151,0.00002177745,0.12953971,0.000042108484,0.000023901484,0.00003150833,0.0000034178543,0.00003315575,0.00008928896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969613,0.000070824535,0.00047550656,0.00043110063,0.0006048104,0.0014564826],"domain_scores_gemma":[0.99786633,0.0008512316,0.00016694625,0.0009026737,0.000082315,0.00013047348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018208943,0.00027001672,0.00035218106,0.000348019,0.00015228971,0.000099335,0.0012493404,0.000073242365,0.000019574427],"category_scores_gemma":[0.00022033893,0.00022065475,0.000071789334,0.0011272607,0.00011472182,0.00044072143,0.00033772454,0.0005102195,0.00009123299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076300224,0.0004319353,0.002006781,0.00025420025,0.00008200894,0.000107768006,0.0019166683,0.000372293,0.0056077526,0.9875229,0.000009649349,0.001611724],"study_design_scores_gemma":[0.0024337606,0.0008765745,0.0021672698,0.00049367803,0.000019345009,0.000118186275,0.00020302489,0.12889577,0.018851375,0.8446696,0.00033825604,0.0009331648],"about_ca_topic_score_codex":0.0000070014557,"about_ca_topic_score_gemma":0.00011223972,"teacher_disagreement_score":0.59738135,"about_ca_system_score_codex":0.00023920697,"about_ca_system_score_gemma":0.00008558115,"threshold_uncertainty_score":0.89980394},"labels":[],"label_agreement":null},{"id":"W2068463402","doi":"10.1016/j.endm.2009.07.020","title":"On the Gapped Consecutive-Ones Property","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","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":"Simon Fraser University","funders":"","keywords":"Parameterized complexity; Conjecture; Combinatorics; Mathematics; Logical matrix; Graph; Function (biology); Binary number; Discrete mathematics; Physics","score_opus":0.01140264538665462,"score_gpt":0.24975593032888882,"score_spread":0.2383532849422342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068463402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97911745,0.0007781969,0.008137813,0.0038705936,0.00004877774,0.0008882445,0.0000072205576,0.00003133414,0.007120349],"genre_scores_gemma":[0.99742484,0.00014267232,0.0009590374,0.00045058562,0.00006207602,0.000034500543,0.000020422212,0.00002089671,0.00088495814],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99884015,0.00006154357,0.00022004593,0.0002539689,0.00017065088,0.0004536421],"domain_scores_gemma":[0.99931955,0.000074666146,0.00007725046,0.0004670476,0.000028740267,0.000032724398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035408104,0.00018930556,0.00015973627,0.000038349597,0.00006867506,0.000030143237,0.0003031338,0.0000852638,0.000051057003],"category_scores_gemma":[0.0003022982,0.00010488027,0.000074722346,0.00012429104,0.00007331786,0.0000026092239,0.000050523337,0.00018508057,0.0000392319],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033555823,0.0013336434,0.00058175944,0.00014469356,0.00035805284,0.000022437978,0.0021165875,0.0005286176,0.77586925,0.1981078,0.004712037,0.015889574],"study_design_scores_gemma":[0.0033213224,0.0051510097,0.0016915991,0.00032879668,0.00011396711,0.00009636401,0.00080064975,0.008174038,0.57009816,0.38781458,0.020593964,0.0018155779],"about_ca_topic_score_codex":0.0000036589151,"about_ca_topic_score_gemma":0.000021024802,"teacher_disagreement_score":0.2057711,"about_ca_system_score_codex":0.000042129293,"about_ca_system_score_gemma":0.000076846474,"threshold_uncertainty_score":0.42768934},"labels":[],"label_agreement":null},{"id":"W2068974319","doi":"10.1016/j.endm.2012.10.030","title":"Generating good starting solutions for the p-median problem in the plane","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Heuristics; Mathematics; Plane (geometry); Mathematical optimization; Variable (mathematics); Variable neighborhood search; Quality (philosophy); Local optimum; Algorithm; Metaheuristic; Geometry; Mathematical analysis","score_opus":0.036546365566911175,"score_gpt":0.2615720966039575,"score_spread":0.22502573103704634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068974319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4967731,0.0038857798,0.39039627,0.082228705,0.0012775781,0.009690798,0.000024481014,0.0003566673,0.015366613],"genre_scores_gemma":[0.9954647,0.000023900386,0.002529978,0.0009603919,0.0004898469,0.00039035545,0.000034894263,0.000018756637,0.0000872212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983217,0.000022073991,0.00043524455,0.00014535506,0.00022646232,0.00084915006],"domain_scores_gemma":[0.9992431,0.00030656366,0.00010460137,0.0003079113,0.000030030838,0.000007783566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002824017,0.00015215893,0.00013927877,0.00010168831,0.00033303362,0.00013537872,0.00037298095,0.00003821191,0.00007408361],"category_scores_gemma":[0.000407206,0.00009535534,0.000061307546,0.00042944512,0.00003857994,0.0004023629,0.0001147932,0.00021359847,0.000050522147],"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.000013433094,0.000412393,0.0041880826,0.00081611914,0.000058628262,5.494679e-7,0.005897866,0.02388888,0.00023348375,0.95306015,0.0018730749,0.009557324],"study_design_scores_gemma":[0.0007367174,0.000024554387,0.001360225,0.00010648698,0.000106102394,0.0000014192387,0.0067344927,0.8771698,0.00004159031,0.08882995,0.024458995,0.00042965027],"about_ca_topic_score_codex":0.00037019848,"about_ca_topic_score_gemma":0.004684142,"teacher_disagreement_score":0.8642302,"about_ca_system_score_codex":0.00007705643,"about_ca_system_score_gemma":0.000022834494,"threshold_uncertainty_score":0.3888478},"labels":[],"label_agreement":null},{"id":"W2071287219","doi":"10.1016/j.endm.2009.07.035","title":"Coloring a set of touching strings","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Université du Québec en Outaouais","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Monotone polygon; Plane (geometry); Planar graph; Bounded function; Discrete geometry; Integer (computer science); Line segment; Line (geometry); Point (geometry); Set (abstract data type); Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","score_opus":0.019808836336700223,"score_gpt":0.31220657841205546,"score_spread":0.29239774207535524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071287219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29783532,0.00021376097,0.7002559,0.00035294576,0.00002188045,0.00022409363,0.0000011382989,0.000076648284,0.001018345],"genre_scores_gemma":[0.92859054,0.000030551488,0.071278736,0.00002737388,0.00001701598,0.000007978448,7.890734e-7,0.00000951923,0.00003752675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982995,0.000054883763,0.00038551787,0.00026625037,0.00035129828,0.00064258795],"domain_scores_gemma":[0.9986716,0.00047995834,0.0001439892,0.0006118618,0.000039987863,0.00005258539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007869588,0.00014843728,0.00027276744,0.00021317099,0.000052930263,0.000049932438,0.0010462288,0.00004981561,0.0000073481015],"category_scores_gemma":[0.00039328125,0.00013705705,0.00006924337,0.0007286947,0.00005201427,0.00035380005,0.00018844842,0.00035606898,0.0000058845035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009094925,0.000050270595,0.00010240982,0.000048324553,0.000010323088,0.0000067246306,0.0018343742,0.00080736034,0.0070022265,0.9762599,0.0000027398728,0.013866276],"study_design_scores_gemma":[0.00031906506,0.00028718906,0.00014880765,0.000117356394,0.0000033180481,0.0000130803855,0.000066969784,0.050262384,0.039389025,0.9091608,0.000053324085,0.00017868576],"about_ca_topic_score_codex":0.000004433512,"about_ca_topic_score_gemma":0.000009438948,"teacher_disagreement_score":0.6307552,"about_ca_system_score_codex":0.00013204753,"about_ca_system_score_gemma":0.0000950258,"threshold_uncertainty_score":0.55890244},"labels":[],"label_agreement":null},{"id":"W2073844168","doi":"10.1016/j.endm.2013.05.114","title":"Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Benders' decomposition; Dimensioning; Mathematical optimization; Decomposition; Facility location problem; Nonlinear system; Integer (computer science); Mathematics; Wireless; Nonlinear programming; Wireless network; Integer programming; Computer science; Telecommunications; Engineering","score_opus":0.017288792545259724,"score_gpt":0.2677603609751958,"score_spread":0.25047156842993606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073844168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018932994,0.00014922596,0.98893285,0.0008138364,0.000033593184,0.008002238,6.624611e-7,0.00008313899,0.00009117295],"genre_scores_gemma":[0.8590217,0.000019280114,0.1323697,0.00011982437,0.00005210716,0.008348127,0.000011483195,0.000031325806,0.00002642986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997783,0.00010709574,0.00058718794,0.0004300646,0.00022128277,0.00087133725],"domain_scores_gemma":[0.9983529,0.0007858757,0.00019767483,0.0004971174,0.00009007955,0.0000763799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259128,0.00026288014,0.00035407787,0.00014676011,0.00008707152,0.00018644582,0.0007911785,0.00016230285,0.000013428676],"category_scores_gemma":[0.000024534642,0.00024086366,0.00007102725,0.00067925954,0.0000619509,0.0004903635,0.00012257576,0.00033246313,0.000010948372],"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.00003999625,0.00036589577,0.0002922154,0.0004243751,0.00004802562,0.000004628363,0.0019308407,0.6300889,0.00013650954,0.26232597,0.0003809424,0.10396169],"study_design_scores_gemma":[0.00052084133,0.00016845542,0.00007280012,0.00025097482,0.000004151124,0.0000057286047,0.00003132517,0.75568694,0.00023396558,0.24277565,0.000019817839,0.00022932864],"about_ca_topic_score_codex":0.00015262651,"about_ca_topic_score_gemma":0.00031649403,"teacher_disagreement_score":0.85712844,"about_ca_system_score_codex":0.0003125745,"about_ca_system_score_gemma":0.00017886359,"threshold_uncertainty_score":0.98221356},"labels":[],"label_agreement":null},{"id":"W2075234757","doi":"10.1016/j.endm.2013.05.097","title":"Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","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":"Polytechnique Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Spanning tree; Mathematics; Minimum spanning tree; Adjacency list; Quadratic equation; Combinatorics; Minimum degree spanning tree; Column generation; Tree (set theory); Mathematical optimization; Linear programming; Upper and lower bounds; Discrete mathematics","score_opus":0.007557376348709966,"score_gpt":0.22126028271029277,"score_spread":0.21370290636158282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075234757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019869408,0.00053755497,0.9768585,0.00017365276,0.000071426606,0.0010580142,0.0000038852727,0.0001643433,0.0012631897],"genre_scores_gemma":[0.9141214,0.00006564805,0.08500567,0.000015528962,0.00005246847,0.0004193099,0.0000142793015,0.000072668736,0.00023306416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877095,0.000011003081,0.00029876726,0.00017646576,0.00015377505,0.0005890161],"domain_scores_gemma":[0.99896044,0.0005480939,0.00007508832,0.0003332461,0.00004313532,0.00004000129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015288994,0.00023858191,0.00022285146,0.000057479836,0.00009794215,0.000096952936,0.00021307771,0.00006921849,0.0000390176],"category_scores_gemma":[0.000100845136,0.00015885771,0.000045577024,0.00013534584,0.00006452164,0.00016750608,0.000023169418,0.00025879854,0.000012603024],"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.000020647523,0.000073136456,0.00006068144,0.0003402129,0.000104977655,0.000001281792,0.0010405718,0.9756598,0.00033343298,0.015358138,0.000255387,0.0067517706],"study_design_scores_gemma":[0.0007450125,0.000302061,0.000098261415,0.00021260588,0.000073721676,0.0000071300005,0.00032842022,0.9514019,0.00217325,0.043876544,0.00033671103,0.00044440097],"about_ca_topic_score_codex":0.0000124098215,"about_ca_topic_score_gemma":0.00014060432,"teacher_disagreement_score":0.89425194,"about_ca_system_score_codex":0.00022319941,"about_ca_system_score_gemma":0.000037853242,"threshold_uncertainty_score":0.64780295},"labels":[],"label_agreement":null},{"id":"W2075766499","doi":"10.1016/j.endm.2004.03.039","title":"Minimum-Cost Single-Source 2-Splittable Flow","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","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":"McMaster University","funders":"","keywords":"Minimum-cost flow problem; Mathematical optimization; Mathematics; Flow (mathematics); Vertex (graph theory); Path (computing); Constraint (computer-aided design); Flow network; Enhanced Data Rates for GSM Evolution; Budget constraint; Graph; Computer science; Combinatorics; Economics; Microeconomics; Computer network; Geometry","score_opus":0.01972464748282074,"score_gpt":0.24912374400685244,"score_spread":0.2293990965240317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075766499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021087788,0.0004504562,0.97513914,0.0009604859,0.00015382204,0.00035512206,0.0000034307973,0.00024340475,0.001606369],"genre_scores_gemma":[0.6023961,0.000038609287,0.3969299,0.00021632938,0.00009356814,0.00005140201,0.000007583696,0.00003691118,0.00022962023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99754894,0.000041708106,0.00048317216,0.0004957111,0.00041428307,0.001016217],"domain_scores_gemma":[0.9983986,0.00032301896,0.00013737229,0.0009925828,0.00004304925,0.000105394385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004922566,0.00029258896,0.00035362225,0.00019735038,0.00015639637,0.00023415293,0.0013847314,0.00010425105,0.00003310325],"category_scores_gemma":[0.00021084797,0.00028032222,0.00013919677,0.00090630277,0.00011393892,0.00040492706,0.00037587766,0.00043979692,0.0000897189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001148211,0.000980127,0.00006305134,0.00017699247,0.00006340277,0.000039262206,0.0058938605,0.020556172,0.0019979882,0.9082485,0.00008233629,0.061886866],"study_design_scores_gemma":[0.0009706678,0.00022540172,0.00002471761,0.00018616929,0.0000116542105,0.00007522058,0.000070722665,0.23862326,0.010262177,0.7460412,0.0029958596,0.0005129931],"about_ca_topic_score_codex":0.00003472869,"about_ca_topic_score_gemma":0.00012411237,"teacher_disagreement_score":0.5813083,"about_ca_system_score_codex":0.00035566266,"about_ca_system_score_gemma":0.00017894566,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W2079074189","doi":"10.1016/j.endm.2013.10.053","title":"Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs","year":2013,"lang":"nl","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Strong perfect graph theorem; Bipartite graph; Operator (biology); Characterization (materials science); Conjecture; Discrete mathematics; Chordal graph; 1-planar graph; Graph","score_opus":0.01201657952695493,"score_gpt":0.27144248370935536,"score_spread":0.2594259041824004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079074189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9347181,0.0056225974,0.05568738,0.00073065667,0.00013376579,0.0016625361,0.000018484387,0.00008268929,0.0013438243],"genre_scores_gemma":[0.97233224,0.0008821475,0.026032533,0.00006694326,0.00003399195,0.000109574314,0.0000039904085,0.00008127269,0.0004573244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949525,0.00040397962,0.0010825789,0.0009137372,0.0008445708,0.0018026226],"domain_scores_gemma":[0.9960911,0.0015538947,0.00026996748,0.0015529726,0.00025254212,0.00027948487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001488196,0.00060937385,0.0009773333,0.00038583283,0.0002164652,0.00047607048,0.0015580546,0.00027327996,0.00043115809],"category_scores_gemma":[0.0008436951,0.00053804065,0.00022282386,0.0015560755,0.0010765811,0.0010600231,0.0008982749,0.001119758,0.00029313803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006896924,0.0007572745,0.0072403722,0.0017818745,0.00031558657,0.00002694566,0.009910725,0.00058074796,0.02282015,0.9452093,0.00017492601,0.011113076],"study_design_scores_gemma":[0.0018688267,0.0014369097,0.0015551423,0.0009196403,0.00006581064,0.00009200981,0.0005126173,0.31619832,0.019590195,0.6563354,0.00027066085,0.0011544835],"about_ca_topic_score_codex":0.00018534923,"about_ca_topic_score_gemma":0.0001736981,"teacher_disagreement_score":0.31561756,"about_ca_system_score_codex":0.00019550086,"about_ca_system_score_gemma":0.0005014905,"threshold_uncertainty_score":0.9997071},"labels":[],"label_agreement":null},{"id":"W2091504656","doi":"10.1016/s1571-0653(05)80126-x","title":"On i-minus-Edge-Removal-critical graphs","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph; Indifference graph; Computer science","score_opus":0.0146321788659135,"score_gpt":0.3085244832909755,"score_spread":0.293892304425062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091504656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33568788,0.0008827506,0.6279186,0.0024659603,0.00016723052,0.0008000831,0.000007717681,0.00041866026,0.031651117],"genre_scores_gemma":[0.9473239,0.000092893344,0.05156974,0.00018011,0.000030235125,0.000053054213,0.0000020318312,0.000041146315,0.00070687186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969338,0.00015582892,0.0004481136,0.0005790756,0.00062252703,0.0012606106],"domain_scores_gemma":[0.9966391,0.001879528,0.00005084251,0.001239239,0.000044781595,0.00014656414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081220886,0.00029308305,0.00034179198,0.00027966825,0.00014137213,0.00013892172,0.0015028089,0.00010819327,0.0003808184],"category_scores_gemma":[0.00075681205,0.0002568357,0.00014319204,0.0010247419,0.00025838087,0.0002784024,0.00016490942,0.00069172494,0.0004486212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019343724,0.00017305455,0.000011250795,0.000036485293,0.000011850024,0.000045823945,0.00038671735,0.00025035432,0.00030132502,0.97580737,0.000029126608,0.02292727],"study_design_scores_gemma":[0.00034427064,0.00028444096,0.000028794744,0.000092106515,0.0000045832503,0.000085926265,0.000012563134,0.036119066,0.0025621993,0.9596899,0.00047697805,0.00029917152],"about_ca_topic_score_codex":0.000003690362,"about_ca_topic_score_gemma":0.000017740116,"teacher_disagreement_score":0.61163604,"about_ca_system_score_codex":0.00017533427,"about_ca_system_score_gemma":0.00011398704,"threshold_uncertainty_score":0.9999884},"labels":[],"label_agreement":null},{"id":"W2116103579","doi":"10.1016/j.endm.2013.07.015","title":"Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Bounded function; Order (exchange); Discrete mathematics","score_opus":0.007075373172213777,"score_gpt":0.2545845592946737,"score_spread":0.24750918612245995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116103579","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.696555,0.0005129533,0.30071136,0.0007187057,0.00001638716,0.0007348468,0.0000032138942,0.0000663514,0.00068113784],"genre_scores_gemma":[0.89556485,0.00004515254,0.104237996,0.000038973198,0.0000049479895,0.000058720576,0.000001887029,0.000017443828,0.000030014968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981704,0.000096074364,0.00035301974,0.0003914307,0.00036366563,0.0006254105],"domain_scores_gemma":[0.9981438,0.0006644498,0.000147751,0.0008393699,0.000118629905,0.00008599771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340256,0.00021427157,0.00035738066,0.00016127397,0.00007177505,0.00009497662,0.0007085871,0.00007642625,0.000037805818],"category_scores_gemma":[0.0002853315,0.00015620449,0.00004280224,0.0008816878,0.0004293817,0.00042680197,0.00024193677,0.00038951455,0.0000059894114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012582577,0.00011016951,0.0019540156,0.0001745738,0.00003603921,0.0000021141902,0.0012657807,0.00004818993,0.001228698,0.9910666,0.0000076651095,0.0040935897],"study_design_scores_gemma":[0.00049990154,0.00034211457,0.0006732734,0.000042903164,0.000005948626,0.000026162716,0.00008567607,0.010013546,0.005939335,0.9821553,0.000020338875,0.00019546702],"about_ca_topic_score_codex":0.000034214903,"about_ca_topic_score_gemma":0.00011811638,"teacher_disagreement_score":0.19900984,"about_ca_system_score_codex":0.000066390705,"about_ca_system_score_gemma":0.0001540934,"threshold_uncertainty_score":0.63698345},"labels":[],"label_agreement":null},{"id":"W2124993762","doi":"10.1016/j.endm.2005.05.085","title":"Discrete Tomography in Discrete Deconvolution: Deconvolution of Binary Images Using Ryser's Algorithm","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","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","funders":"","keywords":"Deconvolution; Algorithm; Blind deconvolution; Thresholding; Binary number; Mathematics; Viterbi algorithm; Wiener filter; Wiener deconvolution; Polynomial; Equalization (audio); Artificial intelligence; Image (mathematics); Computer science; Decoding methods; Arithmetic","score_opus":0.012342428220268419,"score_gpt":0.28389115264451953,"score_spread":0.2715487244242511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124993762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054621436,0.0026104997,0.9408397,0.00042008708,0.0000675383,0.00047111284,0.000016252525,0.0003010921,0.00065224816],"genre_scores_gemma":[0.53047013,0.0000877575,0.46926954,0.000032380965,0.00003681382,0.00003375871,0.000008395337,0.000033582124,0.000027640095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964362,0.000114569295,0.0011378955,0.00070098107,0.0005226354,0.0010877433],"domain_scores_gemma":[0.99800086,0.0002731581,0.00050274876,0.0009987493,0.000118357966,0.00010612919],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095750904,0.0004610044,0.0006486703,0.0007927152,0.00009902923,0.00024923545,0.0014555386,0.00017770428,0.000013241672],"category_scores_gemma":[0.00021570337,0.00045050416,0.00021453733,0.0016602593,0.00031718973,0.0026137275,0.0006078718,0.0004917788,0.000008803993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016927658,0.0036569186,0.013939378,0.0029643443,0.00050535763,0.00022857999,0.0101422975,0.007429169,0.08288106,0.3874995,0.00045769208,0.49012643],"study_design_scores_gemma":[0.00065897737,0.00025323153,0.00065955793,0.00077448867,0.000029739627,0.00007457846,0.00007852894,0.71886396,0.053790856,0.22399761,0.00008710433,0.00073133816],"about_ca_topic_score_codex":0.00007088524,"about_ca_topic_score_gemma":0.000107110754,"teacher_disagreement_score":0.71143484,"about_ca_system_score_codex":0.0005311829,"about_ca_system_score_gemma":0.0002937097,"threshold_uncertainty_score":0.99979466},"labels":[],"label_agreement":null},{"id":"W2145668739","doi":"10.1016/s1571-0653(05)80175-1","title":"Simpler Projective Plane Embedding","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"University of Victoria","funders":"","keywords":"Projective plane; Antipodal point; Real projective plane; Mathematics; Line at infinity; Blocking set; Embedding; Pencil (optics); Projective space; Fano plane; Projective test; Combinatorics; Planar; Planar graph; Discrete mathematics; Homography; Graph; Collineation; Pure mathematics; Geometry; Computer science; Artificial intelligence; Physics; Optics; Computer graphics (images)","score_opus":0.016085028562191128,"score_gpt":0.3185427643036872,"score_spread":0.3024577357414961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145668739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21257329,0.00039633186,0.7740168,0.0005030458,0.000051294424,0.0008725244,0.0000059694617,0.00033781535,0.011242943],"genre_scores_gemma":[0.93973225,0.00007932563,0.05924383,0.00006997525,0.000039592658,0.00007594722,0.0000043295613,0.000032469623,0.0007222492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977307,0.000104042476,0.00034415268,0.00043618967,0.0003992592,0.0009856791],"domain_scores_gemma":[0.9984144,0.00065001583,0.00007228541,0.00075726653,0.000032951568,0.00007308131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000669705,0.00021633528,0.00027061094,0.00018914233,0.00010715405,0.000109248074,0.0010922165,0.000072128096,0.00025491838],"category_scores_gemma":[0.00020765454,0.00018912366,0.000070506154,0.00079891115,0.00009061698,0.00044580278,0.00017150964,0.00048418067,0.00016407103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046551027,0.00024507672,0.00020285067,0.000105682935,0.000060635015,0.000051438663,0.006356997,0.0038447385,0.0010755806,0.9103052,0.00006373626,0.07764151],"study_design_scores_gemma":[0.00044674551,0.00018984215,0.000066513836,0.00007067333,0.0000044736234,0.00005531737,0.00008099389,0.16872558,0.0047922577,0.82435215,0.00087229273,0.00034313108],"about_ca_topic_score_codex":0.000009573864,"about_ca_topic_score_gemma":0.000034784956,"teacher_disagreement_score":0.72715896,"about_ca_system_score_codex":0.00021147748,"about_ca_system_score_gemma":0.00013297856,"threshold_uncertainty_score":0.7712239},"labels":[],"label_agreement":null},{"id":"W2172657760","doi":"10.1016/j.endm.2008.01.004","title":"Limited Packings in Graphs","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.023074299769967836,"score_gpt":0.2875907517908187,"score_spread":0.2645164520208509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172657760","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6037862,0.0005000606,0.3928737,0.0005182568,0.00004799515,0.0004250384,0.0000012203951,0.00016891943,0.001678621],"genre_scores_gemma":[0.95976406,0.00022817276,0.039769195,0.000060189523,0.00001069837,0.000046743415,0.0000020379098,0.000025052383,0.00009382441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756277,0.000113561815,0.00044695573,0.00042448,0.00043412342,0.0010180832],"domain_scores_gemma":[0.9982378,0.0006920934,0.00010520041,0.0008465913,0.000041975276,0.00007636127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434876,0.00021673595,0.00031446957,0.00053030386,0.00008860363,0.00004507244,0.0012440645,0.00008685427,0.000016207545],"category_scores_gemma":[0.0005193391,0.00019999234,0.000085811495,0.001904408,0.00017095,0.00043303845,0.0003054283,0.0006022013,0.000041281055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001266964,0.00019138471,0.0049812733,0.000048418056,0.00001312788,0.000083672385,0.003371429,0.00035244296,0.0011288706,0.98744893,0.000015909704,0.0023518468],"study_design_scores_gemma":[0.0005767841,0.00013100746,0.0017137929,0.00007998279,0.0000016500563,0.00008279048,0.000041776446,0.04267127,0.004400754,0.949913,0.00008804729,0.00029910088],"about_ca_topic_score_codex":0.000015231746,"about_ca_topic_score_gemma":0.00012853138,"teacher_disagreement_score":0.3559779,"about_ca_system_score_codex":0.00019606361,"about_ca_system_score_gemma":0.00014317557,"threshold_uncertainty_score":0.8155451},"labels":[],"label_agreement":null},{"id":"W2173146142","doi":"10.1016/j.endm.2005.05.036","title":"Planar graph bipartization in linear time","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph; Vertex (graph theory); Planar straight-line graph; Transversal (combinatorics); Butterfly graph; Planar; Discrete mathematics; Line graph; Voltage graph; 1-planar graph; Mathematical analysis; Computer science","score_opus":0.012619503247578661,"score_gpt":0.2892128175860272,"score_spread":0.2765933143384485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173146142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08289341,0.0004073743,0.91413516,0.0011685252,0.000031946205,0.00039340512,0.0000021351757,0.00014327352,0.0008247722],"genre_scores_gemma":[0.858732,0.00008893878,0.14062738,0.00009846296,0.000052703967,0.000048995233,0.000008557621,0.000031438183,0.0003115373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801564,0.00010369091,0.00042596657,0.00034538834,0.00034270048,0.0007666196],"domain_scores_gemma":[0.99878395,0.00040576924,0.00009523499,0.00062154484,0.0000309712,0.00006253823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086979975,0.0001763732,0.00024139309,0.00041688472,0.0000506562,0.000052611853,0.0008729325,0.00007738972,0.000036286936],"category_scores_gemma":[0.00028786185,0.00016509621,0.00005442101,0.001269664,0.00006881198,0.00048312778,0.00013240747,0.00038240975,0.00020489804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022766908,0.00032105137,0.000774746,0.00006580696,0.000019917485,0.000017745879,0.0024549474,0.015628295,0.0044057495,0.96328104,0.00005632831,0.012951606],"study_design_scores_gemma":[0.00039347142,0.000081297505,0.000095283,0.000056791792,0.0000020014127,0.00000983354,0.000012937815,0.43290707,0.005038403,0.56089514,0.00029622042,0.00021155177],"about_ca_topic_score_codex":0.0000048094794,"about_ca_topic_score_gemma":0.00012074451,"teacher_disagreement_score":0.77583855,"about_ca_system_score_codex":0.00019886364,"about_ca_system_score_gemma":0.00009527342,"threshold_uncertainty_score":0.6732428},"labels":[],"label_agreement":null},{"id":"W2174315020","doi":"10.1016/j.endm.2009.07.049","title":"On distance edge-colourings and matchings","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","score_opus":0.010402237647939024,"score_gpt":0.2762150895915916,"score_spread":0.26581285194365256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174315020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768452,0.00040215792,0.014296411,0.00065769284,0.00008057967,0.0004421715,0.0000058893897,0.0001405888,0.0071292906],"genre_scores_gemma":[0.9876025,0.00008542921,0.011541763,0.00032992943,0.000055676417,0.000015231303,0.0000020355096,0.00004155488,0.00032591453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980992,0.00005441567,0.00047536593,0.00036939583,0.0003102154,0.0006914024],"domain_scores_gemma":[0.9980395,0.001129344,0.00018735723,0.0005387358,0.000023779361,0.00008130912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006001477,0.00033494996,0.000455478,0.00014118552,0.00019525203,0.000061556195,0.00034314924,0.00013738906,0.000047634643],"category_scores_gemma":[0.0008181497,0.0002671048,0.00009502616,0.00021306991,0.00012163662,0.00011372051,0.00008657601,0.0005444686,0.0000056980207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037821443,0.00010524282,0.00006424124,0.00010620845,0.000018363979,0.00000796138,0.0023993878,0.000010666505,0.00012863093,0.9948586,0.00011608799,0.0021467835],"study_design_scores_gemma":[0.00049104774,0.00026369782,0.00031088036,0.000201549,0.000025926694,0.000027202566,0.00007441797,0.00085768173,0.00091521867,0.99627924,0.00022891887,0.0003242033],"about_ca_topic_score_codex":0.0000027132378,"about_ca_topic_score_gemma":0.00001694667,"teacher_disagreement_score":0.010757246,"about_ca_system_score_codex":0.00013078154,"about_ca_system_score_gemma":0.000029790239,"threshold_uncertainty_score":0.9999781},"labels":[],"label_agreement":null},{"id":"W2174920527","doi":"10.1016/j.endm.2015.06.074","title":"Uniform Linear Embeddings of Spatial Random Graphs","year":2015,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Embedding; Combinatorics; Vertex (graph theory); Random graph; Discrete mathematics; Random regular graph; Space (punctuation); Link (geometry); Graph; Chordal graph; 1-planar graph; Computer science","score_opus":0.02620108249101816,"score_gpt":0.304088283036715,"score_spread":0.2778872005456968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2174920527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8816075,0.0003345665,0.10897296,0.00010831461,0.0002636373,0.00073854864,0.000020531927,0.00012917609,0.00782478],"genre_scores_gemma":[0.9600451,0.000046640198,0.039578333,0.00002434064,0.000079093435,0.000023422268,0.000008189016,0.00006559001,0.00012930566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746174,0.000102429905,0.00091025815,0.00028632712,0.00055365864,0.00068560673],"domain_scores_gemma":[0.9975196,0.0011039522,0.00041866594,0.00069666345,0.00013507363,0.00012605483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015936902,0.0003383395,0.0007509411,0.00025727085,0.00008006513,0.000019500316,0.0005467663,0.00019257894,0.000074178],"category_scores_gemma":[0.0021988414,0.0002644613,0.00022849842,0.00038976426,0.00023695879,0.00012846403,0.00021257726,0.0004611904,0.000006024371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018487658,0.00017233992,0.0005819798,0.000305889,0.000104517596,0.0000048383804,0.0060953116,0.00014740728,0.00020611825,0.9914044,0.00008084599,0.0007114487],"study_design_scores_gemma":[0.0023573549,0.00023026827,0.000022820253,0.00014285224,0.00007625845,0.000023570094,0.00041600474,0.010680942,0.006484752,0.97911596,0.00014128453,0.0003079396],"about_ca_topic_score_codex":0.000057842615,"about_ca_topic_score_gemma":0.0001596454,"teacher_disagreement_score":0.078437604,"about_ca_system_score_codex":0.00013078157,"about_ca_system_score_gemma":0.00015611855,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W2175309622","doi":"10.1016/j.endm.2005.05.035","title":"Degree constrained subgraphs","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Digital Image Processing Techniques","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":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Weighting; Degree (music); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.019654324841137705,"score_gpt":0.27627466262816175,"score_spread":0.25662033778702403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175309622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008078012,0.00046158422,0.97264504,0.0013229796,0.000024584595,0.00020841406,0.0000014509427,0.00063204544,0.01662587],"genre_scores_gemma":[0.6194386,0.000018490946,0.38026002,0.00012951011,0.000019148287,0.000021264426,0.0000013819143,0.00001475674,0.00009686079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983083,0.000024561268,0.00039064587,0.0003385142,0.00027852223,0.00065943255],"domain_scores_gemma":[0.9988669,0.0002231999,0.00012768764,0.00067046087,0.00004858768,0.00006313998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044714328,0.00021225313,0.00024243312,0.00018730765,0.00005129619,0.0002989773,0.0012086326,0.00007243346,0.00001579849],"category_scores_gemma":[0.0002846789,0.00019407718,0.00007623956,0.00055117643,0.00012736498,0.00089751923,0.00025147657,0.0002693633,0.000049860748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002749146,0.00020043699,0.00010537872,0.00007024292,0.00001808405,0.000011851815,0.0008508584,0.000028515455,0.0013981274,0.79813766,0.00015608004,0.19902003],"study_design_scores_gemma":[0.00037196797,0.00012574467,0.00004626869,0.0001491776,0.00000796747,0.00008580123,0.00001855773,0.10945557,0.048210792,0.8398911,0.0011597226,0.00047734004],"about_ca_topic_score_codex":0.00000410625,"about_ca_topic_score_gemma":0.000049272316,"teacher_disagreement_score":0.61136055,"about_ca_system_score_codex":0.00014544082,"about_ca_system_score_gemma":0.00016718639,"threshold_uncertainty_score":0.7914238},"labels":[],"label_agreement":null},{"id":"W2175791395","doi":"10.1016/s1571-0653(04)00522-0","title":"Efficient computation of 2-medians in a tree network with positive/negative weights","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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":"Simon Fraser University","funders":"","keywords":"Mathematics; Median; Combinatorics; Computation; Tree (set theory); Discrete mathematics; Algorithm","score_opus":0.009566982721049827,"score_gpt":0.2237243739697998,"score_spread":0.21415739124874997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2175791395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88480085,0.00015841571,0.098643854,0.00041167176,0.00009398154,0.0008557718,0.0000013954483,0.000043717027,0.014990342],"genre_scores_gemma":[0.9963421,0.0000074976506,0.0034120537,0.0000883758,0.00003583704,0.00003209175,0.000012287994,0.000016846987,0.0000528819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986682,0.000027640584,0.0004245526,0.00021592458,0.00025903748,0.0004046224],"domain_scores_gemma":[0.99952143,0.00009407395,0.00013724143,0.00016943521,0.00006903618,0.0000087671615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053257064,0.00016951103,0.0002544508,0.000224503,0.000046655034,0.000030165103,0.00012768446,0.00003951279,0.00006705214],"category_scores_gemma":[0.00016288925,0.00014217508,0.00004235038,0.00093191117,0.00006387661,0.000115933086,0.00003502319,0.00014075146,0.00003842835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006206282,0.00053474196,0.005488537,0.0005450064,0.00005590022,0.0000055596456,0.001479855,0.4372682,0.00003073,0.552617,0.000034965058,0.0018774171],"study_design_scores_gemma":[0.0019767808,0.00009857923,0.009681018,0.0006205432,0.00006969166,0.000001374227,0.0010881077,0.8444345,0.0003077339,0.14098884,0.00023119547,0.0005016592],"about_ca_topic_score_codex":0.00025333618,"about_ca_topic_score_gemma":0.004153449,"teacher_disagreement_score":0.4116282,"about_ca_system_score_codex":0.00011027217,"about_ca_system_score_gemma":0.000040906438,"threshold_uncertainty_score":0.5797731},"labels":[],"label_agreement":null},{"id":"W2176863076","doi":"10.1016/j.endm.2005.05.016","title":"On bags and bugs","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Chordal graph; Discrete mathematics; Indifference graph; Graph","score_opus":0.01168407347966107,"score_gpt":0.2914724522231081,"score_spread":0.27978837874344703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176863076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2910576,0.0006688622,0.70152485,0.0028591256,0.00003982623,0.00035066993,0.0000012072429,0.00015387719,0.0033440138],"genre_scores_gemma":[0.93483484,0.000087294946,0.064600095,0.00015413303,0.000026792752,0.000021576783,5.5665464e-7,0.000016571168,0.00025814705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984956,0.00005410148,0.00022799682,0.00031936864,0.00029337383,0.00060955214],"domain_scores_gemma":[0.9985475,0.0007163451,0.000057096764,0.0005883499,0.000020278532,0.000070455106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057893473,0.00015442666,0.00018115941,0.0001659469,0.00007060989,0.000074665644,0.0006452432,0.000050397502,0.000020378231],"category_scores_gemma":[0.0004059504,0.00013163431,0.000036573958,0.00036911565,0.0000898487,0.00028563253,0.00022919168,0.00034912062,0.0000662319],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005568817,0.00005656974,0.000037358135,0.000019412264,0.0000065083705,0.0000032017324,0.0006217865,0.0003689263,0.0004065567,0.980243,0.000020741494,0.018210322],"study_design_scores_gemma":[0.00026066418,0.00014257312,0.000055179673,0.000055392746,0.0000019044688,0.000017876951,0.000016250746,0.07171378,0.005625166,0.92158735,0.00034363478,0.00018023905],"about_ca_topic_score_codex":0.0000015090073,"about_ca_topic_score_gemma":0.000034949004,"teacher_disagreement_score":0.64377725,"about_ca_system_score_codex":0.0001236369,"about_ca_system_score_gemma":0.000051625266,"threshold_uncertainty_score":0.5367891},"labels":[],"label_agreement":null},{"id":"W2176943562","doi":"10.1016/s1571-0653(04)00071-x","title":"Addressing the Petersen graph","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Graph theory 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":"Queen's University; Redeemer University College","funders":"","keywords":"Combinatorics; Graph; Tuple; Mathematics; Graph power; Eigenvalues and eigenvectors; Wheel graph; Petersen graph; Discrete mathematics; Shader; Distance-regular graph; Butterfly graph; Voltage graph; Computer science; Line graph; Graphics","score_opus":0.1028449178796152,"score_gpt":0.33586503391173866,"score_spread":0.23302011603212347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176943562","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8910322,0.00188724,0.0655704,0.005513418,0.00015101237,0.0019601455,0.000022491686,0.0005073208,0.03335578],"genre_scores_gemma":[0.99109125,0.0000871381,0.007976567,0.000113193404,0.000059569647,0.00013294644,0.0000028756908,0.00004827971,0.00048818154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982991,0.00010745562,0.00045523033,0.000248817,0.00026039506,0.00062895997],"domain_scores_gemma":[0.9973967,0.0015460906,0.0001846115,0.00079503685,0.000027256809,0.000050282128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007094926,0.0002325392,0.0002737418,0.000107527456,0.00025231138,0.000073928415,0.0005295541,0.00008480987,0.00032650903],"category_scores_gemma":[0.00051103137,0.00016024717,0.00015343435,0.00051746663,0.00019087821,0.00010312177,0.00008206641,0.00046866856,0.00008846458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002614771,0.00015963672,0.000041981355,0.00007118297,0.00003251283,0.0000022818697,0.0023417566,0.000016893346,0.00045307633,0.9952924,0.00043608644,0.0011495316],"study_design_scores_gemma":[0.00024906435,0.00003134097,0.000028201537,0.000096131276,0.0000475699,0.000028808365,0.0003396507,0.004344674,0.0011087831,0.99276257,0.00074755185,0.0002156305],"about_ca_topic_score_codex":0.0000039340384,"about_ca_topic_score_gemma":0.00005474568,"teacher_disagreement_score":0.100059055,"about_ca_system_score_codex":0.00006550883,"about_ca_system_score_gemma":0.000016442735,"threshold_uncertainty_score":0.653469},"labels":[],"label_agreement":null},{"id":"W2177515002","doi":"10.1016/j.endm.2015.06.046","title":"Graph Cores via Universal Completability","year":2015,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Structural Analysis and Optimization","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":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Complement graph; Null graph; Graph; Voltage graph; Line graph; Automorphism; Mathematical proof; Edge-transitive graph","score_opus":0.013383276210346405,"score_gpt":0.22487649541817703,"score_spread":0.21149321920783062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177515002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60817194,0.0004799213,0.38934046,0.00006870741,0.00008652126,0.0001618738,0.0000046296277,0.00018247723,0.0015034411],"genre_scores_gemma":[0.99237657,0.000033930486,0.007497764,0.000007714209,0.000025490608,0.0000040693385,0.000021810414,0.000018270051,0.000014384914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919504,0.000018962955,0.00022890371,0.00011582143,0.00015350098,0.00028779078],"domain_scores_gemma":[0.9995954,0.00007291677,0.000033991073,0.00020934042,0.000032873606,0.000055491175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016090366,0.00013360925,0.00021139784,0.00007950772,0.000022451615,0.000021585514,0.00014514099,0.000049178925,0.000061550105],"category_scores_gemma":[0.00006395206,0.00011403428,0.000058861573,0.00031602173,0.000043100463,0.00009498488,0.000025673811,0.00014822061,0.000012555399],"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.000020172563,0.00006459641,0.0047291405,0.00019381818,0.00016857263,0.000005887006,0.0025183293,0.9406304,0.0013428451,0.046257857,0.00023113012,0.0038372483],"study_design_scores_gemma":[0.00030823215,0.00003580305,0.00051491015,0.000014656145,0.000030550153,0.0000050280064,0.00012818427,0.87829804,0.0011481486,0.11921475,0.00010370976,0.00019798001],"about_ca_topic_score_codex":0.000031529984,"about_ca_topic_score_gemma":0.00020426555,"teacher_disagreement_score":0.3842046,"about_ca_system_score_codex":0.0001921953,"about_ca_system_score_gemma":0.000020866366,"threshold_uncertainty_score":0.4650183},"labels":[],"label_agreement":null},{"id":"W2179188366","doi":"10.1016/s1571-0653(05)80141-6","title":"Well-located graphs: A collection of well-covered ones","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Graph; Maximal independent set; Independent set; Discrete mathematics; Chordal graph; 1-planar graph","score_opus":0.01186500088918949,"score_gpt":0.2746254796604122,"score_spread":0.26276047877122266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2179188366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6188143,0.000829842,0.36652792,0.00048738837,0.00009105289,0.0010135914,0.000004879295,0.00026949853,0.011961533],"genre_scores_gemma":[0.97815245,0.00036688862,0.020425048,0.000031584223,0.000012506831,0.000048645485,0.0000044708718,0.000029392064,0.0009290202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976559,0.00014843784,0.0005602034,0.00040788873,0.0004761336,0.0007513844],"domain_scores_gemma":[0.9983462,0.000498331,0.00016004368,0.00085184723,0.00007422204,0.00006932059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069318915,0.00023295001,0.00038061242,0.0003628707,0.00010340696,0.00005377911,0.0010231426,0.000102258025,0.0003064112],"category_scores_gemma":[0.00014750063,0.00021530846,0.00012434862,0.0021434808,0.00016439556,0.0003519306,0.00012363252,0.0003682009,0.000099277946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020086406,0.00075403217,0.00060749095,0.00033894624,0.0001520976,0.000019531592,0.0033170525,0.0061039724,0.0074749663,0.96690434,0.00017883167,0.013947898],"study_design_scores_gemma":[0.0007532846,0.00034538732,0.00015654987,0.00012018937,0.000010999066,0.00002894792,0.000050829287,0.12159193,0.036022358,0.84027624,0.0003454205,0.00029785675],"about_ca_topic_score_codex":0.0000411484,"about_ca_topic_score_gemma":0.000086686436,"teacher_disagreement_score":0.35933813,"about_ca_system_score_codex":0.00015952092,"about_ca_system_score_gemma":0.00016822112,"threshold_uncertainty_score":0.8780024},"labels":[],"label_agreement":null},{"id":"W2188617452","doi":"10.1016/j.endm.2018.01.009","title":"New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":35,"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":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Government of Alberta Ministry of Transportation","keywords":"Vehicle routing problem; Mathematics; Inequality; Routing (electronic design automation); Branch and cut; Mathematical optimization; Algorithm; Linear programming; Computer science","score_opus":0.03467735418661974,"score_gpt":0.25847533349880364,"score_spread":0.2237979793121839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188617452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029299527,0.000729854,0.9659397,0.00017104147,0.00017308307,0.0006191068,0.00002212556,0.00031480024,0.0027307607],"genre_scores_gemma":[0.9671277,0.000049299695,0.032074235,0.0000357613,0.00027668642,0.00005094748,0.000017245837,0.000072325995,0.00029580863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985171,0.00001715135,0.0004502464,0.0001671721,0.00016407226,0.0006842685],"domain_scores_gemma":[0.9988935,0.0006162055,0.000060973427,0.00033174537,0.000045531684,0.000052044143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004742167,0.00023109642,0.00025689526,0.000057328525,0.000110368324,0.000057556514,0.00030119528,0.00008391785,0.00005445261],"category_scores_gemma":[0.00012467982,0.00017339992,0.00007976206,0.00024760026,0.00010213413,0.00008247713,0.00001908194,0.000284607,0.000020662697],"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.000060779872,0.00009507774,0.00080142193,0.0010360089,0.00043083177,0.0000055498217,0.02463622,0.019730534,0.009255997,0.9330962,0.0016878638,0.009163562],"study_design_scores_gemma":[0.0013407776,0.00025173565,0.000086608474,0.00021468,0.00013449576,0.00000854357,0.00057070307,0.6951576,0.029990511,0.26907697,0.002557661,0.00060971134],"about_ca_topic_score_codex":0.00008320535,"about_ca_topic_score_gemma":0.0005694572,"teacher_disagreement_score":0.9378282,"about_ca_system_score_codex":0.00015280106,"about_ca_system_score_gemma":0.00007271699,"threshold_uncertainty_score":0.7071044},"labels":[],"label_agreement":null},{"id":"W2611522934","doi":"10.1016/j.endm.2018.02.001","title":"Energy-Efficient Service Function Chain Provisioning","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Software-Defined Networks and 5G","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":"Concordia University","funders":"","keywords":"Chaining; Computer science; Network Functions Virtualization; Distributed computing; Provisioning; Software-defined networking; Virtual network; Computer network; Failover; Efficient energy use; Function (biology); Network virtualization; Virtualization; Cloud computing; Operating system","score_opus":0.009884399169723711,"score_gpt":0.23287023850298622,"score_spread":0.2229858393332625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611522934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032282226,0.00036020364,0.96520674,0.0006083779,0.0002478459,0.00015833239,5.9277767e-7,0.00024714085,0.00088851084],"genre_scores_gemma":[0.9662454,0.00001596255,0.032766182,0.0005935805,0.00021573319,0.00003694461,0.000004106987,0.000026762491,0.000095302195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981018,0.0000535802,0.00036315524,0.00042408486,0.00033832577,0.0007191124],"domain_scores_gemma":[0.99868816,0.00030380263,0.00014860187,0.000696896,0.00009532148,0.000067237794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056057813,0.00021414363,0.00022381615,0.00013732143,0.00016640047,0.00013775358,0.00069784024,0.00009605142,0.0000311194],"category_scores_gemma":[0.00010468339,0.00018321098,0.000058155252,0.0010069298,0.00004496464,0.00015987176,0.00031333911,0.00022094058,0.00006655172],"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.00002342439,0.00024261017,0.0001618717,0.000082330684,0.000037852584,0.0000057636958,0.0028008814,0.0060457354,0.00052896363,0.9283751,0.00022620911,0.06146921],"study_design_scores_gemma":[0.0002925078,0.0002500655,0.00008363033,0.00011983052,0.000008890829,0.000012336043,0.000029094012,0.8957012,0.0012809339,0.100550756,0.0014191502,0.00025157668],"about_ca_topic_score_codex":0.000045944784,"about_ca_topic_score_gemma":0.00018928964,"teacher_disagreement_score":0.9339632,"about_ca_system_score_codex":0.00015043971,"about_ca_system_score_gemma":0.00013063451,"threshold_uncertainty_score":0.74711275},"labels":[],"label_agreement":null},{"id":"W2742569245","doi":"10.1016/j.endm.2017.06.067","title":"The codegree threshold of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mrow><mml:mo>−</mml:mo></mml:mrow></mml:msubsup></mml:math>","year":2017,"lang":"lv","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"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":"H2020 European Research Council; Engineering and Physical Sciences Research Council; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Combinatorics; Tournament; Conjecture; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","score_opus":0.020446806103293816,"score_gpt":0.2575681564522261,"score_spread":0.23712135034893228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2742569245","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46942258,0.0034227192,0.0019036914,0.00083249965,0.0028213141,0.00012381325,0.00048539197,0.0002876297,0.5207004],"genre_scores_gemma":[0.9827391,0.003930768,0.005415565,0.0010521944,0.0025025858,0.0013960629,0.0006784422,0.0015111996,0.0007740745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98388743,0.00074602617,0.003732071,0.0025354652,0.004273519,0.004825457],"domain_scores_gemma":[0.9820335,0.005382974,0.004851809,0.006135985,0.0003338011,0.0012619308],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005241715,0.0017325581,0.0008526125,0.00075212517,0.00375229,0.0026817254,0.0061123744,0.0038189858,0.31080264],"category_scores_gemma":[0.006664936,0.0028040656,0.0033313937,0.001353796,0.004332877,0.0018892499,0.0045096986,0.0039404733,0.0014048988],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014672831,0.00047722357,0.000023964787,0.0028665324,0.0030701298,0.00080652663,0.0053943926,0.0010226887,0.0014507532,0.8268029,0.15439603,0.0022215596],"study_design_scores_gemma":[0.0030602373,0.0021783374,0.00008759742,0.0029674515,0.002995797,0.0016457433,0.0031494545,0.108831786,0.85911363,0.010089616,0.0030880356,0.0027922967],"about_ca_topic_score_codex":0.0010075399,"about_ca_topic_score_gemma":0.0026675256,"teacher_disagreement_score":0.8576629,"about_ca_system_score_codex":0.000057048925,"about_ca_system_score_gemma":0.0026867532,"threshold_uncertainty_score":0.99954206},"labels":[],"label_agreement":null},{"id":"W2766373705","doi":"10.1016/j.endm.2017.06.052","title":"Bijections for walks ending on an axis, using open arc diagrams","year":2017,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","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":"Simon Fraser University","funders":"","keywords":"Bijection, injection and surjection; Arc (geometry); Mathematics; Diagram; Combinatorics; Geometry; Statistics; Bijection","score_opus":0.11594771409083832,"score_gpt":0.43060934962885017,"score_spread":0.31466163553801185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766373705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39866439,0.00006384346,0.5900547,0.0003541045,0.00087739975,0.0044087144,0.000052544758,0.00027157037,0.0052527245],"genre_scores_gemma":[0.7663695,0.00002266418,0.23264727,0.000028528972,0.00024370821,0.00033198722,0.000011519089,0.00018492491,0.0001598872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664474,0.0001061103,0.0009475715,0.0006479892,0.00044710966,0.0012064585],"domain_scores_gemma":[0.99375564,0.002540813,0.0009821473,0.0024352768,0.00012222446,0.00016390879],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017083503,0.0005384321,0.0009650766,0.00021344761,0.0010979916,0.0007077898,0.0022791137,0.00023671583,0.000039577062],"category_scores_gemma":[0.007932247,0.0005017277,0.00021618257,0.00019460575,0.00017097105,0.0008432094,0.00059140683,0.0005909441,0.000011505255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004667866,0.00064558635,0.00004992203,0.00030040334,0.00007121902,0.0000047483654,0.00095169526,0.00013102936,0.0008694816,0.9954219,0.00002498251,0.0014823658],"study_design_scores_gemma":[0.0014285779,0.0005067665,0.000014436974,0.00050940295,0.000110002984,0.000021439977,0.00030538588,0.03358709,0.0064307135,0.95631987,0.00017318732,0.0005931235],"about_ca_topic_score_codex":0.000043423715,"about_ca_topic_score_gemma":0.00036920345,"teacher_disagreement_score":0.36770514,"about_ca_system_score_codex":0.00072278,"about_ca_system_score_gemma":0.00021128764,"threshold_uncertainty_score":0.99974346},"labels":[],"label_agreement":null},{"id":"W2790036744","doi":"10.1016/j.endm.2018.02.017","title":"New Constant Weight Codes and Packing Numbers","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","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 Northern British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Constant (computer programming); Code (set theory); Binary code; Binary number; Discrete mathematics; Arithmetic; Computer science; Set (abstract data type)","score_opus":0.005941041425367322,"score_gpt":0.21918699064126726,"score_spread":0.21324594921589993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790036744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8583342,0.002465869,0.11564943,0.000072527,0.00030290306,0.0003421615,0.00000773686,0.00033806777,0.022487136],"genre_scores_gemma":[0.9965127,0.00010988476,0.0031202945,0.000012906567,0.000109137414,0.000007616275,0.0000023121652,0.00003606304,0.00008905123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989985,0.000025329142,0.00027057916,0.00014488817,0.0001138585,0.00044683766],"domain_scores_gemma":[0.9994716,0.00017970987,0.000039124763,0.00022867092,0.000011853813,0.00006906094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027729393,0.0001781737,0.00024373127,0.00007238842,0.000053314532,0.00004480871,0.00013349883,0.000076106815,0.00009520551],"category_scores_gemma":[0.000043545926,0.00015975366,0.000037176236,0.00018464454,0.00010224346,0.000084999345,0.000027445425,0.0001825511,0.00003150221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023613617,0.00002733464,0.0022932545,0.0004563313,0.00017590215,0.000011327094,0.006719261,0.00013864707,0.008626729,0.9721053,0.00047845853,0.008943835],"study_design_scores_gemma":[0.0012678005,0.00022921419,0.0001682015,0.00083759805,0.000077712175,0.00015587526,0.00095778715,0.05821368,0.040134273,0.89295787,0.004015057,0.0009849414],"about_ca_topic_score_codex":0.000018977567,"about_ca_topic_score_gemma":0.00026247394,"teacher_disagreement_score":0.13817857,"about_ca_system_score_codex":0.00006740126,"about_ca_system_score_gemma":0.000035796056,"threshold_uncertainty_score":0.65145653},"labels":[],"label_agreement":null},{"id":"W2792983298","doi":"10.1016/j.endm.2018.02.008","title":"Towards Optimal and Scalable Solution for Routing and Spectrum Allocation","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":18,"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","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Scalability; Computer science; Column generation; Routing (electronic design automation); Provisioning; Frequency allocation; Context (archaeology); Path (computing); Shortest path problem; Slicing; Mathematical optimization; Spectrum (functional analysis); Process (computing); Distributed computing; Computer network; Mathematics; Theoretical computer science","score_opus":0.00955144964890719,"score_gpt":0.24627295239686353,"score_spread":0.23672150274795634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792983298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21500696,0.0005730519,0.7834391,0.00023724118,0.000030485755,0.0002410752,0.0000015676363,0.0002272899,0.00024324375],"genre_scores_gemma":[0.7550951,0.00015841512,0.24462673,0.0000055259966,0.000050183342,0.000028014894,0.0000025912825,0.000023305354,0.00001010355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913716,0.0000044944477,0.00019225533,0.00015402079,0.000065440516,0.00044661562],"domain_scores_gemma":[0.9996543,0.00013405814,0.000029292236,0.00014251175,0.000015175164,0.000024688428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019400127,0.00013077863,0.00016326798,0.000052704538,0.0000630549,0.00003112587,0.00008024903,0.00009049869,0.0000035611038],"category_scores_gemma":[0.00022135396,0.00012649356,0.000015629623,0.00012832951,0.00013069416,0.0001183319,0.00005942599,0.00014649975,0.0000019613988],"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.000057942616,0.00007747737,0.000419212,0.0009804537,0.00012806112,0.0000018384479,0.0019885483,0.020281928,0.017694063,0.8044628,0.00010151976,0.15380614],"study_design_scores_gemma":[0.00020481384,0.00013767401,0.000064266984,0.000060980623,0.000011861372,0.000006449626,0.000053939984,0.84042126,0.0088919215,0.14992753,0.000073024,0.00014627274],"about_ca_topic_score_codex":0.000002498955,"about_ca_topic_score_gemma":0.000044815504,"teacher_disagreement_score":0.82013935,"about_ca_system_score_codex":0.00011740627,"about_ca_system_score_gemma":0.0000121084295,"threshold_uncertainty_score":0.51582575},"labels":[],"label_agreement":null},{"id":"W2886351742","doi":"10.1016/j.endm.2018.07.043","title":"A hybrid heuristic for the multi-activity tour scheduling problem","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Heuristic; Incremental heuristic search; Beam search; Time horizon; Artificial intelligence; Search algorithm; Mathematics; Algorithm; Schedule","score_opus":0.10465804007470333,"score_gpt":0.39678739451841666,"score_spread":0.29212935444371335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886351742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19464223,0.00037721542,0.80272424,0.001173415,0.00019278236,0.00061125634,0.000016283102,0.00006799048,0.00019457974],"genre_scores_gemma":[0.84712577,0.000012031353,0.15191492,0.00006337061,0.0002095029,0.000118807286,0.000001785353,0.000028835413,0.0005249691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713826,0.000121230856,0.00066217594,0.0005105704,0.00067217415,0.0008956105],"domain_scores_gemma":[0.9913447,0.0070267026,0.000324536,0.00093887374,0.0002878807,0.00007729918],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005308014,0.00023276532,0.00038758424,0.00018852795,0.00054880517,0.00031196646,0.0010133228,0.000071634495,0.00010994169],"category_scores_gemma":[0.0148967225,0.00014533252,0.00020254347,0.00068064174,0.00028581644,0.00017706059,0.00015720342,0.0003874722,0.0001914912],"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.00087202335,0.0047344263,0.0067901164,0.00058566825,0.0013210562,0.000027234883,0.025090264,0.05509478,0.012323891,0.66665167,0.004307596,0.22220124],"study_design_scores_gemma":[0.0005540203,0.0001448976,0.00021151952,0.00005606969,0.000049606926,0.000016208516,0.00020088708,0.68895954,0.0034368918,0.3048906,0.0012614818,0.00021826763],"about_ca_topic_score_codex":0.000054238866,"about_ca_topic_score_gemma":0.0003660504,"teacher_disagreement_score":0.6524835,"about_ca_system_score_codex":0.00013034293,"about_ca_system_score_gemma":0.00029450533,"threshold_uncertainty_score":0.9934012},"labels":[],"label_agreement":null},{"id":"W2963297472","doi":"10.1016/j.endm.2017.06.062","title":"Exponentially many nowhere-zero <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-, and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub></mml:math>-flows","year":2017,"lang":"lv","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","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":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Planar graph; Zero (linguistics); Graph; Exponential function; Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis; Philosophy","score_opus":0.023983512937305693,"score_gpt":0.26393773454377983,"score_spread":0.23995422160647414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963297472","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42321083,0.004456314,0.0046479073,0.0015182714,0.0080723995,0.0002806913,0.0020462472,0.0011488611,0.5546185],"genre_scores_gemma":[0.9391739,0.008036628,0.02054315,0.0036438298,0.007320089,0.007230956,0.0061602304,0.0058486615,0.0020425685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9564379,0.0024239474,0.009669442,0.008252498,0.010909803,0.012306396],"domain_scores_gemma":[0.9607447,0.00787473,0.01234763,0.012692499,0.0009692356,0.005371229],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.011947934,0.0052495566,0.0022380983,0.0029538234,0.007714397,0.009823594,0.011958601,0.011939638,0.69688046],"category_scores_gemma":[0.00849449,0.010244969,0.0089010205,0.004690216,0.007508198,0.0074988515,0.011693954,0.009449188,0.00509263],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00812528,0.0014945101,0.00002295736,0.007263132,0.007506366,0.006773542,0.006227505,0.0030603416,0.0067795566,0.6102888,0.33966252,0.0027955263],"study_design_scores_gemma":[0.010484194,0.005028694,0.0000889322,0.006304532,0.0077632163,0.008606194,0.005157973,0.16965827,0.76915044,0.000784101,0.009343827,0.0076296288],"about_ca_topic_score_codex":0.007309895,"about_ca_topic_score_gemma":0.010443786,"teacher_disagreement_score":0.7623709,"about_ca_system_score_codex":0.00016731478,"about_ca_system_score_gemma":0.00949461,"threshold_uncertainty_score":0.99985737},"labels":[],"label_agreement":null},{"id":"W790696949","doi":"10.1016/j.endm.2015.06.021","title":"Weak regularity and finitely forcible graph limits","year":2015,"lang":"en","type":"preprint","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","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":"McGill University","funders":"European Research Council; Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; European Commission","keywords":"Combinatorics; Bounded function; Mathematics; Upper and lower bounds; Partition (number theory); Finitely-generated abelian group; Graph; Discrete mathematics; Mathematical analysis","score_opus":0.046928112627552185,"score_gpt":0.31672372398507637,"score_spread":0.26979561135752417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W790696949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93376476,0.010223054,0.03094152,0.0006523825,0.0009851615,0.002808297,0.00018762604,0.0005418576,0.019895356],"genre_scores_gemma":[0.9195652,0.0009895313,0.077882804,0.00007990088,0.00027862893,0.0001798358,0.00006767814,0.00023516284,0.00072126853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955368,0.00023651599,0.001251309,0.00095188286,0.00076846423,0.0012550313],"domain_scores_gemma":[0.9953821,0.001669014,0.00069980393,0.0018334577,0.0001878518,0.00022777957],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00244844,0.0009088928,0.0014339598,0.0004793771,0.00022734962,0.00018349395,0.0010335629,0.0009503671,0.00005912905],"category_scores_gemma":[0.0029112177,0.0007851781,0.00033600128,0.00038472403,0.00039298585,0.0001383853,0.0016672539,0.0023579656,0.0000056626313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049450977,0.00017262867,0.0002705932,0.0020705438,0.0002353097,0.000015134839,0.003619038,0.00009357521,0.000036150745,0.9913357,0.00086360873,0.0012383015],"study_design_scores_gemma":[0.0006829788,0.00014259644,0.000077275625,0.0007258,0.00022611025,0.000056247853,0.00023024404,0.0029496257,0.00055263407,0.99299467,0.00049052725,0.0008712904],"about_ca_topic_score_codex":0.00003367913,"about_ca_topic_score_gemma":0.00022524674,"teacher_disagreement_score":0.046941288,"about_ca_system_score_codex":0.00031208474,"about_ca_system_score_gemma":0.00038422525,"threshold_uncertainty_score":0.9999436},"labels":[],"label_agreement":null}]}