{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013030301,0.00017580633,0.97409374,0.00021418199,0.00020580989,0.00020117887,0.00016808658,0.0017089875,0.010201868],"genre_scores_gemma":[0.11156731,0.00016195538,0.8750631,0.00016960884,0.00004511549,0.0003000501,0.000446231,0.00047839098,0.011768181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994709,0.00008617652,0.000030190626,0.000074782474,0.00027118987,0.00006684918],"domain_scores_gemma":[0.9993849,0.00019394301,0.000033155728,0.00015155332,0.00018561016,0.00005089988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053732964,0.000870122,0.000511696,0.0015483903,0.0008191083,0.0010193591,0.00076486904,0.00089443836,0.01317531],"category_scores_gemma":[0.0026743005,0.00037714755,0.00054325577,0.0013255936,0.00060550467,0.00095119386,0.0020464074,0.001151314,0.004944677],"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.00042812256,0.00013408081,0.00069039926,0.00018343178,0.000046331785,0.00022259646,0.00024374433,0.026889019,0.03239977,0.23898774,0.0140655525,0.6857093],"study_design_scores_gemma":[0.00034537757,0.00035445608,0.00079749076,0.00012340116,0.000082212304,0.00080260047,0.0001635397,0.46695623,0.10194926,0.36606428,0.062240023,0.00012116299],"about_ca_topic_score_codex":0.00082771864,"about_ca_topic_score_gemma":0.0016162504,"teacher_disagreement_score":0.01317531,"about_ca_system_score_codex":0.0005915871,"about_ca_system_score_gemma":0.0010899242,"threshold_uncertainty_score":0.044075787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95769405,0.00018068867,0.018339036,0.0012426074,0.00014588972,0.000036190533,0.00036656586,0.00021835366,0.021776592],"genre_scores_gemma":[0.9884553,0.00014784565,0.0032353543,0.00013996611,0.00014197583,0.00006024571,0.00035201892,0.00014366885,0.007323503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911505,0.00019078272,0.00002673019,0.0002068288,0.00024451612,0.00021609673],"domain_scores_gemma":[0.9915833,0.0037638799,0.0012841055,0.0010196691,0.00057215936,0.0017770563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012708234,0.0006412202,0.0009084815,0.003368791,0.0028792967,0.003930739,0.001955036,0.0017888644,0.012297507],"category_scores_gemma":[0.008253136,0.00078366126,0.0008341836,0.0016426697,0.004590701,0.004270361,0.0027288029,0.0024907817,0.0007255483],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048084636,0.00008428724,0.0028443974,0.00007430155,0.00003991244,0.0001427377,0.000423125,0.0102588665,0.005390714,0.9707364,0.0036898772,0.0058346773],"study_design_scores_gemma":[0.00014735697,0.00008092165,0.0044261133,0.00005292915,0.000050200615,0.0002685179,0.0003462731,0.08477541,0.0027770658,0.90447426,0.0025121297,0.00008883734],"about_ca_topic_score_codex":0.0022935725,"about_ca_topic_score_gemma":0.0025458399,"teacher_disagreement_score":0.012297507,"about_ca_system_score_codex":0.0022674503,"about_ca_system_score_gemma":0.0010159793,"threshold_uncertainty_score":0.041139245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34537023,0.0012420409,0.3980561,0.0037503133,0.0009741275,0.000477277,0.0034901602,0.0013008765,0.24533889],"genre_scores_gemma":[0.86014616,0.0012154268,0.08748603,0.0011210045,0.00032078486,0.00039034954,0.0022129766,0.00027571907,0.04683162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983669,0.0003546437,0.00010692336,0.00040501467,0.00052476185,0.00024179087],"domain_scores_gemma":[0.99598855,0.0013202046,0.00061254745,0.0008494295,0.00043975085,0.00078947446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076780916,0.00075781776,0.0013473296,0.001570727,0.0029450213,0.0038418889,0.0017922053,0.0017536384,0.014410435],"category_scores_gemma":[0.006593207,0.0012471105,0.00093307905,0.0021527512,0.0024257968,0.006756961,0.0035291489,0.003125113,0.0022360587],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117831514,0.000051222767,0.0003454442,0.00010339214,0.000017476217,0.00013505932,0.00016216397,0.0048057614,0.0010354248,0.97893655,0.0036375576,0.010652199],"study_design_scores_gemma":[0.00002849429,0.000027447992,0.000226806,0.000027225977,0.000013147917,0.00018203947,0.00012587651,0.0051751137,0.0005955304,0.98822355,0.0053607426,0.000013921683],"about_ca_topic_score_codex":0.0014279997,"about_ca_topic_score_gemma":0.0022433845,"teacher_disagreement_score":0.014410435,"about_ca_system_score_codex":0.0012316281,"about_ca_system_score_gemma":0.0012050465,"threshold_uncertainty_score":0.0482077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47728318,0.0029170946,0.18723664,0.004821963,0.0011937962,0.00022928692,0.00082524243,0.00087580044,0.32461694],"genre_scores_gemma":[0.9405793,0.0011371336,0.027615253,0.00056387647,0.0005523305,0.0003134962,0.000349992,0.00014808736,0.028740501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897087,0.0002743482,0.00007360751,0.0001800632,0.00030711887,0.00019395641],"domain_scores_gemma":[0.9974159,0.0014332539,0.0002648279,0.00024704408,0.00028120863,0.0003577849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016916896,0.0009385809,0.0012047413,0.0052096127,0.0040826607,0.005195913,0.0013724954,0.0016408305,0.016677516],"category_scores_gemma":[0.0061958786,0.00072382076,0.0010104785,0.0034577916,0.0048777084,0.010025816,0.0032545647,0.004183539,0.0022520605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016550424,0.000008615909,0.00004239896,0.0000147894,0.0000017308369,0.000025009613,0.00012699538,0.00015121253,0.00011007085,0.9968477,0.0005395463,0.0021153183],"study_design_scores_gemma":[0.000006517314,0.0000053724507,0.000050918803,0.000008885933,0.000003671752,0.000043547014,0.000057179488,0.000835052,0.00011833987,0.99764293,0.0012194349,0.000008146045],"about_ca_topic_score_codex":0.0008145587,"about_ca_topic_score_gemma":0.0012181508,"teacher_disagreement_score":0.016677516,"about_ca_system_score_codex":0.0020488414,"about_ca_system_score_gemma":0.0010743508,"threshold_uncertainty_score":0.055791914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12557505,0.0009037747,0.74343914,0.0027417047,0.0010853802,0.0006643594,0.001441091,0.0025507654,0.12159867],"genre_scores_gemma":[0.5707283,0.00058654015,0.3558057,0.0012006249,0.00030506853,0.0009676962,0.001837286,0.0009235742,0.06764517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917245,0.00018874863,0.0000416393,0.0002191415,0.00019882552,0.00017923562],"domain_scores_gemma":[0.9982486,0.00071834686,0.000082113984,0.0006032277,0.00016578434,0.00018205156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007894897,0.0011800443,0.0014201994,0.0009957383,0.0015312392,0.0014900587,0.002048586,0.0024852504,0.036021665],"category_scores_gemma":[0.005912019,0.0006098226,0.001042732,0.001752456,0.0012728046,0.0027893344,0.00392774,0.0026180297,0.0052929046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011719995,0.00030959188,0.00074929924,0.00039837873,0.00009936306,0.000345665,0.00023574712,0.15324344,0.010237761,0.4113294,0.07200154,0.34987786],"study_design_scores_gemma":[0.00019797878,0.00016285632,0.00026349947,0.000056386558,0.000037357597,0.00024240286,0.000079543504,0.4370917,0.0035072267,0.5441827,0.014140296,0.00003808315],"about_ca_topic_score_codex":0.00083359797,"about_ca_topic_score_gemma":0.0015058416,"teacher_disagreement_score":0.036021665,"about_ca_system_score_codex":0.00082917506,"about_ca_system_score_gemma":0.001098877,"threshold_uncertainty_score":0.1205045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.972001,0.00060556945,0.003906423,0.0007491532,0.000043985416,0.000018911109,0.0008198794,0.000111220135,0.021743758],"genre_scores_gemma":[0.995336,0.00030962616,0.0014475374,0.00006131109,0.000061033694,0.000031359858,0.0004496921,0.000025957928,0.002277512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994905,0.00010217678,0.000024494264,0.00011037793,0.00012518186,0.00014719534],"domain_scores_gemma":[0.9913107,0.0057457443,0.0010894365,0.0005113232,0.0004072781,0.00093560125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062625983,0.00041473916,0.0005934748,0.0022682294,0.0013828092,0.0022273338,0.0012296177,0.00094754406,0.0042106207],"category_scores_gemma":[0.0058534197,0.00042289327,0.00029759307,0.0017952834,0.001443055,0.0018741606,0.0010081029,0.0011570338,0.00032656777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039624055,0.00032926636,0.054234028,0.0010785238,0.0002784555,0.00089604955,0.0027030227,0.09547335,0.07430836,0.62948483,0.0288245,0.108427204],"study_design_scores_gemma":[0.00041329456,0.00037101423,0.05081814,0.00019631948,0.00021498052,0.0021339413,0.001211695,0.22569197,0.023662679,0.6748027,0.020264477,0.00021888429],"about_ca_topic_score_codex":0.0017895389,"about_ca_topic_score_gemma":0.0026201734,"teacher_disagreement_score":0.0042106207,"about_ca_system_score_codex":0.0015434979,"about_ca_system_score_gemma":0.00081961334,"threshold_uncertainty_score":0.0140859485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31702647,0.0021157644,0.65102243,0.0021811123,0.00032329326,0.00029110422,0.0016900096,0.005852865,0.01949695],"genre_scores_gemma":[0.68438655,0.0006952183,0.30021697,0.00049215846,0.00014235775,0.00028454326,0.0024998377,0.0009972579,0.010285112],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846184,0.00028220317,0.00009679767,0.00029764188,0.00039923616,0.0004623828],"domain_scores_gemma":[0.99395895,0.0030994487,0.00035154112,0.0017692855,0.00045272932,0.0003679793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754308,0.0013935196,0.0015637341,0.0013020923,0.0016807121,0.0037308747,0.0037186036,0.001955991,0.0109055005],"category_scores_gemma":[0.009679833,0.0006526685,0.001474602,0.0024682693,0.0012576478,0.007788377,0.004838951,0.002358166,0.0019402223],"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.008126022,0.0006188346,0.0039032686,0.0010393028,0.00025975818,0.00032555073,0.0021230963,0.2211862,0.024921548,0.31111822,0.034871157,0.39150703],"study_design_scores_gemma":[0.0004279162,0.00021546548,0.0007595866,0.00008730252,0.00012372668,0.00021219996,0.00037258715,0.56659836,0.00952268,0.41326037,0.008358397,0.00006144022],"about_ca_topic_score_codex":0.0043661986,"about_ca_topic_score_gemma":0.008436184,"teacher_disagreement_score":0.0109055005,"about_ca_system_score_codex":0.003532261,"about_ca_system_score_gemma":0.0019207771,"threshold_uncertainty_score":0.036482573},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2564877,0.0010226974,0.53602976,0.0025803377,0.0014839566,0.00022463764,0.0019991167,0.0029043986,0.19726743],"genre_scores_gemma":[0.913454,0.0004733466,0.047490165,0.0005058006,0.00023574632,0.00021848286,0.0010213742,0.0006198349,0.03598123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987501,0.0002559344,0.00008308189,0.00023851341,0.0003445337,0.00032775677],"domain_scores_gemma":[0.9965127,0.0013829152,0.00025575882,0.0010472679,0.0005244733,0.00027689486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059346796,0.00058507326,0.0006305162,0.001014238,0.001232094,0.0025026463,0.0009355382,0.0011479914,0.016922558],"category_scores_gemma":[0.0056586764,0.00049123087,0.0007933283,0.0013728001,0.0018179242,0.004331979,0.002168057,0.002198737,0.0027137774],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015889342,0.00002230785,0.00011541379,0.000048470614,0.0000061873693,0.00013838669,0.00037479616,0.001812273,0.0025025795,0.95852387,0.0034164882,0.032880355],"study_design_scores_gemma":[0.000030028294,0.000034098146,0.00019569203,0.000026249432,0.00001012361,0.00013248499,0.00018464637,0.008109458,0.0027990905,0.97924405,0.009205139,0.00002902213],"about_ca_topic_score_codex":0.0010504719,"about_ca_topic_score_gemma":0.0007638966,"teacher_disagreement_score":0.016922558,"about_ca_system_score_codex":0.0006684736,"about_ca_system_score_gemma":0.0007218104,"threshold_uncertainty_score":0.056611598},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50769496,0.002768359,0.3124478,0.0035516815,0.001554365,0.0003048516,0.0006351632,0.001110396,0.16993241],"genre_scores_gemma":[0.89582306,0.0028983352,0.04234727,0.0012668157,0.0009970936,0.0003090673,0.00062764937,0.00054628256,0.05518442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876237,0.00034982114,0.000062934814,0.00031679872,0.00020883855,0.00029917623],"domain_scores_gemma":[0.99546707,0.002622152,0.00035342513,0.00041070508,0.00042639303,0.0007202564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012158134,0.001219475,0.0011787057,0.0036718599,0.0026345907,0.0036486466,0.0020110032,0.0018059089,0.012649987],"category_scores_gemma":[0.006974557,0.0010343421,0.0017032801,0.0041498384,0.003657453,0.008477115,0.0053385976,0.0038813243,0.0010800703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056443,0.000038437996,0.000177388,0.0000496357,0.000010557261,0.00011484421,0.0005573761,0.00075587124,0.00058345846,0.9888058,0.0011096093,0.0077406894],"study_design_scores_gemma":[0.00001625199,0.000013386487,0.00009721519,0.00001462772,0.000009966263,0.00007167201,0.00010631075,0.0017501656,0.00023229218,0.9955155,0.002163129,0.000009381126],"about_ca_topic_score_codex":0.0021274863,"about_ca_topic_score_gemma":0.0014788179,"teacher_disagreement_score":0.012649987,"about_ca_system_score_codex":0.0021159512,"about_ca_system_score_gemma":0.000746514,"threshold_uncertainty_score":0.042318404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80361426,0.00033800505,0.075844795,0.0011785458,0.00041401217,0.00008340596,0.0013631851,0.00047816508,0.11668558],"genre_scores_gemma":[0.92722446,0.0003288716,0.039888624,0.00047379732,0.000116355346,0.0001180293,0.0019981486,0.00030466917,0.029547013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945635,0.00010736628,0.000033274322,0.00011549123,0.000106788706,0.00018081596],"domain_scores_gemma":[0.99825686,0.00057247066,0.00032396676,0.0002741874,0.00027162564,0.00030084804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042356568,0.00048146705,0.000610487,0.0011832347,0.0031499385,0.0039107143,0.001520035,0.0013877837,0.008019205],"category_scores_gemma":[0.0022697116,0.0005787974,0.00064100756,0.0014342695,0.0021680507,0.003039287,0.001336924,0.0019104596,0.001634777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020784012,0.00004755024,0.00067426503,0.000076614415,0.000007802836,0.00019560855,0.000628068,0.0018713374,0.0038436328,0.9788263,0.0033163826,0.010304554],"study_design_scores_gemma":[0.000018488772,0.000023852297,0.0007647398,0.000036785063,0.000013774482,0.0001615554,0.00041698304,0.0057837786,0.0018710397,0.9839662,0.0069216136,0.000021185497],"about_ca_topic_score_codex":0.002120648,"about_ca_topic_score_gemma":0.0032084465,"teacher_disagreement_score":0.008019205,"about_ca_system_score_codex":0.0011238428,"about_ca_system_score_gemma":0.0010189847,"threshold_uncertainty_score":0.026826918},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014966874,0.000107583735,0.997366,0.00004608038,0.000015528674,0.000010379824,0.00002199887,0.00007545403,0.00086028833],"genre_scores_gemma":[0.06498206,0.0007308493,0.9295546,0.000082005514,0.00007806007,0.000112613685,0.00025877432,0.00018361768,0.0040174485],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.00019039116,0.00003235753,0.00012399307,0.0002501821,0.000041525036],"domain_scores_gemma":[0.9977575,0.0010843538,0.00018555991,0.00038297698,0.000486872,0.00010286954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271152,0.0011625299,0.0010820982,0.0013930717,0.00066863955,0.0017018198,0.0016450085,0.0011708875,0.0047250334],"category_scores_gemma":[0.0067256014,0.0008516038,0.00060478057,0.0018065243,0.0010070758,0.0023969326,0.0022418397,0.0021003305,0.002224048],"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.00014597815,0.00013650733,0.00096245983,0.00041586513,0.00007741699,0.0001223408,0.00041058467,0.22353862,0.014597645,0.25370967,0.009384444,0.49649855],"study_design_scores_gemma":[0.000018793633,0.00003258171,0.00020539985,0.000026931293,0.000013060111,0.000117488904,0.00007421325,0.9125141,0.0033287678,0.07802306,0.005618635,0.00002699074],"about_ca_topic_score_codex":0.00231362,"about_ca_topic_score_gemma":0.0036008337,"teacher_disagreement_score":0.0047250334,"about_ca_system_score_codex":0.0003427689,"about_ca_system_score_gemma":0.0009980648,"threshold_uncertainty_score":0.015806854},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5718945,0.0026275287,0.27223063,0.0279751,0.0013931204,0.00021140369,0.0026642752,0.0031325473,0.11787092],"genre_scores_gemma":[0.95240945,0.00054677814,0.029303879,0.0013406905,0.00046779992,0.00020702487,0.0013298182,0.0003319923,0.014062588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980698,0.00039041808,0.00009338267,0.00058175484,0.0003491048,0.00051555247],"domain_scores_gemma":[0.9796728,0.015416876,0.0011786151,0.0018397676,0.0008857752,0.0010061156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025924128,0.0011258514,0.0022302405,0.001014599,0.0035721804,0.0063958676,0.0029048687,0.003748817,0.016637962],"category_scores_gemma":[0.036427964,0.00080442504,0.0012313776,0.0011014647,0.003971485,0.008837768,0.0045730458,0.0039818427,0.0014106815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023768782,0.00025377204,0.0046855803,0.0010238437,0.00017965364,0.00039724706,0.0008839996,0.075491086,0.008058444,0.85093117,0.02998933,0.025729008],"study_design_scores_gemma":[0.0001801457,0.00010263199,0.0009614218,0.000058414847,0.000050275798,0.00013444202,0.00032856222,0.1728997,0.0016748204,0.8199668,0.0036045483,0.000038208073],"about_ca_topic_score_codex":0.0033028682,"about_ca_topic_score_gemma":0.0043216688,"teacher_disagreement_score":0.016637962,"about_ca_system_score_codex":0.0028021312,"about_ca_system_score_gemma":0.0033867548,"threshold_uncertainty_score":0.055659473},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12631965,0.00032068195,0.45019424,0.0013641993,0.0012346265,0.0002102094,0.0007532075,0.0022315555,0.41737157],"genre_scores_gemma":[0.6946819,0.00039668893,0.14495793,0.0007216018,0.0002872634,0.00024109465,0.0011515142,0.0015214613,0.15604055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866474,0.00021610832,0.00006404644,0.00027969058,0.00045974067,0.00031567304],"domain_scores_gemma":[0.99894327,0.00021773858,0.000051965137,0.00044415827,0.00020489788,0.00013804463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065506896,0.0007121168,0.0006721318,0.00074825255,0.0023044269,0.0021162732,0.00077930815,0.0010709368,0.029082509],"category_scores_gemma":[0.0025248001,0.00060191937,0.0008672862,0.00071591674,0.0017918036,0.0039055154,0.0031045896,0.002356771,0.0058720293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109310786,0.000029091236,0.00010487622,0.00004324919,0.000009118546,0.00013292248,0.00013071799,0.0014148006,0.004678695,0.97679645,0.0035751571,0.012975606],"study_design_scores_gemma":[0.00002142188,0.000023328595,0.00009164839,0.000012486016,0.000011099459,0.00016579196,0.00009380619,0.006002449,0.00921399,0.9628038,0.021544391,0.000015876922],"about_ca_topic_score_codex":0.0009477757,"about_ca_topic_score_gemma":0.0009901645,"teacher_disagreement_score":0.029082509,"about_ca_system_score_codex":0.0007726214,"about_ca_system_score_gemma":0.0010183282,"threshold_uncertainty_score":0.097290695},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53711766,0.0068739345,0.36613014,0.004768324,0.0004557599,0.00011010473,0.0014329685,0.0005269295,0.08258413],"genre_scores_gemma":[0.8832171,0.005178385,0.08856727,0.00081863307,0.0008323498,0.00017369188,0.0010412899,0.0006860547,0.019485325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990727,0.00028878837,0.000049964274,0.00020775883,0.00021268144,0.0001679853],"domain_scores_gemma":[0.9915358,0.005430727,0.00091891893,0.00070094183,0.00056247704,0.00085119053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017326016,0.0012545043,0.0013127414,0.0040349145,0.0010886985,0.0035302006,0.002912317,0.0019005556,0.011525444],"category_scores_gemma":[0.013292493,0.0012041458,0.0009190032,0.0035110814,0.0035831465,0.009206072,0.0034645344,0.0043435055,0.0011447202],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026615843,0.00005019374,0.0015405619,0.00017210754,0.000031547574,0.00008986073,0.000531319,0.018436467,0.0022395276,0.93791264,0.004742799,0.033986755],"study_design_scores_gemma":[0.00004173596,0.0000418375,0.00081257476,0.000084138104,0.00003194753,0.000115798626,0.00027534043,0.041177243,0.000717147,0.9518654,0.00481478,0.000021879769],"about_ca_topic_score_codex":0.0018399162,"about_ca_topic_score_gemma":0.0016538099,"teacher_disagreement_score":0.011525444,"about_ca_system_score_codex":0.0013951223,"about_ca_system_score_gemma":0.00043526344,"threshold_uncertainty_score":0.038556457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11660557,0.00017957226,0.86649364,0.00019299422,0.0001859909,0.00015046382,0.00028408083,0.0019429747,0.013964698],"genre_scores_gemma":[0.45781004,0.0003953888,0.5260818,0.00008174544,0.000039127448,0.00011347088,0.00047444215,0.0009257034,0.014078299],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997148,0.000044814416,0.00001790447,0.00007755446,0.00011597302,0.000028943636],"domain_scores_gemma":[0.9995059,0.00016007005,0.000059146398,0.0001621334,0.00006874607,0.000044076394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026563875,0.0008646383,0.0005626547,0.0010249745,0.00042107483,0.0008994383,0.0008587484,0.00085758447,0.0078118145],"category_scores_gemma":[0.0018022311,0.00080247497,0.00065957813,0.00089565705,0.00063679536,0.0013049529,0.0018713474,0.0013663553,0.0010765371],"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.00019397524,0.00012783427,0.0012826881,0.0003654317,0.00008216437,0.0007566605,0.0006799857,0.26768985,0.062293395,0.13059007,0.010070908,0.5258671],"study_design_scores_gemma":[0.000074138305,0.00023968112,0.00093038706,0.00010146986,0.00008940945,0.00090197916,0.00043407702,0.7809477,0.032231145,0.15072325,0.03325309,0.00007369653],"about_ca_topic_score_codex":0.0011169779,"about_ca_topic_score_gemma":0.002279892,"teacher_disagreement_score":0.0078118145,"about_ca_system_score_codex":0.0003371337,"about_ca_system_score_gemma":0.00023575542,"threshold_uncertainty_score":0.02613312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77565014,0.00034990304,0.08282067,0.00046482755,0.00016927105,0.00006419507,0.00069947646,0.00035231526,0.13942915],"genre_scores_gemma":[0.96041167,0.0002784269,0.019589836,0.000103034065,0.000049384875,0.000039987597,0.00055536476,0.00007496459,0.018897345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99974304,0.000034258897,0.000014551354,0.00003711519,0.00009605442,0.00007493536],"domain_scores_gemma":[0.9995759,0.00014185796,0.00006821443,0.000045634384,0.00009339613,0.00007502757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013453902,0.00038823002,0.00044563774,0.0013380144,0.00110086,0.0026697041,0.0007719767,0.0007658358,0.014188124],"category_scores_gemma":[0.00088704855,0.00026534032,0.0003282336,0.0016640162,0.0008562082,0.001954502,0.0011713181,0.0009793582,0.0013769711],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011318942,0.00006938954,0.00086609344,0.00010527959,0.000012027946,0.00038181015,0.0005849121,0.0039423774,0.0057741413,0.9580481,0.002772915,0.027329687],"study_design_scores_gemma":[0.000026489679,0.000044545515,0.0011094655,0.000035445013,0.000014856755,0.00035627797,0.00053157913,0.023066435,0.0039633187,0.9639256,0.006904482,0.000021305688],"about_ca_topic_score_codex":0.0013171855,"about_ca_topic_score_gemma":0.0023862217,"teacher_disagreement_score":0.014188124,"about_ca_system_score_codex":0.0007445134,"about_ca_system_score_gemma":0.000341491,"threshold_uncertainty_score":0.047463953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019822996,0.00008755153,0.99544877,0.000042429354,0.00007598184,0.000034754492,0.000021828182,0.0001583288,0.0021480506],"genre_scores_gemma":[0.037927315,0.00012896681,0.95825857,0.00007734013,0.000060014216,0.0001870205,0.00011390642,0.00018735915,0.0030595784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933225,0.00016250179,0.000025577689,0.00007247277,0.00036522024,0.000041942185],"domain_scores_gemma":[0.9994469,0.00024538985,0.000027135527,0.0000597319,0.00018637574,0.000034473447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011626331,0.0011526182,0.002042686,0.001027826,0.0005388352,0.00093799847,0.0022233592,0.0016217799,0.008897497],"category_scores_gemma":[0.0021383627,0.00071286544,0.001154406,0.0011956181,0.00068409444,0.00093001826,0.0015922793,0.0026545008,0.00194442],"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.00028088744,0.00032345555,0.00038765738,0.0003986258,0.000078942314,0.00011598935,0.00013583736,0.49209854,0.012500179,0.051436882,0.008333485,0.43390957],"study_design_scores_gemma":[0.0000342911,0.000042972297,0.000062859435,0.000010740145,0.0000090910125,0.000026774687,0.0000053267854,0.99261993,0.000604022,0.0042091114,0.002366473,0.000008441718],"about_ca_topic_score_codex":0.0024892502,"about_ca_topic_score_gemma":0.0024201458,"teacher_disagreement_score":0.008897497,"about_ca_system_score_codex":0.00044943776,"about_ca_system_score_gemma":0.0010659385,"threshold_uncertainty_score":0.02976507},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37875947,0.00072372565,0.6015636,0.0006178701,0.00010758621,0.00018628345,0.00072743837,0.00063094345,0.016683083],"genre_scores_gemma":[0.8162389,0.0005419162,0.17755944,0.00012374326,0.00008590365,0.00013971278,0.0009539563,0.00022363586,0.0041327956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997801,0.000043209813,0.000006216184,0.000085326225,0.000041193045,0.000043892986],"domain_scores_gemma":[0.9967874,0.0020826994,0.00036503648,0.00018982924,0.0003331848,0.00024179429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043227777,0.00097212155,0.0006626068,0.0041115596,0.0011399253,0.0013107093,0.0012587568,0.00093184144,0.0062843603],"category_scores_gemma":[0.006037301,0.0006731042,0.00050152984,0.0019072046,0.0014914995,0.002426158,0.00081552216,0.0010933705,0.0004213676],"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.00079704117,0.00026393606,0.014013825,0.0007918162,0.00014964439,0.00035439525,0.00048310033,0.43634146,0.028285103,0.3278626,0.012672781,0.17798425],"study_design_scores_gemma":[0.00006633243,0.00008915345,0.0024749113,0.00006567478,0.000057462905,0.00013688466,0.0001663166,0.6510197,0.006440514,0.33584115,0.0035984241,0.00004355094],"about_ca_topic_score_codex":0.005494249,"about_ca_topic_score_gemma":0.0060499758,"teacher_disagreement_score":0.0062843603,"about_ca_system_score_codex":0.0013613559,"about_ca_system_score_gemma":0.0010743205,"threshold_uncertainty_score":0.021023273},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24014503,0.00044297392,0.75326014,0.00030374678,0.00024668855,0.00017395316,0.00022259644,0.00028866844,0.0049160947],"genre_scores_gemma":[0.91692674,0.00019868971,0.079760626,0.00004171759,0.00006533915,0.00013736215,0.00013353562,0.0001066884,0.0026292908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943215,0.00013335005,0.00003645908,0.0001221892,0.00010003913,0.00017576443],"domain_scores_gemma":[0.9982615,0.0010639717,0.00023229823,0.0001582495,0.00011583922,0.00016818443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012809322,0.0013479802,0.0014262729,0.000907359,0.0011292526,0.0015284665,0.002103449,0.0013592837,0.003959448],"category_scores_gemma":[0.0037953749,0.0009987825,0.0009258606,0.0019099987,0.0010525971,0.0018103557,0.0013542919,0.0011599191,0.0002513008],"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.00047142553,0.00005459635,0.00023549651,0.00009344053,0.000049713904,0.0001118244,0.00008143494,0.9601517,0.0036405742,0.016339239,0.0006851993,0.018085338],"study_design_scores_gemma":[0.000052634725,0.000103643084,0.00013725477,0.0000059486483,0.0000131586185,0.000023150016,0.00003420858,0.9836615,0.0011941813,0.014323821,0.00043839295,0.000012075407],"about_ca_topic_score_codex":0.003117691,"about_ca_topic_score_gemma":0.0035065548,"teacher_disagreement_score":0.003959448,"about_ca_system_score_codex":0.0013031729,"about_ca_system_score_gemma":0.0010474983,"threshold_uncertainty_score":0.013245642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2786234,0.0010017033,0.43972808,0.0012053719,0.00069579255,0.00018698254,0.0021678887,0.0011641497,0.27522662],"genre_scores_gemma":[0.8525325,0.00073202106,0.07052076,0.00048661118,0.00021539745,0.0001757669,0.0018800054,0.0002825525,0.073174395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962056,0.00005663286,0.000023968476,0.000117015115,0.000105070874,0.00007669152],"domain_scores_gemma":[0.99872357,0.0003179705,0.00018932097,0.00018089115,0.00023847228,0.00034982793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002903471,0.00046240562,0.0005244221,0.0018353097,0.001090962,0.0019206803,0.0010252157,0.00074613665,0.020214826],"category_scores_gemma":[0.0023877635,0.00038530616,0.00054096564,0.0017403689,0.000640353,0.002006352,0.0012124752,0.002281051,0.0022186441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081056314,0.00003922731,0.00029979044,0.00004779751,0.000014333839,0.000109475666,0.00013040043,0.002040015,0.0020468384,0.9724089,0.0032272264,0.01955512],"study_design_scores_gemma":[0.00003118391,0.0000426303,0.0009280149,0.000018476225,0.000022253153,0.00020964128,0.00011813596,0.014724128,0.0011283061,0.9612131,0.02153876,0.000025266436],"about_ca_topic_score_codex":0.0009097959,"about_ca_topic_score_gemma":0.0009976485,"teacher_disagreement_score":0.020214826,"about_ca_system_score_codex":0.0008368471,"about_ca_system_score_gemma":0.00030256092,"threshold_uncertainty_score":0.067625344},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12235802,0.00067654956,0.74154127,0.0011284137,0.00069730374,0.00021109033,0.0015870475,0.03718383,0.09461644],"genre_scores_gemma":[0.63484156,0.00020500888,0.33951724,0.00020642062,0.00012123692,0.0004894835,0.0019609763,0.0034971787,0.019160857],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993024,0.00017074823,0.00002760092,0.00010778059,0.00025476396,0.00013663988],"domain_scores_gemma":[0.99898034,0.0003316923,0.000034213503,0.00031289857,0.000277221,0.000063647814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004555108,0.0008236168,0.00094017904,0.00078441773,0.0013397487,0.0012129396,0.0025614032,0.0006155109,0.020953253],"category_scores_gemma":[0.003220927,0.0003514036,0.00061098527,0.0016976803,0.0005294636,0.001017078,0.0011199606,0.0011835108,0.0032035888],"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.0014838913,0.00036961344,0.0029077823,0.000466577,0.0002038707,0.00038925975,0.00061556516,0.3609246,0.013520839,0.097056866,0.08565379,0.4364073],"study_design_scores_gemma":[0.00016298093,0.000042403823,0.00050620444,0.000009796226,0.000025687255,0.000035371955,0.00006746328,0.9603944,0.00724005,0.021556493,0.009940544,0.00001873654],"about_ca_topic_score_codex":0.010263791,"about_ca_topic_score_gemma":0.013605975,"teacher_disagreement_score":0.020953253,"about_ca_system_score_codex":0.00093922636,"about_ca_system_score_gemma":0.0014147143,"threshold_uncertainty_score":0.07009566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85670274,0.0023924944,0.093287945,0.001318938,0.00020328462,0.00005168704,0.0016435902,0.00035160227,0.044047635],"genre_scores_gemma":[0.98064846,0.0009361388,0.013987624,0.00009266201,0.00024333855,0.000078057295,0.0006028252,0.00008581669,0.0033250938],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990978,0.00020171609,0.000066785935,0.00020955321,0.00024872556,0.00017541063],"domain_scores_gemma":[0.99313337,0.003952001,0.0008437849,0.0005055489,0.00054579834,0.0010195135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967945,0.0009912598,0.001360479,0.0067004827,0.0017100256,0.004322666,0.0023733308,0.001443899,0.005492868],"category_scores_gemma":[0.010750933,0.0006244221,0.0006720991,0.00464312,0.0033367786,0.0071713394,0.0017864777,0.0018345994,0.00058292586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039816272,0.00005308259,0.0020540706,0.00018493997,0.00004822506,0.000098992925,0.00044225686,0.0071989475,0.0038759906,0.971077,0.0019535688,0.012614662],"study_design_scores_gemma":[0.00003194115,0.000027754657,0.0014375648,0.000038297843,0.00003067678,0.00013605738,0.00012451496,0.015707567,0.0020706146,0.97898054,0.0013793221,0.00003511135],"about_ca_topic_score_codex":0.00039136998,"about_ca_topic_score_gemma":0.00044531818,"teacher_disagreement_score":0.0067004827,"about_ca_system_score_codex":0.0019159792,"about_ca_system_score_gemma":0.0007409726,"threshold_uncertainty_score":0.018375456},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2539454,0.0010379751,0.27803776,0.0035905633,0.0019975398,0.0003466154,0.003924475,0.0019076278,0.45521197],"genre_scores_gemma":[0.6888967,0.0009970702,0.13354146,0.0019544645,0.00045892177,0.0005432484,0.004557104,0.0013772881,0.16767365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900645,0.00020669532,0.000051921113,0.00021016524,0.00020945452,0.0003153558],"domain_scores_gemma":[0.997647,0.00074277347,0.00018207118,0.00045808102,0.00042019805,0.0005499227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060053664,0.0011466531,0.00088188925,0.0019869201,0.003106829,0.0035361417,0.0013271398,0.001172842,0.033984378],"category_scores_gemma":[0.0020072202,0.00089366746,0.0013781119,0.0020768612,0.0016737077,0.0026332464,0.0021421553,0.0037889834,0.005433941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001044644,0.000060896535,0.00021863199,0.00007871644,0.000015049739,0.00013438231,0.00034282313,0.0013171912,0.00259107,0.9692693,0.01219311,0.013674453],"study_design_scores_gemma":[0.000029732064,0.000017765444,0.00025364175,0.000024147343,0.000012074588,0.00016818567,0.00018874976,0.0035459823,0.0017250804,0.97528994,0.018726064,0.000018604678],"about_ca_topic_score_codex":0.0019890014,"about_ca_topic_score_gemma":0.002849777,"teacher_disagreement_score":0.033984378,"about_ca_system_score_codex":0.0016843589,"about_ca_system_score_gemma":0.0010172364,"threshold_uncertainty_score":0.113689125},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4386121,0.0017150487,0.5198922,0.004421884,0.00032891144,0.00014967904,0.00041079285,0.00055337715,0.033916004],"genre_scores_gemma":[0.92682195,0.0005245568,0.06472361,0.00021294701,0.00015086401,0.00010213374,0.0004735831,0.00012466659,0.0068657165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977729,0.0008110972,0.000107860054,0.00043526775,0.00046472726,0.000408097],"domain_scores_gemma":[0.97343564,0.023197899,0.0008914292,0.0009201872,0.0008235139,0.00073122355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003520801,0.0014879275,0.001740547,0.0015508861,0.00088917004,0.0040126424,0.0029883517,0.0028906323,0.0071180547],"category_scores_gemma":[0.026166309,0.0006953355,0.0019063598,0.0016443126,0.0026550754,0.0045257714,0.0027103866,0.0051643006,0.00027342746],"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.0012374928,0.00035743095,0.002557919,0.00042255866,0.00014598238,0.00022465369,0.00054935936,0.63329583,0.001775921,0.32084206,0.0028084028,0.035782404],"study_design_scores_gemma":[0.000060898383,0.00007459739,0.0003626571,0.00002917175,0.00003701809,0.00005399853,0.000102550395,0.8363314,0.00046533864,0.16180955,0.0006565216,0.000016302576],"about_ca_topic_score_codex":0.0047787135,"about_ca_topic_score_gemma":0.0027808866,"teacher_disagreement_score":0.0071180547,"about_ca_system_score_codex":0.0037016158,"about_ca_system_score_gemma":0.0019962955,"threshold_uncertainty_score":0.026857197},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49949607,0.0010654964,0.346234,0.0032383504,0.0008922253,0.00058281166,0.002690968,0.00269546,0.14310451],"genre_scores_gemma":[0.7745077,0.00055956433,0.18618272,0.00095822103,0.0002138861,0.00038283106,0.0016344906,0.0008080885,0.034752477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899596,0.00021794825,0.000051510036,0.00030920614,0.000190776,0.00023452693],"domain_scores_gemma":[0.99463767,0.0021459442,0.00042321483,0.0017008494,0.0005157806,0.0005765693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063895,0.0010372007,0.0014853942,0.00095212914,0.002380171,0.0024787288,0.0020908674,0.0013581165,0.015174577],"category_scores_gemma":[0.004173,0.0010930654,0.0007612594,0.0016821224,0.0012272473,0.003338487,0.0018766847,0.002130643,0.0021329436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020854692,0.00043463975,0.0029692154,0.0013642684,0.00017830096,0.001223889,0.0006622824,0.027304728,0.04770365,0.7464188,0.046255052,0.12339966],"study_design_scores_gemma":[0.0003580425,0.00015745257,0.0018364437,0.00007109231,0.00012136038,0.0010703646,0.00030838334,0.06649378,0.016326776,0.8944452,0.018746875,0.000064195694],"about_ca_topic_score_codex":0.0018519782,"about_ca_topic_score_gemma":0.0040403814,"teacher_disagreement_score":0.015174577,"about_ca_system_score_codex":0.0013174772,"about_ca_system_score_gemma":0.0011854436,"threshold_uncertainty_score":0.050763965},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31009936,0.0015313148,0.5495955,0.0049649295,0.0010451109,0.00010420639,0.00085445476,0.0010151523,0.13079001],"genre_scores_gemma":[0.90374327,0.0011918861,0.06941131,0.0019470976,0.0008381026,0.00021855625,0.0010914606,0.0007992492,0.02075903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989773,0.00023351646,0.00006072778,0.00032635464,0.00020247634,0.00019970616],"domain_scores_gemma":[0.9912846,0.0060457354,0.0006057014,0.0011418523,0.00046153177,0.00046047402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016305681,0.0008276216,0.001289908,0.0012411671,0.0019473324,0.0024748412,0.0019867234,0.0018717198,0.017403718],"category_scores_gemma":[0.01331182,0.0005494653,0.0010786632,0.0021241605,0.003261947,0.009247719,0.0038598033,0.0041814614,0.0021564746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016216234,0.000040398016,0.00040331014,0.00007755993,0.000012890339,0.00014591862,0.00014568807,0.0030237262,0.0011634384,0.97421604,0.003942909,0.016666044],"study_design_scores_gemma":[0.00003520727,0.000029625648,0.00011473665,0.000014194547,0.000007760691,0.00015564472,0.000030869174,0.0110014705,0.00048123207,0.9862446,0.0018741869,0.000010481434],"about_ca_topic_score_codex":0.0004517951,"about_ca_topic_score_gemma":0.00036424544,"teacher_disagreement_score":0.017403718,"about_ca_system_score_codex":0.00054358935,"about_ca_system_score_gemma":0.0006371788,"threshold_uncertainty_score":0.05822122},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14152004,0.0007131496,0.8401351,0.0011731271,0.00009000705,0.00015140076,0.0005283401,0.0003392185,0.015349634],"genre_scores_gemma":[0.4326997,0.00072757364,0.5555569,0.00025960922,0.000076563956,0.00039728114,0.001285406,0.00039967906,0.008597226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992986,0.000346444,0.00003316061,0.00011891636,0.00010595075,0.00009706633],"domain_scores_gemma":[0.9954775,0.003495534,0.0002828507,0.00023216393,0.0002642623,0.0002475871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022053353,0.0011164667,0.0016404962,0.0016714289,0.001074011,0.0021932288,0.0015277396,0.0028902255,0.00790215],"category_scores_gemma":[0.011592149,0.0009554546,0.0014309408,0.0016115376,0.0013248868,0.0022561185,0.0031449492,0.002241862,0.0010480124],"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.0007579777,0.00022939083,0.0015610913,0.0004239346,0.00013358229,0.0002338672,0.00055020023,0.6406062,0.0025544092,0.27714813,0.011446404,0.06435469],"study_design_scores_gemma":[0.0001588602,0.00012783842,0.0001664755,0.00007904204,0.000021135515,0.000048009682,0.00016023524,0.72919106,0.00074444857,0.2674394,0.0018458783,0.000017586979],"about_ca_topic_score_codex":0.0017139276,"about_ca_topic_score_gemma":0.0021242404,"teacher_disagreement_score":0.00790215,"about_ca_system_score_codex":0.0011253082,"about_ca_system_score_gemma":0.0012234715,"threshold_uncertainty_score":0.026435316},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50504184,0.00038739864,0.41212294,0.00085254456,0.00070444215,0.00027924802,0.0020902597,0.0027094285,0.07581189],"genre_scores_gemma":[0.718972,0.0004019886,0.21757357,0.00051532546,0.00014902062,0.0006422844,0.0025372189,0.00087813026,0.05833051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891305,0.00016503297,0.000068985646,0.0003236527,0.00026902856,0.0002603248],"domain_scores_gemma":[0.996238,0.0013792976,0.00026752445,0.0010295457,0.00055922184,0.00052636984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039151593,0.0010044164,0.0011786799,0.0014385298,0.002639001,0.0033635183,0.0021240755,0.0020631382,0.020221014],"category_scores_gemma":[0.003134919,0.00085561775,0.0010953675,0.0031261903,0.0014040205,0.0029232262,0.0025350945,0.0017796109,0.0032757402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014126053,0.00063662784,0.005124311,0.0008334482,0.00020223689,0.0016235304,0.0013626725,0.039870903,0.0858389,0.70711017,0.015870757,0.14011389],"study_design_scores_gemma":[0.00021872412,0.00037592172,0.0025595021,0.00017060377,0.000110295245,0.00084717764,0.0009967786,0.13048187,0.037096564,0.7966211,0.030396452,0.00012489987],"about_ca_topic_score_codex":0.00095046824,"about_ca_topic_score_gemma":0.0010091735,"teacher_disagreement_score":0.020221014,"about_ca_system_score_codex":0.0008377359,"about_ca_system_score_gemma":0.0007237849,"threshold_uncertainty_score":0.067646086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029502146,0.0005670763,0.9556616,0.001652291,0.00013296469,0.00023853003,0.0006265632,0.00014734337,0.011471498],"genre_scores_gemma":[0.4332615,0.0018938328,0.527231,0.0007364145,0.00039676775,0.0010163698,0.0015720164,0.0004065349,0.033485506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834394,0.0008249724,0.00006178555,0.00029014878,0.00027510923,0.00020399275],"domain_scores_gemma":[0.9968431,0.002216542,0.0002646728,0.00014034321,0.00024622548,0.00028916742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031104675,0.0025132895,0.002560726,0.0016679086,0.0009858378,0.0029261613,0.002028525,0.0034698576,0.01122807],"category_scores_gemma":[0.0076279566,0.0014961539,0.001870846,0.0021446948,0.0016186422,0.003226179,0.002531493,0.0033012829,0.0009961283],"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.0002119247,0.00018374938,0.0005969507,0.00031578308,0.00009084931,0.00015452014,0.00017866385,0.85998833,0.0013276758,0.10246528,0.0065665673,0.027919697],"study_design_scores_gemma":[0.00006101438,0.00007880787,0.00016413227,0.00005034683,0.000038769937,0.000049755527,0.0001047996,0.8931901,0.00039730393,0.10315688,0.0026910477,0.00001708765],"about_ca_topic_score_codex":0.0047781058,"about_ca_topic_score_gemma":0.0036963231,"teacher_disagreement_score":0.01122807,"about_ca_system_score_codex":0.0024664362,"about_ca_system_score_gemma":0.0018517326,"threshold_uncertainty_score":0.037561595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06441904,0.012588406,0.78948736,0.017132428,0.0017536808,0.00029227874,0.002425551,0.0009873245,0.11091387],"genre_scores_gemma":[0.6615189,0.011996254,0.25895858,0.0072517395,0.006628854,0.0009777825,0.0052884794,0.0020759625,0.045303438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343514,0.002033443,0.00020758939,0.0010107536,0.002205774,0.0011072209],"domain_scores_gemma":[0.94472456,0.045424853,0.0021311417,0.0025485787,0.0030513664,0.002119631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074339155,0.0041359495,0.0036569976,0.004214433,0.0023904773,0.006994254,0.0076345,0.004599281,0.03151201],"category_scores_gemma":[0.047861923,0.001951369,0.002827899,0.007346998,0.0033740927,0.017492127,0.008026556,0.013315521,0.0034436206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010270689,0.0010194626,0.0016390162,0.0019912377,0.00023993886,0.0004562183,0.00072976405,0.23717336,0.006350273,0.5986794,0.060914733,0.089779556],"study_design_scores_gemma":[0.00010990396,0.00017340502,0.00081810926,0.00020621471,0.00011460672,0.0002667188,0.00016629603,0.4408956,0.0010126864,0.5481122,0.008067832,0.0000564455],"about_ca_topic_score_codex":0.0032113593,"about_ca_topic_score_gemma":0.004954994,"teacher_disagreement_score":0.03151201,"about_ca_system_score_codex":0.0048556384,"about_ca_system_score_gemma":0.002293412,"threshold_uncertainty_score":0.105418205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39591756,0.0010900744,0.51804274,0.003589085,0.00054863846,0.00078734104,0.008231606,0.0023559465,0.06943704],"genre_scores_gemma":[0.75374275,0.0007741058,0.21549094,0.00042075303,0.00017573542,0.0004060264,0.004019746,0.00044219312,0.024527708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954945,0.00008307435,0.000027765005,0.000117824886,0.00010146201,0.00012030448],"domain_scores_gemma":[0.9985594,0.0006470966,0.00015316447,0.0002486036,0.0001924509,0.00019919494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077346887,0.001518036,0.0016416493,0.0013815061,0.001243734,0.0020570112,0.0025932232,0.0022997984,0.022671182],"category_scores_gemma":[0.0030007488,0.00067906163,0.0009849233,0.0018799887,0.00074674457,0.004430815,0.0021628395,0.0015912297,0.0015148447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003581682,0.00083601504,0.0020080085,0.0025883885,0.00036338187,0.00082829414,0.0006594976,0.31609127,0.035162654,0.33761755,0.06581984,0.23444349],"study_design_scores_gemma":[0.000659848,0.00033164513,0.0015041203,0.00015234324,0.00019605036,0.00045531287,0.00025039367,0.5329261,0.01184507,0.4410241,0.010573757,0.00008133206],"about_ca_topic_score_codex":0.00171112,"about_ca_topic_score_gemma":0.0029041476,"teacher_disagreement_score":0.022671182,"about_ca_system_score_codex":0.0015031477,"about_ca_system_score_gemma":0.0017124311,"threshold_uncertainty_score":0.07584268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7312559,0.0011364672,0.080880135,0.0046397033,0.00073130836,0.00007560096,0.00042114544,0.00054502016,0.18031476],"genre_scores_gemma":[0.9811828,0.0002892157,0.007281246,0.00040797234,0.00030061693,0.00003535786,0.00014383646,0.00005429012,0.010304567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949145,0.00010635228,0.000027888807,0.00008561316,0.00017217004,0.000116535084],"domain_scores_gemma":[0.9992028,0.00021738965,0.00010990536,0.0001289145,0.00011880941,0.00022227723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353654,0.00044763874,0.0009288662,0.0019199263,0.0023441012,0.002741131,0.0011260428,0.0013116621,0.005920701],"category_scores_gemma":[0.0018847783,0.00034493313,0.0008082665,0.0009872862,0.0032551624,0.0032529552,0.0018766855,0.001975195,0.00044646428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008611635,0.000007728252,0.000054093398,0.00000798402,0.0000023402924,0.000037406815,0.00004933868,0.00030095413,0.00020845605,0.9982346,0.00035248004,0.0007360298],"study_design_scores_gemma":[0.0000066503108,0.0000043738096,0.00006428829,0.00000389773,0.0000017811254,0.000044759963,0.000041685238,0.0023133757,0.000073385854,0.9969415,0.0005000991,0.0000041729486],"about_ca_topic_score_codex":0.002348528,"about_ca_topic_score_gemma":0.0020716537,"teacher_disagreement_score":0.005920701,"about_ca_system_score_codex":0.001349701,"about_ca_system_score_gemma":0.0011446587,"threshold_uncertainty_score":0.019806743},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6413188,0.0011969458,0.11571629,0.0026696254,0.00060777954,0.00017516174,0.00071508694,0.00052081264,0.2370795],"genre_scores_gemma":[0.9543382,0.0009531328,0.014707824,0.00072422065,0.00031018606,0.00010489512,0.0009138168,0.00018632502,0.027761295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968886,0.000058634363,0.000014007375,0.000073527066,0.000071141294,0.00009382675],"domain_scores_gemma":[0.9984326,0.0006181281,0.0002834326,0.0001300847,0.00018691245,0.00034891444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039242787,0.00089668174,0.00059739716,0.0023820898,0.0024110842,0.0017684536,0.0011813027,0.0009976351,0.007700018],"category_scores_gemma":[0.002227514,0.00045371673,0.00059390144,0.0011903832,0.0019582924,0.0022808837,0.0014927854,0.0017451122,0.0010107851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015852727,0.000054171,0.00077416725,0.00015846062,0.000019398833,0.00059381354,0.0004613508,0.0031889738,0.005880613,0.971626,0.0065398184,0.010544636],"study_design_scores_gemma":[0.000034410645,0.000020930309,0.00048500503,0.000033678145,0.000016922166,0.0003335032,0.00022243313,0.005758167,0.002087708,0.98646903,0.004524342,0.000013833628],"about_ca_topic_score_codex":0.0012059072,"about_ca_topic_score_gemma":0.0014630584,"teacher_disagreement_score":0.007700018,"about_ca_system_score_codex":0.0010110774,"about_ca_system_score_gemma":0.0005375791,"threshold_uncertainty_score":0.02575916},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6435514,0.002812881,0.17618087,0.01639231,0.0005215434,0.00008402814,0.00094923284,0.0005835249,0.15892425],"genre_scores_gemma":[0.97678953,0.0010531468,0.010176961,0.001153643,0.00047929966,0.00007317454,0.0004605482,0.00012852516,0.009685217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989323,0.00021362356,0.000040870236,0.00030828608,0.00025414533,0.00025078424],"domain_scores_gemma":[0.9884078,0.008150837,0.0005573094,0.0016776694,0.00046353156,0.00074287754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381301,0.0006443338,0.0016881966,0.001291986,0.001773617,0.0034949838,0.0021246911,0.0022823373,0.009052372],"category_scores_gemma":[0.010714435,0.00076834636,0.001542957,0.0016136074,0.005269656,0.009241396,0.002398242,0.004666338,0.00071009557],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014445864,0.000055721015,0.0008455265,0.000113456204,0.000015162865,0.00008347526,0.00034446013,0.0045005125,0.0010356101,0.9839188,0.0028000257,0.0061427304],"study_design_scores_gemma":[0.00002883653,0.000008876141,0.00026518793,0.000008830548,0.0000071638306,0.000028364291,0.000059975897,0.0061876853,0.00020755433,0.992454,0.00073543703,0.000008110339],"about_ca_topic_score_codex":0.0034174903,"about_ca_topic_score_gemma":0.0022355863,"teacher_disagreement_score":0.009052372,"about_ca_system_score_codex":0.0015126877,"about_ca_system_score_gemma":0.0010362535,"threshold_uncertainty_score":0.030283153},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030702418,0.00014694026,0.9953217,0.00007896253,0.000024427158,0.000013629696,0.000011774097,0.00010598831,0.0012264358],"genre_scores_gemma":[0.09649636,0.00074646453,0.89779943,0.00009122385,0.0000616896,0.00006575121,0.000059482663,0.00013156292,0.0045479573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942434,0.0002543641,0.000029513154,0.00009136365,0.00016852365,0.00003198418],"domain_scores_gemma":[0.99908316,0.0005168837,0.00006429786,0.00018766189,0.00011465166,0.000033315897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016359113,0.00067948765,0.000910262,0.00074620673,0.000353584,0.0015381785,0.0010698192,0.0013262717,0.002479494],"category_scores_gemma":[0.0035736521,0.000476796,0.00064713333,0.0010214935,0.0015023499,0.002638494,0.0016530078,0.0021800615,0.00094296184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003411813,0.00008560108,0.00038621586,0.00043719192,0.0000739289,0.0001716366,0.00031033586,0.11055205,0.028840704,0.6279809,0.0028235873,0.2279968],"study_design_scores_gemma":[0.000034268534,0.000041271225,0.00015051936,0.000022352935,0.00002081217,0.0002137476,0.000036527264,0.8664201,0.015321645,0.113600776,0.004100906,0.000037102058],"about_ca_topic_score_codex":0.0006595574,"about_ca_topic_score_gemma":0.0005267338,"teacher_disagreement_score":0.002479494,"about_ca_system_score_codex":0.00042215802,"about_ca_system_score_gemma":0.00067131495,"threshold_uncertainty_score":0.008651614},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33254296,0.0011269404,0.11315624,0.004263888,0.001256457,0.00011765789,0.0010533723,0.0008991232,0.54558337],"genre_scores_gemma":[0.85185,0.00077119004,0.022263467,0.0008867832,0.00055402674,0.00007456955,0.00100666,0.0004221867,0.12217105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946517,0.00008746601,0.00002218936,0.0001686931,0.00014283956,0.00011369303],"domain_scores_gemma":[0.9996699,0.0000627381,0.000043818643,0.00008643536,0.000054679047,0.00008232718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024999314,0.00092244596,0.0007324315,0.0012515748,0.0014622117,0.0025140988,0.0009639201,0.001072483,0.027599417],"category_scores_gemma":[0.00079246133,0.0005002064,0.0006329474,0.0009896561,0.0013824597,0.004962796,0.0028109069,0.003703,0.0038934592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005958329,0.00003901141,0.00011399559,0.00004505989,0.000010503723,0.00010682589,0.00017537623,0.00053076766,0.0018230819,0.9841987,0.0044306233,0.00846635],"study_design_scores_gemma":[0.000033417826,0.00004733523,0.00066254404,0.000013295367,0.00003121932,0.00037920932,0.00020235898,0.003995099,0.0016323143,0.9675637,0.025415573,0.00002394908],"about_ca_topic_score_codex":0.00077415654,"about_ca_topic_score_gemma":0.0008490009,"teacher_disagreement_score":0.027599417,"about_ca_system_score_codex":0.000718105,"about_ca_system_score_gemma":0.00025508497,"threshold_uncertainty_score":0.09232926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69496244,0.0025110708,0.1251253,0.0031627647,0.0004557085,0.00010429575,0.00080998003,0.0005975441,0.17227091],"genre_scores_gemma":[0.94316417,0.0012122482,0.02390837,0.00053142454,0.00046741168,0.00015828983,0.0009468856,0.00020601597,0.029405149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991953,0.00025683793,0.000050203602,0.00014365744,0.00025346107,0.000100597215],"domain_scores_gemma":[0.9963685,0.0019693938,0.00049074786,0.00044611393,0.00019843328,0.0005266457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067792163,0.0006273877,0.0012765026,0.002716238,0.0019479962,0.0032882253,0.0012449406,0.0016540666,0.012201056],"category_scores_gemma":[0.005212851,0.0010932924,0.0008713698,0.0027480181,0.0026190795,0.005365105,0.0028399036,0.0028892348,0.0013235209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011487855,0.000052130476,0.00047901866,0.00011386689,0.000018193752,0.00017429936,0.00037051155,0.004824567,0.001124872,0.97699463,0.004128694,0.01160416],"study_design_scores_gemma":[0.000013971843,0.000016456122,0.00034851796,0.000020687028,0.0000075936427,0.0001663638,0.0001024964,0.0098934285,0.00031695314,0.9873223,0.0017844478,0.0000069030807],"about_ca_topic_score_codex":0.00055042165,"about_ca_topic_score_gemma":0.0006751061,"teacher_disagreement_score":0.012201056,"about_ca_system_score_codex":0.00083829847,"about_ca_system_score_gemma":0.00027084537,"threshold_uncertainty_score":0.040816545},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19726975,0.0015713469,0.6286947,0.005542689,0.0005670676,0.0007967384,0.004559218,0.009035262,0.15196328],"genre_scores_gemma":[0.5678869,0.001281397,0.3386627,0.0015028198,0.00037412657,0.0007233023,0.006251824,0.002585423,0.08073143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799263,0.0003606891,0.00009110018,0.00050629093,0.0005039012,0.00054529525],"domain_scores_gemma":[0.9956654,0.0022791382,0.000388903,0.00087582826,0.00036250852,0.00042826642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095771486,0.0013594733,0.0024125378,0.0015947114,0.0024764368,0.005006304,0.0028584755,0.0017911674,0.037907742],"category_scores_gemma":[0.00643373,0.0010568101,0.0017805692,0.004324111,0.0018296995,0.008724864,0.004132447,0.0038659335,0.004817327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021251526,0.0007050853,0.0010237986,0.0013523727,0.00023219558,0.00026054916,0.00089569844,0.09176078,0.015165768,0.5950844,0.06933036,0.22206378],"study_design_scores_gemma":[0.00041435083,0.000158474,0.00055675174,0.000059817412,0.00014559738,0.00021293205,0.00036990645,0.1773436,0.0052661146,0.7992458,0.016179115,0.000047533405],"about_ca_topic_score_codex":0.0050324923,"about_ca_topic_score_gemma":0.0073516914,"teacher_disagreement_score":0.037907742,"about_ca_system_score_codex":0.0036506495,"about_ca_system_score_gemma":0.0021993022,"threshold_uncertainty_score":0.12681407},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4067413,0.010547938,0.37385818,0.010433832,0.0014972002,0.00014175144,0.0009106175,0.00059508946,0.19527416],"genre_scores_gemma":[0.8784713,0.005988722,0.060793888,0.0017161578,0.0014243907,0.0001812934,0.00077761646,0.00031223166,0.05033437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983891,0.0004398709,0.00010147052,0.00039743914,0.000434561,0.00023755112],"domain_scores_gemma":[0.9921394,0.005233335,0.00069810805,0.0007677032,0.0005085501,0.0006527892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020388404,0.0011088479,0.0018670335,0.0042913486,0.002797376,0.004013027,0.0029615473,0.003040174,0.013507303],"category_scores_gemma":[0.013831871,0.0009998498,0.0012296424,0.007493273,0.005396553,0.01462794,0.0052272542,0.004979826,0.0012769671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032425472,0.000019399025,0.00016803393,0.000043041946,0.000005575794,0.000030418614,0.00021582014,0.00106139,0.00023700492,0.9899559,0.0011157898,0.0071151913],"study_design_scores_gemma":[0.00000613198,0.000005056272,0.00007525476,0.000011144319,0.000004625193,0.000039067538,0.000047631398,0.001662937,0.00007111787,0.99640393,0.0016680928,0.0000049503196],"about_ca_topic_score_codex":0.0015237058,"about_ca_topic_score_gemma":0.001274764,"teacher_disagreement_score":0.013507303,"about_ca_system_score_codex":0.0023861171,"about_ca_system_score_gemma":0.0005751854,"threshold_uncertainty_score":0.04518646},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58241916,0.0015102985,0.35490283,0.003308355,0.00023487027,0.00012457781,0.0012669038,0.000894919,0.05533808],"genre_scores_gemma":[0.9527614,0.0010133414,0.020461243,0.00059244473,0.0003346116,0.00018154024,0.00089667074,0.00028413994,0.023474634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848574,0.00058472465,0.00006349799,0.0003161536,0.00032542812,0.00022452303],"domain_scores_gemma":[0.98944175,0.0060009747,0.0016107665,0.00095758634,0.0009287974,0.0010601394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011937148,0.0009737817,0.00091914454,0.0023930853,0.0010860468,0.0032514527,0.0019757967,0.0013315419,0.008389382],"category_scores_gemma":[0.012208282,0.0009482811,0.0007109112,0.0014805335,0.0028356856,0.006314783,0.0032054605,0.0021919892,0.0010661021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000705763,0.00003423079,0.0004232935,0.000057537585,0.000012435072,0.00006958417,0.00020053175,0.0059530395,0.00058158964,0.98709863,0.0012900301,0.0042085685],"study_design_scores_gemma":[0.000025448791,0.000022545952,0.0003979301,0.00002138993,0.00000978731,0.000106057174,0.00013273212,0.04172578,0.0004276677,0.95566744,0.0014445359,0.000018636943],"about_ca_topic_score_codex":0.0014981256,"about_ca_topic_score_gemma":0.0013742541,"teacher_disagreement_score":0.008389382,"about_ca_system_score_codex":0.0016110076,"about_ca_system_score_gemma":0.0005256462,"threshold_uncertainty_score":0.028065264},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41070274,0.0011964748,0.28389078,0.004790829,0.0003806656,0.00041054838,0.0071118544,0.0010600983,0.2904561],"genre_scores_gemma":[0.84390277,0.00094481657,0.049988028,0.0008826132,0.00022137201,0.00028623117,0.0073195207,0.0005356858,0.09591893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996375,0.000074947035,0.000013935479,0.00012299677,0.000082503866,0.00006821213],"domain_scores_gemma":[0.99870074,0.00047855542,0.00013760476,0.00033829128,0.00015295959,0.00019178404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026438097,0.00056192954,0.00064752105,0.0010138709,0.0012642979,0.0016749055,0.0010475348,0.00078365754,0.03034837],"category_scores_gemma":[0.0022390725,0.00045489508,0.0006299867,0.0014220692,0.0007270631,0.0025772415,0.0015297331,0.0019199337,0.0028208606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017796819,0.00007935613,0.0012168176,0.00021197343,0.000053039923,0.00030111757,0.0002686509,0.008811052,0.0052035106,0.9172943,0.025857031,0.040525146],"study_design_scores_gemma":[0.000029966617,0.000018391414,0.0010033072,0.000025866368,0.000031951182,0.00035807712,0.00013450155,0.015558366,0.0021292532,0.957859,0.02284122,0.000010161072],"about_ca_topic_score_codex":0.0010491671,"about_ca_topic_score_gemma":0.0018818125,"teacher_disagreement_score":0.03034837,"about_ca_system_score_codex":0.000687154,"about_ca_system_score_gemma":0.00045466184,"threshold_uncertainty_score":0.10152537},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17009205,0.000241616,0.8221607,0.0005626979,0.000064420514,0.00010006957,0.0009098374,0.0015301653,0.004338419],"genre_scores_gemma":[0.45070463,0.00012238276,0.5439899,0.000083741135,0.000043822416,0.00010463222,0.0011104702,0.00028001194,0.0035604243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995271,0.000108052984,0.000032718057,0.00013322518,0.000115539064,0.00008329677],"domain_scores_gemma":[0.99741334,0.0018126667,0.00019365788,0.0001926727,0.00022713588,0.00016054037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009978014,0.0008332665,0.001231428,0.0015499198,0.0009487781,0.0021435777,0.0015953918,0.0016208105,0.0065906923],"category_scores_gemma":[0.006761513,0.00086167373,0.0008782215,0.0016309315,0.00072437455,0.003045836,0.0017005274,0.0011738742,0.0007054227],"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.0005465785,0.000110845984,0.0024750922,0.00021277527,0.00007430756,0.00012326485,0.00022580253,0.83724594,0.0037673742,0.045807466,0.0046891347,0.10472143],"study_design_scores_gemma":[0.000016699729,0.000017786044,0.0001590943,0.000007340565,0.0000072013936,0.000014335429,0.000033983888,0.9722005,0.00071303325,0.026489023,0.00033576132,0.0000051648412],"about_ca_topic_score_codex":0.005959823,"about_ca_topic_score_gemma":0.012207459,"teacher_disagreement_score":0.0065906923,"about_ca_system_score_codex":0.0015283739,"about_ca_system_score_gemma":0.0011616112,"threshold_uncertainty_score":0.022048056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0851855,0.0206937,0.46095428,0.094055,0.0063997274,0.000098561846,0.0013705266,0.0028687115,0.32837403],"genre_scores_gemma":[0.81915253,0.0054033417,0.055652328,0.007748393,0.0032449325,0.00019313219,0.0013360633,0.0023575078,0.10491167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968093,0.001243601,0.00018135982,0.00066109415,0.0007224147,0.00038224936],"domain_scores_gemma":[0.98949534,0.0066202017,0.0004885907,0.0019149595,0.00096150086,0.00051951554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352642,0.0009542752,0.0014630683,0.0029958468,0.003769799,0.0059177135,0.0017890614,0.0031590536,0.027524816],"category_scores_gemma":[0.021536354,0.00107425,0.0014060744,0.0032842983,0.008707613,0.022622442,0.006848787,0.0052304566,0.0031815881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022518145,0.000007646916,0.00028172217,0.000037727634,0.00000899557,0.00004107707,0.0005268737,0.0004330937,0.000070161586,0.9766376,0.010101804,0.011830676],"study_design_scores_gemma":[0.000004922672,0.0000027887384,0.000049549566,0.000018176519,0.0000055387113,0.00003737812,0.00013667146,0.0007839742,0.000036396174,0.9877274,0.011191713,0.000005504452],"about_ca_topic_score_codex":0.0030841774,"about_ca_topic_score_gemma":0.0021551822,"teacher_disagreement_score":0.027524816,"about_ca_system_score_codex":0.0019130381,"about_ca_system_score_gemma":0.0008346559,"threshold_uncertainty_score":0.0920797},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19962424,0.0034549572,0.30703634,0.02064838,0.0035666714,0.0001325617,0.00054297113,0.00071204896,0.4642818],"genre_scores_gemma":[0.8165289,0.0032707455,0.06726275,0.0024330954,0.0021391115,0.000117929834,0.0007517102,0.00045994748,0.10703592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996216,0.00010405706,0.000012455155,0.000092640155,0.0000831012,0.00008612445],"domain_scores_gemma":[0.9994399,0.00021046387,0.00004898233,0.00012795249,0.00008332811,0.00008943374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036116716,0.00054740807,0.00071236625,0.0012986121,0.0027192002,0.0021353574,0.0009974616,0.0020721802,0.015020038],"category_scores_gemma":[0.002398631,0.00038656924,0.0008247187,0.0010161564,0.0018152888,0.005316505,0.0036436217,0.003294349,0.0021107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010834702,0.00001130429,0.000064978594,0.000035648653,0.0000054317306,0.000057801535,0.000092382004,0.0013337957,0.0002674799,0.984522,0.0054726074,0.008125757],"study_design_scores_gemma":[0.000003158332,0.0000036134493,0.000029841765,0.000007229432,0.0000037917664,0.000043932538,0.00008127141,0.004489523,0.00026098083,0.985493,0.009579721,0.0000038687394],"about_ca_topic_score_codex":0.0012876384,"about_ca_topic_score_gemma":0.0017793035,"teacher_disagreement_score":0.015020038,"about_ca_system_score_codex":0.00074895873,"about_ca_system_score_gemma":0.00067829096,"threshold_uncertainty_score":0.050247073},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32767186,0.00077073765,0.46707124,0.003331338,0.00045003998,0.00025760083,0.0011263479,0.0021230516,0.19719775],"genre_scores_gemma":[0.94821364,0.00041504911,0.03070729,0.001000911,0.0003663251,0.00026934146,0.000723053,0.0005706601,0.017733756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987526,0.00023225276,0.000046205387,0.00041803226,0.00029692665,0.0002539833],"domain_scores_gemma":[0.9946091,0.0033872218,0.00041453997,0.0008047444,0.00040336596,0.00038104135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090540247,0.001024042,0.001347554,0.0017347231,0.0017216252,0.002706417,0.00173211,0.0013056763,0.01872176],"category_scores_gemma":[0.006236281,0.0010253257,0.0016552551,0.0014339349,0.003438676,0.0066896025,0.004351779,0.0042542964,0.0012204807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066066685,0.00004282183,0.00020208753,0.00007914752,0.00001896778,0.0000766814,0.00015509328,0.0031518778,0.00073780783,0.98370403,0.0032215088,0.0085440045],"study_design_scores_gemma":[0.000020582904,0.000018477549,0.00014361955,0.000013547268,0.000014010696,0.00007868149,0.00003952752,0.01046487,0.00053662184,0.9876056,0.0010560359,0.000008550611],"about_ca_topic_score_codex":0.00081946264,"about_ca_topic_score_gemma":0.0015236652,"teacher_disagreement_score":0.01872176,"about_ca_system_score_codex":0.0010926854,"about_ca_system_score_gemma":0.00072446425,"threshold_uncertainty_score":0.062630534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46644196,0.0066831415,0.44700396,0.0014645765,0.00038369835,0.00023596558,0.003130817,0.001405134,0.07325075],"genre_scores_gemma":[0.8518812,0.0048544602,0.095932946,0.0005916825,0.00086417096,0.00037098862,0.0047346344,0.001148608,0.03962127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978137,0.00032755852,0.00013801813,0.0006601302,0.00072850223,0.0003320217],"domain_scores_gemma":[0.99237025,0.002938448,0.0008693992,0.0015498288,0.0013586929,0.00091342244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010710557,0.0012682744,0.0020687063,0.0060866945,0.0027848473,0.004047799,0.0025436154,0.0021852322,0.0078015835],"category_scores_gemma":[0.008046494,0.0014152552,0.0012105503,0.006491021,0.002548663,0.007961713,0.0035540203,0.0028828967,0.0018534588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020299938,0.00008535967,0.002476579,0.0004711865,0.00009844196,0.0011302842,0.0016269909,0.0047946023,0.00539979,0.93470925,0.009260387,0.039744083],"study_design_scores_gemma":[0.00003079644,0.0000563219,0.002224073,0.00009634416,0.000098602,0.0016560805,0.0006048578,0.015062407,0.0022758886,0.9564969,0.021350395,0.000047273315],"about_ca_topic_score_codex":0.00085826614,"about_ca_topic_score_gemma":0.0011985815,"teacher_disagreement_score":0.0078015835,"about_ca_system_score_codex":0.0010142119,"about_ca_system_score_gemma":0.0006318035,"threshold_uncertainty_score":0.026098907},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016993925,0.003647583,0.90030944,0.0029246581,0.0014718705,0.00032052447,0.0016285642,0.00020023862,0.07250321],"genre_scores_gemma":[0.46908203,0.0073181293,0.445876,0.0027888513,0.0018355155,0.0010866178,0.0042004664,0.00062345853,0.06718897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707544,0.0010059248,0.0001769074,0.0003799567,0.0009001809,0.0004616976],"domain_scores_gemma":[0.99445856,0.0034062571,0.0004773632,0.00030385793,0.0010737606,0.00028017277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003424606,0.0020758673,0.0013463091,0.001776312,0.0012145418,0.005077625,0.0045931092,0.0023483,0.012935679],"category_scores_gemma":[0.010909359,0.0009835763,0.002358425,0.0029509233,0.0015971496,0.0058513917,0.0029961003,0.007912164,0.0014918433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030471274,0.00028985582,0.0007864804,0.0008030818,0.00013967059,0.0007109454,0.00033910593,0.12744659,0.006537134,0.751478,0.030036092,0.081128314],"study_design_scores_gemma":[0.00008055777,0.00009601057,0.0006676,0.0001920368,0.00006676207,0.00023647877,0.00017038199,0.57706785,0.00161207,0.3957507,0.023988325,0.00007115697],"about_ca_topic_score_codex":0.005172683,"about_ca_topic_score_gemma":0.006795037,"teacher_disagreement_score":0.012935679,"about_ca_system_score_codex":0.0035598879,"about_ca_system_score_gemma":0.0026550982,"threshold_uncertainty_score":0.043274105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12059678,0.0004786576,0.85507995,0.0009152589,0.0001990503,0.00023005175,0.0004287311,0.0011918725,0.020879688],"genre_scores_gemma":[0.9131993,0.00024519576,0.07905057,0.000075539836,0.000051529318,0.000059108632,0.0003147804,0.00010093801,0.0069030044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993887,0.000119140954,0.000025528492,0.0000913752,0.00019542254,0.00017995325],"domain_scores_gemma":[0.9989454,0.00039197027,0.00007259092,0.0002744812,0.00022625996,0.00008931017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613224,0.0007123995,0.00081070163,0.0006839982,0.001118768,0.0017341708,0.0014466158,0.0009999112,0.010854677],"category_scores_gemma":[0.003172749,0.0003669621,0.00041067353,0.0012797731,0.00043751558,0.0019238812,0.0017525244,0.0010707934,0.0012641738],"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.0007943117,0.00033730842,0.0011572503,0.00025119758,0.000043448294,0.00031387035,0.00015692224,0.602256,0.024698235,0.10738779,0.011027283,0.25157648],"study_design_scores_gemma":[0.000013878382,0.000039192706,0.00019258462,0.000011886011,0.0000089545765,0.000072751296,0.000038485785,0.9641063,0.0027697508,0.031058447,0.0016801141,0.000007685963],"about_ca_topic_score_codex":0.0011282379,"about_ca_topic_score_gemma":0.002081551,"teacher_disagreement_score":0.010854677,"about_ca_system_score_codex":0.00095875154,"about_ca_system_score_gemma":0.0013493565,"threshold_uncertainty_score":0.03631258},"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":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010685481,0.00042420364,0.120176286,0.0022140238,0.0018458208,0.00044589656,0.110219315,0.5363069,0.22729902],"genre_scores_gemma":[0.015321164,0.0009586596,0.077100836,0.002095706,0.0005718072,0.0011268001,0.2000545,0.43253535,0.27023527],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975834,0.0003164848,0.00021212171,0.00042442573,0.0010150904,0.00044839302],"domain_scores_gemma":[0.9941947,0.0018126239,0.00022930467,0.0014208221,0.0019023039,0.0004402282],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018640644,0.0034916156,0.0018509455,0.0030180595,0.0017484997,0.006131917,0.0052978247,0.0034013952,0.6732566],"category_scores_gemma":[0.013790714,0.0025494448,0.002815103,0.0033275052,0.0016237962,0.0072935577,0.0062110443,0.0053812796,0.61323446],"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.00013863038,0.0000599162,0.00034107934,0.00047358355,0.000024812878,0.00009539091,0.00012185905,0.00039606463,0.00091528264,0.011637146,0.95188105,0.033915244],"study_design_scores_gemma":[0.00011844077,0.000027513246,0.0006257565,0.00023663465,0.000015488813,0.00022381886,0.00007838541,0.0028028903,0.0041389554,0.013870398,0.97778213,0.00007959499],"about_ca_topic_score_codex":0.009748774,"about_ca_topic_score_gemma":0.009130455,"teacher_disagreement_score":0.6732566,"about_ca_system_score_codex":0.002786246,"about_ca_system_score_gemma":0.004183714,"threshold_uncertainty_score":0.4660598},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18662558,0.0013745311,0.6789919,0.0006922962,0.0013216921,0.00021286645,0.00046788546,0.001122585,0.12919073],"genre_scores_gemma":[0.7336094,0.002147356,0.20294802,0.0005907894,0.00062649394,0.0005074437,0.00078076473,0.0014121787,0.05737761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987626,0.00030510843,0.00010728797,0.00028116218,0.0003500408,0.0001938178],"domain_scores_gemma":[0.9977392,0.0011341928,0.0002046267,0.0002600935,0.00034725503,0.00031462763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010398711,0.0008255005,0.0005830948,0.003895326,0.0025544334,0.0044017737,0.0014310954,0.0014821324,0.008697806],"category_scores_gemma":[0.004994207,0.0006936802,0.0012124417,0.0022719996,0.0017292695,0.0066482546,0.002993509,0.0028010176,0.002150466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004567977,0.000057219968,0.00012320607,0.00006104735,0.0000079460815,0.00010924336,0.00046482103,0.0009801518,0.0015240001,0.97921216,0.0012367885,0.016177658],"study_design_scores_gemma":[0.000018667926,0.000027976985,0.00011686151,0.000041091986,0.000019004066,0.00020191628,0.00022851894,0.0054129087,0.0014419891,0.97940093,0.013064083,0.000026020827],"about_ca_topic_score_codex":0.00051261764,"about_ca_topic_score_gemma":0.00071617775,"teacher_disagreement_score":0.008697806,"about_ca_system_score_codex":0.0006585945,"about_ca_system_score_gemma":0.00046481547,"threshold_uncertainty_score":0.02909708},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38766566,0.005613867,0.3750908,0.0064738085,0.0032911783,0.0001840488,0.0009593594,0.0012037515,0.21951756],"genre_scores_gemma":[0.83956057,0.0026837215,0.09002688,0.0015378575,0.0022727908,0.00033197214,0.00066511007,0.0006328773,0.062288262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986364,0.00029359446,0.00006626915,0.0002697493,0.0005372588,0.0001966406],"domain_scores_gemma":[0.9945972,0.0029708135,0.00065896806,0.0007577493,0.00054538494,0.00046981705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941008,0.0012024792,0.0009027025,0.0042146854,0.0019970739,0.004034932,0.0019801124,0.002837188,0.01034398],"category_scores_gemma":[0.011318054,0.0009428199,0.00066165585,0.0048946105,0.0036775426,0.005485296,0.0030576931,0.0044239485,0.0019647037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084012274,0.000025843603,0.00020422548,0.00005977343,0.0000063504062,0.00007903543,0.00015463882,0.0024581738,0.001357574,0.9763299,0.0032686784,0.015971802],"study_design_scores_gemma":[0.000018604705,0.000018371267,0.0001985526,0.000026675489,0.0000087739045,0.0001927439,0.00003949215,0.010526568,0.0010947934,0.9827063,0.005141063,0.0000280785],"about_ca_topic_score_codex":0.000636469,"about_ca_topic_score_gemma":0.00073891814,"teacher_disagreement_score":0.01034398,"about_ca_system_score_codex":0.0016491329,"about_ca_system_score_gemma":0.0006934574,"threshold_uncertainty_score":0.034604013},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008095092,0.00027005508,0.98547155,0.0004259659,0.000107533335,0.000060553062,0.00010030515,0.0003948349,0.005074025],"genre_scores_gemma":[0.20628834,0.0003869083,0.7863872,0.00022174013,0.00015733794,0.00022503408,0.00030689914,0.00016953188,0.0058569466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992811,0.00016776737,0.000030661817,0.00013349176,0.00025663152,0.00013043797],"domain_scores_gemma":[0.9992974,0.00030727085,0.000053811986,0.000124877,0.00016336812,0.00005331003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008252516,0.0011059216,0.0011216999,0.00077497587,0.0006332724,0.0016448692,0.0018674966,0.0018263411,0.0066419877],"category_scores_gemma":[0.00311367,0.0006014491,0.0007362394,0.001072764,0.00063451176,0.0016423496,0.0021338835,0.0017091264,0.0010621728],"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.00011291135,0.0001765169,0.0002996583,0.00020965979,0.00006056114,0.00010405136,0.00009386425,0.7506986,0.00940644,0.088903606,0.012639931,0.13729414],"study_design_scores_gemma":[0.000011425476,0.000012410554,0.00004598354,0.000007416393,0.0000056827785,0.00001954321,0.000024187088,0.9721414,0.00042589658,0.026155647,0.0011466552,0.0000036513698],"about_ca_topic_score_codex":0.00240533,"about_ca_topic_score_gemma":0.004439184,"teacher_disagreement_score":0.0066419877,"about_ca_system_score_codex":0.0010702494,"about_ca_system_score_gemma":0.0023059906,"threshold_uncertainty_score":0.022219658},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10598086,0.00072042557,0.8760058,0.00033640797,0.00027213132,0.00033166623,0.00029819418,0.001211543,0.014842988],"genre_scores_gemma":[0.5223924,0.00028853948,0.46891746,0.0001997413,0.00008467595,0.0004754683,0.00037624117,0.00017764472,0.0070877415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995691,0.00013575764,0.000019180688,0.000059066482,0.00012382491,0.00009300752],"domain_scores_gemma":[0.9993173,0.0004201931,0.000042944688,0.000057655405,0.00008671717,0.00007529937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068547146,0.0006985961,0.0009847812,0.0011392338,0.0005050431,0.0010135106,0.0017667154,0.0013204588,0.006209776],"category_scores_gemma":[0.0012166521,0.0005023034,0.0007554963,0.0011963181,0.00041008668,0.0009099347,0.0009851243,0.00072488864,0.00057260745],"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.00033984953,0.0003103426,0.0006113139,0.00018944521,0.00009151464,0.00014126628,0.000071888564,0.8423797,0.0047183232,0.010486028,0.0025773754,0.13808309],"study_design_scores_gemma":[0.000079529076,0.00011377117,0.00016500162,0.000010286944,0.00002707384,0.00003262214,0.000021910828,0.9951096,0.0006119511,0.0024621268,0.0013548854,0.000011356245],"about_ca_topic_score_codex":0.004076378,"about_ca_topic_score_gemma":0.005730472,"teacher_disagreement_score":0.006209776,"about_ca_system_score_codex":0.00086746836,"about_ca_system_score_gemma":0.0013617759,"threshold_uncertainty_score":0.020773709},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09139881,0.010953526,0.31648853,0.06782664,0.008258539,0.0003324825,0.014099845,0.009752551,0.48088902],"genre_scores_gemma":[0.39437047,0.0105921645,0.0716081,0.013337318,0.0027804906,0.0008978466,0.011964564,0.0048067593,0.48964232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960497,0.00073871564,0.0001636742,0.0011370194,0.0012555913,0.0006553914],"domain_scores_gemma":[0.98593605,0.0051730606,0.0008349784,0.0028892986,0.0038115177,0.0013551591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031321114,0.0016625546,0.0023488286,0.0023788773,0.0042099752,0.008443112,0.0033917848,0.00330227,0.11793392],"category_scores_gemma":[0.029275695,0.0012019548,0.002203822,0.002275272,0.0032303343,0.018761128,0.0053579975,0.0062479884,0.05552763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043212058,0.00020460928,0.0045467126,0.0008615095,0.00011466907,0.0004896199,0.0005420955,0.0058396733,0.0029091774,0.6711694,0.20718545,0.10570494],"study_design_scores_gemma":[0.00009505057,0.000097818585,0.0024694586,0.00039575933,0.00011920318,0.0012386728,0.0007991685,0.032298923,0.004625533,0.7782776,0.1794155,0.00016739074],"about_ca_topic_score_codex":0.0046788924,"about_ca_topic_score_gemma":0.0046155443,"teacher_disagreement_score":0.11793392,"about_ca_system_score_codex":0.0037839906,"about_ca_system_score_gemma":0.0033547033,"threshold_uncertainty_score":0.39452827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8687887,0.00071460474,0.098523006,0.0009161708,0.00006019713,0.00004024164,0.00014977943,0.00025324753,0.030554015],"genre_scores_gemma":[0.9830041,0.00019496359,0.011174686,0.000117698866,0.000056267607,0.000045622728,0.0001927501,0.000054823762,0.0051590675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.00020834424,0.00003037617,0.00020461752,0.0001863659,0.00012946854],"domain_scores_gemma":[0.9964142,0.0018614985,0.00044017838,0.00050435093,0.00028383135,0.00049588806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073521683,0.0004224517,0.00049529155,0.0012891871,0.0011145513,0.0019447125,0.0011076697,0.0007886487,0.0024287861],"category_scores_gemma":[0.0053863227,0.00033948736,0.0006387432,0.00052710547,0.004104753,0.0040264344,0.0020287363,0.0017430484,0.00030198973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007604911,0.00002266823,0.0011370725,0.000046921,0.0000088493325,0.000109427296,0.000291272,0.0046813884,0.0033385523,0.9854843,0.00052018225,0.0042834305],"study_design_scores_gemma":[0.000012331528,0.000029210347,0.0005596229,0.000015383172,0.0000069578778,0.00015363653,0.00013527018,0.017501023,0.0023971817,0.9771678,0.0020099753,0.000011552647],"about_ca_topic_score_codex":0.00048664582,"about_ca_topic_score_gemma":0.00055860076,"teacher_disagreement_score":0.0024287861,"about_ca_system_score_codex":0.0011658465,"about_ca_system_score_gemma":0.00027559558,"threshold_uncertainty_score":0.008458912},"labels":[],"label_agreement":null}]}