{"meta":{"query_hash":"2f9ea72872c9","filters":{"venue":"Discrete Applied Mathematics"},"cohort_total":520,"direct_labels_cover":0,"predictions_cover":520,"exported":520,"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/2f9ea72872c9","api":"https://metacan.xera.ac/api/v1/cohort?venue=Discrete+Applied+Mathematics"},"results":[{"id":"W118899274","doi":"10.1016/j.dam.2015.06.012","title":"The simultaneous metric dimension of graph families","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric dimension; Mathematics; Combinatorics; Vertex (graph theory); Intrinsic metric; Metric (unit); Discrete mathematics; Generator (circuit theory); Convex metric space; Graph; Metric space; Line graph; Pathwidth","score_opus":0.018101287191006572,"score_gpt":0.23859046555515936,"score_spread":0.2204891783641528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118899274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1839868,0.002326638,0.7749028,0.000759181,0.0008030571,0.0011227989,0.000008413114,0.0007238491,0.03536642],"genre_scores_gemma":[0.8775969,0.000061570514,0.12217285,0.000058640588,0.000004371862,0.00001565508,0.0000017920929,0.000013200112,0.0000750348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985177,0.000020685115,0.00042043757,0.00023082196,0.00054897054,0.0002613907],"domain_scores_gemma":[0.99793684,0.0006844571,0.00022975495,0.00085492106,0.00017201043,0.00012203529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676943,0.00016150098,0.00023992502,0.00014524999,0.00015536732,0.00008232998,0.00073938555,0.000058194135,6.234502e-7],"category_scores_gemma":[0.000240604,0.00009721112,0.00007529447,0.0009107991,0.0001483914,0.00007017106,0.00028719127,0.00010390648,0.000038793547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064375345,0.00006712538,0.000006736672,0.000038233462,0.000027993934,0.0000028575912,0.0018769152,0.0027364623,0.002858382,0.9865781,0.0005884565,0.0052122683],"study_design_scores_gemma":[0.0005095373,0.00010015025,0.0000038396806,0.000032984517,0.000030494955,0.00001010183,0.0017998745,0.13863409,0.012014897,0.84586495,0.0007551288,0.00024395535],"about_ca_topic_score_codex":0.000009120819,"about_ca_topic_score_gemma":0.0000019055763,"teacher_disagreement_score":0.6936101,"about_ca_system_score_codex":0.000012001672,"about_ca_system_score_gemma":0.0000427369,"threshold_uncertainty_score":0.39641547},"labels":[],"label_agreement":null},{"id":"W1418567529","doi":"10.1016/j.dam.2015.09.015","title":"Counting the number of non-equivalent vertex colorings of a graph","year":2015,"lang":"en","type":"article","venue":"Discrete Applied 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":"Polytechnique Montréal","funders":"Fonds De La Recherche Scientifique - FNRS","keywords":"Mathematics; Combinatorics; Upper and lower bounds; Degree (music); Vertex (graph theory); Discrete mathematics; Graph","score_opus":0.034397920620340305,"score_gpt":0.3151338333837076,"score_spread":0.2807359127633673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1418567529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2306872,0.000034361117,0.70074314,0.000120850054,0.00007064292,0.0005654778,0.000005584857,0.00006043422,0.0677123],"genre_scores_gemma":[0.88277036,0.000007209057,0.11705917,0.000025278157,0.000007979726,0.000044381613,0.0000010009741,0.000016058817,0.000068556015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834156,0.000020815103,0.00042589026,0.00021145832,0.0007056625,0.00029458868],"domain_scores_gemma":[0.9981914,0.0003505789,0.00031614787,0.0008731382,0.00018045184,0.00008829349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468946,0.00014474487,0.00030394606,0.000066873814,0.00006195141,0.000034459583,0.001289123,0.00004599589,0.000008549927],"category_scores_gemma":[0.000098716024,0.0000988392,0.00008815118,0.00060429476,0.0002782206,0.00014069027,0.00054190354,0.00014844506,0.000032872216],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014170559,0.00007104419,0.00012446857,0.00016886127,0.00003513842,0.0000012706155,0.0038854613,0.00009737443,0.0057065324,0.98922354,0.00011714388,0.0005549828],"study_design_scores_gemma":[0.0006669365,0.000059032885,0.00012891048,0.000093586415,0.000024463257,0.000012020737,0.0027313228,0.016759915,0.03014195,0.9489302,0.00023671522,0.00021491303],"about_ca_topic_score_codex":0.0000058161654,"about_ca_topic_score_gemma":6.7229496e-7,"teacher_disagreement_score":0.65208316,"about_ca_system_score_codex":0.000023292008,"about_ca_system_score_gemma":0.00006972165,"threshold_uncertainty_score":0.40305457},"labels":[],"label_agreement":null},{"id":"W1517912555","doi":"10.1016/j.dam.2016.07.011","title":"The set chromatic number of random graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Security Agency; Ryerson University","keywords":"Mathematics; Chromatic scale; Combinatorics; Zigzag; Random graph; Set (abstract data type); Graph; Discrete mathematics; Range (aeronautics); Computer science; Geometry","score_opus":0.01362310397871623,"score_gpt":0.28564018366956956,"score_spread":0.2720170796908533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517912555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034814726,0.000050888313,0.9845634,0.00024257936,0.00003949861,0.0003388694,0.0000048662473,0.0001907881,0.0110876495],"genre_scores_gemma":[0.6117958,0.00029080434,0.3873539,0.000074774005,0.000021607362,0.000096716736,0.0000010721024,0.000025307912,0.00034004854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988193,0.000017432643,0.00040766655,0.0001929587,0.00031238655,0.00025028177],"domain_scores_gemma":[0.99800617,0.00074715685,0.00025373092,0.0008815742,0.00005852441,0.00005287216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040527168,0.00015389266,0.00025874452,0.000030081972,0.00012224389,0.00005579257,0.0009082635,0.000046066754,0.000015437123],"category_scores_gemma":[0.00011379208,0.0000721268,0.000099993114,0.0002655097,0.00017569806,0.00020409371,0.00023129067,0.0000610592,0.000071450406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010804281,0.000024734,0.0000120257055,0.000066723806,0.000027058531,0.0000013628303,0.0004713512,1.8290172e-7,0.0155676855,0.9506172,0.00068447023,0.032516435],"study_design_scores_gemma":[0.0005991366,0.000021422375,0.000020321737,0.0000882931,0.0000131199595,0.000011566562,0.000077788354,0.00037357758,0.15341671,0.8436372,0.0015819727,0.00015884134],"about_ca_topic_score_codex":6.9444957e-7,"about_ca_topic_score_gemma":3.8439566e-7,"teacher_disagreement_score":0.60831434,"about_ca_system_score_codex":0.000015310661,"about_ca_system_score_gemma":0.000021874379,"threshold_uncertainty_score":0.29412457},"labels":[],"label_agreement":null},{"id":"W1522469957","doi":"10.1016/j.dam.2012.12.006","title":"The vertex leafage of chordal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Wilfrid Laurier University","funders":"Engineering and Physical Sciences Research Council","keywords":"Combinatorics; Chordal graph; Mathematics; Vertex (graph theory); Interval graph; Discrete mathematics; Treewidth; Tree (set theory); Graph; Pathwidth; 1-planar graph; Line graph","score_opus":0.019421689100344953,"score_gpt":0.2834221397538592,"score_spread":0.26400045065351424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522469957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028687667,0.00043951866,0.9171548,0.00017787641,0.00021476742,0.0005562835,0.0000053236786,0.00014975932,0.052614026],"genre_scores_gemma":[0.8875532,0.00004803141,0.11210061,0.000034814704,0.000023158062,0.00005989696,0.0000014273897,0.000020508785,0.00015831196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848074,0.00002949528,0.00031503508,0.00016888883,0.00047741365,0.0005284456],"domain_scores_gemma":[0.9980021,0.0006012691,0.00015284898,0.0010716289,0.000046370278,0.00012576867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009110802,0.00014886868,0.00019914495,0.000070112335,0.00021321111,0.000062099774,0.0013458277,0.000047039564,0.00000982143],"category_scores_gemma":[0.000083055784,0.00009541975,0.000092134,0.00046765624,0.00025074478,0.00024054566,0.00041397434,0.00017648659,0.000075452124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000523199,0.000052180207,0.000029535388,0.00003826076,0.000020409876,3.1297526e-7,0.0013278207,0.0000045642246,0.005358937,0.98666716,0.00015677953,0.006338838],"study_design_scores_gemma":[0.00025853465,0.000031861946,0.00021920538,0.000017451855,0.000010739898,0.0000071812224,0.00065542903,0.0028350723,0.025301307,0.9685054,0.0019506479,0.0002071788],"about_ca_topic_score_codex":8.0812595e-7,"about_ca_topic_score_gemma":7.4966533e-7,"teacher_disagreement_score":0.85886556,"about_ca_system_score_codex":0.000015358411,"about_ca_system_score_gemma":0.00002065441,"threshold_uncertainty_score":0.38911045},"labels":[],"label_agreement":null},{"id":"W1577789785","doi":"10.1016/j.dam.2017.09.003","title":"Partially directed snake polyominoes","year":2017,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Geometric and Algebraic Topology","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":"Université du Québec à Trois-Rivières","funders":"","keywords":"Polyomino; Inscribed figure; Rectangle; Mathematics; Combinatorics; Conjecture; Focus (optics); Class (philosophy); Computer science; Geometry; Physics; Artificial intelligence","score_opus":0.055091542873715794,"score_gpt":0.3222935187412614,"score_spread":0.26720197586754557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577789785","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.312915,0.00122199,0.13264793,0.0026649756,0.004282333,0.0069173663,0.00088005495,0.004799147,0.5336712],"genre_scores_gemma":[0.75311196,0.00017495545,0.23832327,0.00013951179,0.0009224851,0.00065489183,0.00024582417,0.0003444079,0.006082709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960651,0.000047746762,0.0012367083,0.00097388256,0.000749417,0.0009271681],"domain_scores_gemma":[0.99382013,0.0009037058,0.0016728974,0.0031714565,0.00014419452,0.00028758709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007421648,0.0009462288,0.0017952597,0.00035903428,0.0004085898,0.00033698825,0.0014630291,0.0010063032,0.0005818453],"category_scores_gemma":[0.0013912662,0.00080885825,0.00046913835,0.00017303434,0.00043182072,0.000060509814,0.0020907198,0.0011825637,0.00032233537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000341038,0.00050903787,0.00003808196,0.0028509335,0.0007093987,0.00008570734,0.0028303363,0.000015393167,0.0004534066,0.9722083,0.016196063,0.00406922],"study_design_scores_gemma":[0.0006087395,0.00003141635,0.00013094315,0.0002699369,0.0005449575,0.00003136852,0.00041487964,0.00074976985,0.0015009958,0.99195206,0.0027489606,0.0010159599],"about_ca_topic_score_codex":0.00002936025,"about_ca_topic_score_gemma":0.000044134817,"teacher_disagreement_score":0.5275885,"about_ca_system_score_codex":0.00009313281,"about_ca_system_score_gemma":0.00025284762,"threshold_uncertainty_score":0.9994362},"labels":[],"label_agreement":null},{"id":"W1585664102","doi":"10.1016/j.dam.2016.02.011","title":"Game brush number","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Stochastic processes and statistical mechanics","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":"Toronto Metropolitan University","funders":"","keywords":"Brush; Combinatorics; Mathematics; Vertex (graph theory); Graph; Complete graph; Discrete mathematics","score_opus":0.03334031006903643,"score_gpt":0.31305648943782455,"score_spread":0.2797161793687881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585664102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051842923,0.000008472643,0.9280835,0.00020766804,0.00010909445,0.0003713871,0.00006705382,0.00026339185,0.06570517],"genre_scores_gemma":[0.6236707,0.00001909083,0.37383637,0.00016090472,0.00015453821,0.00015389017,0.000005421561,0.00011376954,0.0018853289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980951,0.000009676397,0.000555235,0.00035723523,0.0004732662,0.00050948904],"domain_scores_gemma":[0.99748015,0.0014227602,0.00021107034,0.0006073916,0.000083161576,0.00019548995],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027711006,0.0003106282,0.0004678848,0.000038538154,0.0000779993,0.00004671168,0.00035709274,0.00013850072,0.0010786955],"category_scores_gemma":[0.000732678,0.00018950403,0.00010149193,0.00016749903,0.000102236074,0.00007098338,0.00014353063,0.00011986918,0.0014345958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014478166,0.000099412835,0.0000026251903,0.00027304975,0.00003849579,0.0000059273348,0.00033098608,1.0099153e-7,0.0023687838,0.9892426,0.0018026069,0.005820922],"study_design_scores_gemma":[0.00063554914,0.000027125703,0.0000047529784,0.0001671803,0.0000813536,0.000025228781,0.00017926804,0.0003701819,0.0029114098,0.9939429,0.0013043277,0.0003507279],"about_ca_topic_score_codex":8.472864e-7,"about_ca_topic_score_gemma":0.0000018661775,"teacher_disagreement_score":0.6184864,"about_ca_system_score_codex":0.00005072481,"about_ca_system_score_gemma":0.000040428222,"threshold_uncertainty_score":0.9998345},"labels":[],"label_agreement":null},{"id":"W1596352210","doi":"10.1016/j.dam.2011.04.003","title":"A closed-form solution for the optimal release times for the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>F</mml:mi><mml:mn>2</mml:mn><mml:mo>|</mml:mo></mml:math> deteriorating jobs <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mo>|</mml:mo><mml:mo>∑</mml:mo><mml:msub><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math> problem","year":2011,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Hong Kong Polytechnic University","keywords":"Monotone polygon; Job shop scheduling; Scheduling (production processes); Mathematics; Mathematical optimization; Algorithm; Computer science; Routing (electronic design automation); Geometry","score_opus":0.01935625462398985,"score_gpt":0.23663805969992807,"score_spread":0.21728180507593822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596352210","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4445972,0.0044648023,0.02229815,0.0017292949,0.008364273,0.0004211998,0.0026036252,0.0016781555,0.5138433],"genre_scores_gemma":[0.93304265,0.0038353123,0.033591453,0.003051076,0.006370661,0.009913153,0.0053499155,0.0042403257,0.0006054683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9709564,0.0010642458,0.0069024833,0.0055498476,0.0073667904,0.0081602475],"domain_scores_gemma":[0.9744956,0.00651992,0.007662839,0.0068798815,0.00080881955,0.0036329494],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.007146333,0.0035480584,0.0013306312,0.0018004716,0.0068150638,0.0058272574,0.0077341627,0.0078156935,0.36424738],"category_scores_gemma":[0.005682029,0.006522737,0.0067365607,0.0038555837,0.005093101,0.0044629015,0.006158912,0.005853463,0.0048118974],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053014364,0.0011108749,0.000013388448,0.005370285,0.0064053442,0.0017474857,0.0070093344,0.019471098,0.004665432,0.62675864,0.31719032,0.0049563907],"study_design_scores_gemma":[0.005280485,0.0032878867,0.00004121902,0.0032873855,0.005895326,0.002867085,0.0063068713,0.28147018,0.6818323,0.0011117366,0.0038433587,0.004776121],"about_ca_topic_score_codex":0.0035340802,"about_ca_topic_score_gemma":0.0031972267,"teacher_disagreement_score":0.6771669,"about_ca_system_score_codex":0.00009107416,"about_ca_system_score_gemma":0.004605797,"threshold_uncertainty_score":0.99772424},"labels":[],"label_agreement":null},{"id":"W1599403872","doi":"10.1016/j.dam.2016.01.026","title":"Global cycle properties of locally isometric graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Combinatorics; Isometric exercise; Conjecture; Chordal graph; Neighbourhood (mathematics); Discrete mathematics; Indifference graph; Graph; Vertex (graph theory); Mathematical analysis","score_opus":0.021100355340927864,"score_gpt":0.26408884339656225,"score_spread":0.2429884880556344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599403872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066365816,0.0001373042,0.9222874,0.00015191502,0.000042135413,0.0003531397,0.000010134064,0.0001514763,0.010500671],"genre_scores_gemma":[0.8886542,0.000029443361,0.11113998,0.00002810432,0.00000908034,0.00004448172,3.1733856e-7,0.0000140373995,0.00008036141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827445,0.00002205168,0.00039288038,0.00032705703,0.00058103906,0.00040251188],"domain_scores_gemma":[0.9985353,0.00013296632,0.00017143709,0.00093480246,0.00010999541,0.00011549404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037150198,0.0001802364,0.0002913396,0.00020915201,0.00006985473,0.000045674922,0.0013125322,0.00006123956,0.000013267907],"category_scores_gemma":[0.0001256312,0.00010585361,0.00009491439,0.0015213018,0.00028422524,0.0002554217,0.00048179092,0.00005846481,0.00008155775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000124897715,0.00008106037,0.000056109267,0.00011365592,0.00002546485,0.0000016969252,0.00022109316,0.000017968678,0.02469767,0.95592576,0.000033014672,0.018814012],"study_design_scores_gemma":[0.00049483863,0.000069336595,0.00012437333,0.00010958426,0.000008110141,0.000007918562,0.000121416066,0.0017192689,0.046666343,0.9503723,0.00007401651,0.00023249982],"about_ca_topic_score_codex":0.0000018747911,"about_ca_topic_score_gemma":0.0000015192596,"teacher_disagreement_score":0.8222884,"about_ca_system_score_codex":0.000045064506,"about_ca_system_score_gemma":0.00005408818,"threshold_uncertainty_score":0.43165848},"labels":[],"label_agreement":null},{"id":"W1600674239","doi":"10.1016/j.dam.2015.05.019","title":"Computing covers using prefix tables","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; London Mathematical Society; Bangladesh University of Engineering and Technology; Government of the United Kingdom","keywords":"Substring; Cover (algebra); Mathematics; Combinatorics; Integer (computer science); Prefix; String (physics); Alphabet; Sequence (biology); Table (database); Discrete mathematics; Algorithm; Data structure; Computer science","score_opus":0.049241740002295066,"score_gpt":0.2826943611037871,"score_spread":0.23345262110149204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600674239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012557235,0.000050567734,0.97675097,0.000030997242,0.00016585525,0.00017661614,0.000008332954,0.00017932075,0.010080104],"genre_scores_gemma":[0.16774344,0.0000023233288,0.8320184,0.00008901552,0.00007491842,0.0000036623005,0.000014223533,0.000016868367,0.000037186106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872905,0.000011543008,0.00027343602,0.0002930636,0.00039700588,0.00029590874],"domain_scores_gemma":[0.9988797,0.00007265812,0.00016916517,0.00066022575,0.00005461785,0.0001636424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032382726,0.00016864912,0.00022551625,0.00005450614,0.00013306056,0.00022906368,0.00074209954,0.000057740788,0.0000056992017],"category_scores_gemma":[0.000028413508,0.00013879307,0.00003784846,0.00023271795,0.000039941122,0.00032344513,0.0007425032,0.00010444864,0.000053828946],"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.000009962156,0.00019623282,0.000040153096,0.0001543299,0.000054369917,0.000019120458,0.008656441,0.014525188,0.008315985,0.9483388,0.005377187,0.014312201],"study_design_scores_gemma":[0.00039034183,0.000018171388,0.0000065972968,0.000056492892,0.000012273341,0.000017431195,0.0006626741,0.960293,0.0021179228,0.03375378,0.0024203663,0.00025096617],"about_ca_topic_score_codex":0.000020377409,"about_ca_topic_score_gemma":7.574615e-7,"teacher_disagreement_score":0.9457678,"about_ca_system_score_codex":0.000050768296,"about_ca_system_score_gemma":0.000079060126,"threshold_uncertainty_score":0.5659817},"labels":[],"label_agreement":null},{"id":"W1602326336","doi":"10.1016/j.dam.2003.02.002","title":"Worst-case analysis of a dynamic channel assignment strategy","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Competitive analysis; Reuse; Channel (broadcasting); Greedy algorithm; Algorithm; Computer science; Online algorithm; Mathematical optimization; Upper and lower bounds; Channel allocation schemes; Mathematics; Theoretical computer science; Computer network; Engineering; Wireless; Telecommunications","score_opus":0.028226775621338965,"score_gpt":0.3024998840984041,"score_spread":0.27427310847706515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1602326336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024748623,0.00006545189,0.9704618,0.0002060128,0.000014982216,0.00032166124,0.000008388952,0.00009003556,0.0040830583],"genre_scores_gemma":[0.86610305,0.000032626755,0.13370341,0.000021934991,0.00000528693,0.0000767701,0.0000150238075,0.000013960175,0.000027946611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833924,0.000024811989,0.00049242924,0.0003016941,0.0005174567,0.00032438518],"domain_scores_gemma":[0.9976284,0.00018120615,0.00025580518,0.0017355382,0.000078570236,0.00012046257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046790607,0.00017430806,0.00040794222,0.0003570865,0.000112691094,0.00010925437,0.001323325,0.000076145734,0.000014988557],"category_scores_gemma":[0.000015600157,0.00015445596,0.00014469236,0.0019283756,0.0001004589,0.00012860761,0.0005483896,0.00018960633,0.000023678556],"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.000004315344,0.0003192494,0.0000017341636,0.00008064151,0.00058626605,0.000050488597,0.0031057463,0.12024922,0.0013822243,0.8681076,0.000012446891,0.0061000516],"study_design_scores_gemma":[0.000399576,0.000040152667,0.00008300502,0.000033598488,0.00016319015,0.000027483435,0.0008836333,0.90950286,0.0009095965,0.08771912,0.000007262011,0.00023053319],"about_ca_topic_score_codex":0.000019266216,"about_ca_topic_score_gemma":0.0000478706,"teacher_disagreement_score":0.8413544,"about_ca_system_score_codex":0.00011258027,"about_ca_system_score_gemma":0.00007726442,"threshold_uncertainty_score":0.6298531},"labels":[],"label_agreement":null},{"id":"W1631636474","doi":"10.1016/j.dam.2015.06.011","title":"A tie-break model for graph search","year":2015,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Graph; Theoretical computer science","score_opus":0.08109971346624698,"score_gpt":0.3344557456080762,"score_spread":0.2533560321418292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1631636474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002019223,0.000037831785,0.9864867,0.00036759113,0.000042006737,0.0008513321,0.000016715512,0.00023600746,0.00994259],"genre_scores_gemma":[0.17721952,0.0000052653963,0.8216083,0.00017170404,0.000036201043,0.00034444124,0.000010295015,0.000043981774,0.00056029897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979805,0.000018310146,0.00031240963,0.0004359536,0.00064859615,0.0006042666],"domain_scores_gemma":[0.9980971,0.00023935307,0.000081547776,0.0010711091,0.0001947164,0.00031617016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229194,0.00021453439,0.00028597555,0.00018458228,0.00013484033,0.00015555046,0.0014092184,0.0000814661,0.0000022839602],"category_scores_gemma":[0.00007988932,0.00018245197,0.00010904503,0.00050043815,0.00013381611,0.00026268675,0.00048495302,0.00018360217,0.00006961945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022681188,0.00007059652,0.0000013461181,0.00009225441,0.000020116204,0.0000015408855,0.0035868918,0.0042328252,0.0011518992,0.9868618,0.001193279,0.002764748],"study_design_scores_gemma":[0.00037044522,0.000030572304,3.109332e-7,0.000007333661,0.0000043405735,0.0000034559114,0.0002616924,0.475597,0.0016761427,0.5217174,0.00019417991,0.00013710637],"about_ca_topic_score_codex":0.0000011168376,"about_ca_topic_score_gemma":0.0000016524804,"teacher_disagreement_score":0.47136417,"about_ca_system_score_codex":0.000051120314,"about_ca_system_score_gemma":0.00011322116,"threshold_uncertainty_score":0.74401754},"labels":[],"label_agreement":null},{"id":"W1659542177","doi":"10.1016/j.dam.2015.07.020","title":"Network decontamination under <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si60.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>m</mml:mi></mml:math>-immunity","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"HIV Research and Treatment","field":"Immunology and Microbiology","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Vertex (graph theory); Human decontamination; Mathematics; Algorithm; Torus; Graph; Computer science; Discrete mathematics; Geometry","score_opus":0.024152479307935886,"score_gpt":0.26108429674356026,"score_spread":0.2369318174356244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1659542177","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98130876,0.0006166789,0.0041291867,0.00019901611,0.00035954785,0.0001963241,0.00013670127,0.00014851324,0.012905278],"genre_scores_gemma":[0.99304646,0.00015727158,0.0038513767,0.00027756096,0.00016346032,0.00037802252,0.0014824168,0.000101273035,0.0005421849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781275,0.00009402823,0.0005785953,0.00042700942,0.00027542285,0.00081221346],"domain_scores_gemma":[0.99804026,0.00046905715,0.00037842654,0.0008716066,0.00007571363,0.00016493391],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007505316,0.00035559866,0.00032289387,0.00009486225,0.0005680674,0.00015944964,0.00047903703,0.00054735196,0.00013131244],"category_scores_gemma":[0.000175554,0.00036305105,0.00023430948,0.00021820744,0.00038816093,0.00018130387,0.00043761297,0.00056513894,0.005776918],"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.00026222088,0.00032460885,0.000010041698,0.00017028124,0.0005425974,0.000038085298,0.0014422114,0.0002630158,0.002591066,0.99008626,0.0030321835,0.0012374164],"study_design_scores_gemma":[0.024585754,0.0050337403,0.0012526514,0.0017947708,0.0034801608,0.0015112131,0.02597458,0.66784984,0.08847093,0.10143061,0.07395233,0.0046634446],"about_ca_topic_score_codex":0.00020549605,"about_ca_topic_score_gemma":0.00023669074,"teacher_disagreement_score":0.88865566,"about_ca_system_score_codex":0.00005191667,"about_ca_system_score_gemma":0.000288351,"threshold_uncertainty_score":0.99988216},"labels":[],"label_agreement":null},{"id":"W1706312069","doi":"10.1016/j.dam.2014.05.007","title":"On the van der Waerden numbers<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si167.gif\" display=\"inline\" overflow=\"scroll\"><mml:mstyle mathvariant=\"normal\"><mml:mi>w</mml:mi></mml:mstyle><mml:mrow><mml:mo>(</mml:mo><mml:mn>2</mml:mn><mml:mo>;</mml:mo><mml:mn>3</mml:mn><mml:mo>,</mml:mo><mml:mi>t</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Van der Waerden's theorem; Conjecture; Combinatorics; Mathematics; Upper and lower bounds; Solver; Heuristic; Algorithm; Discrete mathematics; Mathematical analysis","score_opus":0.017026558341712024,"score_gpt":0.23475725351554888,"score_spread":0.21773069517383686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1706312069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5583548,0.0024397832,0.029630532,0.002775002,0.008022109,0.0005651489,0.002424966,0.0018591704,0.3939285],"genre_scores_gemma":[0.954663,0.0018494679,0.024195787,0.004794092,0.0050734733,0.0037474453,0.0024974567,0.0024163215,0.00076294935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9723553,0.0012775912,0.0057563637,0.0056820605,0.007789794,0.007138887],"domain_scores_gemma":[0.976655,0.006222455,0.006043863,0.0071335877,0.00068291003,0.0032621864],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0069031822,0.0034520668,0.001562813,0.00152166,0.006246754,0.0061372356,0.009762289,0.005614414,0.06503346],"category_scores_gemma":[0.0033244977,0.0055605993,0.005172417,0.0038972143,0.0052806507,0.0035568497,0.00829623,0.0058040833,0.008571585],"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.0017214441,0.0012589112,0.000008763396,0.0027757823,0.0036131807,0.0013952062,0.0061730654,0.0029867338,0.0024181912,0.79572487,0.17721093,0.0047129057],"study_design_scores_gemma":[0.00555225,0.0035966511,0.00005744905,0.0039028677,0.004807777,0.004161098,0.006104105,0.28806028,0.63135517,0.031109829,0.014672723,0.006619786],"about_ca_topic_score_codex":0.002212533,"about_ca_topic_score_gemma":0.0015497145,"teacher_disagreement_score":0.76461506,"about_ca_system_score_codex":0.00010390415,"about_ca_system_score_gemma":0.0027815185,"threshold_uncertainty_score":0.9997245},"labels":[],"label_agreement":null},{"id":"W1717515755","doi":"10.1016/j.dam.2011.11.009","title":"The universality of iterated hashing over variable-length strings","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Iterated function; Hash function; Dynamic perfect hashing; Universal hashing; Double hashing; K-independent hashing; Perfect hash function; Combinatorics; Rolling hash; Discrete mathematics; Pairwise comparison; Collision resistance; Upper and lower bounds; Algorithm; Cryptographic hash function; Cryptography; Statistics; Computer science","score_opus":0.02156783680824183,"score_gpt":0.22221216568779847,"score_spread":0.20064432887955663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717515755","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008337749,0.000020534331,0.9628948,0.000016654734,0.000086625616,0.00017640197,0.000012977453,0.00009015233,0.028364105],"genre_scores_gemma":[0.40474892,0.000022331684,0.59500885,0.000042591626,0.00002429568,0.000010935945,0.000009104901,0.000016184948,0.00011676249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989992,0.000016315955,0.00029636026,0.00020950631,0.00026562,0.00021302141],"domain_scores_gemma":[0.998669,0.00016588035,0.0002295208,0.0008284464,0.000048864465,0.000058239155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000392725,0.00012987613,0.0001718516,0.00003137481,0.00018603813,0.00010500607,0.0010339937,0.0000522678,0.000024516816],"category_scores_gemma":[0.000022081544,0.000083682906,0.000037529968,0.0002554946,0.00007047483,0.0002933819,0.0005294694,0.00012130054,0.00000822557],"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.000006576716,0.00005030008,0.000008097024,0.00003835904,0.000023746205,0.000001340652,0.0029902107,0.0000088699935,0.0011672837,0.99205315,0.00025077738,0.003401305],"study_design_scores_gemma":[0.0014187777,0.00011248916,0.00079144025,0.00026107449,0.00008179104,0.000010546762,0.002429516,0.49810392,0.03131342,0.4561044,0.008563284,0.0008093589],"about_ca_topic_score_codex":0.00003885858,"about_ca_topic_score_gemma":0.0000012576792,"teacher_disagreement_score":0.53594875,"about_ca_system_score_codex":0.000017027369,"about_ca_system_score_gemma":0.00003652603,"threshold_uncertainty_score":0.341249},"labels":[],"label_agreement":null},{"id":"W1717727751","doi":"10.1016/j.dam.2015.07.036","title":"Contraction obstructions for connected graph searching","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mitacs; University of British Columbia","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Mitacs","keywords":"Mathematics; Monotone polygon; Combinatorics; Connected component; Finite set; Bounded function; Discrete mathematics; Graph; Mixed graph; Strongly connected component; Induced subgraph; Contraction (grammar); Line graph; Voltage graph","score_opus":0.05334818489376948,"score_gpt":0.299537856910135,"score_spread":0.24618967201636555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1717727751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001148484,0.000009844122,0.98494977,0.00046910284,0.00014811565,0.0006464099,0.000007224726,0.00027002936,0.012351008],"genre_scores_gemma":[0.1553358,0.0000060681014,0.8440547,0.00011655504,0.000050618848,0.00019151348,0.000029015313,0.000019045578,0.00019668526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990084,0.000015976811,0.00023873958,0.0002152001,0.00026819736,0.00025347708],"domain_scores_gemma":[0.9990094,0.00019655967,0.0001017956,0.00035024926,0.00017185319,0.00017017961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040892084,0.000109394896,0.0001533475,0.00010364663,0.00016668487,0.0002089959,0.00034581503,0.00005181698,0.000006948534],"category_scores_gemma":[0.00013926765,0.00009773372,0.00005144288,0.00029093184,0.000041160307,0.00026047142,0.00008108231,0.00011023641,0.000031945347],"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.0000053292656,0.00004416929,0.000002151847,0.000039848124,0.000019463776,4.098905e-7,0.0019353313,0.0023872904,0.0013975183,0.9909111,0.00085972756,0.0023976376],"study_design_scores_gemma":[0.0011123891,0.000055932287,0.000013124662,0.000015995754,0.000012689686,0.000011885436,0.0011444277,0.54538524,0.0016615137,0.44762704,0.0027357265,0.00022404271],"about_ca_topic_score_codex":0.0000031605948,"about_ca_topic_score_gemma":0.00000273155,"teacher_disagreement_score":0.5432841,"about_ca_system_score_codex":0.00003390095,"about_ca_system_score_gemma":0.000069940244,"threshold_uncertainty_score":0.39854652},"labels":[],"label_agreement":null},{"id":"W1871413087","doi":"10.1016/j.dam.2015.08.018","title":"A note on the Grundy number and graph products","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Memorial University of Newfoundland; Mount Allison University; University of Prince Edward Island; St. Francis Xavier University; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.04128525240217985,"score_gpt":0.30362654616002677,"score_spread":0.2623412937578469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871413087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07146504,0.00006277689,0.8162682,0.0074387514,0.00017362696,0.0015988552,0.0000069003167,0.0003894177,0.102596454],"genre_scores_gemma":[0.76055574,0.000013065316,0.23831148,0.00038185978,0.000086886124,0.00016140655,0.0000021626292,0.00003717734,0.00045021996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985688,0.000037124337,0.00019173298,0.00035897974,0.0005147407,0.00032867512],"domain_scores_gemma":[0.9982861,0.0003478746,0.0000871883,0.0010550548,0.00008242484,0.00014131243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000854154,0.00017613261,0.00017597097,0.00005551299,0.00014528165,0.00016836786,0.0008138543,0.000043575736,0.0000055876035],"category_scores_gemma":[0.00021662205,0.00010737268,0.00003007573,0.00051492604,0.00020494185,0.00014381611,0.00039427425,0.00022165739,0.00023226262],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000852909,0.000031146858,0.000004213865,0.00002931644,0.000009912941,0.0000032634598,0.0025572358,0.000019133182,0.0011364992,0.99375147,0.0006602528,0.0017890007],"study_design_scores_gemma":[0.00025642227,0.000039141352,0.00001122689,0.000019881518,0.000005808038,0.000017592423,0.00038588082,0.0039622486,0.0077027637,0.98554736,0.0018683859,0.00018330621],"about_ca_topic_score_codex":0.0000010916168,"about_ca_topic_score_gemma":8.131214e-7,"teacher_disagreement_score":0.6890907,"about_ca_system_score_codex":0.000020478436,"about_ca_system_score_gemma":0.000045508037,"threshold_uncertainty_score":0.4378531},"labels":[],"label_agreement":null},{"id":"W1906735889","doi":"10.1016/j.dam.2019.09.016","title":"On split graphs with four distinct eigenvalues","year":2019,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Science Foundation Ireland; University of Manitoba","keywords":"Combinatorics; Mathematics; Eigenvalues and eigenvectors; Vertex (graph theory); Graph; Split graph; Block graph; Chordal graph; Discrete mathematics; Cograph; 1-planar graph; Physics","score_opus":0.04342340528400412,"score_gpt":0.2923687122327828,"score_spread":0.2489453069487787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906735889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6961529,0.000048070422,0.09175059,0.0002239369,0.00025179095,0.005480914,0.00055980077,0.0009421651,0.2045898],"genre_scores_gemma":[0.87102056,0.00002169262,0.12540224,0.00011734756,0.000107398664,0.0013574443,0.00024345267,0.00031070458,0.001419185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965193,0.000051732524,0.0008980007,0.0010480385,0.0008356477,0.00064724276],"domain_scores_gemma":[0.9943957,0.0013450271,0.000945282,0.0029947492,0.000114815026,0.00020446241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006559981,0.0010011914,0.0012447583,0.00024979838,0.00026265715,0.00019830326,0.0011177191,0.0005055167,0.00021862538],"category_scores_gemma":[0.000126542,0.00075721217,0.0003997123,0.00030915748,0.00027565676,0.000044511497,0.0006065278,0.001156966,0.0004941149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009460465,0.000374141,0.000023508555,0.0021758156,0.00031096325,0.0000052733344,0.001007795,0.00013844883,0.0000934111,0.9939651,0.0016203036,0.00019066033],"study_design_scores_gemma":[0.00054837577,0.0001061467,0.000064144806,0.0007127135,0.0005086874,0.000012214096,0.00045293977,0.0006873939,0.00064470293,0.99496585,0.0003272494,0.000969605],"about_ca_topic_score_codex":0.0000036653712,"about_ca_topic_score_gemma":0.000008892093,"teacher_disagreement_score":0.20317061,"about_ca_system_score_codex":0.000077234305,"about_ca_system_score_gemma":0.00011190683,"threshold_uncertainty_score":0.9994879},"labels":[],"label_agreement":null},{"id":"W1964667683","doi":"10.1016/s0166-218x(00)00240-7","title":"On the number of generators for transeunt triangles","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","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 New Brunswick","funders":"","keywords":"Modulo; Mathematics; Combinatorics; Generator (circuit theory); Element (criminal law); Set (abstract data type); Discrete mathematics; Computer science","score_opus":0.023782838325275574,"score_gpt":0.26715552964723055,"score_spread":0.24337269132195496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964667683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070954725,0.000009455342,0.9144449,0.00073118164,0.000026296733,0.00054466195,0.000012209923,0.00006977005,0.013206752],"genre_scores_gemma":[0.80315274,0.000010132309,0.19610623,0.00020338329,0.000033001696,0.00035272294,0.000008824397,0.000017332579,0.000115618364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992589,0.0000068018417,0.00024593473,0.00016645431,0.00017000709,0.00015194528],"domain_scores_gemma":[0.9988701,0.00034212242,0.00010556213,0.0006210042,0.00002595079,0.00003530013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020268236,0.0001086318,0.00015574857,0.000022141645,0.00010766055,0.00004763374,0.0005796739,0.000037256217,0.00003467754],"category_scores_gemma":[0.000015118033,0.00006938716,0.00009441671,0.00021331199,0.00004364204,0.000035535395,0.000037710022,0.000047466518,0.000048080798],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028649401,0.00006976419,0.0000014260598,0.000023568184,0.000013218646,2.2421538e-7,0.0006344763,0.000020649835,0.0047291997,0.99145424,0.0005948623,0.002455527],"study_design_scores_gemma":[0.0006393726,0.000030316749,0.000021450569,0.00002624777,0.000039113267,0.000011207971,0.000334069,0.056667265,0.08325623,0.85223997,0.0064721033,0.0002626707],"about_ca_topic_score_codex":9.660137e-7,"about_ca_topic_score_gemma":8.1811135e-7,"teacher_disagreement_score":0.73219806,"about_ca_system_score_codex":0.000008586731,"about_ca_system_score_gemma":0.000018673489,"threshold_uncertainty_score":0.28295264},"labels":[],"label_agreement":null},{"id":"W1965026568","doi":"10.1016/j.dam.2011.05.004","title":"Analysing local algorithms in location-aware quasi-unit-disk graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Unit disk graph; Algorithm; Vertex (graph theory); Mathematics; Set (abstract data type); Matching (statistics); Graph; Approximation algorithm; Computer science; Combinatorics; Wireless network","score_opus":0.04545922886075514,"score_gpt":0.2643196687415958,"score_spread":0.21886043988084064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965026568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044452865,0.00005918959,0.98596895,0.000049136794,0.0001151012,0.00028897854,0.0000053408603,0.00021845734,0.008849549],"genre_scores_gemma":[0.62578875,0.000013520079,0.37398213,0.00008760704,0.000021094604,0.000050699342,0.000011621597,0.000020850324,0.00002374041],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978986,0.00003370789,0.00060739566,0.00052834046,0.00044618195,0.00048576732],"domain_scores_gemma":[0.99836314,0.0001313385,0.00020647135,0.0010620465,0.000091771384,0.00014525227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047277272,0.00030333034,0.00041437458,0.0004052445,0.00018375972,0.00012482573,0.0012882254,0.00011442062,0.00004714528],"category_scores_gemma":[0.000019354791,0.00028548477,0.00012682528,0.0018374878,0.0002198036,0.0003184644,0.00035769568,0.00029317196,0.00008013023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004698758,0.0004050389,0.000140786,0.00011979893,0.00004668826,0.000020203246,0.008420207,0.00016396672,0.000051985306,0.9547199,0.000038644,0.03586806],"study_design_scores_gemma":[0.00040034327,0.000049329923,0.00075828645,0.00008953734,0.000027318494,0.000013957211,0.0025118883,0.45992616,0.0010132501,0.53467757,0.00006801158,0.0004643382],"about_ca_topic_score_codex":0.00009861812,"about_ca_topic_score_gemma":0.000090113426,"teacher_disagreement_score":0.62134343,"about_ca_system_score_codex":0.000041911146,"about_ca_system_score_gemma":0.00006498164,"threshold_uncertainty_score":0.9999597},"labels":[],"label_agreement":null},{"id":"W1965529758","doi":"10.1016/j.dam.2007.07.023","title":"Self-duality of bounded monotone boolean functions and related problems","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Machine Learning and Algorithms","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":"Simon Fraser University; University of Lethbridge","funders":"","keywords":"Mathematics; Duality (order theory); Monotone polygon; Bounded function; Boolean function; Disjunctive normal form; Discrete mathematics; Combinatorics; Function (biology); Maximum satisfiability problem; Parity function; Boolean expression","score_opus":0.008905465639928068,"score_gpt":0.24209905899356418,"score_spread":0.23319359335363612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965529758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06434129,0.00006302131,0.89430875,0.00014660889,0.00008357449,0.00034622924,0.0000038044482,0.00032949468,0.040377226],"genre_scores_gemma":[0.68654186,0.000010567733,0.3129111,0.00002382797,0.000020939638,0.000012038007,0.000007862419,0.000016196378,0.00045564986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998772,0.000015229552,0.00044590584,0.00026614734,0.00025319456,0.0002474765],"domain_scores_gemma":[0.9990224,0.00012393466,0.00023476039,0.00048096103,0.000039702092,0.000098206234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009457159,0.00015097825,0.00024281502,0.00008203482,0.00013560388,0.00006488482,0.00028170235,0.00007731671,0.000008801683],"category_scores_gemma":[0.000024954319,0.0001290997,0.000048048212,0.00031120682,0.000070497605,0.00009659931,0.00017372737,0.00020247788,0.00002085673],"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.0000045220527,0.00030296252,0.00013640305,0.00055859867,0.000118092066,0.0000040205127,0.01187732,0.00015160379,0.0031402996,0.972199,0.00009908744,0.011408071],"study_design_scores_gemma":[0.0020149455,0.00025890302,0.0026974757,0.00014998695,0.00014646426,0.0001038541,0.0019736688,0.49070653,0.0067257504,0.49052617,0.0037049518,0.0009913032],"about_ca_topic_score_codex":0.000008956445,"about_ca_topic_score_gemma":0.000002282743,"teacher_disagreement_score":0.62220055,"about_ca_system_score_codex":0.000016680604,"about_ca_system_score_gemma":0.000021268108,"threshold_uncertainty_score":0.52645326},"labels":[],"label_agreement":null},{"id":"W1965641578","doi":"10.1016/j.dam.2007.05.001","title":"Flows over edge-disjoint mixed multipaths and applications","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"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 New Brunswick; University of Windsor","funders":"","keywords":"Disjoint sets; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Theoretical computer science; Computer science; Telecommunications","score_opus":0.016258153685711853,"score_gpt":0.2561109614297292,"score_spread":0.23985280774401738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965641578","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007976812,0.00008251214,0.9772411,0.00006980899,0.00009407607,0.0005244658,0.000008283399,0.00024142137,0.013761495],"genre_scores_gemma":[0.21729064,0.000020513417,0.78215533,0.00016236134,0.00013821531,0.00012303695,0.000009468654,0.000023745682,0.00007669934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985527,0.0000070914575,0.00038276508,0.0003992285,0.00029251733,0.00036572802],"domain_scores_gemma":[0.9986366,0.0002445989,0.00012674638,0.00078959455,0.000037496706,0.00016496812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048287958,0.00021040562,0.00024170337,0.00011894199,0.00023003393,0.00014785051,0.0006033026,0.00008041121,0.000015065837],"category_scores_gemma":[0.000016288188,0.00019047619,0.0000721789,0.0003769238,0.00010947464,0.00013983632,0.0004305585,0.00016777149,0.0000554413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022475958,0.00010421022,0.000012826022,0.00007999386,0.000018284962,0.0000030450126,0.0010613103,0.0000101847745,0.0021405853,0.9358997,0.00014384357,0.06052378],"study_design_scores_gemma":[0.001172463,0.000054092627,0.0019490892,0.00006167565,0.000048198897,0.00004853499,0.0009577428,0.18098722,0.008663729,0.78242004,0.022650816,0.0009864157],"about_ca_topic_score_codex":0.0000043272703,"about_ca_topic_score_gemma":0.000017974253,"teacher_disagreement_score":0.20931382,"about_ca_system_score_codex":0.000023173374,"about_ca_system_score_gemma":0.000018452787,"threshold_uncertainty_score":0.77673936},"labels":[],"label_agreement":null},{"id":"W1965799704","doi":"10.1016/j.dam.2012.02.004","title":"On edge-sets of bicliques in graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Simon Fraser University","funders":"Secretaría de Ciencia y Técnica, Universidad de Buenos Aires; Natural Sciences and Engineering Research Council of Canada; Fondation Sciences Mathématiques de Paris; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Combinatorics; Hypergraph; Mathematics; Bipartite graph; Complete bipartite graph; Intersection graph; Discrete mathematics; Graph; Line graph","score_opus":0.026164911057218455,"score_gpt":0.31298894050997234,"score_spread":0.28682402945275387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965799704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37346393,0.0001771975,0.54747045,0.00012846687,0.00013324931,0.00078981515,0.000008412239,0.0001903575,0.077638134],"genre_scores_gemma":[0.86313283,0.000013694202,0.13670227,0.000050198156,0.000008545822,0.00004605628,0.0000016688144,0.000015599717,0.000029144781],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867964,0.000028477194,0.0003230277,0.00019221404,0.00036007026,0.0004165525],"domain_scores_gemma":[0.9986415,0.00038104094,0.00012369058,0.00072312256,0.000028663966,0.00010200471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064143684,0.00014670857,0.00025013118,0.00026641457,0.000034204884,0.000024476816,0.0007191753,0.000058655518,0.000015696027],"category_scores_gemma":[0.00007243004,0.0001205265,0.000059399412,0.0005894735,0.000102954335,0.00023786975,0.00022709774,0.00016940944,0.0000803278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007931162,0.00016774502,0.000085797525,0.00007436854,0.000007046482,9.347208e-7,0.0018347154,0.000020286901,0.002678958,0.9920116,0.000052671832,0.0030579458],"study_design_scores_gemma":[0.00024578947,0.000045418714,0.0003015914,0.00005042423,0.0000026553478,0.0000020811324,0.00017371694,0.0015631404,0.030227216,0.9671672,0.000060928454,0.00015985307],"about_ca_topic_score_codex":0.0000014759247,"about_ca_topic_score_gemma":0.0000012715492,"teacher_disagreement_score":0.48966888,"about_ca_system_score_codex":0.000022852253,"about_ca_system_score_gemma":0.00001633087,"threshold_uncertainty_score":0.49149278},"labels":[],"label_agreement":null},{"id":"W1968027460","doi":"10.1016/s0166-218x(02)00418-3","title":"Maximum independent set and maximum clique algorithms for overlap graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Chordal graph; Mathematics; Combinatorics; Maximal independent set; Split graph; Indifference graph; Treewidth; Independent set; Clique-sum; Pathwidth; Discrete mathematics; Cograph; Vertex (graph theory); Clique problem; 1-planar graph; Graph; Line graph","score_opus":0.030238746495345224,"score_gpt":0.3033645190743955,"score_spread":0.27312577257905024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968027460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007900526,0.00010574297,0.98283815,0.00011229941,0.00010348569,0.0011809408,0.000031496482,0.00016597618,0.00756137],"genre_scores_gemma":[0.1639113,0.00007001184,0.8349958,0.00021337958,0.000025710255,0.0004842352,0.000014068198,0.00006767824,0.00021781461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977658,0.000042075444,0.00042268814,0.0006192756,0.00049771025,0.0006524481],"domain_scores_gemma":[0.99816024,0.00041303795,0.0001722648,0.0009377156,0.00008839391,0.00022831606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009822464,0.00031314808,0.00037959032,0.0001894821,0.00023642965,0.00021683605,0.0007696947,0.00014057959,0.000012990011],"category_scores_gemma":[0.00010508959,0.00027594654,0.00011367095,0.00041078025,0.00016430907,0.00026270427,0.0002936155,0.00025843014,0.000025012409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001109103,0.00005976857,0.000021216767,0.00015998461,0.000036065623,0.0000056066997,0.0008610229,0.00001919236,0.0014853847,0.99259406,0.00010488228,0.004641747],"study_design_scores_gemma":[0.00078782556,0.00008304486,0.000021614178,0.000020979856,0.00001393225,0.000036675203,0.0006053261,0.0055596232,0.0065717543,0.98423326,0.0017142821,0.00035168862],"about_ca_topic_score_codex":0.0000011173873,"about_ca_topic_score_gemma":0.000002071391,"teacher_disagreement_score":0.15601076,"about_ca_system_score_codex":0.000038883758,"about_ca_system_score_gemma":0.00005929209,"threshold_uncertainty_score":0.99996924},"labels":[],"label_agreement":null},{"id":"W1969506670","doi":"10.1016/j.dam.2015.01.035","title":"The Minimum Flow Cost Hamiltonian Cycle Problem: A comparison of formulations","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hamiltonian path; Mathematics; Minimum-cost flow problem; Hamiltonian (control theory); Hamiltonian path problem; Combinatorics; Integer programming; Shortest path problem; Graph; Mathematical optimization; Flow network; Discrete mathematics","score_opus":0.036546015957150124,"score_gpt":0.3037352396843029,"score_spread":0.26718922372715276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969506670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01617683,0.000091561575,0.93344134,0.00009154057,0.000099204604,0.0007576565,0.000020949656,0.00030039335,0.049020514],"genre_scores_gemma":[0.44304246,0.0000052005284,0.55674607,0.0000066942644,0.000022087732,0.000072157294,0.0000145678505,0.00004163827,0.000049132675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887013,0.000015705842,0.0005141003,0.00010211028,0.00025902013,0.00023893258],"domain_scores_gemma":[0.9990587,0.000246679,0.00012642215,0.00039429063,0.00007651916,0.00009736907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004654545,0.00015102679,0.00026008007,0.00004355664,0.00011040036,0.000050101706,0.00022997249,0.00007334437,0.000005975341],"category_scores_gemma":[0.000077782235,0.0001171672,0.000047868158,0.00024046964,0.000064906846,0.000053733726,0.000052641084,0.00012976612,0.000026231119],"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.000006322064,0.000048914244,0.00010176707,0.00016718304,0.000053480704,1.6810796e-7,0.007872124,0.93767875,0.0012615955,0.044510797,0.0011294171,0.0071694893],"study_design_scores_gemma":[0.00033260818,0.000012179763,0.000039131228,0.000026318612,0.000032288073,0.0000011515756,0.0013380283,0.9797326,0.002481117,0.014814863,0.001047066,0.0001426788],"about_ca_topic_score_codex":0.0000014796577,"about_ca_topic_score_gemma":0.000008987568,"teacher_disagreement_score":0.42686564,"about_ca_system_score_codex":0.000048448546,"about_ca_system_score_gemma":0.00002624474,"threshold_uncertainty_score":0.47779396},"labels":[],"label_agreement":null},{"id":"W1969844667","doi":"10.1016/j.dam.2013.10.021","title":"A<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si22.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>d</mml:mi></mml:math>-step approach to the maximum number of distinct squares and runs in strings","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Canada Research Chairs","keywords":"Parameterized complexity; Mathematics; String (physics); Combinatorics; Upper and lower bounds; Computation; Discrete mathematics; Algorithm; Mathematical analysis","score_opus":0.014358841014989042,"score_gpt":0.236957026351675,"score_spread":0.22259818533668596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969844667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82509315,0.00004555101,0.16936247,0.00015012111,0.000116195726,0.0002032266,0.000058855974,0.00008473262,0.0048856875],"genre_scores_gemma":[0.8654032,0.000028587836,0.13376072,0.00019242625,0.00011149927,0.00033123887,0.00007159417,0.000059680333,0.000041061492],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976259,0.000025890737,0.0006284946,0.00056113856,0.00065246556,0.00050612487],"domain_scores_gemma":[0.99786115,0.00030530358,0.0003949066,0.0012106278,0.000042776745,0.00018526775],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004804965,0.0003160785,0.00028605238,0.00006852263,0.0002642086,0.0003891096,0.0011180687,0.00020681707,0.000019243773],"category_scores_gemma":[0.00008154762,0.00026348047,0.00013848412,0.00029831662,0.00017645933,0.00042146473,0.0014160721,0.00031692084,0.0002972971],"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.000020984253,0.00015113121,0.000011924805,0.0003224986,0.00004199434,0.0000072891207,0.0022121235,0.00018206835,0.0004470972,0.9935363,0.0005989271,0.0024676882],"study_design_scores_gemma":[0.0004295101,0.000074282674,0.00027858734,0.0001789366,0.000045980556,0.00005036397,0.0010561345,0.9873739,0.0011178114,0.008377027,0.00070856133,0.00030890558],"about_ca_topic_score_codex":0.00029433233,"about_ca_topic_score_gemma":0.000031884076,"teacher_disagreement_score":0.98719186,"about_ca_system_score_codex":0.000011308085,"about_ca_system_score_gemma":0.00007528801,"threshold_uncertainty_score":0.99998176},"labels":[],"label_agreement":null},{"id":"W1969872322","doi":"10.1016/j.dam.2004.06.007","title":"Measures on Boolean polynomials and their applications in data mining","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Data Management and Algorithms","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é de Montréal","funders":"","keywords":"Mathematics; Extension (predicate logic); Value (mathematics); Bonferroni correction; Type (biology); Binary number; Discrete mathematics; Statistics; Computer science; Arithmetic","score_opus":0.04596786842187776,"score_gpt":0.2692105800670464,"score_spread":0.22324271164516865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969872322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049246154,0.000060141225,0.98259085,0.00053003844,0.00002689262,0.00052057265,0.000043374843,0.00011616013,0.011187348],"genre_scores_gemma":[0.5302346,0.000045148725,0.46895802,0.00031408822,0.000073183335,0.00012035874,0.00015226586,0.000027161708,0.00007518001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999004,0.0000060291,0.00023117762,0.0003988307,0.00015878708,0.00020116934],"domain_scores_gemma":[0.9984638,0.000086771455,0.000086083506,0.0013025139,0.0000075063413,0.000053319138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035920073,0.00015333938,0.0001835191,0.00010332552,0.000086040825,0.00021020228,0.0013039286,0.00003178559,0.000001487604],"category_scores_gemma":[0.000017004386,0.00011703264,0.0000148707695,0.00022419309,0.000042819876,0.00030614433,0.0007873476,0.0000752414,0.00002127051],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021393887,0.00014026687,0.000011523531,0.00006646695,0.000024090123,0.0000020644934,0.0025504825,0.00006382685,0.0005878828,0.9360806,0.00037815492,0.060092524],"study_design_scores_gemma":[0.004606432,0.00015062318,0.0010070191,0.00050520943,0.0000852951,0.000014973807,0.013231037,0.090996705,0.012905957,0.8457635,0.028403183,0.0023300878],"about_ca_topic_score_codex":0.0000055965384,"about_ca_topic_score_gemma":0.000016218472,"teacher_disagreement_score":0.52531,"about_ca_system_score_codex":0.000017954213,"about_ca_system_score_gemma":0.00001752542,"threshold_uncertainty_score":0.47724527},"labels":[],"label_agreement":null},{"id":"W1970103772","doi":"10.1016/s0166-218x(03)00375-5","title":"Exact enumeration of rooted 3-connected triangular maps on the projective plane","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Combinatorial Mathematics","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":"Nortel (Canada); Carleton University","funders":"","keywords":"Mathematics; Projective plane; Enumeration; Simple (philosophy); Combinatorics; Blocking set; Real projective plane; Plane (geometry); Connected component; Parametric statistics; Projective test; Discrete mathematics; Projective space; Pure mathematics; Geometry; Complex projective space","score_opus":0.03181268124892055,"score_gpt":0.2841718465625536,"score_spread":0.25235916531363306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970103772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5138134,0.00008907232,0.26792678,0.00043988015,0.0008427381,0.010655604,0.00019829208,0.0008701335,0.20516412],"genre_scores_gemma":[0.8919433,0.0000093602275,0.106839344,0.000068059926,0.000089151894,0.00044094882,0.000034916768,0.0001677671,0.00040718948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972002,0.00015247079,0.0010307379,0.0003982673,0.000766186,0.00045214707],"domain_scores_gemma":[0.9943672,0.0032117127,0.00090474956,0.00124474,0.00018073044,0.000090889145],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010709076,0.00048593146,0.0008093606,0.0001472287,0.00020624998,0.000052490897,0.00044475662,0.00021394364,0.00015291556],"category_scores_gemma":[0.0033990566,0.0003335823,0.00017932327,0.0005723292,0.00014671902,0.0000901967,0.00006419859,0.00039549,0.00006589594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057083467,0.00043030176,0.0000015822654,0.000351598,0.0001354456,0.0000031261206,0.002708496,0.000024329558,0.009244585,0.9862861,0.0006568241,0.00010052475],"study_design_scores_gemma":[0.0011096022,0.00014279415,0.0000031227498,0.00015698775,0.00013864276,0.000010492309,0.0023431827,0.00032248316,0.12094559,0.8740729,0.00040460497,0.00034960997],"about_ca_topic_score_codex":0.0000021157546,"about_ca_topic_score_gemma":0.0000028580955,"teacher_disagreement_score":0.37812987,"about_ca_system_score_codex":0.00010981288,"about_ca_system_score_gemma":0.00009112759,"threshold_uncertainty_score":0.9999116},"labels":[],"label_agreement":null},{"id":"W1970251068","doi":"10.1016/s0166-218x(00)00262-6","title":"Investigations on autark assignments","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":75,"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","score_opus":0.014236189236115571,"score_gpt":0.232626912351096,"score_spread":0.21839072311498042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970251068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005865746,0.0000020172877,0.7709891,0.0006421804,0.00005761206,0.00023608029,0.0000039750435,0.00025885494,0.22194442],"genre_scores_gemma":[0.46032584,0.000012113584,0.5371585,0.00101996,0.00003222503,0.000063296524,0.00001755456,0.000017040064,0.0013534855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991722,0.000009267192,0.0002085039,0.00020726814,0.00024774155,0.00015502206],"domain_scores_gemma":[0.99936974,0.00006122335,0.00006146347,0.00040382822,0.000013224606,0.00009052608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090322545,0.00011742305,0.000108256216,0.00005635973,0.00013405562,0.00011508129,0.00027036984,0.00004484815,0.00065770146],"category_scores_gemma":[0.000012355525,0.00010638846,0.000034688976,0.00022218,0.00004402862,0.00013765508,0.000029239696,0.00008689388,0.00075878616],"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.0000018144024,0.000066382934,0.00001785432,0.000014320438,0.00001530456,0.0000013986427,0.0012126599,0.0032540765,0.00059910485,0.93287873,0.0010505817,0.06088778],"study_design_scores_gemma":[0.001247025,0.00010106838,0.0017932559,0.000104738,0.00003717002,0.000020943195,0.00029277508,0.63928527,0.005722895,0.33520246,0.01528555,0.0009068433],"about_ca_topic_score_codex":9.4857313e-7,"about_ca_topic_score_gemma":8.814382e-7,"teacher_disagreement_score":0.6360312,"about_ca_system_score_codex":0.00003070031,"about_ca_system_score_gemma":0.00002856469,"threshold_uncertainty_score":0.97529143},"labels":[],"label_agreement":null},{"id":"W1970577301","doi":"10.1016/j.dam.2014.02.008","title":"Number of lines in hypergraphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Google (Canada); Concordia University","funders":"Concordia University; Canada Research Chairs","keywords":"Hypergraph; Mathematics; Combinatorics; Upper and lower bounds; Line (geometry); Chen; Discrete mathematics; Geometry","score_opus":0.01583011199010476,"score_gpt":0.2953630191365015,"score_spread":0.2795329071463967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970577301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11301717,0.0000135093715,0.8276888,0.000089139096,0.000038054706,0.00022463969,0.0000015768521,0.00007944082,0.05884766],"genre_scores_gemma":[0.6746825,0.00000681406,0.32516977,0.000029735565,0.000012014736,0.000027615099,0.0000010477136,0.000011950032,0.000058575726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988466,0.00002424067,0.0003362491,0.00022912229,0.00030109877,0.00026271885],"domain_scores_gemma":[0.99876213,0.00030415962,0.000111110996,0.00072179537,0.000042290314,0.000058490306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005141934,0.0001252169,0.0002616411,0.0001233926,0.000029621253,0.000026589514,0.0008152272,0.000050865303,0.000015067694],"category_scores_gemma":[0.00008433841,0.00010482905,0.00005523985,0.00059018773,0.000103706436,0.00011739254,0.0002454399,0.00012462532,0.00006669407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003391394,0.000056707446,0.00025365397,0.000084652944,0.000005280726,7.4047614e-7,0.0005816744,0.000058683996,0.0048862793,0.99025565,0.000017031332,0.0037962405],"study_design_scores_gemma":[0.00031816668,0.000016098027,0.00018872289,0.000035151006,0.0000026541272,0.000004567949,0.000116855495,0.022079041,0.01148828,0.96534914,0.00024867855,0.00015264798],"about_ca_topic_score_codex":0.000002066409,"about_ca_topic_score_gemma":0.000002941708,"teacher_disagreement_score":0.5616653,"about_ca_system_score_codex":0.000009080027,"about_ca_system_score_gemma":0.000014422946,"threshold_uncertainty_score":0.42748046},"labels":[],"label_agreement":null},{"id":"W1971217502","doi":"10.1016/j.dam.2008.12.004","title":"On explicit formulas for bandwidth and antibandwidth of hypercubes","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hypercube; Mathematics; Bandwidth (computing); Numbering; Simple (philosophy); Combinatorics; Latin hypercube sampling; Discrete mathematics; Algorithm; Computer science; Telecommunications; Monte Carlo method","score_opus":0.012773041884500557,"score_gpt":0.24299205514265712,"score_spread":0.23021901325815655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971217502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053595304,0.00003410457,0.93192863,0.00015429831,0.00009239911,0.00045973234,0.0000045050747,0.000064665044,0.013666376],"genre_scores_gemma":[0.93616736,0.0000105290055,0.06345597,0.00019800411,0.00004548287,0.00002385987,0.000002337413,0.000008799949,0.000087638284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999115,0.000005534354,0.00031419616,0.00021873512,0.00015587974,0.0001906708],"domain_scores_gemma":[0.99921966,0.00019712166,0.00012933019,0.00036018816,0.00004222995,0.000051488187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226759,0.00013958616,0.00029062497,0.00006702423,0.00008148027,0.00006821134,0.00026159515,0.000060235394,0.0000032075889],"category_scores_gemma":[0.000018848956,0.00010608573,0.00006688378,0.000106515065,0.000016822658,0.00009692759,0.000035105717,0.000052912426,0.0000037990505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011076438,0.00004941328,0.0000016154323,0.00007566692,0.000011677274,3.1244605e-7,0.0010508251,0.000072798815,0.0028262767,0.9899029,0.0005560217,0.005441374],"study_design_scores_gemma":[0.001403581,0.0008553351,0.0001160127,0.0002481488,0.000030302406,0.000024901847,0.0005161849,0.27253094,0.025265703,0.6972906,0.0012435035,0.00047478598],"about_ca_topic_score_codex":9.299171e-7,"about_ca_topic_score_gemma":6.504788e-7,"teacher_disagreement_score":0.88257205,"about_ca_system_score_codex":0.000009735842,"about_ca_system_score_gemma":0.000008849421,"threshold_uncertainty_score":0.43260506},"labels":[],"label_agreement":null},{"id":"W1972531982","doi":"10.1016/j.dam.2004.05.002","title":"Saturated systems of homogeneous boxes and the logical analysis of numerical data","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Mathematics; Homogeneous; Algorithm; Combinatorics","score_opus":0.019098772404859816,"score_gpt":0.26120398441800796,"score_spread":0.24210521201314814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972531982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02912133,0.00027513693,0.969189,0.00016765621,0.000030315443,0.00018617162,0.00002665796,0.000044893375,0.00095884723],"genre_scores_gemma":[0.9143548,0.000020428177,0.085549004,0.000017522154,0.000013018971,0.000006222065,0.000022189306,0.0000053316076,0.000011505257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892986,0.0000341025,0.00037728646,0.0002440137,0.00028361613,0.00013111427],"domain_scores_gemma":[0.9983835,0.00027462476,0.0002692464,0.0009960319,0.000034381417,0.000042163716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046723604,0.0001154409,0.00049474,0.00007587621,0.000056636214,0.000059064103,0.00095605146,0.00004455804,0.0000027011472],"category_scores_gemma":[0.000068339665,0.00006373789,0.00006238945,0.00069750356,0.00017449967,0.000045107463,0.0004604052,0.00010939827,0.0000018861448],"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.000012460548,0.00010803237,0.00005235246,0.00015957028,0.0006436431,0.000003770516,0.0023083303,0.025500981,0.00054884696,0.9687397,0.000018981727,0.0019033169],"study_design_scores_gemma":[0.00057578034,0.000028226248,0.00024828568,0.000023956545,0.00038355717,0.000013432849,0.0002744896,0.98972803,0.00020253318,0.0083710505,0.00003371024,0.000116914234],"about_ca_topic_score_codex":0.0000800535,"about_ca_topic_score_gemma":0.0000017543156,"teacher_disagreement_score":0.9642271,"about_ca_system_score_codex":0.000005685967,"about_ca_system_score_gemma":0.000020435222,"threshold_uncertainty_score":0.2599156},"labels":[],"label_agreement":null},{"id":"W1973455746","doi":"10.1016/j.dam.2005.02.003","title":"A note on 3D orthogonal graph drawing","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Graph; Vertex (graph theory); Combinatorics; Graph drawing","score_opus":0.014098558613001643,"score_gpt":0.25672371548179274,"score_spread":0.2426251568687911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973455746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014178813,0.000017673756,0.9565012,0.0005585698,0.0000989969,0.00017928901,0.0000027615843,0.00015920667,0.028303474],"genre_scores_gemma":[0.48565775,0.000003267999,0.51342547,0.0005725657,0.0001633559,0.00002519455,0.00001198433,0.000009989839,0.00013042081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881035,0.000009551497,0.00026931684,0.00028868587,0.0004004123,0.00022168987],"domain_scores_gemma":[0.99924713,0.0001491918,0.000102916245,0.00038045415,0.00003897006,0.000081346465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022855353,0.00015712067,0.00015249634,0.0001397563,0.00016185748,0.00013641317,0.00038139935,0.000051562914,0.000027566208],"category_scores_gemma":[0.000021316617,0.00014032252,0.00006791301,0.0003851016,0.00002348498,0.0001818902,0.0001093309,0.00011978026,0.0002914586],"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.000003984069,0.00009105235,0.0000012782795,0.000021650361,0.00001192669,0.0000018370582,0.0010608957,0.016062247,0.0026763643,0.91681594,0.00036468782,0.06288813],"study_design_scores_gemma":[0.00082056737,0.00009469803,0.00021333036,0.000059382113,0.000025919897,0.000027180788,0.00006646128,0.77821124,0.015812492,0.18795043,0.016053837,0.0006644796],"about_ca_topic_score_codex":2.9715412e-7,"about_ca_topic_score_gemma":0.0000019614722,"teacher_disagreement_score":0.762149,"about_ca_system_score_codex":0.00003015414,"about_ca_system_score_gemma":0.000041590436,"threshold_uncertainty_score":0.5722186},"labels":[],"label_agreement":null},{"id":"W1973674225","doi":"10.1016/s0166-218x(00)00381-4","title":"Almost resolvable perfect Mendelsohn designs with block size five","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Beijing Institute For Brain Disorders","keywords":"Mathematics; Combinatorics; Block size; Block (permutation group theory); Discrete mathematics","score_opus":0.01463708394742453,"score_gpt":0.1866140436394577,"score_spread":0.17197695969203317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973674225","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2636203,0.0005054737,0.0214859,0.000043948305,0.00017379128,0.0013488431,0.00004418067,0.0012909558,0.71148664],"genre_scores_gemma":[0.9875863,0.00003085669,0.010868374,0.000027592545,0.0000597333,0.00014585182,0.000004703637,0.00009868419,0.0011778664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987758,0.000015328296,0.00030958303,0.00022408296,0.000257901,0.00041731764],"domain_scores_gemma":[0.9990581,0.00022426441,0.00006375178,0.000512563,0.000022551707,0.00011875192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019104198,0.00030535285,0.00036556285,0.000053195974,0.00012805838,0.000064977474,0.0002386666,0.00010663498,0.00032522934],"category_scores_gemma":[0.00001429908,0.00024825454,0.00007135226,0.0002554138,0.0000647468,0.0000756441,0.000027890088,0.00019427095,0.00032550277],"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.00016779627,0.0007527945,0.00008105017,0.0051601124,0.0020053973,0.00020183936,0.06353855,0.081384785,0.14011902,0.6602123,0.044486526,0.0018898622],"study_design_scores_gemma":[0.008196549,0.0010856461,0.00010364332,0.0016398304,0.001354213,0.00076561485,0.03602545,0.6254333,0.15187038,0.14475912,0.02164487,0.0071213534],"about_ca_topic_score_codex":0.000002215653,"about_ca_topic_score_gemma":0.0000034953239,"teacher_disagreement_score":0.72396606,"about_ca_system_score_codex":0.000034700573,"about_ca_system_score_gemma":0.000004437531,"threshold_uncertainty_score":0.99999696},"labels":[],"label_agreement":null},{"id":"W1974192323","doi":"10.1016/s0166-218x(03)00189-6","title":"Searching with mobile agents in networks with liars","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bounded function; Hypercube; Node (physics); Computer science; Graph; Theoretical computer science; Shortest path problem; Path (computing); Mathematics; Combinatorics; Discrete mathematics; Topology (electrical circuits); Computer network","score_opus":0.018882787564954387,"score_gpt":0.26042773149044907,"score_spread":0.2415449439254947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974192323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063559227,0.000013680981,0.95049536,0.00003580537,0.000013509121,0.0005963728,3.9383806e-7,0.00008757518,0.042401355],"genre_scores_gemma":[0.42735955,0.000017723156,0.5721427,0.00011131589,0.000005792536,0.00015004215,0.0000034274804,0.00002285533,0.0001865606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877596,0.000030355475,0.00019992197,0.00027604066,0.0003454697,0.00037225927],"domain_scores_gemma":[0.9992512,0.00007630771,0.00007551068,0.00045452506,0.00003239504,0.00011009144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003704094,0.00015095051,0.00018235933,0.000093014954,0.00008755957,0.00017691811,0.00039809634,0.000041914715,0.00002265245],"category_scores_gemma":[0.00000852143,0.00010497571,0.000017524519,0.0005610717,0.000052845528,0.00016980807,0.00007870472,0.0002079515,0.000019560426],"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.000007655205,0.00012978469,0.00016018715,0.000066215856,0.000019064208,0.000018523038,0.0032251975,0.42894715,0.000031670814,0.56589115,0.000056135035,0.0014472674],"study_design_scores_gemma":[0.0011503462,0.00016149189,0.00007836187,0.0001311116,0.0000069862936,0.000022271026,0.0007574062,0.98725176,0.00032030416,0.00874933,0.0009809682,0.0003896779],"about_ca_topic_score_codex":0.0000030786052,"about_ca_topic_score_gemma":0.000012531241,"teacher_disagreement_score":0.5583046,"about_ca_system_score_codex":0.00002958147,"about_ca_system_score_gemma":0.000056677476,"threshold_uncertainty_score":0.42807853},"labels":[],"label_agreement":null},{"id":"W1975073433","doi":"10.1016/j.dam.2005.03.004","title":"On the computational complexity of defining sets","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Computational complexity theory; Feedback vertex set; Discrete mathematics; Dominating set; Integer (computer science); Set (abstract data type); Graph; Algorithm; Computer science","score_opus":0.022911517164400135,"score_gpt":0.22810424032527768,"score_spread":0.20519272316087755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975073433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7739216,0.00005474337,0.04760599,0.0001228248,0.000070414564,0.0003436658,0.00006851314,0.00021424657,0.17759797],"genre_scores_gemma":[0.9854142,9.962334e-7,0.014460439,0.00004774576,0.000011226934,0.000020983209,0.000016558002,0.000019306133,0.0000085582815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939984,0.000008680252,0.00024014115,0.00006725199,0.00016485326,0.000119231765],"domain_scores_gemma":[0.9994492,0.0002659267,0.000054324748,0.00019289271,0.000012357294,0.00002529063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019729337,0.00010734413,0.0001573802,0.000029896722,0.00005767926,0.000013201022,0.00014241821,0.00003342968,0.000085167274],"category_scores_gemma":[0.0000094573625,0.000075546486,0.00004901383,0.000086506654,0.00008851718,0.000019563473,0.00001643329,0.00009288538,0.00016513611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024213089,0.00001720428,0.0000016895004,0.00008756311,0.000027710927,1.1947411e-7,0.0010709842,0.060168996,0.00042312915,0.9374378,0.00049515953,0.00026722637],"study_design_scores_gemma":[0.00020065716,0.000011785344,0.00007829362,0.00006655887,0.000017087228,0.000003941651,0.0007972466,0.23122947,0.00261771,0.7645816,0.00023985452,0.00015577796],"about_ca_topic_score_codex":3.2113215e-7,"about_ca_topic_score_gemma":0.0000010814049,"teacher_disagreement_score":0.21149255,"about_ca_system_score_codex":0.00001192472,"about_ca_system_score_gemma":0.0000037760933,"threshold_uncertainty_score":0.30806965},"labels":[],"label_agreement":null},{"id":"W1975784696","doi":"10.1016/j.dam.2007.02.003","title":"A survey of scheduling with controllable processing times","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":419,"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":"Scheduling (production processes); Computer science; Dynamic priority scheduling; Mathematical optimization; Rate-monotonic scheduling; Fair-share scheduling; Data processing; Distributed computing; Mathematics; Database; Schedule","score_opus":0.012435765269643264,"score_gpt":0.23287126122586468,"score_spread":0.22043549595622142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975784696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04961553,0.00022734002,0.92838097,0.0000039642955,0.000028090337,0.00019082818,0.000007401092,0.00023724455,0.021308666],"genre_scores_gemma":[0.57266915,0.0000042384213,0.4272251,0.000006556024,0.000013591224,0.000005706665,0.000013533647,0.000033617922,0.000028469345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999129,0.0000035332826,0.0003284595,0.00010988549,0.00020089529,0.00022821518],"domain_scores_gemma":[0.9994345,0.00013090415,0.000091652975,0.00017605236,0.00010451173,0.00006241031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055079686,0.00014837994,0.00027454592,0.00007525737,0.00004371601,0.00003232075,0.00010883142,0.00006510986,0.00002476661],"category_scores_gemma":[0.00003681291,0.000120553894,0.000020475793,0.0003429758,0.000044546858,0.000049935043,0.000012713732,0.00009893119,0.000011335657],"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.0001225775,0.00015549762,0.0006261894,0.0017021444,0.00026460906,0.0000066466882,0.0038965154,0.9602208,0.010093738,0.00914966,0.00005456777,0.01370706],"study_design_scores_gemma":[0.0008190778,0.000021498388,0.00030481283,0.00012742788,0.00004151857,0.0000034688485,0.000983908,0.9751574,0.021915877,0.00034112355,0.000011816498,0.00027206543],"about_ca_topic_score_codex":0.0000047493886,"about_ca_topic_score_gemma":0.000012124377,"teacher_disagreement_score":0.52305365,"about_ca_system_score_codex":0.000016799511,"about_ca_system_score_gemma":0.000024145118,"threshold_uncertainty_score":0.4916045},"labels":[],"label_agreement":null},{"id":"W1975965952","doi":"10.1016/j.dam.2005.02.018","title":"Monotonicity and positive invariance of linear systems over dioids","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Monotonic function; Discrete mathematics; Combinatorics; Mathematical economics; Mathematical analysis","score_opus":0.004826318827618837,"score_gpt":0.20682724381977644,"score_spread":0.2020009249921576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975965952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063868076,0.000562906,0.92363286,0.000011340454,0.000056429297,0.00068223977,0.000046775764,0.00017436457,0.010965035],"genre_scores_gemma":[0.9341862,0.00006731278,0.065529004,0.000008696839,0.000069224625,0.000052111864,0.000009734858,0.000040169234,0.000037534992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923813,0.0000058101436,0.0003471885,0.00012230118,0.0001341476,0.00015241712],"domain_scores_gemma":[0.9995239,0.00007493982,0.00010152718,0.00022280471,0.00002952456,0.000047296642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000968604,0.00015091448,0.00030660364,0.00003976678,0.000031345146,0.000016901233,0.00008296968,0.000076170996,0.0000040147474],"category_scores_gemma":[0.000013507459,0.00014359217,0.000025477959,0.00008994544,0.000032680407,0.00011052798,0.00002777621,0.0000819172,0.000007868343],"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.000012114877,0.00002768274,0.00002040893,0.0006040811,0.00009818675,7.4268377e-7,0.0017092121,0.83309907,0.03184864,0.13157915,0.000038322967,0.00096242625],"study_design_scores_gemma":[0.00044983617,0.000010598507,0.00007049525,0.000093958646,0.00003144025,0.000003663592,0.00016107087,0.99263275,0.0055295816,0.00068922987,0.00015012633,0.0001772319],"about_ca_topic_score_codex":0.000005007288,"about_ca_topic_score_gemma":0.0000023524403,"teacher_disagreement_score":0.8703181,"about_ca_system_score_codex":0.00004661727,"about_ca_system_score_gemma":0.0000054952498,"threshold_uncertainty_score":0.5855519},"labels":[],"label_agreement":null},{"id":"W1976067517","doi":"10.1016/j.dam.2007.05.036","title":"Problems related to a de Bruijn–Erdös theorem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":48,"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":"De Bruijn sequence; Mathematics; Generalization; Metric space; Combinatorics; De Bruijn graph; Discrete mathematics; Set (abstract data type); Plane (geometry); Geometry; Mathematical analysis; Computer science","score_opus":0.010794055965107775,"score_gpt":0.25584033915541904,"score_spread":0.24504628319031127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976067517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038402177,0.00002074326,0.92240536,0.00033885456,0.00008657383,0.00037850428,0.0000012261211,0.00019742417,0.03816914],"genre_scores_gemma":[0.56844175,0.0000018161127,0.4307845,0.00033105645,0.000034873345,0.000024793451,0.0000070744427,0.000012530937,0.00036160086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987233,0.000010450258,0.0003499727,0.00027347877,0.00030426876,0.0003384736],"domain_scores_gemma":[0.999122,0.0001655812,0.000098385506,0.00039522853,0.000057519777,0.00016127576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121404,0.00014390737,0.00015077392,0.00015056385,0.00011980977,0.000113934446,0.00047336158,0.00006951183,0.000018050521],"category_scores_gemma":[0.000046319394,0.00012933013,0.000049307797,0.0007220006,0.000022176317,0.00011035887,0.0001663227,0.00010916163,0.00019895713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003549661,0.000055443805,0.000006067038,0.000034653807,0.000014483281,0.0000035876424,0.004287652,0.0041034888,0.0129809985,0.96597725,0.00031014986,0.012222698],"study_design_scores_gemma":[0.0004523637,0.000079956255,0.0004932437,0.000050591178,0.000016750502,0.0000533231,0.00031641542,0.09530148,0.022105198,0.8767279,0.003957738,0.0004450805],"about_ca_topic_score_codex":0.0000015032169,"about_ca_topic_score_gemma":0.0000034307723,"teacher_disagreement_score":0.5300396,"about_ca_system_score_codex":0.00005370399,"about_ca_system_score_gemma":0.000049890354,"threshold_uncertainty_score":0.5273929},"labels":[],"label_agreement":null},{"id":"W1976577139","doi":"10.1016/j.dam.2012.01.024","title":"Finding and listing induced paths and cycles","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; Graph; Listing (finance); Time complexity; Running time; Discrete mathematics; Algorithm","score_opus":0.047435364140021107,"score_gpt":0.3154596740394087,"score_spread":0.26802430989938764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976577139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6389355,0.00018077306,0.3509968,0.000075899974,0.000041875188,0.0002610553,0.0000019499792,0.00013025219,0.009375917],"genre_scores_gemma":[0.7996876,0.000013278386,0.20017785,0.000031042524,0.00003209703,0.000022020557,7.6628373e-7,0.000013807278,0.00002149045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989687,0.000016792568,0.00018672702,0.0002157316,0.00021250545,0.00039950595],"domain_scores_gemma":[0.9990419,0.00034274225,0.000088075074,0.00034555804,0.000016511176,0.00016521974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055818807,0.00014138139,0.00017538563,0.00008699736,0.0001900093,0.00013634493,0.00028013653,0.000052846604,0.0000030803712],"category_scores_gemma":[0.00009261602,0.000120099205,0.000017981494,0.00019354526,0.00008010338,0.00034322223,0.00052327017,0.00015549871,0.000011560198],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016321324,0.000021155469,0.00030824542,0.000095284406,0.000009018214,0.0000012263415,0.0051624267,9.1555086e-7,0.018224718,0.9579905,0.000005937463,0.018178904],"study_design_scores_gemma":[0.00075530994,0.00006289844,0.0037359863,0.00014542897,0.000027483886,0.00009053021,0.004269614,0.02150313,0.023693494,0.94465566,0.0002203911,0.00084007776],"about_ca_topic_score_codex":0.0000010198085,"about_ca_topic_score_gemma":4.1588876e-7,"teacher_disagreement_score":0.16075215,"about_ca_system_score_codex":0.000012092875,"about_ca_system_score_gemma":0.000008465665,"threshold_uncertainty_score":0.48975033},"labels":[],"label_agreement":null},{"id":"W1977160818","doi":"10.1016/j.dam.2014.10.022","title":"Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Regret; Mathematics; Minimax; Vertex (graph theory); Cactus; Algorithm; Tree (set theory); Path (computing); Time complexity; Combinatorics; Minimum spanning tree; Binary logarithm; Computer science; Mathematical optimization; Graph","score_opus":0.024277186163922323,"score_gpt":0.23960004340827668,"score_spread":0.21532285724435435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977160818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054639573,0.000029106319,0.8484332,0.0013285482,0.0007944238,0.0015360262,0.00001392098,0.00037458714,0.14202622],"genre_scores_gemma":[0.9345839,0.00004362262,0.05304062,0.0057599787,0.0023434637,0.0008074498,0.0007341005,0.00018177733,0.0025050596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819124,0.00000496406,0.0005365807,0.00040182268,0.00038501146,0.00048039696],"domain_scores_gemma":[0.9989473,0.00005406493,0.00018062626,0.00064290065,0.00014320266,0.000031882373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074771163,0.00031393825,0.00034578244,0.00012800343,0.00022111522,0.00021895887,0.0004249509,0.00010519388,0.00026588235],"category_scores_gemma":[0.000112269656,0.00027767284,0.00015977843,0.0002554362,0.00005986789,0.00026888112,0.00021413364,0.000116757226,0.00046324794],"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.00006076487,0.0004342411,0.00009156174,0.0018493686,0.00013853368,0.0000010191895,0.0003510112,0.002988115,0.00010956545,0.8431003,0.08083867,0.07003684],"study_design_scores_gemma":[0.0010283694,0.00001238851,0.00012212286,0.000052707637,0.00010629149,3.9317217e-7,0.00060451886,0.66570735,0.00002077523,0.022374596,0.3095196,0.0004509085],"about_ca_topic_score_codex":0.000035083405,"about_ca_topic_score_gemma":0.00006820782,"teacher_disagreement_score":0.92911994,"about_ca_system_score_codex":0.000036404526,"about_ca_system_score_gemma":0.0000069850516,"threshold_uncertainty_score":0.9999675},"labels":[],"label_agreement":null},{"id":"W1977619874","doi":"10.1016/s0166-218x(99)00227-9","title":"Coding, Cryptography, and Computer Security","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Chaos-based Image/Signal Encryption","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 Lethbridge","funders":"","keywords":"Cryptography; Mathematics; Coding (social sciences); Theoretical computer science; Computer security; Computer science; Algorithm; Statistics","score_opus":0.007603113787219689,"score_gpt":0.22017122687192142,"score_spread":0.21256811308470172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977619874","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048312,0.000041589785,0.93031913,0.00016696949,0.00005742531,0.00031996446,0.000005837443,0.00034192327,0.020435132],"genre_scores_gemma":[0.4942944,0.000066330365,0.50490445,0.0005098114,0.00010682354,0.000037639173,0.000009785363,0.000026585765,0.000044199947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998679,0.000016495436,0.00029403588,0.00039533855,0.00031205433,0.0003030711],"domain_scores_gemma":[0.9990852,0.00010899671,0.000088791036,0.0005525344,0.00002935902,0.00013511357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000240651,0.00022077613,0.00024942541,0.00009028486,0.00013830977,0.00024825073,0.00048037118,0.00007152044,0.00014481632],"category_scores_gemma":[0.0000044180474,0.00020113627,0.00007032888,0.0003028289,0.000112385955,0.00025775717,0.00016090418,0.00016249013,0.0001570785],"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.00000799525,0.000120598306,0.000016031632,0.00015960612,0.0000294074,0.000009051679,0.0036223123,0.00005038019,0.0022193994,0.9604154,0.0014818939,0.03186791],"study_design_scores_gemma":[0.0012259847,0.0001294385,0.0003808934,0.00010786375,0.000042885735,0.000066280474,0.000118118325,0.5063598,0.0052821147,0.48086107,0.004589555,0.0008359565],"about_ca_topic_score_codex":0.000005110396,"about_ca_topic_score_gemma":0.0000015844954,"teacher_disagreement_score":0.50630945,"about_ca_system_score_codex":0.00001892541,"about_ca_system_score_gemma":0.000016958082,"threshold_uncertainty_score":0.8202099},"labels":[],"label_agreement":null},{"id":"W1979637305","doi":"10.1016/j.dam.2004.07.007","title":"Minimization of ordered, symmetric half-products","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Minification; Algebra over a field; Mathematical optimization; Pure mathematics","score_opus":0.021628327450887167,"score_gpt":0.2727581203581696,"score_spread":0.25112979290728243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979637305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010546044,0.00007864359,0.97512245,0.00030178952,0.00005655476,0.00041874385,0.0000029353923,0.00012894617,0.013343874],"genre_scores_gemma":[0.47953296,0.000018145975,0.5203089,0.000023726223,0.00001621164,0.000024874216,0.0000048519896,0.000017058177,0.000053288935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847376,0.000013705102,0.0003768066,0.00034003097,0.00049267075,0.00030302227],"domain_scores_gemma":[0.99849004,0.00012917598,0.00020586042,0.00094718864,0.00015227133,0.00007547007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031097577,0.00016008699,0.00025746247,0.00029939046,0.00007797408,0.00005108954,0.0009011075,0.000058736252,0.0000075699413],"category_scores_gemma":[0.00021159936,0.00014068531,0.000048737336,0.0019498179,0.00011323749,0.00021386702,0.00027779,0.000118468124,0.000059506234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004568977,0.00010257538,0.0000021631631,0.00016207482,0.000014942869,0.0000020571797,0.0007745813,0.0012442154,0.0062780464,0.98788816,0.000018517543,0.0035080793],"study_design_scores_gemma":[0.0006749534,0.000053734315,0.000037967282,0.00004116301,0.00001157623,0.000009926639,0.00024065934,0.004953455,0.10280109,0.8907577,0.00018474921,0.00023304744],"about_ca_topic_score_codex":0.000002916151,"about_ca_topic_score_gemma":7.4559136e-7,"teacher_disagreement_score":0.4689869,"about_ca_system_score_codex":0.000039925257,"about_ca_system_score_gemma":0.00008136882,"threshold_uncertainty_score":0.57369804},"labels":[],"label_agreement":null},{"id":"W1980067218","doi":"10.1016/s0166-218x(02)00502-4","title":"A lower bound for the job insertion problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","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":"Kommission für Technologie und Innovation; École Polytechnique Fédérale de Lausanne","keywords":"Mathematics; Upper and lower bounds; Combinatorics; Job loss","score_opus":0.013528224513189068,"score_gpt":0.22615687908057705,"score_spread":0.21262865456738797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980067218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045840284,0.00011796649,0.96903986,0.000051215142,0.00018295199,0.0005846874,0.0000055158475,0.00024803542,0.025185734],"genre_scores_gemma":[0.19857849,0.00004335674,0.8002986,0.000093048555,0.00007210793,0.00045401504,0.000012074777,0.00007959997,0.0003687415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994301,0.0000028786096,0.00019167033,0.00009278339,0.00010912042,0.00017342037],"domain_scores_gemma":[0.9995719,0.00011651034,0.000031269097,0.00021816857,0.000026991876,0.000035134803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018306907,0.00011997177,0.000112565,0.000024570234,0.00011055968,0.00007076665,0.00010008616,0.0000568244,0.000038306585],"category_scores_gemma":[0.000030008541,0.000084973166,0.000048552378,0.00011770862,0.000024237324,0.00003378199,0.000007090358,0.00007723731,0.000037140206],"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.000014988174,0.000089767884,0.00000804488,0.0006461034,0.00020560225,7.6833606e-7,0.0032176985,0.31621572,0.0028307564,0.66934836,0.0027702632,0.0046519074],"study_design_scores_gemma":[0.00080839783,0.000023261273,0.000015771533,0.00004125291,0.000103873135,0.000006583469,0.0012338406,0.92957693,0.005908473,0.052196957,0.009684193,0.00040043698],"about_ca_topic_score_codex":3.2145869e-7,"about_ca_topic_score_gemma":0.0000010423693,"teacher_disagreement_score":0.61715144,"about_ca_system_score_codex":0.000021069698,"about_ca_system_score_gemma":0.000010505523,"threshold_uncertainty_score":0.34651053},"labels":[],"label_agreement":null},{"id":"W1980213624","doi":"10.1016/j.dam.2011.01.014","title":"Separator orders in interval, cocomparability, and AT-free graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied 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":"University of Saskatchewan","funders":"","keywords":"Mathematics; Separator (oil production); Combinatorics; Interval graph; Interval (graph theory); Discrete mathematics; Graph; Chordal graph; 1-planar graph","score_opus":0.041937089263702064,"score_gpt":0.29236340334544086,"score_spread":0.2504263140817388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980213624","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7022559,0.000103124104,0.25657383,0.00012717489,0.000065052445,0.0010373824,0.000009036938,0.00023777722,0.039590746],"genre_scores_gemma":[0.76824737,0.00001465377,0.23147482,0.00006667089,0.0000045133042,0.00011569695,0.0000015625808,0.000020965983,0.000053756557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836695,0.000039189606,0.00039355204,0.00046778726,0.00030464111,0.0004278985],"domain_scores_gemma":[0.99815446,0.00020300427,0.00010933224,0.0013480034,0.00003657454,0.00014860946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059821794,0.00021671806,0.0003347357,0.0001928605,0.00009291417,0.000059619066,0.0014202354,0.00006944051,0.00004272849],"category_scores_gemma":[0.00006887505,0.00018927046,0.00005614171,0.00052793784,0.00031475056,0.00022957633,0.0015518444,0.00020444498,0.00005556898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002708586,0.000120319906,0.00074059004,0.00011688247,0.000016108641,0.0000082678325,0.005624473,0.000004114739,0.0009841764,0.9914976,0.00016761043,0.0006928029],"study_design_scores_gemma":[0.00062901573,0.00005757425,0.0009940802,0.00002926509,0.000005169994,0.000010920384,0.000407367,0.0051019588,0.0035202831,0.9888534,0.00013102753,0.00025994756],"about_ca_topic_score_codex":0.000009870984,"about_ca_topic_score_gemma":0.000061614825,"teacher_disagreement_score":0.06599147,"about_ca_system_score_codex":0.0000444192,"about_ca_system_score_gemma":0.000022217842,"threshold_uncertainty_score":0.7718226},"labels":[],"label_agreement":null},{"id":"W1981043030","doi":"10.1016/j.dam.2004.10.010","title":"Subset-conjunctive rules for breast cancer diagnosis","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Population; Set (abstract data type); Integer (computer science); Sequence (biology); Algorithm; Computer science; Medicine","score_opus":0.018436031217841865,"score_gpt":0.2603765067945547,"score_spread":0.24194047557671283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981043030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009842771,0.00026447835,0.9569292,0.004894271,0.00021944386,0.0012152902,0.0005155637,0.00035895876,0.025759997],"genre_scores_gemma":[0.3313254,0.00013367407,0.66492313,0.00093668594,0.00035105238,0.0021757102,0.000019377572,0.00003707431,0.0000978669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874336,0.0000060666393,0.000284961,0.00036334447,0.00022687887,0.00037539727],"domain_scores_gemma":[0.99898976,0.00018456917,0.00014486603,0.00052063155,0.000059170154,0.00010102408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016886574,0.00021797742,0.00028004544,0.000054206255,0.00015659501,0.00015929066,0.0006901082,0.000076335746,0.00008269324],"category_scores_gemma":[0.00001093354,0.00016645002,0.00010647593,0.00015375398,0.000055520315,0.00021477522,0.00016163551,0.0000851884,0.00011552532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010691672,0.00016842838,0.000057614347,0.00010647982,0.00006062513,0.0000010632331,0.0020073734,0.00013521772,0.00013574015,0.8356551,0.006494951,0.15516673],"study_design_scores_gemma":[0.0035893945,0.00017229897,0.004635246,0.00021982056,0.00024464633,0.00005046619,0.0011981714,0.26836997,0.0078316135,0.65555924,0.055765536,0.00236357],"about_ca_topic_score_codex":0.0000075399385,"about_ca_topic_score_gemma":0.0000130624085,"teacher_disagreement_score":0.32148266,"about_ca_system_score_codex":0.000057449215,"about_ca_system_score_gemma":0.000037689286,"threshold_uncertainty_score":0.67876345},"labels":[],"label_agreement":null},{"id":"W1981209126","doi":"10.1016/j.dam.2006.06.004","title":"Formulas for cube roots in <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si710.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">F</mml:mi></mml:mrow><mml:mrow><mml:msup><mml:mrow><mml:mn>3</mml:mn></mml:mrow><mml:mrow><mml:mi>m</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:msub></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scroll; Mathematics; Cube (algebra); Algorithm; Computer science; Database; Combinatorics; Theology","score_opus":0.017826701568944153,"score_gpt":0.23815581394651023,"score_spread":0.22032911237756608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981209126","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18899965,0.0013869267,0.0127572045,0.0009924141,0.0038960066,0.0001450196,0.000717203,0.0006187125,0.7904869],"genre_scores_gemma":[0.9655497,0.0012449895,0.018514397,0.0022099887,0.0032435355,0.004166826,0.0024041852,0.0019069576,0.0007594233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97990626,0.0006987593,0.004470522,0.004011733,0.0051318323,0.0057808645],"domain_scores_gemma":[0.98297006,0.003905589,0.004575397,0.0059525566,0.0003686488,0.002227722],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0047054375,0.0021308074,0.0008587216,0.0016070844,0.003234559,0.0043910085,0.0065289726,0.004755902,0.731571],"category_scores_gemma":[0.001898742,0.004354307,0.0042675342,0.003521461,0.0033006533,0.0033279671,0.0051515726,0.0033413856,0.0034684206],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024339235,0.00063056516,0.000011150395,0.0028086787,0.0019254598,0.0015257775,0.00356347,0.00242435,0.002871619,0.6082466,0.37112772,0.0024306374],"study_design_scores_gemma":[0.005307708,0.002453605,0.0000924508,0.0023796044,0.0027324755,0.00242488,0.0035921794,0.073345564,0.89536303,0.0022065355,0.0061000106,0.0040019834],"about_ca_topic_score_codex":0.00199105,"about_ca_topic_score_gemma":0.00307778,"teacher_disagreement_score":0.8924914,"about_ca_system_score_codex":0.000041083767,"about_ca_system_score_gemma":0.0029605033,"threshold_uncertainty_score":0.9994118},"labels":[],"label_agreement":null},{"id":"W1981399828","doi":"10.1016/s0166-218x(03)00304-4","title":"Hereditary dominating pair graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Research Council Canada; National Science Council","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Path graph; Dominating set; Induced path; Graph; Discrete mathematics; Line graph; Pathwidth; Graph power","score_opus":0.018307557652128232,"score_gpt":0.2723833924507984,"score_spread":0.2540758347986702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981399828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013813509,0.00008573804,0.90078855,0.00009975654,0.00011335277,0.00040366585,0.000002891947,0.0003106339,0.084381916],"genre_scores_gemma":[0.4162366,0.000005575956,0.5833473,0.00009048177,0.000017836237,0.00008520442,0.0000024158433,0.000029018043,0.00018554761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981546,0.000049925544,0.00035713328,0.0004117471,0.0005012514,0.00052535534],"domain_scores_gemma":[0.9982477,0.0004084041,0.00013352225,0.0010003278,0.00005758174,0.00015245394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084424234,0.00022528986,0.00026317468,0.0001487692,0.00021365307,0.0001149409,0.00096232345,0.00007228102,0.00004097861],"category_scores_gemma":[0.00016412414,0.00019498271,0.00010074131,0.0006794335,0.0001271635,0.0002675654,0.00022947394,0.00025081652,0.00014023045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019077168,0.000053879397,0.000013135563,0.00006605482,0.000017249164,0.000015601361,0.0010108749,0.000036174028,0.0021934328,0.99326026,0.00022782602,0.0031035861],"study_design_scores_gemma":[0.00033670137,0.00002827241,0.000012614259,0.000023698125,0.000006226714,0.000032495293,0.0008071556,0.0046965955,0.014025078,0.97895557,0.00079753937,0.00027803943],"about_ca_topic_score_codex":6.047691e-7,"about_ca_topic_score_gemma":7.195273e-7,"teacher_disagreement_score":0.40242308,"about_ca_system_score_codex":0.000029703891,"about_ca_system_score_gemma":0.000040455885,"threshold_uncertainty_score":0.7951164},"labels":[],"label_agreement":null},{"id":"W1981843507","doi":"10.1016/j.dam.2010.02.011","title":"A General Label Search to investigate classical graph search algorithms","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Search algorithm; Algorithm; Graph; Mathematical optimization; Combinatorics","score_opus":0.03913475955611867,"score_gpt":0.3226654876041811,"score_spread":0.28353072804806245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981843507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1882065,0.000009144336,0.80099195,0.0015898956,0.0001588,0.00087370496,0.000017143402,0.00034465344,0.0078081912],"genre_scores_gemma":[0.10610362,0.0000064051246,0.89212596,0.00043882674,0.00016977768,0.0002015077,0.000009843577,0.00006927679,0.0008747943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961638,0.00006722846,0.00047352602,0.00083836855,0.0012981659,0.0011589113],"domain_scores_gemma":[0.99676365,0.00033817126,0.0000655787,0.0017754474,0.00018664422,0.00087050267],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013562941,0.00036312232,0.0004219735,0.00042289874,0.000326886,0.00040012907,0.0025732226,0.00017779425,0.00004407618],"category_scores_gemma":[0.00011621236,0.00031101028,0.00010961307,0.0016174873,0.0004714582,0.00028479088,0.0011254235,0.0011683342,0.00065822614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009449324,0.000115191164,0.000010354323,0.00005554526,0.000023458686,0.000017004957,0.0016114316,0.0001027066,0.17889869,0.80816334,0.00029565475,0.010697162],"study_design_scores_gemma":[0.0010778297,0.00020235551,0.0001353858,0.00003839654,0.00001447296,0.000055278473,0.0003332816,0.21525835,0.13424549,0.646243,0.0014710014,0.00092521904],"about_ca_topic_score_codex":0.000008008736,"about_ca_topic_score_gemma":0.000012064587,"teacher_disagreement_score":0.21515563,"about_ca_system_score_codex":0.00003978831,"about_ca_system_score_gemma":0.00016818005,"threshold_uncertainty_score":0.9999342},"labels":[],"label_agreement":null},{"id":"W1982429141","doi":"10.1016/j.dam.2012.12.010","title":"Graph models and their efficient implementation for sparse Jacobian matrix determination","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Mathematics; Sparse matrix; Graph; Matrix (chemical analysis); Mathematical optimization; Algorithm; Combinatorics; Applied mathematics","score_opus":0.016980310951542593,"score_gpt":0.2596519545351472,"score_spread":0.24267164358360463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982429141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114496134,0.000042621166,0.8823118,0.0000142806475,0.000022541333,0.001261134,0.000026529002,0.00030635123,0.0015185658],"genre_scores_gemma":[0.89122355,0.00002546986,0.10793397,0.000012668813,0.000019691055,0.0006977564,0.00003538828,0.00004097049,0.0000105436075],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935615,0.0000029867288,0.00024633255,0.00012357075,0.00007669668,0.00019424858],"domain_scores_gemma":[0.99965835,0.000055047843,0.00004882636,0.00015959614,0.00002827307,0.00004993322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000115312505,0.00016062787,0.0001616454,0.00008485154,0.000058475973,0.00007068361,0.00008011167,0.00006165388,0.000019255369],"category_scores_gemma":[0.0000022418528,0.00013387263,0.00004160477,0.00006944842,0.000021067499,0.00009064167,0.00001965944,0.000047224054,0.000007636966],"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.000010283594,0.0001280128,0.000010234323,0.0025409625,0.00014084241,7.2937416e-7,0.017139189,0.015037396,0.43997654,0.30498928,0.0038645407,0.216162],"study_design_scores_gemma":[0.00026957365,0.00002419086,0.000013913475,0.000019487334,0.000022732895,0.0000023986868,0.001627062,0.7721706,0.059729625,0.16585977,0.00004884957,0.00021177957],"about_ca_topic_score_codex":0.0000031828786,"about_ca_topic_score_gemma":0.0000022309357,"teacher_disagreement_score":0.7767274,"about_ca_system_score_codex":0.000022357452,"about_ca_system_score_gemma":0.0000033909346,"threshold_uncertainty_score":0.54591674},"labels":[],"label_agreement":null},{"id":"W1983564337","doi":"10.1016/s0166-218x(00)00338-3","title":"On the robustness of primitive words","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Prefix; Morphism; Robustness (evolution); Arithmetic; Symbol (formal); Combinatorics; Theoretical computer science; Computer science; Linguistics; Programming language; Biology","score_opus":0.02056261474225464,"score_gpt":0.21674798330922246,"score_spread":0.19618536856696783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983564337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06059911,0.00003668659,0.8468603,0.0006087132,0.00009383892,0.00033627573,0.0000049007663,0.00014143958,0.09131877],"genre_scores_gemma":[0.9524718,0.0000090409085,0.047016352,0.00022798915,0.000028657738,0.00004091991,8.8192746e-7,0.000014551207,0.0001898343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990784,0.00001670043,0.00023428141,0.00018882666,0.00029042142,0.00019138065],"domain_scores_gemma":[0.99845845,0.00053825974,0.00015745794,0.00078600796,0.000023146697,0.000036664635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026558436,0.00013755633,0.00018980094,0.00004164764,0.00008181121,0.000054784545,0.0008916677,0.00004271503,0.0001222844],"category_scores_gemma":[0.000040995477,0.000082969804,0.00006444343,0.00024992862,0.00009381978,0.00007025081,0.00017788052,0.00010981783,0.00007819948],"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.0000010976771,0.00007901248,2.4877934e-7,0.000028935758,0.000014460296,8.505992e-7,0.002401178,0.00021168112,0.0006060567,0.99262106,0.0009012014,0.0031342139],"study_design_scores_gemma":[0.0003711125,0.00007124404,0.0000338425,0.0001384717,0.00002403725,0.0000092253695,0.001649391,0.6443295,0.01826366,0.3344824,0.00026532135,0.00036178436],"about_ca_topic_score_codex":3.9159997e-7,"about_ca_topic_score_gemma":1.6498093e-7,"teacher_disagreement_score":0.89187264,"about_ca_system_score_codex":0.000012460575,"about_ca_system_score_gemma":0.0000059420604,"threshold_uncertainty_score":0.33834103},"labels":[],"label_agreement":null},{"id":"W1983709447","doi":"10.1016/j.dam.2012.08.004","title":"Strongly connected orientations of plane graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Digraph; Mathematics; Combinatorics; Bounded function; Orientation (vector space); Strongly connected component; Plane (geometry); Simply connected space; Connectivity; Graph; Planar graph; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.014305243039027757,"score_gpt":0.2447293648818942,"score_spread":0.23042412184286645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983709447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061862707,0.00006463907,0.91229945,0.000031933745,0.0001987326,0.00042290767,0.000013799663,0.00017517028,0.02493068],"genre_scores_gemma":[0.78361005,0.000004695737,0.2162,0.000024899156,0.000036534868,0.000056560242,0.00001915284,0.00001358733,0.00003450891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880755,0.000013420553,0.00036437204,0.00017042815,0.00029136727,0.00035284852],"domain_scores_gemma":[0.99870265,0.00022076238,0.00022579475,0.0006804598,0.000044610944,0.00012573654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021510941,0.00014948306,0.00024089974,0.000069529735,0.00006462667,0.00003418005,0.0005554669,0.00006308747,0.00004954703],"category_scores_gemma":[0.000019676023,0.00013226867,0.00005643627,0.0004060849,0.000066703135,0.00021280244,0.0001645505,0.00010711525,0.000058021295],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019276335,0.00010405465,0.00010703948,0.00004821868,0.000027587057,3.9977823e-7,0.0023733058,0.000115584,0.0016640126,0.99440426,0.00043198286,0.0007216586],"study_design_scores_gemma":[0.0059739077,0.00052246096,0.009945738,0.0003876435,0.0005274351,0.00013055257,0.009297232,0.2210238,0.10121313,0.64034104,0.0069977175,0.003639337],"about_ca_topic_score_codex":0.0000026913567,"about_ca_topic_score_gemma":0.0000018516363,"teacher_disagreement_score":0.72174734,"about_ca_system_score_codex":0.000015201268,"about_ca_system_score_gemma":0.000021930982,"threshold_uncertainty_score":0.53937596},"labels":[],"label_agreement":null},{"id":"W1983862473","doi":"10.1016/j.dam.2002.11.004","title":"Computing large planar regions in terrains, with an application to fracture surfaces","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Terrain; Embedding; Combinatorics; Mathematics; Heuristic; Planar; Graph; Unit sphere; RADIUS; Planar graph; Plane (geometry); Geometry; Computer science; Artificial intelligence; Mathematical optimization; Computer graphics (images); Geography","score_opus":0.012354288666288241,"score_gpt":0.26839749681263675,"score_spread":0.2560432081463485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983862473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008929366,0.000012735054,0.9760572,0.0002712478,0.000007761962,0.00048817592,0.0000031074396,0.00044901937,0.013781411],"genre_scores_gemma":[0.5045495,5.878282e-7,0.49501553,0.00035780712,0.000004886343,0.000035079593,0.000007424113,0.00001587273,0.000013307556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986965,0.000015781256,0.00026841447,0.0004178029,0.00026255392,0.00033891914],"domain_scores_gemma":[0.99891126,0.000060256465,0.00014211163,0.00073267095,0.000041141633,0.00011255855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000355812,0.00020058257,0.00022570146,0.00012297792,0.00010186049,0.0003132408,0.00071204663,0.000066610315,0.0000010720053],"category_scores_gemma":[0.000028925679,0.00016485897,0.000018833403,0.00052780594,0.000035370045,0.00043185207,0.00008756692,0.00014837796,0.000017646355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000603145,0.00032687993,0.000120310746,0.00012326823,0.00001011634,0.0000086801465,0.007515716,0.0005009222,0.0018777446,0.98564,0.00043262166,0.0034377314],"study_design_scores_gemma":[0.0011861281,0.00034906997,0.0005878198,0.00051372417,0.000027080452,0.00008372349,0.003534551,0.18345448,0.031472173,0.7644255,0.012515802,0.0018499003],"about_ca_topic_score_codex":0.000004827218,"about_ca_topic_score_gemma":0.000029888211,"teacher_disagreement_score":0.49562013,"about_ca_system_score_codex":0.000037931593,"about_ca_system_score_gemma":0.000044403427,"threshold_uncertainty_score":0.67227536},"labels":[],"label_agreement":null},{"id":"W1984765529","doi":"10.1016/j.dam.2006.09.009","title":"Super-simple <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mn>5</mml:mn><mml:mo>,</mml:mo><mml:mn>4</mml:mn><mml:mo stretchy=\"false\">)</mml:mo></mml:math> designs","year":2006,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Simple (philosophy); Mathematics; Algorithm; Combinatorics; Scroll; Discrete mathematics; Theology","score_opus":0.016832993092146,"score_gpt":0.22662424923359775,"score_spread":0.20979125614145175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984765529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9354645,0.003471886,0.008845685,0.00048502407,0.003892189,0.00075308525,0.0033902533,0.0020069578,0.04169041],"genre_scores_gemma":[0.972884,0.0015897742,0.009284448,0.0011089521,0.004151646,0.003853335,0.0036708368,0.00300185,0.00045515996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9746049,0.00095967593,0.006563251,0.0049165743,0.005939277,0.007016302],"domain_scores_gemma":[0.98267806,0.0038809478,0.004556866,0.005411463,0.0006036241,0.0028690365],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005436207,0.004015237,0.0022748513,0.0015285539,0.004034354,0.003944984,0.0058542904,0.0061284285,0.0064226827],"category_scores_gemma":[0.0016854537,0.0062143696,0.0047976472,0.0032584716,0.0030710374,0.002637496,0.0035308003,0.0049025477,0.0068458985],"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.0015992875,0.0012882847,0.000024183542,0.0057327314,0.0043765153,0.0012997626,0.0065628383,0.008264592,0.013301314,0.9017081,0.053190365,0.0026519964],"study_design_scores_gemma":[0.007463461,0.0030836638,0.000048012378,0.0047768364,0.006965344,0.0031465595,0.015963053,0.21056652,0.61593336,0.107561015,0.015553588,0.008938568],"about_ca_topic_score_codex":0.0022188802,"about_ca_topic_score_gemma":0.0013629931,"teacher_disagreement_score":0.79414713,"about_ca_system_score_codex":0.00019446792,"about_ca_system_score_gemma":0.001713697,"threshold_uncertainty_score":0.999642},"labels":[],"label_agreement":null},{"id":"W1985281184","doi":"10.1016/j.dam.2009.04.004","title":"Variable neighborhood search for extremal graphs. 22. Extending bounds for independence to upper irredundance","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Upper and lower bounds; Mathematical proof; Independence number; Graph; Discrete mathematics; Independent set","score_opus":0.02630681998353096,"score_gpt":0.31734610857314616,"score_spread":0.2910392885896152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985281184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017778628,0.00007387981,0.9850201,0.00038930564,0.00013516087,0.002441869,0.00004589183,0.0002317871,0.009884124],"genre_scores_gemma":[0.26934844,0.0000051913266,0.7291172,0.00027337615,0.000069814436,0.0005953355,0.000012211903,0.000045487555,0.00053292746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964605,0.00002453921,0.0005472556,0.00091661076,0.00081989635,0.0012312107],"domain_scores_gemma":[0.99720216,0.0007353702,0.00014576419,0.0012945541,0.00027480122,0.00034738134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014639207,0.00038046332,0.0004881213,0.00034879264,0.00053568836,0.0005065907,0.0020731224,0.00015374734,0.000022104336],"category_scores_gemma":[0.00017990971,0.0003547009,0.00018137928,0.0011146414,0.0000976523,0.0005546413,0.00034302147,0.0002933462,0.0000312983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069139656,0.00012486159,0.0000074180275,0.00016040984,0.000024198687,0.0000023627642,0.0009657383,0.00033376773,0.016786762,0.96926403,0.00025783243,0.0120035065],"study_design_scores_gemma":[0.00073138624,0.00029304874,0.0000377529,0.000084060426,0.000015228081,0.000019969473,0.00027259052,0.046781167,0.012163974,0.9382254,0.0009002769,0.00047518432],"about_ca_topic_score_codex":0.0000010860368,"about_ca_topic_score_gemma":5.27088e-7,"teacher_disagreement_score":0.26757059,"about_ca_system_score_codex":0.00009752139,"about_ca_system_score_gemma":0.00015049092,"threshold_uncertainty_score":0.9998905},"labels":[],"label_agreement":null},{"id":"W1985522690","doi":"10.1016/j.dam.2008.11.011","title":"Edge searching weighted graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Pathwidth; Graph; Enhanced Data Rates for GSM Evolution; Monotonic function; Edge cover; Discrete mathematics; Line graph; Computer science; Artificial intelligence","score_opus":0.017714882409356578,"score_gpt":0.2656131470015109,"score_spread":0.2478982645921543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985522690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001282379,0.000018641587,0.88554925,0.00083751563,0.000038645576,0.00030584773,0.0000013632321,0.00033013851,0.11163622],"genre_scores_gemma":[0.24799407,0.000028192939,0.7509079,0.0006388096,0.000026330508,0.000020074483,0.0000098318715,0.000014244919,0.0003605376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868083,0.000018034923,0.00026738466,0.00027767604,0.0003949179,0.00036116978],"domain_scores_gemma":[0.9990516,0.00007199004,0.000080449296,0.00059619057,0.000048523194,0.00015129014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033453517,0.00015232121,0.00018443019,0.00013693348,0.00017280864,0.00025692364,0.00078955403,0.000054018925,0.00003979135],"category_scores_gemma":[0.000016725984,0.0001267739,0.00006260373,0.00049734995,0.000037171267,0.00022558717,0.00013597417,0.0001806961,0.00015173083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012381079,0.00006571688,0.0000013628737,0.000021883327,0.0000073373753,0.000002760385,0.0016082954,0.000101050384,0.0018983282,0.9832352,0.0006020522,0.012454771],"study_design_scores_gemma":[0.00038693115,0.00005515687,0.0000559064,0.000028713312,0.0000055551764,0.000007280164,0.00011798877,0.3081466,0.0023132071,0.6874291,0.0011745762,0.00027905763],"about_ca_topic_score_codex":7.281166e-7,"about_ca_topic_score_gemma":3.4916505e-7,"teacher_disagreement_score":0.30804554,"about_ca_system_score_codex":0.00001809527,"about_ca_system_score_gemma":0.000035776782,"threshold_uncertainty_score":0.51696897},"labels":[],"label_agreement":null},{"id":"W1985638002","doi":"10.1016/j.dam.2007.10.015","title":"Partition into cliques for cubic graphs: Planar case, complexity and approximation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":48,"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; Partition (number theory); Induced subgraph isomorphism problem; Disjoint sets; Discrete mathematics; Clique-sum; Cograph; Clique; Chordal graph; Induced subgraph; Partition problem; Planar graph; Frequency partition of a graph; Graph; 1-planar graph; Line graph; Graph power","score_opus":0.06445379228865139,"score_gpt":0.3174664405960601,"score_spread":0.2530126483074087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985638002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09367829,0.000047893136,0.9039667,0.00013520573,0.000022918439,0.00076756446,0.000012471262,0.00018014993,0.0011888149],"genre_scores_gemma":[0.45373705,0.000030171024,0.54589856,0.000048601993,0.00001583719,0.00021871598,0.000021964555,0.000014317585,0.000014780562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879813,0.000026147158,0.00030877278,0.00034012395,0.00023832411,0.0002884988],"domain_scores_gemma":[0.99893475,0.00027057613,0.0001377803,0.0004755067,0.000073809526,0.00010757039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039363833,0.00016960735,0.0002390477,0.00012816976,0.00043510343,0.00007351182,0.00030552765,0.000064629596,0.000002773937],"category_scores_gemma":[0.000046991874,0.00015143515,0.00005486441,0.00026256853,0.00030350065,0.0003184159,0.00011418868,0.00011103883,0.000008971243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001313327,0.000048173584,0.000012175234,0.00021751624,0.000014693276,0.000020547463,0.00301662,0.0000083157265,0.0015957013,0.99337393,0.00013142182,0.0015477422],"study_design_scores_gemma":[0.0003341678,0.00006487803,0.00002831054,0.00001717089,0.000007933153,0.00030786195,0.00034749086,0.041143212,0.00479114,0.9526495,0.0001213871,0.00018694377],"about_ca_topic_score_codex":0.000005539927,"about_ca_topic_score_gemma":0.000012174059,"teacher_disagreement_score":0.36005875,"about_ca_system_score_codex":0.000025712232,"about_ca_system_score_gemma":0.000020638023,"threshold_uncertainty_score":0.6175346},"labels":[],"label_agreement":null},{"id":"W1985797130","doi":"10.1016/j.dam.2004.01.005","title":"Minimum average distance of strong orientations of graphs","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Digraph; Multipartite; Upper and lower bounds; Eulerian path; Girth (graph theory); Planar graph; Graph; Connectivity; Discrete mathematics; Lagrangian","score_opus":0.018001465331463636,"score_gpt":0.2891017829121568,"score_spread":0.2711003175806932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985797130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041226264,0.000030767216,0.9480187,0.000037361562,0.000033968237,0.00030371055,0.000023104278,0.000046412348,0.010279682],"genre_scores_gemma":[0.72004265,0.000008330487,0.27986884,0.000006319815,0.00000387998,0.000025707039,0.0000041199823,0.000010891741,0.000029250645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986008,0.000011698289,0.00044617124,0.00023630803,0.00045107765,0.00025395525],"domain_scores_gemma":[0.9986151,0.00016309215,0.00027013314,0.0007858687,0.000092419876,0.00007339222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022393868,0.00013736429,0.00027284547,0.00013685747,0.00006576597,0.000021234526,0.0008076711,0.000039499042,0.0000091499105],"category_scores_gemma":[0.00004013975,0.00012312701,0.000089505666,0.0006867832,0.00023955319,0.0001845633,0.00018996446,0.00010810411,0.0000088232655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067162155,0.00010813585,0.000014157023,0.00014687775,0.00001977663,0.0000014716558,0.0024528345,0.001381335,0.01094392,0.9845263,0.000004507283,0.00039400524],"study_design_scores_gemma":[0.0005272423,0.000050429546,0.000048658854,0.000055200973,0.000008599442,0.0000019973324,0.0006423493,0.0017585821,0.053665683,0.9430854,0.000020634385,0.00013527849],"about_ca_topic_score_codex":0.0000021414469,"about_ca_topic_score_gemma":0.0000029607845,"teacher_disagreement_score":0.6788164,"about_ca_system_score_codex":0.000024779709,"about_ca_system_score_gemma":0.000056256205,"threshold_uncertainty_score":0.5020974},"labels":[],"label_agreement":null},{"id":"W1985890716","doi":"10.1016/j.dam.2013.08.037","title":"A pseudo-polynomial time algorithm for solving the resource dependent assignment problem","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","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":"McMaster University","funders":"","keywords":"Generalized assignment problem; Function (biology); Assignment problem; Task (project management); Time complexity; Mathematical optimization; Mathematics; Weapon target assignment problem; Set (abstract data type); Resource allocation; Polynomial; Polynomial-time approximation scheme; Resource (disambiguation); Algorithm; Computer science","score_opus":0.007609167916331044,"score_gpt":0.20170244246734956,"score_spread":0.19409327455101852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985890716","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010021906,0.000050194383,0.9822322,0.00015884072,0.000083934705,0.001504943,0.000021214975,0.00042071566,0.014525748],"genre_scores_gemma":[0.00928485,0.000008520738,0.9881332,0.00010606027,0.00023682052,0.0011652159,0.000043775915,0.00011110005,0.000910437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988083,0.0000060306884,0.0003721586,0.00019277477,0.00025481547,0.00036589644],"domain_scores_gemma":[0.99924624,0.00019371633,0.00008079703,0.0003506094,0.000036400237,0.000092219525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026649525,0.00023282839,0.00023297513,0.00004445512,0.00017390735,0.00018718679,0.00028724485,0.00009860779,0.00015086464],"category_scores_gemma":[0.000014759973,0.00016891313,0.000081522936,0.00010213811,0.00003910639,0.00006460895,0.000058926493,0.00015534708,0.00029561954],"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.000020649688,0.00040355622,0.0000036361769,0.0011358425,0.0010079445,0.0000040806044,0.016539132,0.5166635,0.037257735,0.013820941,0.087044805,0.3260982],"study_design_scores_gemma":[0.00043157817,0.000015677295,0.0000013411933,0.000028558668,0.00004657833,0.0000049306063,0.0008701652,0.99196666,0.0035961033,0.001804548,0.000981298,0.00025258356],"about_ca_topic_score_codex":0.0000021885198,"about_ca_topic_score_gemma":3.3168027e-7,"teacher_disagreement_score":0.47530314,"about_ca_system_score_codex":0.00006475798,"about_ca_system_score_gemma":0.00001413275,"threshold_uncertainty_score":0.6888078},"labels":[],"label_agreement":null},{"id":"W1986858995","doi":"10.1016/j.dam.2011.07.004","title":"Randomized algorithms and upper bounds for multiple domination in graphs and networks","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematics; Domination analysis; Upper and lower bounds; Combinatorics; Dominating set; Randomized algorithm; Tuple; Graph; Discrete mathematics; Algorithm; Vertex (graph theory)","score_opus":0.02782976408193505,"score_gpt":0.24571431039309174,"score_spread":0.2178845463111567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986858995","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019855263,0.00019031917,0.976873,0.000051951287,0.00009508082,0.0010587577,0.000004309639,0.00008262883,0.0017886859],"genre_scores_gemma":[0.3879579,0.000096090786,0.6115417,0.000059742895,0.000015283735,0.0002894007,0.000006031404,0.000013735887,0.000020157151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885887,0.000025384368,0.00037502625,0.00033619374,0.000135162,0.0002693697],"domain_scores_gemma":[0.9988229,0.00063732575,0.00013296763,0.00029934506,0.00003336897,0.00007405344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008488395,0.00018833778,0.00044192013,0.00015756866,0.00013337607,0.00012452691,0.00028277002,0.000087503635,0.000003457971],"category_scores_gemma":[0.000063123356,0.00015872679,0.00007735149,0.0002221639,0.0002251257,0.00019379793,0.00019241445,0.000110711626,8.173169e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004291685,0.00007189228,0.00004256733,0.000081158505,0.000027732602,0.0000011601229,0.0052230554,0.000008057102,0.00003221588,0.9762161,0.000019296547,0.017847646],"study_design_scores_gemma":[0.019809937,0.000018035733,0.00014430497,0.000023157581,0.000015680242,0.0000050548106,0.00017501779,0.50598556,0.0001256536,0.4735145,0.000026070622,0.00015702982],"about_ca_topic_score_codex":0.000015225103,"about_ca_topic_score_gemma":0.000014425635,"teacher_disagreement_score":0.5059775,"about_ca_system_score_codex":0.000009602354,"about_ca_system_score_gemma":0.0000095188525,"threshold_uncertainty_score":0.64726907},"labels":[],"label_agreement":null},{"id":"W1987788269","doi":"10.1016/j.dam.2014.07.019","title":"On the event distance of Poisson processes with applications to sensors","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"History and advancements in chemistry","field":"Chemistry","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Poisson distribution; Event (particle physics); Event data; Combinatorics; Statistics","score_opus":0.010334318364938852,"score_gpt":0.24811667841072899,"score_spread":0.23778236004579012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987788269","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21373497,0.00003484124,0.3686682,0.00036318746,0.000016760636,0.0006553962,0.000103396116,0.00013995312,0.4162833],"genre_scores_gemma":[0.98646593,0.000004488872,0.01131295,0.00009540348,0.000045192053,0.00043792403,0.000016461947,0.000031511598,0.001590139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991012,0.000002664837,0.00024182699,0.00021737421,0.00027328669,0.00016360701],"domain_scores_gemma":[0.99872535,0.0003573857,0.00018943229,0.0006161283,0.00004899596,0.00006271551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009285488,0.00016405205,0.000183605,0.000012436326,0.000117469564,0.000011756913,0.00029558546,0.000040696515,0.00017435847],"category_scores_gemma":[0.00009555166,0.00010509132,0.00002781474,0.00014420101,0.00009595942,0.000016543543,0.00003356865,0.000108253924,0.000034665914],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001356458,0.00063549954,0.00001956688,0.006917442,0.00010293234,9.233466e-7,0.0034632036,0.0029276218,0.22761846,0.75499415,0.0010520272,0.0021325361],"study_design_scores_gemma":[0.00034313175,0.00003519505,0.0000014961654,0.0005006647,0.000060312374,0.0000025476686,0.0018560627,0.00019218547,0.91065407,0.028982298,0.057003267,0.00036879483],"about_ca_topic_score_codex":3.9174523e-7,"about_ca_topic_score_gemma":0.0000022533861,"teacher_disagreement_score":0.77273095,"about_ca_system_score_codex":0.000037906073,"about_ca_system_score_gemma":0.00002749708,"threshold_uncertainty_score":0.42854998},"labels":[],"label_agreement":null},{"id":"W1988776662","doi":"10.1016/j.dam.2005.07.006","title":"Equivalence of some LP-based lower bounds for the Golomb ruler problem","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","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":"Université de Montréal; Computer Research Institute of Montréal; Université du Québec à Montréal","funders":"","keywords":"Golomb coding; Mathematics; Upper and lower bounds; Ruler; Combinatorics; Equivalence (formal languages); Linear programming; Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Image compression","score_opus":0.011016444497554815,"score_gpt":0.21941546201412174,"score_spread":0.20839901751656692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988776662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1992634,0.0016540708,0.7273836,0.0004259436,0.0006612017,0.004555572,0.00022451387,0.0009049495,0.06492674],"genre_scores_gemma":[0.9799164,0.000012848513,0.019320512,0.000054031614,0.000110385365,0.00036115397,0.0000080323125,0.000055414355,0.00016125607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990024,0.0000059742792,0.0003950228,0.00013091673,0.00018487529,0.00028079606],"domain_scores_gemma":[0.99910134,0.0002768411,0.00009488995,0.00045420555,0.00002742472,0.000045288256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037086406,0.0001924479,0.00026450327,0.000042813506,0.00007939244,0.00003163754,0.00032281413,0.00008244585,0.000037009784],"category_scores_gemma":[0.000010412402,0.00013343763,0.00013248227,0.000110862915,0.00010046501,0.000069510796,0.00002352431,0.000099885874,0.000037697588],"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.00002956583,0.00010284036,0.0000037081622,0.0021557207,0.00014486151,3.8705508e-7,0.0015242628,0.029284459,0.030476365,0.9323362,0.0013306772,0.0026109403],"study_design_scores_gemma":[0.0025836169,0.00016019038,0.00004314169,0.0005748423,0.000426585,0.000008359767,0.0019604329,0.5014894,0.11896795,0.3333018,0.039193545,0.0012901614],"about_ca_topic_score_codex":5.265037e-7,"about_ca_topic_score_gemma":0.0000013744285,"teacher_disagreement_score":0.78065294,"about_ca_system_score_codex":0.000022542928,"about_ca_system_score_gemma":0.0000132423265,"threshold_uncertainty_score":0.54414284},"labels":[],"label_agreement":null},{"id":"W1989181122","doi":"10.1016/s0166-218x(00)00196-7","title":"Fixed topology alignment with recombination","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; City University of Hong Kong","keywords":"Merge (version control); Mathematics; Recombination; Topology (electrical circuits); Combinatorics; Node (physics); Discrete mathematics; Algorithm; Computer science; Physics; Genetics","score_opus":0.00898845320520242,"score_gpt":0.22610393493605466,"score_spread":0.21711548173085224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989181122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013333092,0.000016437269,0.9271003,0.00042739778,0.000056760593,0.0002807309,0.0000043138134,0.00017968946,0.058601253],"genre_scores_gemma":[0.19616911,0.000032421656,0.8022224,0.00029381504,0.000043066084,0.00008637932,0.000037982434,0.000020016356,0.0010948284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990804,0.000009896401,0.00019325047,0.00026825676,0.00024030713,0.00020788015],"domain_scores_gemma":[0.9991945,0.000048222424,0.00007410816,0.00060123147,0.000018355453,0.00006357644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121118974,0.00013237646,0.00016074655,0.000035036457,0.00010914525,0.00008402167,0.00049582927,0.000049052524,0.00025781797],"category_scores_gemma":[0.0000026362934,0.00009426399,0.000022985523,0.0001448977,0.0000379629,0.00017635286,0.00010651037,0.00007300356,0.00018662063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001250728,0.00017981946,0.000004991323,0.000038410224,0.00002390545,0.000008486187,0.0017693341,0.00013637984,0.00077982096,0.86787975,0.0017912538,0.12737532],"study_design_scores_gemma":[0.004071833,0.000691934,0.0005379581,0.00021506428,0.00008022325,0.0001565551,0.0010413014,0.36828506,0.023441691,0.5367916,0.06296294,0.0017238198],"about_ca_topic_score_codex":0.0000054794637,"about_ca_topic_score_gemma":0.0000014788825,"teacher_disagreement_score":0.36814868,"about_ca_system_score_codex":0.000023263883,"about_ca_system_score_gemma":0.000017461192,"threshold_uncertainty_score":0.3843974},"labels":[],"label_agreement":null},{"id":"W1989358594","doi":"10.1016/j.dam.2014.06.007","title":"Constructions of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-critical<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si12.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>-free graphs","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Graph; Combinatorics; Algorithm; Discrete mathematics","score_opus":0.018204848653324352,"score_gpt":0.25829085320337314,"score_spread":0.24008600455004878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989358594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7150432,0.0013630074,0.02434282,0.0010670737,0.0040379306,0.00023528197,0.001536966,0.0007872875,0.25158644],"genre_scores_gemma":[0.9489768,0.0016940251,0.03900299,0.0016358478,0.002330092,0.0026900528,0.0017187526,0.0015837325,0.00036770196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.979624,0.0007518755,0.004554628,0.003969271,0.0058990284,0.0052012443],"domain_scores_gemma":[0.979621,0.005662549,0.0041266307,0.0075436076,0.00054765755,0.002498558],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004749096,0.0022746504,0.0011857705,0.0012572876,0.0035344807,0.0029940186,0.006892463,0.0038314546,0.040790208],"category_scores_gemma":[0.0045977766,0.003741434,0.0037620575,0.0030559485,0.0061314255,0.0030096471,0.006583895,0.0039946088,0.004306504],"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.0017334912,0.0009857189,0.000010776081,0.003977095,0.0024926094,0.0011996301,0.0036450808,0.0024737683,0.005561507,0.93358934,0.041848447,0.0024825584],"study_design_scores_gemma":[0.003351159,0.0019531151,0.00003819485,0.002342765,0.002208814,0.002103241,0.0033151808,0.53945833,0.4318634,0.0071076974,0.0033683202,0.002889778],"about_ca_topic_score_codex":0.0007291121,"about_ca_topic_score_gemma":0.0008723333,"teacher_disagreement_score":0.9264816,"about_ca_system_score_codex":0.000052914547,"about_ca_system_score_gemma":0.0025901208,"threshold_uncertainty_score":0.99899924},"labels":[],"label_agreement":null},{"id":"W1989578968","doi":"10.1016/j.dam.2007.05.044","title":"On bags and bugs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":45,"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":"Science and Engineering Research Board","keywords":"Combinatorics; Mathematics; Chordal graph; Discrete mathematics; Graph; Indifference graph","score_opus":0.01574263487328406,"score_gpt":0.2900160010133184,"score_spread":0.2742733661400344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989578968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045246944,0.000022154301,0.89239293,0.00012926973,0.000040560964,0.00023892839,0.000001038526,0.00014288988,0.061785296],"genre_scores_gemma":[0.7076694,0.0000095688065,0.29178956,0.00020399726,0.00002214303,0.0000150661535,9.843884e-7,0.000018682345,0.0002706154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987875,0.000007294691,0.0002045343,0.0002881863,0.00035177154,0.0003606753],"domain_scores_gemma":[0.9986804,0.00048543763,0.00006457902,0.00060763897,0.000025077137,0.00013683863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072088715,0.00013964843,0.0001561517,0.00012250693,0.00011465901,0.00007559087,0.0005221772,0.00004984996,0.00000956324],"category_scores_gemma":[0.00007346703,0.00011386749,0.000030000918,0.0002894109,0.00011001246,0.00010911809,0.00026024986,0.00016198309,0.00010148206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007836543,0.000030443249,0.000004101812,0.000030674782,0.0000065509444,0.0000070677265,0.00074402307,0.000008607281,0.0033334957,0.98706955,0.00008162763,0.008676026],"study_design_scores_gemma":[0.00020144062,0.00004391886,0.0000901247,0.000022247308,0.0000029357475,0.000010046309,0.00020816996,0.0022378906,0.01233715,0.9843801,0.00029005235,0.00017591614],"about_ca_topic_score_codex":3.5962842e-7,"about_ca_topic_score_gemma":0.0000013122005,"teacher_disagreement_score":0.6624224,"about_ca_system_score_codex":0.00001877843,"about_ca_system_score_gemma":0.000010433785,"threshold_uncertainty_score":0.46433815},"labels":[],"label_agreement":null},{"id":"W1989886714","doi":"10.1016/j.dam.2007.08.045","title":"Digraph searching, directed vertex separation and directed pathwidth","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Digraph; Vertex (graph theory); Mathematics; Directed graph; Directed acyclic graph; Combinatorics; Strongly connected component; Graph","score_opus":0.01467820838175314,"score_gpt":0.2815725775623087,"score_spread":0.26689436918055554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989886714","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015307262,0.00004580245,0.94614327,0.00014021593,0.0000630421,0.00050727685,0.000003956281,0.0008872418,0.036901955],"genre_scores_gemma":[0.48567635,0.00006930622,0.51358205,0.00018237623,0.000027345679,0.000035264995,0.000034475383,0.00002986665,0.000362958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845505,0.000026662308,0.00034618756,0.000349251,0.00042370358,0.00039916657],"domain_scores_gemma":[0.9989198,0.00023638304,0.00011579876,0.00044941588,0.000081356986,0.00019725788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007119578,0.0001843718,0.00021468432,0.00017688202,0.00021176477,0.00025902467,0.00037780832,0.00007867985,0.00001784445],"category_scores_gemma":[0.00006512707,0.00015887282,0.00004135755,0.00058700336,0.00007550732,0.0002474696,0.00020275792,0.00017365406,0.000034746106],"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.000021892034,0.00023008858,0.00017387277,0.00020200515,0.000067556924,0.000013828042,0.012176374,0.00018149006,0.014242568,0.93816614,0.0012665945,0.03325761],"study_design_scores_gemma":[0.0013388194,0.00010662831,0.0032024067,0.000084563326,0.000024520708,0.000021549118,0.00042748966,0.8894653,0.007423146,0.09494158,0.0022318647,0.00073216343],"about_ca_topic_score_codex":0.0000066347325,"about_ca_topic_score_gemma":0.000014700455,"teacher_disagreement_score":0.8892838,"about_ca_system_score_codex":0.000024440013,"about_ca_system_score_gemma":0.00003297235,"threshold_uncertainty_score":0.6478645},"labels":[],"label_agreement":null},{"id":"W1989985245","doi":"10.1016/j.dam.2004.04.001","title":"Fun with algorithms","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.022159716576036687,"score_gpt":0.2613993383699683,"score_spread":0.23923962179393163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989985245","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068928655,0.000017890789,0.9630592,0.00040689373,0.00006318365,0.00025311677,0.0000014360627,0.00029694272,0.029008495],"genre_scores_gemma":[0.3385099,0.00000430948,0.66113734,0.00016199182,0.000042053663,0.000042954412,0.0000014575071,0.000018672277,0.0000813472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871844,0.000003889417,0.0002620685,0.00031732713,0.00037498164,0.00032326626],"domain_scores_gemma":[0.9989365,0.00006178901,0.00011194812,0.00074329576,0.000046730576,0.00009977078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014591803,0.00018445605,0.00019727269,0.000058945927,0.00011158276,0.00016267518,0.00084669987,0.00005509394,0.000017319753],"category_scores_gemma":[0.000014020491,0.0001364672,0.00004142153,0.00032492448,0.000113109374,0.00020697716,0.00017720228,0.0001267184,0.00046811352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002251763,0.000068813424,0.000003019697,0.000023696486,0.00001598151,0.000012667805,0.0033895506,0.0010931812,0.001065623,0.9838253,0.00004015023,0.010459765],"study_design_scores_gemma":[0.00030198402,0.000134589,0.000025500733,0.00008056032,0.00002211038,0.000052566247,0.0016126265,0.019152941,0.11539151,0.86163723,0.0010019658,0.00058639195],"about_ca_topic_score_codex":0.000008667146,"about_ca_topic_score_gemma":0.000007947731,"teacher_disagreement_score":0.33161703,"about_ca_system_score_codex":0.00004461479,"about_ca_system_score_gemma":0.00006173463,"threshold_uncertainty_score":0.6016808},"labels":[],"label_agreement":null},{"id":"W1990242495","doi":"10.1016/j.dam.2003.07.001","title":"A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Interval graph; Mathematics; Graph; Algorithm; Interval (graph theory); Simple (philosophy); Unit interval; SIMPLE algorithm; Combinatorics; Simple graph; Unit (ring theory); Line graph; Pathwidth","score_opus":0.045052827599361286,"score_gpt":0.31071194466239943,"score_spread":0.26565911706303813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990242495","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021424561,0.000050382754,0.9930312,0.000041991254,0.000056167482,0.0008404681,0.000033778448,0.00006901244,0.003734567],"genre_scores_gemma":[0.12680052,0.000028026232,0.87254083,0.00008580471,0.00001909292,0.00038557636,0.000017379876,0.00003564742,0.00008711382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865067,0.000040021627,0.00037678576,0.0002645415,0.0003251026,0.0003428848],"domain_scores_gemma":[0.99783033,0.0010054285,0.00019742383,0.00075400324,0.00014416524,0.00006865386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087987597,0.0001681731,0.00024782744,0.00011368164,0.00016724135,0.00006688259,0.0008473075,0.00005686322,0.000025391613],"category_scores_gemma":[0.00014493271,0.000118299795,0.00014092783,0.00055072975,0.00016866748,0.00014676373,0.00015012157,0.00015059138,0.000020411208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000637194,0.000073357776,0.0000016622035,0.00008905968,0.000051090046,6.2868423e-7,0.0008909409,0.000022469081,0.0012206344,0.88592094,0.00008050601,0.11164233],"study_design_scores_gemma":[0.00042593293,0.00007549741,0.000006476182,0.00002101371,0.000022704276,0.000006354058,0.00093026937,0.050485443,0.020089285,0.9268503,0.00092973106,0.0001570017],"about_ca_topic_score_codex":0.00000211627,"about_ca_topic_score_gemma":0.000002543697,"teacher_disagreement_score":0.12465806,"about_ca_system_score_codex":0.000013522464,"about_ca_system_score_gemma":0.000035652192,"threshold_uncertainty_score":0.48241258},"labels":[],"label_agreement":null},{"id":"W1990401792","doi":"10.1016/j.dam.2007.05.052","title":"Fractionally total colouring <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Graph; Mathematics; Algorithm; Combinatorics","score_opus":0.01713641632784357,"score_gpt":0.23797400099233587,"score_spread":0.2208375846644923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990401792","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46030232,0.0011700595,0.0087966,0.00075177726,0.0034171387,0.00009491957,0.0002374489,0.0005326474,0.52469707],"genre_scores_gemma":[0.96926033,0.0008666559,0.02220594,0.0023171902,0.001622735,0.0013185024,0.000815433,0.0011211913,0.00047204024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98476404,0.00037626323,0.00333334,0.0029032032,0.0046596797,0.0039634593],"domain_scores_gemma":[0.98750395,0.0028791968,0.0035781786,0.0037569667,0.0003549702,0.0019267626],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0043015755,0.0014585884,0.00061727356,0.0009884784,0.002922515,0.0028837454,0.003816297,0.0032346079,0.25262],"category_scores_gemma":[0.0016897413,0.002810938,0.0024848403,0.002218244,0.0021500823,0.001969343,0.0037415796,0.0027660131,0.004555724],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010289277,0.00059007015,0.000009438059,0.0018543417,0.0018183298,0.001260406,0.0039371634,0.0039771767,0.0066071944,0.7389287,0.23775174,0.0022365476],"study_design_scores_gemma":[0.0028213854,0.001632025,0.00006156602,0.0019045197,0.0017634357,0.0021283706,0.003232986,0.060989425,0.9146926,0.005670992,0.002304513,0.0027982092],"about_ca_topic_score_codex":0.0012402483,"about_ca_topic_score_gemma":0.000868019,"teacher_disagreement_score":0.9080854,"about_ca_system_score_codex":0.000034656667,"about_ca_system_score_gemma":0.0020922206,"threshold_uncertainty_score":0.99981636},"labels":[],"label_agreement":null},{"id":"W1990755119","doi":"10.1016/j.dam.2011.04.005","title":"Dichotomy for tree-structured trigraph list homomorphism problems","year":2011,"lang":"en","type":"article","venue":"Discrete Applied 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":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Tree (set theory); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.0410811667948333,"score_gpt":0.27026961887385204,"score_spread":0.22918845207901872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990755119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042811353,0.000063336505,0.9694778,0.00006490212,0.000109507426,0.0018847277,0.00002640969,0.00035659038,0.023735631],"genre_scores_gemma":[0.31950325,0.000014683612,0.67903167,0.00008295348,0.000046090263,0.0008913911,0.00001701712,0.00005859284,0.00035436044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978233,0.000018410952,0.0004918384,0.0005737568,0.00043851082,0.00065419875],"domain_scores_gemma":[0.9979564,0.00020140463,0.00024544093,0.0012776352,0.00010774259,0.00021140027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049989665,0.00032617143,0.00041713633,0.00023086896,0.00023774078,0.00012796141,0.001748205,0.00012291629,0.000045952722],"category_scores_gemma":[0.00004850338,0.00026586835,0.0001895898,0.0006403732,0.0002418068,0.00027602806,0.0002901597,0.00022425642,0.000037570047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027149114,0.00010626732,0.000014253633,0.0001990714,0.00005055262,0.0000043055898,0.004419567,0.0000054561788,0.0067228475,0.98320454,0.00028611248,0.004959879],"study_design_scores_gemma":[0.0009551386,0.00010513573,0.0000641463,0.000031934756,0.000024307466,0.0000138153255,0.00020502778,0.006938087,0.020497084,0.9690643,0.0017018223,0.0003992124],"about_ca_topic_score_codex":0.0000039967094,"about_ca_topic_score_gemma":0.000012842096,"teacher_disagreement_score":0.3152221,"about_ca_system_score_codex":0.000029492112,"about_ca_system_score_gemma":0.000043089865,"threshold_uncertainty_score":0.9999794},"labels":[],"label_agreement":null},{"id":"W1990809933","doi":"10.1016/s0166-218x(01)00237-2","title":"On the computational complexity of strong edge coloring","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":68,"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":"University of Toronto","keywords":"Mathematics; Edge coloring; Combinatorics; Computational complexity theory; Graph coloring; Time complexity; Graph; Completeness (order theory); Matching (statistics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph power; Artificial intelligence; Computer science; Line graph","score_opus":0.09358971132498799,"score_gpt":0.3031898687250434,"score_spread":0.2096001574000554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990809933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020103376,0.000014952421,0.92122144,0.0004474554,0.000034094814,0.00037726667,0.0000090362955,0.000077227254,0.057715137],"genre_scores_gemma":[0.8502447,0.0000018795162,0.14956777,0.0000653949,0.0000123542,0.00003453415,0.0000018502582,0.000011000714,0.00006053157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987306,0.00003013094,0.00027605836,0.00021035015,0.0005026659,0.00025018904],"domain_scores_gemma":[0.9982096,0.00092772255,0.00014862671,0.00060111587,0.00005735206,0.000055566234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035575565,0.00013024261,0.00018985913,0.00006986892,0.00017271764,0.0000543002,0.0009613517,0.000029721792,0.000100213045],"category_scores_gemma":[0.00006184299,0.00009034327,0.0000611644,0.00034055117,0.00033958297,0.00008943562,0.00027316483,0.00018219762,0.0001031372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030018161,0.000076507626,0.0000024706496,0.000032775202,0.000015704245,8.1134203e-7,0.0008875059,0.0024845002,0.00026560604,0.9953597,0.00019554736,0.00067582197],"study_design_scores_gemma":[0.00014489304,0.00003103413,0.000031989362,0.000017296568,0.0000026260757,0.0000017890465,0.00015650992,0.2642678,0.0011486161,0.7340795,0.00003476579,0.00008319946],"about_ca_topic_score_codex":5.019513e-7,"about_ca_topic_score_gemma":4.7153935e-7,"teacher_disagreement_score":0.8301413,"about_ca_system_score_codex":0.000025770034,"about_ca_system_score_gemma":0.000010113745,"threshold_uncertainty_score":0.36840916},"labels":[],"label_agreement":null},{"id":"W1991223992","doi":"10.1016/j.dam.2007.08.013","title":"Planar graph bipartization in linear time","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Planar graph; Combinatorics; Planar; Graph; Vertex (graph theory); Transversal (combinatorics); Planar straight-line graph; Time complexity; Discrete mathematics; Mathematical analysis; Pathwidth; Line graph; Computer science","score_opus":0.01678555882454132,"score_gpt":0.2884691405430597,"score_spread":0.2716835817185184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991223992","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016152961,0.00002022888,0.9679788,0.00007851834,0.000038861624,0.00033679255,0.0000022132276,0.0001663068,0.015225347],"genre_scores_gemma":[0.33626783,0.000012418912,0.6630683,0.00014000856,0.000050461345,0.000040694198,0.00001852765,0.000040272836,0.0003614679],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984516,0.000015812348,0.0003844965,0.00030122502,0.00038858457,0.0004582819],"domain_scores_gemma":[0.9988783,0.00025945166,0.00010337221,0.000614369,0.000036173053,0.00010834486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010606563,0.00015339552,0.00020358092,0.00032604532,0.000072114126,0.000048432004,0.00070202764,0.00007432315,0.000017468223],"category_scores_gemma":[0.000054626038,0.00013863234,0.00004368528,0.0010697562,0.000076127835,0.00019910774,0.00013483503,0.00017894724,0.0003163114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013316673,0.00008180001,0.00005060711,0.000041983494,0.000008235611,0.00001651582,0.0012723431,0.0002537967,0.014903824,0.9806042,0.00008041282,0.0026730176],"study_design_scores_gemma":[0.000496883,0.00003958462,0.0002541065,0.00003666223,0.000004331341,0.000008498264,0.00020440399,0.048247203,0.016058521,0.9339495,0.0003786929,0.00032165338],"about_ca_topic_score_codex":0.0000012725492,"about_ca_topic_score_gemma":0.0000059471467,"teacher_disagreement_score":0.32011488,"about_ca_system_score_codex":0.00003407085,"about_ca_system_score_gemma":0.000021148451,"threshold_uncertainty_score":0.56532633},"labels":[],"label_agreement":null},{"id":"W1991400499","doi":"10.1016/j.dam.2005.03.006","title":"A solvable case of image reconstruction in discrete tomography","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Conservatoire National des Arts et Métiers; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; École Polytechnique Fédérale de Lausanne","keywords":"Mathematics; Bounded function; Image (mathematics); Graph; Combinatorics; Time complexity; Discrete mathematics; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.010057554231600534,"score_gpt":0.25722725958762,"score_spread":0.24716970535601945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991400499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039913315,0.000045635552,0.89972097,0.00014756327,0.000029337392,0.00033920645,0.000007844941,0.00035860512,0.059437502],"genre_scores_gemma":[0.40874648,0.0000049009013,0.5911287,0.000024393285,0.000011498973,0.000038964605,0.0000014602049,0.000013180626,0.00003045226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986517,0.000009773127,0.00052972214,0.00032644442,0.00019323574,0.00028916885],"domain_scores_gemma":[0.99889517,0.000066313274,0.00025753558,0.0006542827,0.000060969956,0.00006570124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003173054,0.00019234385,0.00030199296,0.0002764996,0.000049295253,0.0002047881,0.000549631,0.00007002309,0.000008822605],"category_scores_gemma":[0.000034341243,0.00017700982,0.00008103629,0.00064497656,0.00015556697,0.0010607075,0.00025558547,0.00013769441,0.000015355256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001602359,0.00043545134,0.000057222423,0.0008199188,0.000044695327,0.00019824569,0.0049522244,0.00004635677,0.05292772,0.6550187,0.00044810644,0.28503537],"study_design_scores_gemma":[0.0007635754,0.00008605044,0.00002080264,0.0003977818,0.000030587125,0.0016833728,0.0009048255,0.14776208,0.30782837,0.5395028,0.00023809804,0.0007816585],"about_ca_topic_score_codex":0.00001240162,"about_ca_topic_score_gemma":0.000018085539,"teacher_disagreement_score":0.36883315,"about_ca_system_score_codex":0.00003473924,"about_ca_system_score_gemma":0.000034045952,"threshold_uncertainty_score":0.72182506},"labels":[],"label_agreement":null},{"id":"W1991560854","doi":"10.1016/j.dam.2007.10.027","title":"Existence of directed triplewhist tournaments with the three person property <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mi>T</mml:mi><mml:mi>W</mml:mi><mml:mi>h</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>v</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Tournament; Mathematics; Property (philosophy); Combinatorics; Discrete mathematics; Scroll; Theology; Philosophy","score_opus":0.017331763808788918,"score_gpt":0.22394668905066564,"score_spread":0.20661492524187672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991560854","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59018165,0.0030238014,0.00569441,0.00079162506,0.0047974726,0.0003571523,0.0013412507,0.001091516,0.39272112],"genre_scores_gemma":[0.97545826,0.0017344995,0.008201073,0.0014927946,0.0034243222,0.0038746705,0.0023708197,0.0027793422,0.00066420645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.97633743,0.0009832857,0.0054636914,0.0042807357,0.0066086124,0.0063262354],"domain_scores_gemma":[0.98100805,0.0036702661,0.005805449,0.006017478,0.0006074523,0.0028913044],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0062503,0.0029721728,0.0013945655,0.001504602,0.004387114,0.0033240106,0.006432643,0.0052698324,0.12204207],"category_scores_gemma":[0.0026144555,0.0047625736,0.004387929,0.0037595748,0.004394301,0.0027045757,0.0036204066,0.0048148492,0.0031192675],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049682907,0.0012842824,0.000035724162,0.0066181254,0.0066214763,0.002489989,0.009942964,0.004869552,0.009426317,0.71317565,0.23727264,0.0032950162],"study_design_scores_gemma":[0.006210368,0.0035413825,0.00009084019,0.0053533986,0.0056579057,0.0033982275,0.012252675,0.026450215,0.9194727,0.006420701,0.0055659236,0.0055856933],"about_ca_topic_score_codex":0.002624412,"about_ca_topic_score_gemma":0.003148463,"teacher_disagreement_score":0.91004634,"about_ca_system_score_codex":0.00009922874,"about_ca_system_score_gemma":0.0024913314,"threshold_uncertainty_score":0.99894303},"labels":[],"label_agreement":null},{"id":"W1991670069","doi":"10.1016/s0166-218x(01)00268-2","title":"Domination analysis of some heuristics for the traveling salesman problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"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 New Brunswick","funders":"Southern Taiwan Science Park","keywords":"Travelling salesman problem; Digraph; Mathematics; Combinatorics; Heuristics; Bottleneck traveling salesman problem; Integer (computer science); Christofides algorithm; Upper and lower bounds; Discrete mathematics; Algorithm; Mathematical optimization; Computer science","score_opus":0.03373754081539889,"score_gpt":0.289320133767459,"score_spread":0.25558259295206015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991670069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020356972,0.00009522102,0.9950454,0.00021247946,0.000023343247,0.00066250033,0.000017671815,0.000053493783,0.0018541545],"genre_scores_gemma":[0.5718787,0.000053574,0.4276733,0.000035945304,0.000024536424,0.00016077272,0.00000804145,0.000017688624,0.00014746057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986629,0.00001670359,0.00041965037,0.0002481582,0.0003837033,0.0002689032],"domain_scores_gemma":[0.9977232,0.0011324087,0.0002468465,0.00074043113,0.000108529784,0.00004854027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065627473,0.0001384111,0.00030703578,0.0001935281,0.00017054076,0.00007069366,0.0009215983,0.0000481724,0.000012388439],"category_scores_gemma":[0.000087669454,0.00009657246,0.00016769442,0.0010331128,0.000121543395,0.00013162184,0.00013774363,0.000105271785,0.000008303384],"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.0000039663364,0.00006173996,0.000003026776,0.00010652313,0.00024675153,3.1928212e-7,0.0022686701,0.0032234658,0.0018457698,0.98457855,0.00004601512,0.0076152114],"study_design_scores_gemma":[0.00019376205,0.000021059906,0.000022445827,0.000009097212,0.0002164007,5.7648043e-7,0.00020797922,0.663431,0.0021941608,0.3335065,0.00009495572,0.00010206447],"about_ca_topic_score_codex":5.9553497e-7,"about_ca_topic_score_gemma":0.00000186898,"teacher_disagreement_score":0.6602075,"about_ca_system_score_codex":0.000022165937,"about_ca_system_score_gemma":0.000008954438,"threshold_uncertainty_score":0.39381108},"labels":[],"label_agreement":null},{"id":"W1991964214","doi":"10.1016/j.dam.2008.02.004","title":"Linear codes for high payload steganography","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Steganography; Payload (computing); Mathematics; Theoretical computer science; Computer science; Embedding; Computer security; Artificial intelligence","score_opus":0.01995839114205825,"score_gpt":0.2536231795427298,"score_spread":0.23366478840067154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991964214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012195051,0.000041960622,0.9835618,0.000110980094,0.0000772474,0.0006165807,0.000021705397,0.00082907797,0.0025455833],"genre_scores_gemma":[0.38345042,0.00004364037,0.6160831,0.00011967576,0.0000430307,0.00018633246,0.000014285419,0.000020058986,0.00003943838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985828,0.000009947277,0.00036779288,0.00038053148,0.000263465,0.0003955093],"domain_scores_gemma":[0.9986883,0.00017706816,0.0001770155,0.0007954596,0.00007094274,0.00009126005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019068566,0.0002562836,0.00033987098,0.00016769263,0.00034271498,0.000053199907,0.00089142774,0.000102716614,0.0000022123581],"category_scores_gemma":[0.0000148567315,0.00021112937,0.00016338594,0.00041692928,0.00014963798,0.00023253445,0.00017327385,0.00012663101,0.00000971595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014084323,0.00010966776,0.000043630014,0.00013996594,0.00004713089,0.000006961471,0.0015298158,0.00002365163,0.0039189113,0.99086255,0.000785656,0.0025179575],"study_design_scores_gemma":[0.0007756408,0.00017217881,0.00011353802,0.00006367651,0.000032620133,0.000038555958,0.00011018627,0.0077389916,0.13312504,0.8525257,0.0045745396,0.0007293517],"about_ca_topic_score_codex":0.0000017916041,"about_ca_topic_score_gemma":6.517638e-7,"teacher_disagreement_score":0.37125537,"about_ca_system_score_codex":0.000011648905,"about_ca_system_score_gemma":0.000021065824,"threshold_uncertainty_score":0.8609606},"labels":[],"label_agreement":null},{"id":"W1993094949","doi":"10.1016/j.dam.2014.07.021","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-centrum Chinese Postman delivery problem and a related cost allocation game","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Graph; Mathematics; Submodular set function; Undirected graph; Directed graph; Connectivity; Enhanced Data Rates for GSM Evolution; Strongly connected component; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.012281730963888435,"score_gpt":0.21315306689176525,"score_spread":0.20087133592787682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993094949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98201805,0.00030043945,0.0027971095,0.00028271024,0.00029991617,0.0002353132,0.00007715485,0.00011237332,0.013876948],"genre_scores_gemma":[0.9972719,0.00020059192,0.0015044445,0.00019346092,0.00015927984,0.00022406835,0.00013499345,0.00011062932,0.00020061673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977833,0.000034586843,0.0009873552,0.0005015826,0.00017078851,0.0005224029],"domain_scores_gemma":[0.99759966,0.0004596516,0.00097341253,0.0007822496,0.000032182958,0.00015282244],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015303381,0.0003266785,0.00034655162,0.00008672126,0.00046565433,0.00034081654,0.0004348233,0.00032325316,0.000022641094],"category_scores_gemma":[0.00026284528,0.00031941192,0.00020475758,0.00021736795,0.00022639369,0.00021756934,0.00025009,0.0003448333,0.0010077213],"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.00007655884,0.000084793246,0.00004797305,0.00036659106,0.00016266589,0.0000044720387,0.0021382868,0.00028436,0.000269074,0.99601305,0.0000899647,0.00046221228],"study_design_scores_gemma":[0.0008501669,0.00013781313,0.00016920437,0.00020396961,0.00008355237,0.00006747454,0.00069617096,0.90673625,0.00028073436,0.08808821,0.0022668215,0.0004196462],"about_ca_topic_score_codex":0.000059694717,"about_ca_topic_score_gemma":0.00003982356,"teacher_disagreement_score":0.90792483,"about_ca_system_score_codex":0.000020627911,"about_ca_system_score_gemma":0.000039080962,"threshold_uncertainty_score":0.9999258},"labels":[],"label_agreement":null},{"id":"W1996514690","doi":"10.1016/j.dam.2003.11.013","title":"The geometry of carpentry and joinery","year":2004,"lang":"en","type":"article","venue":"Discrete Applied 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":"Carleton University","funders":"","keywords":"Carpentry; Mathematics; Geometry; Combinatorics; Engineering; Civil engineering","score_opus":0.008359718409636167,"score_gpt":0.22227404046640922,"score_spread":0.21391432205677305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996514690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10067543,0.00026364974,0.89329165,0.00042481,0.0000860188,0.00016089267,0.0000019061877,0.00003823272,0.0050574294],"genre_scores_gemma":[0.8626223,0.000045992976,0.13716419,0.00006212259,0.00003183465,0.000012208572,0.0000029504072,0.000005184951,0.000053182463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993198,0.0000048001943,0.0002125776,0.0001324765,0.00021232251,0.00011801959],"domain_scores_gemma":[0.9993923,0.00014852844,0.000101497186,0.0002802218,0.000037832036,0.000039655602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022326343,0.000079108126,0.00010764086,0.000049925493,0.00013225243,0.000071292816,0.00025644217,0.000027466223,0.0000013838121],"category_scores_gemma":[0.000023025053,0.0000542138,0.00002830595,0.00027507334,0.0000583759,0.00008127379,0.00014604242,0.000054646905,0.000006997537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013498749,0.000021513823,0.0000043568966,0.00003500658,0.000011439138,4.5677797e-7,0.00045338875,0.0012363717,0.0031773539,0.9884675,0.000036319987,0.0065549277],"study_design_scores_gemma":[0.0009596831,0.00007634317,0.0012744182,0.000050719016,0.00002905373,0.00003974386,0.0006042805,0.021332214,0.060369093,0.91306597,0.0018614428,0.00033703688],"about_ca_topic_score_codex":0.0000022801594,"about_ca_topic_score_gemma":0.0000018706131,"teacher_disagreement_score":0.7619469,"about_ca_system_score_codex":0.00001171828,"about_ca_system_score_gemma":0.000037692076,"threshold_uncertainty_score":0.22107746},"labels":[],"label_agreement":null},{"id":"W1996889656","doi":"10.1016/s0166-218x(99)00217-6","title":"Biconvex graphs: ordering and algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Row; Row and column spaces; Mathematics; Combinatorics; Bipartite graph; Matrix (chemical analysis); Vertex (graph theory); Property (philosophy); Context (archaeology); Permutation (music); Discrete mathematics; Algorithm; Graph; Computer science","score_opus":0.0166004784493937,"score_gpt":0.270519379893698,"score_spread":0.2539189014443043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996889656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071285285,0.00017236324,0.8817416,0.00020563854,0.000040865914,0.00046505488,0.0000041935878,0.00039078362,0.045694206],"genre_scores_gemma":[0.249981,0.00023621632,0.7487681,0.000170127,0.000030984807,0.00010155766,0.0000033534177,0.000042757023,0.00066590804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986646,0.000015094942,0.0002456109,0.0003751767,0.0003136854,0.00038580754],"domain_scores_gemma":[0.99895436,0.00015372057,0.000053377615,0.0006752817,0.000023854289,0.0001394008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031664775,0.00018255947,0.00022672665,0.00011053432,0.00016109085,0.00016311368,0.000648482,0.00005520066,0.00010081645],"category_scores_gemma":[0.000015209933,0.00015701374,0.000043995173,0.00046108928,0.00015094606,0.00024014949,0.00021195147,0.00016689034,0.00012324529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039890438,0.000034640878,0.000007261676,0.00006905013,0.000018394378,0.0000069839352,0.0012826284,0.000038412356,0.0016978601,0.8831617,0.00003786132,0.113641195],"study_design_scores_gemma":[0.00039441796,0.000036805188,0.00006561239,0.000029027413,0.0000070464994,0.00003028437,0.00022439277,0.057030138,0.0032495349,0.9369016,0.0017050932,0.00032601258],"about_ca_topic_score_codex":0.0000017971398,"about_ca_topic_score_gemma":8.0026024e-7,"teacher_disagreement_score":0.17869571,"about_ca_system_score_codex":0.000010939252,"about_ca_system_score_gemma":0.000014817807,"threshold_uncertainty_score":0.64028347},"labels":[],"label_agreement":null},{"id":"W1998243034","doi":"10.1016/j.dam.2003.09.012","title":"Variable neighborhood search for the maximum clique","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":83,"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":"Mathematics; Clique; Heuristic; Variable neighborhood search; Clique problem; Vertex (graph theory); Greedy algorithm; Mathematical optimization; Simplicity; Combinatorics; Variable (mathematics); Algorithm; Metaheuristic; Graph; Chordal graph","score_opus":0.019684030115138522,"score_gpt":0.26877238570278233,"score_spread":0.2490883555876438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998243034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006037512,0.00005001035,0.9717149,0.00015133142,0.0001029619,0.000740184,0.000017906388,0.00036810833,0.026250832],"genre_scores_gemma":[0.123817086,0.000022506882,0.8755813,0.00008722643,0.000104194434,0.00022329712,0.0000143024645,0.00009758905,0.000052465206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902755,0.000007584381,0.0002904553,0.00015070115,0.00018142673,0.00034225805],"domain_scores_gemma":[0.9990101,0.0004030047,0.000038131482,0.0004423522,0.000043944303,0.00006245692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059963926,0.00017604101,0.00020086093,0.00004041966,0.00015029637,0.000078343626,0.0002935613,0.000099827,0.00003738424],"category_scores_gemma":[0.00004671484,0.0001331332,0.00006022155,0.00024712135,0.000039790037,0.000049240905,0.000049420156,0.00018398101,0.00003636561],"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.0000029242613,0.000015664542,0.0000013560868,0.00018231882,0.00004111444,2.070718e-7,0.0006687192,0.5281119,0.002306528,0.4674951,0.000062929816,0.0011112799],"study_design_scores_gemma":[0.0010420704,0.000024244056,0.000010996695,0.000051658022,0.00008787603,0.000007658733,0.0009725495,0.70189947,0.023401527,0.27101988,0.0011164269,0.00036561143],"about_ca_topic_score_codex":0.0000022405684,"about_ca_topic_score_gemma":6.1047274e-7,"teacher_disagreement_score":0.19647522,"about_ca_system_score_codex":0.000066776265,"about_ca_system_score_gemma":0.00003688776,"threshold_uncertainty_score":0.54290146},"labels":[],"label_agreement":null},{"id":"W1998583115","doi":"10.1016/s0166-218x(00)00270-5","title":"On the visibility graph of convex translates","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Regular polygon; Visibility; Graph; Visibility graph; Geometry; Geography","score_opus":0.01896582713069101,"score_gpt":0.24632823553742678,"score_spread":0.22736240840673577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998583115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14130975,0.000021921403,0.8454682,0.0005691391,0.000046172685,0.00022853489,0.0000024287656,0.000044862776,0.012308969],"genre_scores_gemma":[0.9550983,0.000008243768,0.044613663,0.00019218854,0.000016417895,0.000019200348,0.0000040754703,0.0000049543833,0.00004297363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991835,0.000015838144,0.0002462513,0.00017249613,0.00026467303,0.00011728606],"domain_scores_gemma":[0.99895453,0.00043370633,0.000099339006,0.00043632207,0.000044316912,0.00003180546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003466902,0.00009783077,0.00013841219,0.000053508367,0.00008166463,0.000039842023,0.0003993054,0.00003153218,0.00003915778],"category_scores_gemma":[0.000029135472,0.00006346665,0.000064608175,0.0003998659,0.000052530173,0.000063341125,0.00004033855,0.00007030881,0.000026168778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048259762,0.00007251327,0.00000468043,0.000022998734,0.000012841152,4.5902377e-7,0.00090626173,0.00080525514,0.0028953538,0.9908493,0.000111174726,0.0043143225],"study_design_scores_gemma":[0.00020335961,0.000049255854,0.0001756334,0.000016462222,0.000009931992,0.0000041519406,0.00011392815,0.069536716,0.019497894,0.90993905,0.0003303958,0.00012324612],"about_ca_topic_score_codex":0.0000010400433,"about_ca_topic_score_gemma":9.756945e-7,"teacher_disagreement_score":0.81378853,"about_ca_system_score_codex":0.000006330349,"about_ca_system_score_gemma":0.00001931748,"threshold_uncertainty_score":0.25880948},"labels":[],"label_agreement":null},{"id":"W1998787944","doi":"10.1016/j.dam.2005.03.026","title":"Properties and constraints of cheating-immune secret sharing schemes","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptography and Data Security","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":"Cheating; Mathematics; Secret sharing; Theoretical computer science; Algorithm; Cryptography; Computer science; Social psychology","score_opus":0.02531549787410058,"score_gpt":0.2313856977545834,"score_spread":0.2060701998804828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998787944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50126034,0.0005109484,0.48662457,0.0001598637,0.00002864305,0.00037287408,0.000016801321,0.0002554093,0.010770566],"genre_scores_gemma":[0.7402384,0.00002310005,0.2596717,0.00002458096,0.000014970625,0.000013115486,0.0000019480447,0.000010016981,0.0000021288092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990424,0.000004250489,0.00033608437,0.00024251975,0.00018649729,0.00018825167],"domain_scores_gemma":[0.9992133,0.000045755864,0.00014149993,0.00051195157,0.000030103258,0.000057408666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495551,0.00013811505,0.00024084609,0.000057075442,0.00007993125,0.00008811062,0.00046012708,0.00004985501,0.000015950951],"category_scores_gemma":[0.000029214963,0.000113028356,0.00004554288,0.00015440476,0.0002465161,0.00027849988,0.00037842224,0.00010074736,0.0000052149994],"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.0000029658609,0.000055365566,0.00009413334,0.0001981863,0.000023972481,4.1170765e-7,0.004136958,0.0000040511004,0.019047396,0.9653332,0.000007639554,0.011095723],"study_design_scores_gemma":[0.0025830774,0.00016237391,0.0013008467,0.000944026,0.000115225615,0.00008572802,0.0049045435,0.21155123,0.49590793,0.2788791,0.001957388,0.0016085359],"about_ca_topic_score_codex":0.0000026715109,"about_ca_topic_score_gemma":0.000003926532,"teacher_disagreement_score":0.6864541,"about_ca_system_score_codex":0.000007518433,"about_ca_system_score_gemma":0.000015192264,"threshold_uncertainty_score":0.46091625},"labels":[],"label_agreement":null},{"id":"W1999636241","doi":"10.1016/j.dam.2014.02.005","title":"Diametral broadcast graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","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":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.009687206107418208,"score_gpt":0.22364444937069797,"score_spread":0.21395724326327975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999636241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083509935,0.000017125749,0.9266638,0.0002025269,0.00005123878,0.00020801327,0.0000028457355,0.00036230657,0.06414116],"genre_scores_gemma":[0.65666664,0.0000053086064,0.34286255,0.00017570249,0.000034290646,0.00007626633,0.000011028793,0.000017861508,0.00015033416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989077,0.000009294204,0.00025452473,0.0003041708,0.00024738582,0.00027693802],"domain_scores_gemma":[0.99865955,0.00011491835,0.000102073005,0.0009914234,0.000021287557,0.000110768626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021680984,0.00015898852,0.00019349453,0.000077482495,0.00013253407,0.00016583121,0.00086873426,0.000053874093,0.00002194448],"category_scores_gemma":[0.000017422457,0.00013847923,0.000084255655,0.00038719087,0.000058022568,0.00011536529,0.00020488865,0.00010144132,0.00041645952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.6886661e-7,0.000049170496,0.0000050919975,0.000027769467,0.000007769632,3.602543e-7,0.0004438448,0.0000110994815,0.0059224204,0.9756574,0.000483661,0.017391127],"study_design_scores_gemma":[0.0004686518,0.000035372912,0.00028482612,0.000021801165,0.000029965157,0.000018956838,0.00014442643,0.19151948,0.015807763,0.762137,0.028956631,0.0005751222],"about_ca_topic_score_codex":0.0000024034475,"about_ca_topic_score_gemma":0.0000010084714,"teacher_disagreement_score":0.64831567,"about_ca_system_score_codex":0.000011438397,"about_ca_system_score_gemma":0.000013297438,"threshold_uncertainty_score":0.5647019},"labels":[],"label_agreement":null},{"id":"W1999881791","doi":"10.1016/j.dam.2009.11.003","title":"Parallel cleaning of a network with brushes","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bipartite graph; Mathematics; Process (computing); Combinatorics; Brush; Algorithm; Computer science; Graph; Materials science; Composite material","score_opus":0.011522141334401477,"score_gpt":0.21896920427227684,"score_spread":0.20744706293787538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999881791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047260015,0.000036527825,0.94353974,0.000109625784,0.000061190134,0.00019886835,3.5723025e-7,0.00010807849,0.05121964],"genre_scores_gemma":[0.70948446,0.000003689801,0.2902048,0.00013079135,0.00007990482,0.000009347101,9.0116305e-7,0.0000075239473,0.00007859762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989937,0.000010470093,0.00032981264,0.0001964126,0.00022340841,0.00024622606],"domain_scores_gemma":[0.9991624,0.000069623835,0.00021546878,0.0004597417,0.000041437135,0.000051333613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024094655,0.00013694738,0.00027973822,0.000032226613,0.00007805109,0.00007381788,0.00042125388,0.000049013317,0.0000068427967],"category_scores_gemma":[0.0000044390526,0.0000983093,0.00005239173,0.00025800374,0.000026811862,0.00010401218,0.000049135433,0.00008936079,0.0000133908225],"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.000009665377,0.00003318774,0.000009909572,0.000031601787,0.000020997048,0.0000023941645,0.001501104,0.008164874,0.0001812424,0.9865325,0.000886928,0.0026255874],"study_design_scores_gemma":[0.0015166921,0.0007810554,0.0005564193,0.00071855687,0.000057760288,0.0001130205,0.0016379294,0.63030505,0.0014387416,0.35927287,0.0026314845,0.0009704034],"about_ca_topic_score_codex":0.0000022820832,"about_ca_topic_score_gemma":0.0000035752664,"teacher_disagreement_score":0.70475847,"about_ca_system_score_codex":0.00001116876,"about_ca_system_score_gemma":0.000016717528,"threshold_uncertainty_score":0.40089366},"labels":[],"label_agreement":null},{"id":"W2001432254","doi":"10.1016/j.dam.2003.11.009","title":"A note on line broadcast in digraphs under the edge-disjoint paths mode","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"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":"Concordia University; University of Ottawa","keywords":"Digraph; Mathematics; Combinatorics; Disjoint sets; Time complexity; Line (geometry); Approximation algorithm; Enhanced Data Rates for GSM Evolution; Integer (computer science); Node (physics); Discrete mathematics; Tree (set theory); Degree (music); Running time; Algorithm; Computer science","score_opus":0.028447797900540576,"score_gpt":0.27861105444618267,"score_spread":0.2501632565456421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001432254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013123536,0.000047774964,0.97586215,0.0017823081,0.00015329267,0.00049770955,0.000011452021,0.00017879423,0.008342971],"genre_scores_gemma":[0.7852699,0.000034994748,0.2134628,0.00097015005,0.0000811875,0.0001051775,0.000007339765,0.000030388559,0.00003806964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981763,0.000019488292,0.00044589417,0.0004408811,0.000471552,0.0004459363],"domain_scores_gemma":[0.9983514,0.00022061601,0.000142611,0.0011630184,0.00002880548,0.000093557064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032287755,0.00029085993,0.00030827045,0.00016116993,0.00020206822,0.00019134069,0.0012196773,0.00008867454,0.000007990215],"category_scores_gemma":[0.000019991636,0.00019974241,0.00014334254,0.00072756707,0.00016072833,0.00012953751,0.0003729747,0.0003976798,0.00009094902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062669983,0.0002533093,9.371831e-7,0.000035780995,0.000012781899,0.000009019108,0.004035698,0.012866578,0.000394713,0.97178376,0.00003431267,0.010566828],"study_design_scores_gemma":[0.0007563581,0.00008022885,0.00007094043,0.00011551772,0.000010134372,0.000013160118,0.0005476751,0.12282726,0.0020737636,0.8728886,0.00028776878,0.00032858696],"about_ca_topic_score_codex":0.00003428107,"about_ca_topic_score_gemma":0.000072041905,"teacher_disagreement_score":0.77214634,"about_ca_system_score_codex":0.00007199375,"about_ca_system_score_gemma":0.00006268193,"threshold_uncertainty_score":0.8145259},"labels":[],"label_agreement":null},{"id":"W2002248615","doi":"10.1016/j.dam.2007.06.012","title":"Pareto optima for total weighted completion time and maximum lateness on a single machine","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University; McMaster University","funders":"","keywords":"Mathematics; Pareto principle; Mathematical optimization; Pareto optimal; Single-machine scheduling; Multi-objective optimization; Combinatorics; Computer science; Job shop scheduling; Routing (electronic design automation)","score_opus":0.012162247573192104,"score_gpt":0.22257126118429485,"score_spread":0.21040901361110276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002248615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10787777,0.00005015942,0.88411504,0.00003536603,0.000090841066,0.00045956895,0.00005894313,0.00040359187,0.006908737],"genre_scores_gemma":[0.28916496,0.000007253972,0.71020865,0.000053518146,0.00008759214,0.000040197938,0.0002441617,0.00008666026,0.00010700578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992255,0.0000023853827,0.0002535607,0.0001520088,0.00013532926,0.00023119577],"domain_scores_gemma":[0.9995317,0.00013194462,0.000045837456,0.00016266537,0.000029435127,0.00009840138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019134997,0.00017800958,0.00022169652,0.000073739895,0.00007348595,0.000047844173,0.00006535695,0.00008597423,0.00003715846],"category_scores_gemma":[0.000016097843,0.00016326764,0.00003684873,0.000105909174,0.000027923583,0.000032447508,0.000017949042,0.00007919291,0.000034061406],"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.0007790048,0.0014444384,0.00005412524,0.0037256524,0.0009104403,0.0000361589,0.009527178,0.61122936,0.15171346,0.1424949,0.0016204789,0.07646477],"study_design_scores_gemma":[0.0006977623,0.00005363127,0.000032412445,0.000040917857,0.000033068816,0.000009034852,0.00010785938,0.986743,0.009121265,0.002774015,0.00012717827,0.00025988207],"about_ca_topic_score_codex":6.1467796e-7,"about_ca_topic_score_gemma":8.522814e-7,"teacher_disagreement_score":0.37551358,"about_ca_system_score_codex":0.000033425014,"about_ca_system_score_gemma":0.0000035715232,"threshold_uncertainty_score":0.66578615},"labels":[],"label_agreement":null},{"id":"W2002544979","doi":"10.1016/j.dam.2014.08.033","title":"On the continuity of graph parameters","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","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":"Dalhousie University","funders":"","keywords":"Mathematics; Metric space; Metric dimension; Combinatorics; Discrete mathematics; Graph isomorphism; Split graph; Cograph; Graph; Metric (unit); Isomorphism (crystallography); Graph product; Pathwidth; Line graph","score_opus":0.011238758772614373,"score_gpt":0.21444103943760193,"score_spread":0.20320228066498755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002544979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09253209,0.0000035622047,0.87839776,0.00016742152,0.00006733858,0.00020623967,0.0000025545155,0.00006806763,0.028554952],"genre_scores_gemma":[0.9230568,0.000001255567,0.07661277,0.00026415655,0.0000079718675,0.000023385708,7.583028e-7,0.000007638195,0.000025275504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914014,0.00003642034,0.00022725778,0.00017938657,0.00023865169,0.00017815708],"domain_scores_gemma":[0.998165,0.0008044516,0.00016368413,0.00080078136,0.000022924423,0.00004312654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069652806,0.00012649938,0.00019954536,0.000048488364,0.00008620908,0.000049992992,0.0008611978,0.000037105227,0.000007778665],"category_scores_gemma":[0.00007488485,0.00007563011,0.00009659123,0.00023658815,0.00014101475,0.000046196532,0.000116031886,0.000109114495,0.00003534729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002093928,0.000038927108,0.0000016813763,0.00002078198,0.000013941038,1.8052137e-7,0.0009137817,0.000041784755,0.00068926765,0.99551433,0.000080862876,0.0026823748],"study_design_scores_gemma":[0.0001391392,0.00004346481,0.000033223143,0.000021539634,0.000008649308,0.0000010882129,0.00013692243,0.011324669,0.013589901,0.9745276,0.000068105546,0.00010572779],"about_ca_topic_score_codex":7.910626e-7,"about_ca_topic_score_gemma":2.712683e-7,"teacher_disagreement_score":0.8305247,"about_ca_system_score_codex":0.0000034723805,"about_ca_system_score_gemma":0.0000057822567,"threshold_uncertainty_score":0.3084106},"labels":[],"label_agreement":null},{"id":"W2004476852","doi":"10.1016/j.dam.2012.03.019","title":"Hardness results on the gapped consecutive-ones property problem","year":2012,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia Hospital","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Logical matrix; Time complexity; Algebraic number; Binary number; Integer (computer science); Polynomial; Discrete mathematics; Computational complexity theory; Algebraic combinatorics; Computer science; Algorithm; Arithmetic","score_opus":0.048037758935888325,"score_gpt":0.2913822552962249,"score_spread":0.2433444963603366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004476852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011657199,0.00008186689,0.6123472,0.003916408,0.00026127943,0.0031206745,0.000040516188,0.000594664,0.3679802],"genre_scores_gemma":[0.8525027,0.000016861972,0.14389521,0.00046776186,0.000100464786,0.00052229397,0.000008437358,0.000051620962,0.002434635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977544,0.00009114093,0.00041366476,0.00037789092,0.0006393116,0.0007236017],"domain_scores_gemma":[0.99745846,0.0007054111,0.00020494865,0.0013744436,0.000083399325,0.00017335433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015557348,0.00027236284,0.00028873404,0.00008653094,0.0003402486,0.00016711673,0.0014295721,0.0000743463,0.000015464731],"category_scores_gemma":[0.00019744011,0.00013102886,0.000080191,0.00050636684,0.0002775592,0.0002832954,0.0005018891,0.00033016648,0.0005000089],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049146336,0.00015852907,0.0000068558197,0.00006388755,0.000030072515,0.0000013137616,0.004899365,0.000013140628,0.0025388817,0.9886232,0.0022078298,0.0014078023],"study_design_scores_gemma":[0.0017177197,0.00020514327,0.00015859904,0.00025882642,0.000038527378,0.000048694757,0.0036435747,0.00944012,0.053521432,0.89906216,0.030761091,0.0011441052],"about_ca_topic_score_codex":0.000002038705,"about_ca_topic_score_gemma":9.463557e-7,"teacher_disagreement_score":0.8408455,"about_ca_system_score_codex":0.00003969372,"about_ca_system_score_gemma":0.00004887674,"threshold_uncertainty_score":0.64267695},"labels":[],"label_agreement":null},{"id":"W2004845474","doi":"10.1016/s0166-218x(02)00237-8","title":"Physical network design to facilitate capacity reallocation","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Logical topology; Control reconfiguration; Network topology; Distributed computing; Heuristic; Asynchronous Transfer Mode; Flexibility (engineering); Topology (electrical circuits); Computer network; Engineering; Mathematics","score_opus":0.08591626587253681,"score_gpt":0.2392964225146704,"score_spread":0.15338015664213359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004845474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002616789,0.000009378076,0.97549385,0.0002535271,0.00020535315,0.0005027891,0.00000154159,0.00021466783,0.020702094],"genre_scores_gemma":[0.72731566,0.0000028534844,0.27146655,0.00023642193,0.00025648874,0.00013480852,0.0000013190787,0.000015147478,0.00057072885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986921,0.00003977209,0.00030533102,0.00032968787,0.00028132022,0.0003518076],"domain_scores_gemma":[0.99890226,0.00017464136,0.00010265163,0.0006346286,0.000056293928,0.00012952727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038029917,0.00017894416,0.00025951042,0.000043300603,0.00015715408,0.00015407232,0.00050933135,0.000056117635,0.000019305879],"category_scores_gemma":[0.000021631382,0.00015196949,0.00007036664,0.00038063966,0.000024936855,0.00013669296,0.000108658074,0.000117647374,0.0006949909],"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.0000042220936,0.0001170289,0.0000013309051,0.000051981602,0.000034876095,0.0000019863844,0.019029686,0.046307575,0.0015211676,0.8969357,0.028107565,0.0078868605],"study_design_scores_gemma":[0.00013877903,0.00006782607,0.0000064615347,0.000038421655,0.000008237952,0.000007804981,0.00013765221,0.94538087,0.0008085574,0.0508917,0.0022540416,0.00025965777],"about_ca_topic_score_codex":0.00000719075,"about_ca_topic_score_gemma":0.0000041523003,"teacher_disagreement_score":0.8990733,"about_ca_system_score_codex":0.000047615507,"about_ca_system_score_gemma":0.0000056503586,"threshold_uncertainty_score":0.89329344},"labels":[],"label_agreement":null},{"id":"W2004981790","doi":"10.1016/j.dam.2010.12.022","title":"On a labeling problem in graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Indian Institute of Technology Roorkee","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Time complexity; Graph; Alphabet; Discrete mathematics","score_opus":0.03362565585068039,"score_gpt":0.24749419453963428,"score_spread":0.2138685386889539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004981790","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015253811,0.000018608698,0.8827211,0.000046522247,0.00004576898,0.00042799534,0.00000104963,0.006507334,0.094977774],"genre_scores_gemma":[0.33301798,0.0000018256479,0.6667737,0.00011357538,0.000003518992,0.00006435304,6.179376e-7,0.000012010023,0.00001241228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990347,0.000008849231,0.00025430895,0.00026552624,0.00018765152,0.00024894008],"domain_scores_gemma":[0.9990836,0.00018192874,0.00009394403,0.0005721028,0.000019210927,0.000049216862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033517918,0.00014544206,0.00017385205,0.0001560462,0.00004842459,0.000046475914,0.0006022438,0.00005716205,0.000006286434],"category_scores_gemma":[0.00006260958,0.00012265002,0.000035231587,0.00036583343,0.000028922412,0.000073245195,0.00014798038,0.00014646581,0.000048192054],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023815812,0.00010740262,0.00007395926,0.000048294358,0.0000041252533,0.000007840846,0.0039680977,0.00000553265,0.00013548254,0.99140996,0.00052114885,0.0037157543],"study_design_scores_gemma":[0.00013440737,0.000044763256,0.00006381044,0.00011719849,0.0000028667741,0.00000469604,0.000020493619,0.0069604428,0.0017288831,0.9907443,0.000010953005,0.00016718541],"about_ca_topic_score_codex":0.000016343765,"about_ca_topic_score_gemma":0.0000019355093,"teacher_disagreement_score":0.31776416,"about_ca_system_score_codex":0.000018528315,"about_ca_system_score_gemma":0.000017224334,"threshold_uncertainty_score":0.5001523},"labels":[],"label_agreement":null},{"id":"W2005110454","doi":"10.1016/j.dam.2011.04.006","title":"The<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-extended graft construction","year":2011,"lang":"lv","type":"article","venue":"Discrete Applied 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":"Vancouver Island University; University of Victoria","funders":"","keywords":"Homomorphism; Digraph; Enumeration; Bipartite graph; Algorithm; Mathematics; Combinatorics; Computer science; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.022255737254391842,"score_gpt":0.25491510821285335,"score_spread":0.2326593709584615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005110454","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32756528,0.00087531435,0.02466722,0.0004773941,0.002592558,0.00012474642,0.0002546439,0.00039910807,0.64304376],"genre_scores_gemma":[0.9648726,0.0010774991,0.029051242,0.00072373415,0.0012062873,0.0015065906,0.00044161247,0.00075841165,0.00036203585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9889569,0.00039909518,0.0022589613,0.0020980723,0.0032696952,0.0030172432],"domain_scores_gemma":[0.98979986,0.0022312712,0.002454146,0.0040476047,0.00024274016,0.0012243928],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["sts","insufficient_payload"],"category_scores_codex":[0.002978588,0.0010569434,0.0004501399,0.0005600839,0.0023973756,0.0019149451,0.004041435,0.0018769464,0.15298776],"category_scores_gemma":[0.0013609513,0.0017496645,0.0016524193,0.0016480859,0.0033511263,0.001607674,0.0033517245,0.0020713508,0.0030295753],"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.0010898503,0.00034483892,0.000008620899,0.0013556419,0.0012545112,0.00061907637,0.004338073,0.00054031104,0.0029455337,0.9309503,0.05212178,0.0044314987],"study_design_scores_gemma":[0.0018938249,0.0011597539,0.00006359947,0.0009227402,0.0009410786,0.0013220096,0.003965656,0.103080675,0.8724721,0.011024742,0.0013556927,0.0017981442],"about_ca_topic_score_codex":0.00037358422,"about_ca_topic_score_gemma":0.00052718085,"teacher_disagreement_score":0.9199255,"about_ca_system_score_codex":0.000023265724,"about_ca_system_score_gemma":0.0013379392,"threshold_uncertainty_score":0.99941885},"labels":[],"label_agreement":null},{"id":"W2005871446","doi":"10.1016/s0166-218x(03)00261-0","title":"Dynamic monopolies in tori","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Torus; Monotone polygon; Context (archaeology); Simple (philosophy); Upper and lower bounds; Constructive; Node (physics); Dynamo; Topology (electrical circuits); Combinatorics; Discrete mathematics; Process (computing); Computer science; Geometry; Mathematical analysis","score_opus":0.009067863765680985,"score_gpt":0.240658269237084,"score_spread":0.23159040547140303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005871446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021641891,0.00007708557,0.89157784,0.00015892125,0.000053964704,0.0003127247,0.0000023992147,0.0001905691,0.08598462],"genre_scores_gemma":[0.6862865,0.000014363358,0.31327012,0.000059769915,0.0000042750635,0.00010350489,0.000004586191,0.000012946124,0.0002439394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909824,0.000008480037,0.00025033907,0.0002420366,0.00016005385,0.00024087164],"domain_scores_gemma":[0.99912184,0.00006192821,0.00006931623,0.000679775,0.0000115578405,0.0000555678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001654098,0.00012924014,0.00016433648,0.00007607007,0.00006350125,0.000088337874,0.0004914586,0.000048062866,0.000017522496],"category_scores_gemma":[0.000015379843,0.00011954548,0.000038303282,0.0003611273,0.000032011365,0.00010413703,0.00008795029,0.00009025232,0.00017370343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.8418653e-7,0.000056503926,0.0000070465353,0.000020306452,0.0000034739037,0.0000014834993,0.00087365933,0.000029983661,0.0036967047,0.9943283,0.00006750287,0.00091485016],"study_design_scores_gemma":[0.00051850325,0.000015055778,0.0002288974,0.000027738999,0.000011496091,0.000018681852,0.0008609894,0.13321733,0.012289211,0.8431763,0.009123189,0.00051258056],"about_ca_topic_score_codex":0.0000030116817,"about_ca_topic_score_gemma":0.000009089452,"teacher_disagreement_score":0.6646446,"about_ca_system_score_codex":0.00004057242,"about_ca_system_score_gemma":0.000030444187,"threshold_uncertainty_score":0.48749235},"labels":[],"label_agreement":null},{"id":"W2006340097","doi":"10.1016/s0166-218x(99)00123-7","title":"On the strong chromatic index of cyclic multigraphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Edge coloring; Upper and lower bounds; Index (typography); Graph; Multigraph; Discrete mathematics; Line graph; Mathematical analysis; Computer science; Graph power","score_opus":0.007138909142864235,"score_gpt":0.1925086100329304,"score_spread":0.18536970089006616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006340097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.866675,0.00004503559,0.0032625387,0.0000100616535,0.000042355136,0.00040516804,0.000011906011,0.00016067264,0.12938723],"genre_scores_gemma":[0.99930066,0.000012216582,0.00044050565,0.000017761187,0.000019099067,0.00008109528,0.0000038869543,0.000038884624,0.00008586461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910575,0.000014125656,0.0003534742,0.00010531938,0.00021069372,0.00021061527],"domain_scores_gemma":[0.99917215,0.00022664205,0.00005811617,0.0004925947,0.0000071659265,0.000043324475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019668168,0.00018652366,0.00026073607,0.000055108918,0.00006060902,0.000019839415,0.00026125446,0.00006872599,0.00048214465],"category_scores_gemma":[0.000008322386,0.00012442928,0.00009676917,0.00019437945,0.00007983077,0.000028659011,0.000010318871,0.0001394555,0.00015369014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001565188,0.00009393952,0.000018222338,0.00079191715,0.0001958962,0.0000015781962,0.004299283,0.015955064,0.0117825065,0.96313757,0.00055467174,0.003153688],"study_design_scores_gemma":[0.0019418712,0.00014797584,0.0010851489,0.0010821709,0.00023310304,0.000020925347,0.00901652,0.28813365,0.057416264,0.63835764,0.0011052345,0.0014594907],"about_ca_topic_score_codex":0.0000017680918,"about_ca_topic_score_gemma":0.0000017184409,"teacher_disagreement_score":0.32477993,"about_ca_system_score_codex":0.000010312961,"about_ca_system_score_gemma":0.0000033825,"threshold_uncertainty_score":0.5279146},"labels":[],"label_agreement":null},{"id":"W2006409610","doi":"10.1016/j.dam.2009.04.014","title":"Limited packings in graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Memorial University of Newfoundland","funders":"","keywords":"Combinatorics; Mathematics; Packing problems; Graph; Upper and lower bounds; Set packing; Simple graph; Discrete mathematics; Computer science","score_opus":0.01961147427158829,"score_gpt":0.2841082372443037,"score_spread":0.2644967629727154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006409610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06712497,0.00007043402,0.87007535,0.0008416264,0.00004888418,0.0006735804,0.0000023884215,0.0004210485,0.060741697],"genre_scores_gemma":[0.774251,0.000018121898,0.22531016,0.00030224948,0.000010239819,0.000029106024,0.0000028813947,0.00001354191,0.00006269292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840087,0.000019447401,0.00033684756,0.00036347075,0.0003972363,0.00048214776],"domain_scores_gemma":[0.9987393,0.00016616662,0.00009869978,0.00085237663,0.00003522017,0.00010823034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044072658,0.0001879543,0.0002555407,0.0003027014,0.00007222222,0.00011652093,0.0010658203,0.000071088514,0.000009790653],"category_scores_gemma":[0.000058436843,0.00016508217,0.00006624371,0.0011586414,0.00006763401,0.00025099886,0.00016203949,0.00024900792,0.00007854257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005433486,0.00008478706,0.000016858232,0.000018385479,0.000004164567,0.000012202631,0.0012494492,0.000039121715,0.0059277737,0.98197776,0.000058145484,0.010605932],"study_design_scores_gemma":[0.00034711778,0.000046781628,0.00047523197,0.000030226707,0.0000023091695,0.000006379395,0.00015574983,0.009003427,0.004194544,0.9853583,0.00016116079,0.00021879954],"about_ca_topic_score_codex":8.0051456e-7,"about_ca_topic_score_gemma":0.0000017559893,"teacher_disagreement_score":0.707126,"about_ca_system_score_codex":0.000032254287,"about_ca_system_score_gemma":0.000021716389,"threshold_uncertainty_score":0.6731855},"labels":[],"label_agreement":null},{"id":"W2007055393","doi":"10.1016/j.dam.2010.05.027","title":"Packing and covering tetrahedra","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Mathematics and Applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tetrahedron; Mathematics; Combinatorics; Packing problems; Geometry","score_opus":0.024825319910743767,"score_gpt":0.2966039777252472,"score_spread":0.27177865781450344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007055393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7213625,0.000022347145,0.106344536,0.00031608445,0.00014461503,0.0011722839,0.000033965014,0.00049170677,0.170112],"genre_scores_gemma":[0.6226601,0.000010919981,0.3767258,0.000049767685,0.000096765885,0.00012653631,0.000005708298,0.00006832273,0.00025605387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985128,0.000005183486,0.00049859774,0.0003215413,0.00030609046,0.0003557653],"domain_scores_gemma":[0.9982395,0.0005674494,0.00023965191,0.0007431204,0.000045531713,0.00016472813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043215396,0.00028564804,0.00039236803,0.00008075049,0.00023180447,0.00014676643,0.00027924048,0.00014241389,0.00018279783],"category_scores_gemma":[0.0002192531,0.00024550507,0.00007368051,0.00017361487,0.00013990351,0.00007865737,0.000173152,0.00038157005,0.00005875105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017022015,0.00010222564,0.000020198839,0.00038600893,0.000028139595,0.0000013303231,0.0012967626,5.199535e-7,0.052907623,0.9427398,0.0013506986,0.001164995],"study_design_scores_gemma":[0.0004348193,0.000014995836,0.000049961614,0.00006600881,0.000102060694,0.00004991415,0.0010664061,0.0030193967,0.009965244,0.9779155,0.0068036756,0.0005120089],"about_ca_topic_score_codex":0.0000022244126,"about_ca_topic_score_gemma":0.00001463701,"teacher_disagreement_score":0.27038127,"about_ca_system_score_codex":0.000011734369,"about_ca_system_score_gemma":0.000021901666,"threshold_uncertainty_score":0.9999997},"labels":[],"label_agreement":null},{"id":"W2007560929","doi":"10.1016/j.dam.2008.01.026","title":"Polarity of chordal graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Chordal graph; Combinatorics; Mathematics; Indifference graph; Pathwidth; Cograph; Bipartite graph; Split graph; Interval graph; Discrete mathematics; Maximal independent set; Distance-hereditary graph; Strong perfect graph theorem; Treewidth; Modular decomposition; Graph; 1-planar graph; Line graph; Voltage graph","score_opus":0.027902754545618,"score_gpt":0.27988077025463104,"score_spread":0.251978015709013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007560929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10331238,0.000051628056,0.8708377,0.000061006922,0.00004064001,0.00029885603,0.0000072467114,0.00014493115,0.025245612],"genre_scores_gemma":[0.65369713,0.000021440206,0.3461488,0.000027155864,0.000009032274,0.000019092913,0.0000019943188,0.000012774927,0.0000626032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855375,0.000019359215,0.00033391974,0.00027051632,0.0004953072,0.00032715846],"domain_scores_gemma":[0.998563,0.00017492336,0.00014665091,0.00093744503,0.00006984519,0.00010813192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003225883,0.00015324114,0.00027984506,0.00014578448,0.0001383233,0.000020564807,0.0010941045,0.00006052268,0.000016954546],"category_scores_gemma":[0.000050740455,0.00013206834,0.00009936602,0.0006087743,0.00027877218,0.0001835534,0.00035663278,0.00018774046,0.000043634704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005272905,0.00008540916,0.000072633055,0.000060938015,0.000016877562,0.0000081324615,0.0013370843,0.000012369474,0.013947705,0.9836207,0.00005312923,0.00077973],"study_design_scores_gemma":[0.00035980082,0.000048612004,0.00049015915,0.000015874792,0.000005893275,0.000051060462,0.00013348593,0.0033045735,0.035030324,0.96015054,0.00017905569,0.00023061938],"about_ca_topic_score_codex":0.0000030686178,"about_ca_topic_score_gemma":8.304045e-7,"teacher_disagreement_score":0.55038476,"about_ca_system_score_codex":0.000014369201,"about_ca_system_score_gemma":0.000045479515,"threshold_uncertainty_score":0.538559},"labels":[],"label_agreement":null},{"id":"W2008790560","doi":"10.1016/j.dam.2010.06.007","title":"Sorting with networks of data structures","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"University of Waterloo","keywords":"Mathematics; Sorting; Combinatorics; Algorithm","score_opus":0.04065875194645551,"score_gpt":0.32170332704317783,"score_spread":0.2810445750967223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008790560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20943716,0.000023017983,0.76170367,0.00004399703,0.00034880202,0.0012713809,0.000050472696,0.00038608772,0.026735427],"genre_scores_gemma":[0.49124658,0.0000026996224,0.5084387,0.000011156406,0.00012849121,0.000025047077,0.000025709538,0.00009064743,0.000030944408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99743485,0.00001398268,0.0009576627,0.00047966515,0.00062964304,0.000484173],"domain_scores_gemma":[0.99481255,0.0010684557,0.0010172062,0.0028272555,0.00013557862,0.0001389593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006335049,0.0004182871,0.00078983983,0.00008814431,0.00012977254,0.000054156895,0.0014273537,0.00020992823,0.00008843336],"category_scores_gemma":[0.00055088394,0.00031166815,0.00006656599,0.0003363109,0.0002735454,0.00023806168,0.0006012689,0.0006274346,0.000006899842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024912939,0.00014738154,0.000022505961,0.00055303733,0.00009429632,0.0000035454548,0.0006753033,0.00007017577,0.007908999,0.9891957,0.00016572901,0.0011384098],"study_design_scores_gemma":[0.0006923365,0.000046257443,0.000014815425,0.00009082459,0.00019792854,0.000028981225,0.00077632506,0.0091573605,0.00560993,0.98282886,0.00013432273,0.00042206165],"about_ca_topic_score_codex":0.0000022096322,"about_ca_topic_score_gemma":0.00002231532,"teacher_disagreement_score":0.28180942,"about_ca_system_score_codex":0.000015294505,"about_ca_system_score_gemma":0.000063204185,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W2008914847","doi":"10.1016/s0166-218x(99)00163-8","title":"Pancyclicity and NP-completeness in planar graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Completeness (order theory); Combinatorics; NP-complete; Planar; Planar graph; Discrete mathematics; Graph; Time complexity; Computer science","score_opus":0.018394195643940105,"score_gpt":0.2686029003853998,"score_spread":0.2502087047414597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008914847","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.667103,0.00014265669,0.28763962,0.00035637524,0.000034959427,0.00077280455,0.00001394122,0.0002715491,0.04366509],"genre_scores_gemma":[0.8277246,0.00011415277,0.17167076,0.00020435132,0.000013765633,0.00009922436,0.000005107812,0.000026291915,0.0001417365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852806,0.000028911629,0.00031488747,0.00039566946,0.000307574,0.00042487337],"domain_scores_gemma":[0.99892765,0.00022284064,0.00005814993,0.00066127593,0.000015449648,0.00011464785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037971244,0.00018814203,0.0002924933,0.00015550565,0.000104963234,0.000095674186,0.0007186667,0.00006275476,0.000041989264],"category_scores_gemma":[0.000016129268,0.00016446365,0.000039231447,0.0005568342,0.00014442865,0.00020554123,0.00012378917,0.00020130555,0.000063773885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012561852,0.00006507471,0.00016084977,0.000074208445,0.0000092064065,0.000013727412,0.0014188574,0.000043551732,0.001782307,0.9772307,0.000031722466,0.019157182],"study_design_scores_gemma":[0.00047088924,0.00002457039,0.0012554851,0.000028642038,0.0000035201183,0.000020656315,0.00014453613,0.008294314,0.0008823329,0.988052,0.0005578213,0.00026521145],"about_ca_topic_score_codex":0.000008473583,"about_ca_topic_score_gemma":0.000014033963,"teacher_disagreement_score":0.1606216,"about_ca_system_score_codex":0.000017595003,"about_ca_system_score_gemma":0.000013993038,"threshold_uncertainty_score":0.6706633},"labels":[],"label_agreement":null},{"id":"W2009069065","doi":"10.1016/j.dam.2015.03.001","title":"Charm bracelets and their application to the construction of periodic Golay pairs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Modulo; Binary Golay code; Combinatorics; Ring of integers; Charm (quantum number); Discrete mathematics; Arithmetic; Algorithm; Algebraic number field; Particle physics; Physics","score_opus":0.013737063935454489,"score_gpt":0.22188586029084437,"score_spread":0.20814879635538988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009069065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10347734,0.000046081383,0.89201397,0.00079314987,0.000052832802,0.00036093107,0.0000041873022,0.000078728175,0.0031728055],"genre_scores_gemma":[0.9264669,0.0000073888536,0.07328974,0.00012124936,0.00002814359,0.00007045263,0.0000020092484,0.0000078255725,0.0000062995437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930274,0.000022832679,0.00019677186,0.000194375,0.00015201708,0.00013127484],"domain_scores_gemma":[0.99911547,0.00009523068,0.00012388226,0.0005310272,0.00004636995,0.00008799613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005919642,0.00011620348,0.00015539803,0.00005957454,0.0000945412,0.00006847872,0.00043255003,0.000036833368,0.0000021741182],"category_scores_gemma":[0.000019446306,0.000074416996,0.000038131435,0.00031462,0.000116464675,0.00007376747,0.00017953703,0.0000711614,0.000015940215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069679945,0.000023291566,0.000012248625,0.0000371191,0.000013367289,8.7891145e-8,0.027769236,0.000021140915,0.003419885,0.94201934,0.00014868545,0.026528629],"study_design_scores_gemma":[0.0005878433,0.00016089962,0.00012187476,0.00005512579,0.000034421235,0.00004942308,0.026596183,0.030068276,0.025097935,0.9054465,0.011326438,0.00045507064],"about_ca_topic_score_codex":0.0000025473435,"about_ca_topic_score_gemma":0.000002037306,"teacher_disagreement_score":0.8229896,"about_ca_system_score_codex":0.0000091642305,"about_ca_system_score_gemma":0.000020542051,"threshold_uncertainty_score":0.3034637},"labels":[],"label_agreement":null},{"id":"W2010655053","doi":"10.1016/j.dam.2006.04.019","title":"Generalized Fibonacci broadcasting: An efficient VOD scheme with user bandwidth limit","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University","keywords":"Bandwidth (computing); Fibonacci number; Broadcasting (networking); Computer science; Computer network; Limiting; Scheme (mathematics); Mathematics; Discrete mathematics","score_opus":0.02361556129626337,"score_gpt":0.29147197993972135,"score_spread":0.267856418643458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010655053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6554213,0.00008376661,0.020636318,0.0014372291,0.0000666982,0.0010130745,0.000009276922,0.0008242796,0.32050803],"genre_scores_gemma":[0.74824005,0.000016167442,0.2505046,0.00009487044,0.00008961824,0.00009770293,0.000042922155,0.000033156357,0.0008808783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856013,0.000044408316,0.00031898497,0.00026146948,0.00041679398,0.0003982168],"domain_scores_gemma":[0.9987504,0.00014902302,0.00020300222,0.0007034634,0.00008031845,0.000113808666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040540344,0.00018541062,0.00026262406,0.00009113991,0.0004468194,0.000098953176,0.0005849901,0.00016398929,0.00022832073],"category_scores_gemma":[0.00005749224,0.00015178688,0.000046988138,0.00033203769,0.00036072545,0.00005825305,0.000101122816,0.00018482724,0.00008053932],"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.000014940464,0.00025354014,0.00018507884,0.000020723344,0.000016177926,0.0000015864671,0.003440173,0.00016293692,0.0015245968,0.99292743,0.00040785666,0.0010449484],"study_design_scores_gemma":[0.0129418485,0.00045179678,0.0025547892,0.00035175524,0.00047870018,0.000033112712,0.049235404,0.16611482,0.018290399,0.1704636,0.57429355,0.0047902195],"about_ca_topic_score_codex":0.00026048845,"about_ca_topic_score_gemma":0.0009064972,"teacher_disagreement_score":0.82246387,"about_ca_system_score_codex":0.000056422377,"about_ca_system_score_gemma":0.00008419813,"threshold_uncertainty_score":0.61896896},"labels":[],"label_agreement":null},{"id":"W2011015448","doi":"10.1016/j.dam.2004.06.006","title":"Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Rough Sets and Fuzzy Logic","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":"Penticton Regional Hospital","funders":"","keywords":"Categorical variable; Mathematics; Algorithm; Enumeration; Combinatorics; Statistics","score_opus":0.05097250153341767,"score_gpt":0.2943127930250565,"score_spread":0.2433402914916388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011015448","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020508657,0.00004425031,0.99644685,0.00024677647,0.00003313531,0.00051164534,0.00008581406,0.00006123825,0.0005194171],"genre_scores_gemma":[0.3507708,0.00005217232,0.64882135,0.000013190348,0.00001721909,0.00006680287,0.00023997037,0.000012376238,0.0000061571154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.000010812716,0.00049740996,0.0005113497,0.00024119747,0.00027642635],"domain_scores_gemma":[0.9985561,0.00015894811,0.00024133084,0.0009335046,0.00002937943,0.00008074903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042280572,0.00018549389,0.00041976583,0.00024334449,0.00010980806,0.00012259348,0.0007639306,0.00008351063,0.0000033383387],"category_scores_gemma":[0.000057888683,0.00014642741,0.00006623253,0.0009528002,0.000085323154,0.00034405658,0.00045101345,0.00009370903,9.493332e-7],"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.000019712492,0.00040902031,0.00046543876,0.00049025874,0.0004162961,0.000004368378,0.0045087915,0.4105851,0.00015823844,0.5804771,0.000047932976,0.0024177325],"study_design_scores_gemma":[0.0005288592,0.0000314697,0.0002593046,0.000017757999,0.00018998144,0.0000028304303,0.00027878556,0.93851393,0.00012052379,0.059861563,0.000014640639,0.00018035478],"about_ca_topic_score_codex":0.000019261606,"about_ca_topic_score_gemma":0.000013768486,"teacher_disagreement_score":0.5279288,"about_ca_system_score_codex":0.000035300534,"about_ca_system_score_gemma":0.000035837977,"threshold_uncertainty_score":0.59711367},"labels":[],"label_agreement":null},{"id":"W2011959959","doi":"10.1016/s0166-218x(02)00440-7","title":"Higher weights and graded rings for binary self-dual codes","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","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":"University of Victoria","funders":"","keywords":"Mathematics; Dual (grammatical number); Binary number; Combinatorics; Discrete mathematics; Arithmetic; Linguistics","score_opus":0.014709663999998299,"score_gpt":0.23082972422446046,"score_spread":0.21612006022446217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011959959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26455086,0.00021683624,0.6966769,0.00032384857,0.00031989918,0.0011442901,0.000011522387,0.0009406206,0.03581521],"genre_scores_gemma":[0.5435943,0.000017138604,0.4559743,0.00014493214,0.000030063706,0.0001038312,0.0000027504018,0.000020191954,0.00011247057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901235,0.000017365213,0.0002155933,0.00031658733,0.00015885783,0.00027925125],"domain_scores_gemma":[0.9991088,0.00025337038,0.000096893455,0.00042304775,0.000024610632,0.00009326792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003261203,0.00019040109,0.00022608001,0.00008507934,0.00020828488,0.00013665539,0.00029587827,0.00006794102,0.000010438616],"category_scores_gemma":[0.000010669638,0.00015787248,0.00007605789,0.000221401,0.00006670484,0.0001309572,0.000101081896,0.0000807444,0.000010718219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004424027,0.00007167777,0.000011307795,0.00011786622,0.000034303182,0.000001565192,0.0013985896,0.0000010076077,0.0015213655,0.99635077,0.0002351821,0.00025196892],"study_design_scores_gemma":[0.0005430166,0.000074000134,0.00006671465,0.00002451269,0.000040534702,0.000011723771,0.0001391253,0.0016687881,0.0063164677,0.98311704,0.0077007213,0.00029734403],"about_ca_topic_score_codex":3.101865e-7,"about_ca_topic_score_gemma":2.5471394e-7,"teacher_disagreement_score":0.27904347,"about_ca_system_score_codex":0.000009429339,"about_ca_system_score_gemma":0.000015080402,"threshold_uncertainty_score":0.6437853},"labels":[],"label_agreement":null},{"id":"W2012205236","doi":"10.1016/j.dam.2013.06.021","title":"Semidefinite resolution and exactness of semidefinite relaxations for satisfiability","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Semidefinite programming; Semidefinite embedding; Mathematics; Satisfiability; Transformation (genetics); Resolution (logic); Quadratically constrained quadratic program; Discrete mathematics; Combinatorics; Algorithm; Mathematical optimization; Computer science; Quadratic programming","score_opus":0.024181814076874943,"score_gpt":0.2668779148487238,"score_spread":0.24269610077184886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012205236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034898877,0.000030154693,0.957913,0.00011664931,0.00006039236,0.00094572623,0.000015866724,0.000100451536,0.005918887],"genre_scores_gemma":[0.23163183,0.00001349623,0.7679123,0.00003079751,0.000011487255,0.00034393344,0.00001021076,0.000011978256,0.000033952037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872255,0.00003170884,0.000530108,0.00029241754,0.00021209459,0.0002111051],"domain_scores_gemma":[0.9980064,0.00061352534,0.00038727323,0.00077368796,0.00015147014,0.000067655965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072774966,0.0001463833,0.0002526152,0.00008566893,0.000118823256,0.0000761812,0.00035957582,0.00009633936,0.0000087052],"category_scores_gemma":[0.00045235382,0.00013269362,0.00005032916,0.0002753736,0.00012989891,0.0003788978,0.00015983467,0.000091123395,0.000016384722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029227956,0.000036820322,0.000048762315,0.0003092624,0.000010458267,2.5513181e-8,0.0013777772,0.000070899434,0.0077979644,0.98354465,0.00010245151,0.006698018],"study_design_scores_gemma":[0.000395079,0.000062876934,0.0033423584,0.00006552525,0.000030318062,0.0000047289013,0.0003511232,0.3025778,0.012888291,0.679717,0.0002846806,0.000280203],"about_ca_topic_score_codex":0.000011178669,"about_ca_topic_score_gemma":0.0000012538221,"teacher_disagreement_score":0.3038276,"about_ca_system_score_codex":0.000030710482,"about_ca_system_score_gemma":0.000029225133,"threshold_uncertainty_score":0.54110885},"labels":[],"label_agreement":null},{"id":"W2012294171","doi":"10.1016/j.dam.2013.05.007","title":"Super-simple balanced incomplete block designs with block size 5 and index 3","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","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":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Mathematics; Simple (philosophy); Block (permutation group theory); Block size; Block design; Combinatorics; Index (typography); Hash function; Discrete mathematics; Algorithm; Arithmetic; Computer science; Key (lock)","score_opus":0.00862092791215069,"score_gpt":0.18716392127110532,"score_spread":0.17854299335895463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012294171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9705853,0.00006079108,0.010187308,0.000017742032,0.000039452774,0.00082026917,0.000014937085,0.0003918848,0.017882349],"genre_scores_gemma":[0.9931769,0.000009888537,0.0063392688,0.000037687114,0.000043738564,0.00023634336,0.0000064108012,0.00007700109,0.000072799274],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.000011946875,0.00031808525,0.00021039143,0.00019695409,0.00037274815],"domain_scores_gemma":[0.9991518,0.00021694739,0.000055187218,0.00040295225,0.0000288469,0.0001442308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012440399,0.0002997054,0.00038711773,0.000050549508,0.000098570854,0.00010011763,0.00018450909,0.00010138894,0.00008505236],"category_scores_gemma":[0.0000119932465,0.00023441718,0.000039923736,0.00017551078,0.000088107176,0.00009456841,0.000046335546,0.00016377831,0.00009449504],"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.00012377564,0.00033600014,0.003706772,0.0072076675,0.0015138028,0.000039463208,0.023165347,0.015433249,0.6444624,0.29548916,0.0063068657,0.002215497],"study_design_scores_gemma":[0.012443007,0.00075641565,0.01579581,0.0011917942,0.00075834914,0.0007479096,0.034455873,0.30535015,0.07476365,0.537829,0.007832975,0.008075074],"about_ca_topic_score_codex":0.000009466654,"about_ca_topic_score_gemma":0.000008033962,"teacher_disagreement_score":0.56969875,"about_ca_system_score_codex":0.000017533874,"about_ca_system_score_gemma":0.00000792911,"threshold_uncertainty_score":0.9559255},"labels":[],"label_agreement":null},{"id":"W2012996826","doi":"10.1016/j.dam.2009.02.010","title":"There are <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si47.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-uniform cubefree binary morphisms for all <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si48.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi><mml:mo>≥</mml:mo><mml:mn>0</mml:mn></mml:math>","year":2009,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Morphism; Mathematics; Binary number; Word (group theory); Discrete mathematics; Combinatorics; Algorithm; Arithmetic; Geometry","score_opus":0.018514275569914133,"score_gpt":0.24428564184295826,"score_spread":0.22577136627304412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012996826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95858157,0.0021201633,0.019070566,0.0013216378,0.0030545446,0.0006714016,0.002291537,0.0013960076,0.011492556],"genre_scores_gemma":[0.9462587,0.0019168749,0.037235066,0.004085892,0.003120088,0.0025508185,0.0027478996,0.0016063536,0.0004782678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98059076,0.00037554489,0.0047695492,0.004362621,0.0047643525,0.005137153],"domain_scores_gemma":[0.9826751,0.0029722431,0.0053610737,0.006515776,0.00043896126,0.0020368793],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0041466686,0.0031941957,0.0018701153,0.00083663396,0.00347646,0.0034742637,0.0067408495,0.003961094,0.00066015194],"category_scores_gemma":[0.0011919533,0.0040784683,0.0037657332,0.001984844,0.0022468881,0.002961275,0.004734178,0.0033697307,0.004881817],"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.001669336,0.0016999743,0.000004877688,0.0036745304,0.0022122753,0.0016909216,0.005648503,0.0032699222,0.0056650364,0.96002316,0.010823989,0.0036174792],"study_design_scores_gemma":[0.0041165934,0.0025037914,0.00004584913,0.0032270316,0.0024643233,0.001829768,0.0039711837,0.9161697,0.03705799,0.01782824,0.0071384422,0.0036470664],"about_ca_topic_score_codex":0.00047064587,"about_ca_topic_score_gemma":0.00033746185,"teacher_disagreement_score":0.94219494,"about_ca_system_score_codex":0.0001421285,"about_ca_system_score_gemma":0.001753487,"threshold_uncertainty_score":0.99892956},"labels":[],"label_agreement":null},{"id":"W2013474931","doi":"10.1016/j.dam.2008.01.011","title":"Efficient algorithms for Roman domination on some classes of graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Interval graph; Domination analysis; Graph; Time complexity; Minimum weight; Chordal graph; Discrete mathematics; 1-planar graph","score_opus":0.03393014591615173,"score_gpt":0.3040478813041502,"score_spread":0.2701177353879985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013474931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116449095,0.000027854943,0.8793503,0.00007891422,0.00006675171,0.0008303711,0.000014887794,0.00010377024,0.003078046],"genre_scores_gemma":[0.6220733,0.000011865432,0.37758675,0.000036184967,0.000016944734,0.00016971985,0.0000066487137,0.000022005448,0.00007660266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984629,0.000016367518,0.00035924962,0.00032556418,0.0005176545,0.0003182288],"domain_scores_gemma":[0.99841195,0.00053336006,0.00020525,0.00067189365,0.00009885486,0.00007871566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791433,0.00017283931,0.00028306345,0.00023470027,0.00017404738,0.000024883553,0.0007123043,0.00006112675,0.0000031864324],"category_scores_gemma":[0.00007423281,0.00014438492,0.0001188361,0.0003981194,0.00017993257,0.000082810315,0.00014073907,0.000103406266,0.000016723849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017711098,0.00018343302,0.0000013392568,0.00010684858,0.000017179565,0.000001862705,0.0010145673,0.0011640064,0.006154637,0.9891786,0.00007556218,0.0020842573],"study_design_scores_gemma":[0.0007651475,0.00019848753,0.000060398455,0.00003732065,0.000009110482,0.000007781189,0.00018242229,0.1708454,0.053504795,0.77407414,0.000091497146,0.00022351679],"about_ca_topic_score_codex":4.5507193e-7,"about_ca_topic_score_gemma":1.9383334e-7,"teacher_disagreement_score":0.5056242,"about_ca_system_score_codex":0.00003096976,"about_ca_system_score_gemma":0.00003521056,"threshold_uncertainty_score":0.5887846},"labels":[],"label_agreement":null},{"id":"W2015132157","doi":"10.1016/j.dam.2013.11.015","title":"Counting inequivalent monotone Boolean functions","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Western Canada Research Grid; Compute Canada","keywords":"Mathematics; Monotone polygon; Monotonic function; Combinatorics; Boolean function; Discrete mathematics","score_opus":0.023356769323008897,"score_gpt":0.2614921495457749,"score_spread":0.23813538022276598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015132157","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015525927,0.000015748556,0.9479787,0.0001579529,0.00016298615,0.00050872285,0.000002082583,0.00027025514,0.03537767],"genre_scores_gemma":[0.19961905,0.0000052199207,0.7996321,0.00012900984,0.000051661555,0.0002410608,0.0000063782886,0.000018446075,0.00029710904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868923,0.000015211924,0.00039114986,0.00028298967,0.00032009088,0.00030135215],"domain_scores_gemma":[0.99867314,0.000072310286,0.00020194433,0.0008855665,0.000077757766,0.000089260604],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042507882,0.0001669538,0.00018656527,0.000079995356,0.00016407632,0.00023951348,0.00068119983,0.0000646119,0.00007891001],"category_scores_gemma":[0.0000624903,0.00014741921,0.000054161075,0.0003053681,0.000052387808,0.00047737695,0.00025728048,0.00014821567,0.0012435993],"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":[8.8496057e-7,0.00006623693,0.000011804161,0.00008655797,0.000018094943,3.6021996e-7,0.0012867857,0.00013720847,0.013670483,0.9719471,0.0011647928,0.011609721],"study_design_scores_gemma":[0.00046600515,0.00006117155,0.0009345158,0.00006284594,0.00003655723,0.000018337423,0.0013863348,0.7692452,0.02253634,0.20020351,0.0043390593,0.00071009906],"about_ca_topic_score_codex":0.000007802262,"about_ca_topic_score_gemma":3.7752324e-7,"teacher_disagreement_score":0.7717436,"about_ca_system_score_codex":0.000047090907,"about_ca_system_score_gemma":0.000021744885,"threshold_uncertainty_score":0.9995341},"labels":[],"label_agreement":null},{"id":"W2015142077","doi":"10.1016/s0166-218x(01)00299-2","title":"Pushing vertices in digraphs without long induced cycles","year":2002,"lang":"en","type":"article","venue":"Discrete Applied 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":"Combinatorics; Digraph; Bipartite graph; Mathematics; Chordal graph; Characterization (materials science); Discrete mathematics; Permutation (music); Class (philosophy); Permutation graph; Graph; Computer science","score_opus":0.04205290952623685,"score_gpt":0.29742326292808546,"score_spread":0.2553703534018486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015142077","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6166109,0.00016350497,0.353464,0.0002708858,0.000072523064,0.0006391861,0.0000018128387,0.00032584238,0.028451346],"genre_scores_gemma":[0.9174246,0.000027792472,0.08229164,0.000070824455,0.000018607534,0.00008166144,0.0000011749207,0.000028377426,0.000055288183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979943,0.000037029615,0.00041680556,0.0004499037,0.00052880007,0.00057317043],"domain_scores_gemma":[0.9985048,0.00028350097,0.00013867859,0.0009074054,0.000031182273,0.00013442308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045742473,0.00023710255,0.00032051743,0.00029948508,0.00013153971,0.00024774284,0.0013011303,0.00008794592,0.000027736854],"category_scores_gemma":[0.000085597625,0.00020773665,0.0000691792,0.000875762,0.000095395066,0.0005715487,0.00039494384,0.00033894865,0.00013394248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009692699,0.00025103128,0.001616841,0.00018857255,0.000035747373,0.000041446234,0.01014267,0.00016522194,0.015006544,0.952437,0.0000345049,0.020070774],"study_design_scores_gemma":[0.0015632656,0.000094177834,0.0031666134,0.00027235624,0.000020994958,0.000031499283,0.0016047425,0.1794169,0.02522661,0.7873655,0.00012934725,0.001107985],"about_ca_topic_score_codex":0.000005050543,"about_ca_topic_score_gemma":0.000029882929,"teacher_disagreement_score":0.30081373,"about_ca_system_score_codex":0.00004016293,"about_ca_system_score_gemma":0.000011305197,"threshold_uncertainty_score":0.8471255},"labels":[],"label_agreement":null},{"id":"W2015695027","doi":"10.1016/j.dam.2008.01.016","title":"The colourful feasibility problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":19,"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; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Benchmarking; Generalization; Convergence (economics); Mathematics; Mathematical optimization; Linear programming; Computational complexity theory; Computer science; Algorithm; Theoretical computer science","score_opus":0.07630770286649102,"score_gpt":0.35293061711257817,"score_spread":0.27662291424608715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015695027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033617623,0.00011918609,0.7835016,0.0010634809,0.00012994121,0.004627815,0.000037594156,0.0008326294,0.17607014],"genre_scores_gemma":[0.059582934,0.00018099319,0.93406016,0.000069591704,0.00009158075,0.00042028676,0.000013723133,0.00012174908,0.005459004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99751765,0.000044542987,0.0006620582,0.00036329322,0.00081411516,0.0005983358],"domain_scores_gemma":[0.9968328,0.0014557341,0.0002768812,0.0010568666,0.00020818415,0.00016954371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007898818,0.0002821213,0.00037112393,0.000054573706,0.00095943775,0.0000724826,0.00062521483,0.00011559713,0.00011597245],"category_scores_gemma":[0.0006606536,0.00018695317,0.00011551472,0.00042132754,0.0004964028,0.000101535064,0.00024794874,0.000364079,0.0001881614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054991073,0.00038328205,0.00006193511,0.0002640465,0.000084254956,0.000015426793,0.0029352636,0.00027730054,0.0005478831,0.98583287,0.008135798,0.0014069657],"study_design_scores_gemma":[0.000995093,0.000056752102,0.000058885238,0.000029404433,0.00003427303,0.00007048761,0.0015826117,0.012721096,0.0019505256,0.9770787,0.004966629,0.00045558327],"about_ca_topic_score_codex":0.0000012901424,"about_ca_topic_score_gemma":0.0000069905936,"teacher_disagreement_score":0.17061113,"about_ca_system_score_codex":0.00013485002,"about_ca_system_score_gemma":0.00011645891,"threshold_uncertainty_score":0.7623729},"labels":[],"label_agreement":null},{"id":"W2017572120","doi":"10.1016/s0166-218x(02)00384-0","title":"Complexity of robust single facility location problems on networks with uncertain edge lengths","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Minimax; Mathematics; Enhanced Data Rates for GSM Evolution; Facility location problem; Mathematical optimization; Robust optimization; Regret; Realization (probability); 1-center problem; Computer science; Statistics","score_opus":0.06967438577420261,"score_gpt":0.23043842097782177,"score_spread":0.16076403520361915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017572120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07313436,0.00004268481,0.6944387,0.00041834434,0.00020973697,0.0021324076,0.000014217639,0.00028010592,0.22932942],"genre_scores_gemma":[0.9936194,0.0000041953044,0.005698198,0.00023417283,0.000046009885,0.000083898674,0.00012527971,0.000020986367,0.00016786066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985399,0.000010240721,0.00048374952,0.000318107,0.00036708827,0.0002808637],"domain_scores_gemma":[0.9990394,0.000028991875,0.00021420652,0.0005226302,0.00017540522,0.000019374762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049925863,0.00024720834,0.0002993133,0.000108603046,0.00014379951,0.00007834657,0.00020839788,0.00006342067,0.00025984526],"category_scores_gemma":[0.00006930398,0.00020209476,0.00005201579,0.00057611195,0.00018052373,0.00019440765,0.00005568966,0.00011867194,0.00014161889],"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.000035469217,0.000605649,0.00014254177,0.0016904017,0.000051135954,3.7458668e-7,0.00023662829,0.3089434,0.00012912088,0.68642545,0.00076906383,0.00097076356],"study_design_scores_gemma":[0.00452039,0.000263132,0.0025221845,0.0008083318,0.0005805126,0.0000024309873,0.011082737,0.82741004,0.0017437632,0.10229108,0.04607245,0.0027029742],"about_ca_topic_score_codex":0.0000983254,"about_ca_topic_score_gemma":0.0002124674,"teacher_disagreement_score":0.920485,"about_ca_system_score_codex":0.00004793929,"about_ca_system_score_gemma":0.000015429396,"threshold_uncertainty_score":0.8241185},"labels":[],"label_agreement":null},{"id":"W2017638499","doi":"10.1016/j.dam.2007.10.010","title":"On chromatic and flow polynomial unique graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Combinatorial Mathematics","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":"Thompson Rivers University","funders":"Nankai University","keywords":"Chromatic polynomial; Tutte polynomial; Mathematics; Combinatorics; Discrete mathematics; 1-planar graph; Chordal graph; Chromatic scale; Graph; Line graph; Voltage graph","score_opus":0.025378264574234508,"score_gpt":0.27032597392181695,"score_spread":0.24494770934758245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017638499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84340525,0.000067606554,0.08854661,0.00017897473,0.00043050866,0.0023159941,0.000041856118,0.0008406839,0.06417249],"genre_scores_gemma":[0.61113334,0.000060542214,0.38763237,0.00014683037,0.000114535265,0.000220447,0.000010542947,0.000197778,0.00048358165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99726677,0.00003835716,0.0008892809,0.0005239802,0.00066984387,0.00061174313],"domain_scores_gemma":[0.99648595,0.0016294081,0.00044358362,0.001101204,0.00007069042,0.00026916325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003647097,0.00061456347,0.0009305832,0.00021296476,0.0003912713,0.000053636595,0.00043728485,0.00024792246,0.00010188621],"category_scores_gemma":[0.00060667854,0.0005337969,0.00015936219,0.00035718366,0.00035078818,0.00013466844,0.0002103874,0.0004200842,0.0001565861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035817808,0.0003567104,0.0000042153606,0.0006139355,0.000081211925,0.000029025103,0.0033436718,0.00001973282,0.0015317702,0.9903575,0.0033436264,0.0002827886],"study_design_scores_gemma":[0.0012728242,0.00015001459,0.0000128014635,0.00017832904,0.00009512749,0.00013618711,0.00044678035,0.0029736103,0.0040284167,0.98991543,0.00016736836,0.0006230927],"about_ca_topic_score_codex":0.0000015218878,"about_ca_topic_score_gemma":0.0000019168892,"teacher_disagreement_score":0.29908577,"about_ca_system_score_codex":0.00009549746,"about_ca_system_score_gemma":0.000064898144,"threshold_uncertainty_score":0.99971133},"labels":[],"label_agreement":null},{"id":"W2017914065","doi":"10.1016/j.dam.2005.04.001","title":"On the b-dominating coloring of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Edge coloring; Chromatic scale; Graph; Existential quantification; Perfect graph; Discrete mathematics; Induced subgraph; Graph power; Line graph","score_opus":0.01573717360601393,"score_gpt":0.22825541704617913,"score_spread":0.2125182434401652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017914065","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67163295,0.00008658326,0.23130712,0.0021710938,0.00014606403,0.0006699752,0.0000031889165,0.00030276502,0.09368028],"genre_scores_gemma":[0.84260905,0.0000035352182,0.15708347,0.00022625434,0.0000038086823,0.000026140757,4.2701186e-7,0.0000086258,0.00003869892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990272,0.000011379229,0.00030396876,0.00017738012,0.000292759,0.00018734645],"domain_scores_gemma":[0.9987198,0.0004441704,0.00018300452,0.00057551544,0.00003812863,0.00003934685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051403843,0.000117044816,0.00016281019,0.000069229245,0.00012784265,0.000047517977,0.0005746269,0.000034767236,0.0000111283725],"category_scores_gemma":[0.000059962298,0.000073429546,0.00006487125,0.0002967274,0.00006730016,0.000060669347,0.00014519649,0.0001125998,0.000044449444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013202903,0.000045165056,0.0000014418046,0.000024014696,0.000010132161,2.4765993e-7,0.0012384092,0.00037433702,0.0075293398,0.9883359,0.00022606822,0.0022136397],"study_design_scores_gemma":[0.00024781423,0.00003631361,0.000009042307,0.00007310137,0.000010482456,0.000002390112,0.00026599623,0.06255598,0.053738922,0.8828055,0.00011147983,0.00014297946],"about_ca_topic_score_codex":0.0000012438919,"about_ca_topic_score_gemma":6.931946e-7,"teacher_disagreement_score":0.1709761,"about_ca_system_score_codex":0.000008672863,"about_ca_system_score_gemma":0.0000125241495,"threshold_uncertainty_score":0.29943702},"labels":[],"label_agreement":null},{"id":"W2019168264","doi":"10.1016/j.dam.2011.10.029","title":"Sturmian graphs and integer representations over numeration systems","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","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":"Mathematics; Continued fraction; Graph; Integer (computer science); Discrete mathematics; Fraction (chemistry); Natural number; Combinatorics; Representation (politics); Path (computing); Arithmetic","score_opus":0.021773893499408177,"score_gpt":0.24163171360855865,"score_spread":0.21985782010915048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019168264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058717933,0.00009862131,0.8988587,0.000048978414,0.00018849269,0.00043523166,0.00000545925,0.00032115215,0.041325413],"genre_scores_gemma":[0.9257589,0.000014401969,0.073920146,0.0000902144,0.000017763292,0.00007277602,0.000006064166,0.000014930541,0.00010483518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991121,0.000015841682,0.00026152973,0.00026263567,0.00017990563,0.00016797446],"domain_scores_gemma":[0.9991532,0.0000722257,0.00012315703,0.0005546048,0.000025819209,0.00007097699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021942872,0.00013449683,0.00016433815,0.00007813257,0.00011204033,0.00017822096,0.0003292181,0.000052272928,0.000018247993],"category_scores_gemma":[0.000012982208,0.00010886276,0.00003443762,0.00017969393,0.000055602253,0.00028330064,0.00015359187,0.000081037346,0.0000339058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013485947,0.000034415818,0.000043772074,0.000045840377,0.00001843524,0.000002087515,0.005706529,0.0000045636184,0.0011194967,0.992047,0.0003185393,0.0006579563],"study_design_scores_gemma":[0.00048613673,0.000043656204,0.0016984501,0.00007962152,0.000043706998,0.000037232156,0.0037312403,0.13386653,0.0034190954,0.8558305,0.00029175586,0.00047208395],"about_ca_topic_score_codex":0.000024022176,"about_ca_topic_score_gemma":0.0000028518918,"teacher_disagreement_score":0.86704093,"about_ca_system_score_codex":0.00001021973,"about_ca_system_score_gemma":0.000011049712,"threshold_uncertainty_score":0.44392943},"labels":[],"label_agreement":null},{"id":"W2019249538","doi":"10.1016/j.dam.2010.01.005","title":"An implicit representation of chordal comparability graphs in linear time","year":2010,"lang":"en","type":"article","venue":"Discrete Applied 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":"Mathematics; Comparability; Chordal graph; Representation (politics); Interval graph; Discrete mathematics; Combinatorics; Graph; 1-planar graph","score_opus":0.02053967500338945,"score_gpt":0.3343552338514482,"score_spread":0.3138155588480588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019249538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75979954,0.0000025540844,0.23657404,0.000038832062,0.000041818716,0.0004631885,0.0000072608054,0.000086479384,0.0029863142],"genre_scores_gemma":[0.749382,0.0000012434738,0.25051752,0.000011169639,0.000011666894,0.00003938274,0.00001155941,0.000012371657,0.000013075505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983941,0.000042244807,0.00048254544,0.00039809238,0.00038493812,0.00029811857],"domain_scores_gemma":[0.9979265,0.00028516774,0.00017371839,0.001425394,0.00007931925,0.000109952205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007187099,0.00015159238,0.0003381007,0.00018964839,0.00005374852,0.000041074683,0.0010691253,0.00008020502,0.000028153101],"category_scores_gemma":[0.00007818657,0.00013694025,0.00006694281,0.0008033285,0.00020167007,0.0003066593,0.0001979215,0.00032604818,0.000049189173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017193055,0.00022200307,0.00053587125,0.000051520125,0.000007105578,0.0000013155236,0.0011987564,0.00023028874,0.3260894,0.67002666,0.000008165206,0.0016116772],"study_design_scores_gemma":[0.00042266684,0.000056282206,0.0028686358,0.000010364968,0.0000042533497,0.0000045551383,0.00015996367,0.14475936,0.05432479,0.7971838,0.000013624712,0.00019167551],"about_ca_topic_score_codex":0.000009271977,"about_ca_topic_score_gemma":0.000017115522,"teacher_disagreement_score":0.27176464,"about_ca_system_score_codex":0.000012639388,"about_ca_system_score_gemma":0.000031151714,"threshold_uncertainty_score":0.55842614},"labels":[],"label_agreement":null},{"id":"W2020284609","doi":"10.1016/j.dam.2012.06.013","title":"Computing transitive closure of bipolar weighted digraphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cognitive Science and Mapping","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Digraph; Transitive closure; Transitive relation; Closure (psychology); Mathematics; Sign (mathematics); Fuzzy logic; Transitive reduction; Discrete mathematics; Combinatorics; Computer science; Artificial intelligence; Graph","score_opus":0.015098436158656857,"score_gpt":0.24538720204974468,"score_spread":0.23028876589108782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020284609","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07072724,0.0002079533,0.9123615,0.00007471687,0.0001106982,0.00026938284,0.0000071455624,0.00011742928,0.01612395],"genre_scores_gemma":[0.8525433,0.000012069547,0.14727627,0.0000896639,0.000046003883,0.000006547391,0.0000035256744,0.000009706721,0.000012945822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985754,0.000019510891,0.00034852215,0.00023277268,0.00037670738,0.00044709654],"domain_scores_gemma":[0.99902123,0.00018632966,0.00019862974,0.00038333356,0.00008279252,0.0001277115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005574048,0.0001756695,0.0002867809,0.00013908035,0.00013013152,0.000048936294,0.0005638842,0.000059540038,0.000009815839],"category_scores_gemma":[0.000020914507,0.00014740306,0.00011096943,0.000688273,0.00012510631,0.00036985317,0.00017665568,0.000127908,0.000032376858],"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.0000029768428,0.0001778518,0.00050527975,0.00016330891,0.000051030947,0.0000013943403,0.024621159,0.0000037097877,0.032979652,0.91678303,0.000062761,0.024647856],"study_design_scores_gemma":[0.0038242366,0.00037394473,0.019117547,0.001132492,0.00040734748,0.00011999872,0.021727832,0.13888475,0.51145697,0.2904431,0.008764978,0.0037468271],"about_ca_topic_score_codex":0.0000031399486,"about_ca_topic_score_gemma":7.831931e-7,"teacher_disagreement_score":0.78181607,"about_ca_system_score_codex":0.000012979461,"about_ca_system_score_gemma":0.000030360141,"threshold_uncertainty_score":0.6010922},"labels":[],"label_agreement":null},{"id":"W2021508809","doi":"10.1016/j.dam.2009.06.032","title":"Multiple levels of preference in interactive strategic decisions","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"","keywords":"Preference; Mathematics; Graph; Stability (learning theory); Decision maker; Ranking (information retrieval); Mathematical economics; Mathematical optimization; Combinatorics; Computer science; Operations research; Artificial intelligence; Statistics; Machine learning","score_opus":0.2618965418645576,"score_gpt":0.40123021836661665,"score_spread":0.13933367650205908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021508809","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.836365,0.000011187052,0.059847955,0.00014339585,0.000023810846,0.0004739028,0.00006833651,0.000030611336,0.10303584],"genre_scores_gemma":[0.9756754,0.0000034399955,0.02402256,0.000048100355,0.000010725836,0.0000326922,0.0000037833065,0.0000075446656,0.0001957768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99794793,0.000039986397,0.0008761114,0.00033323726,0.00059165613,0.000211087],"domain_scores_gemma":[0.9956968,0.0029474983,0.0003743743,0.0007844261,0.000118198914,0.000078742676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106825,0.00015681656,0.00038828934,0.00020722765,0.00006025055,0.00006953086,0.0008103783,0.000072401905,0.00022349908],"category_scores_gemma":[0.000937101,0.00011349315,0.00007987242,0.0007540802,0.00010135755,0.00013591621,0.00008479369,0.0001757694,0.00020146374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042119813,0.0003371826,0.000048433776,0.000005439187,0.0000072620956,0.0000011145048,0.004126237,0.0004339976,0.033007298,0.94817215,0.00006824819,0.013750484],"study_design_scores_gemma":[0.00039922431,0.00003652319,0.0036605531,0.000045008248,0.000007616598,0.0000018779401,0.006526465,0.003571328,0.010030405,0.9755356,0.00005696789,0.00012846966],"about_ca_topic_score_codex":0.0000019017873,"about_ca_topic_score_gemma":0.000017109794,"teacher_disagreement_score":0.13931042,"about_ca_system_score_codex":0.000019827652,"about_ca_system_score_gemma":0.00004399355,"threshold_uncertainty_score":0.46281162},"labels":[],"label_agreement":null},{"id":"W2021533461","doi":"10.1016/j.dam.2009.06.023","title":"Bounds on the index of the signless Laplacian of a graph","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Adjacency matrix; Diagonal matrix; Distance matrix; Simple graph; Bound graph; Degree matrix; Graph; Diagonal; Connectivity; Upper and lower bounds; Laplacian matrix; Laplace operator; Discrete mathematics; Graph power; Line graph","score_opus":0.026193188572908404,"score_gpt":0.2752893651765035,"score_spread":0.2490961766035951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021533461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8720897,0.000018049326,0.012699864,0.0013540959,0.00004382579,0.0014988007,0.000058022903,0.000077282864,0.11216036],"genre_scores_gemma":[0.99651617,0.000004097477,0.0030374178,0.00019882036,0.000019279916,0.00006987727,0.0000022293498,0.000022757698,0.00012933135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863726,0.00004010996,0.0005417942,0.00016719551,0.00040269637,0.0002109714],"domain_scores_gemma":[0.9974834,0.0007600628,0.0005097599,0.0011499185,0.000056984787,0.000039923216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055570755,0.00020605301,0.00035413637,0.00006569384,0.00018848147,0.00001929275,0.0007290948,0.000095264906,0.00004464396],"category_scores_gemma":[0.00011625236,0.00010987166,0.0002225743,0.00052576413,0.00031091648,0.000024267643,0.00006243277,0.00021774281,0.000008217869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016598193,0.00027898166,0.00001303645,0.00010156936,0.00003860539,1.1019651e-7,0.0018268549,0.000012046001,0.008505768,0.9884322,0.00052595156,0.00024822188],"study_design_scores_gemma":[0.00020253425,0.000037967977,0.00022373165,0.00009906184,0.00007309022,0.0000016316407,0.0014558615,0.00011486196,0.03292374,0.96461624,0.00012973495,0.0001215585],"about_ca_topic_score_codex":0.0000011219665,"about_ca_topic_score_gemma":0.0000032048963,"teacher_disagreement_score":0.12442649,"about_ca_system_score_codex":0.000010538663,"about_ca_system_score_gemma":0.000026408004,"threshold_uncertainty_score":0.4480436},"labels":[],"label_agreement":null},{"id":"W2021735068","doi":"10.1016/j.dam.2008.03.022","title":"Variable space search for graph coloring","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":124,"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":"Mathematics; Complete coloring; Fractional coloring; Vertex (graph theory); Graph coloring; Combinatorics; Best-first search; Edge coloring; List coloring; Space (punctuation); Local search (optimization); Variable neighborhood search; Graph; Set (abstract data type); Search algorithm; Greedy coloring; Beam search; Discrete mathematics; Algorithm; Computer science; Metaheuristic; Graph power; Line graph","score_opus":0.17326229154974396,"score_gpt":0.37690683939622843,"score_spread":0.20364454784648447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021735068","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07014537,0.000049679238,0.87812865,0.00029674548,0.00018187103,0.00052280416,0.000034358796,0.00013787087,0.050502647],"genre_scores_gemma":[0.4043876,0.000008348636,0.59232736,0.000059575053,0.00010315726,0.000115422066,0.000008253447,0.000027419946,0.002962887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976411,0.000019932995,0.0005253265,0.0004051259,0.0009282799,0.00048024365],"domain_scores_gemma":[0.9966094,0.0021164801,0.00015300927,0.0007259352,0.00024231206,0.00015286311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023857502,0.0001646921,0.0003680015,0.00022680595,0.0006482891,0.0001404642,0.0006051722,0.00009284918,0.00012697931],"category_scores_gemma":[0.00094937644,0.0001268516,0.00014307101,0.0010010934,0.00015761235,0.00010510798,0.000116494426,0.00015350318,0.00039378888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018658498,0.00009304906,0.00010393354,0.000027786682,0.00003709651,0.0000015486114,0.0017438454,0.0031174659,0.003218621,0.9874534,0.003940298,0.00024428172],"study_design_scores_gemma":[0.0011439467,0.00007641261,0.00018455819,0.000036632417,0.000079943995,0.000039414794,0.004212244,0.04518653,0.014518467,0.9177732,0.01622245,0.00052620814],"about_ca_topic_score_codex":0.000008701495,"about_ca_topic_score_gemma":0.000001462221,"teacher_disagreement_score":0.33424222,"about_ca_system_score_codex":0.000025077172,"about_ca_system_score_gemma":0.00011848483,"threshold_uncertainty_score":0.5172858},"labels":[],"label_agreement":null},{"id":"W2023406382","doi":"10.1016/s0166-218x(00)00329-2","title":"Optimal embeddings of odd ladders into a hypercube","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Mathematics; Hypercube; Combinatorics; Discrete mathematics","score_opus":0.016393960639763266,"score_gpt":0.2266928977100116,"score_spread":0.21029893707024835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023406382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02762896,0.00006540325,0.90650415,0.00017233982,0.00019817184,0.00024043325,0.0000014653632,0.00014215763,0.06504694],"genre_scores_gemma":[0.81049526,0.00001034098,0.18895918,0.00008699468,0.000057363995,0.000027950848,0.0000010448533,0.000015375846,0.0003465226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880815,0.00001155388,0.00042384746,0.00024653954,0.00027591782,0.00023399272],"domain_scores_gemma":[0.99906164,0.00009156158,0.00018701844,0.0005342504,0.000053891377,0.000071613074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022145055,0.00015779634,0.0002976537,0.00007879927,0.00008348292,0.00008628861,0.0005886331,0.00007883319,0.000107023356],"category_scores_gemma":[0.000016994085,0.00013284317,0.00010019718,0.0002597329,0.0000559672,0.00014886915,0.0001564807,0.00010822795,0.0001250819],"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.0000036221313,0.00015535572,0.000006183445,0.0002648258,0.000074179494,0.000005405396,0.024763323,0.001610802,0.00664116,0.95383793,0.008545539,0.004091676],"study_design_scores_gemma":[0.00036610957,0.00007832299,0.0000038362446,0.00008916644,0.000018404035,0.00003543147,0.0021506096,0.97876245,0.0033229466,0.011929847,0.00292022,0.00032263057],"about_ca_topic_score_codex":0.000007795622,"about_ca_topic_score_gemma":0.0000019359525,"teacher_disagreement_score":0.9771517,"about_ca_system_score_codex":0.00002611783,"about_ca_system_score_gemma":0.000007476184,"threshold_uncertainty_score":0.5417187},"labels":[],"label_agreement":null},{"id":"W2023710022","doi":"10.1016/s0166-218x(01)00352-3","title":"Semidefinite programming for discrete optimization and matrix completion problems","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":35,"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":"Semidefinite programming; Mathematics; Lagrangian relaxation; Matrix completion; Relaxation (psychology); Mathematical optimization; Euclidean geometry; Matrix (chemical analysis); Euclidean distance matrix; Maximum cut; Optimization problem; Positive-definite matrix; Combinatorics; Eigenvalues and eigenvectors","score_opus":0.06678160909610262,"score_gpt":0.3380575190064754,"score_spread":0.27127590991037276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023710022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036239537,0.00012811298,0.99243796,0.000247757,0.000038109167,0.0029717204,0.00005948303,0.00034803015,0.0034064183],"genre_scores_gemma":[0.0077199806,0.00017950317,0.989552,0.0000331164,0.00007970706,0.00097401376,0.00013174942,0.00015325629,0.0011766541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763376,0.000026995427,0.00073857285,0.0004922881,0.00052571844,0.0005826533],"domain_scores_gemma":[0.9980171,0.0007199008,0.0003882677,0.00049511885,0.00019905693,0.00018055705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050154,0.00037005547,0.00052169274,0.00018518706,0.00035487497,0.00020655434,0.00024034466,0.00016283551,0.00016595864],"category_scores_gemma":[0.00040697952,0.0003383166,0.00009759882,0.0003898762,0.00016866077,0.00023081794,0.00014941968,0.0002150943,0.000024061712],"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.000055357636,0.00065181305,0.000022184766,0.0054512033,0.00023210426,0.0000042010242,0.007655764,0.104096204,0.0013678015,0.8631219,0.0016947977,0.015646648],"study_design_scores_gemma":[0.0012680787,0.000085800464,0.0000012571203,0.0001270225,0.00008981437,0.000017013486,0.0006415314,0.9032109,0.00023984855,0.091766454,0.0020837248,0.00046859332],"about_ca_topic_score_codex":9.1404723e-7,"about_ca_topic_score_gemma":0.0000018296626,"teacher_disagreement_score":0.79911464,"about_ca_system_score_codex":0.000076295175,"about_ca_system_score_gemma":0.000011979936,"threshold_uncertainty_score":0.9999069},"labels":[],"label_agreement":null},{"id":"W2024343945","doi":"10.1016/j.dam.2014.06.015","title":"A decision algorithm for reversible pairs of polygons","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Regular polygon; Combinatorics; Algorithm; Geometry","score_opus":0.013131921075011557,"score_gpt":0.25040557663786406,"score_spread":0.23727365556285251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024343945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001482627,0.000015441572,0.9947245,0.000076416945,0.00011649825,0.0002653975,0.000007422579,0.00005055874,0.0032611275],"genre_scores_gemma":[0.082671255,0.000002717078,0.91705763,0.00006593679,0.00004924854,0.000032345633,0.000013104181,0.0000075026105,0.0001002508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918294,0.000007102955,0.00026056377,0.0001892652,0.00022332493,0.00013680012],"domain_scores_gemma":[0.9989701,0.00043482205,0.00013437243,0.00033185398,0.00007846485,0.000050374427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037789205,0.00009397397,0.0001702014,0.000096546384,0.00007938138,0.000037275615,0.00033315012,0.000041879517,0.000005950091],"category_scores_gemma":[0.000061948485,0.00008388455,0.00007135544,0.0002723938,0.000020396632,0.000095573094,0.0000976385,0.00003544177,0.000013136456],"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.0000022465306,0.000057662477,8.3365114e-7,0.0000574688,0.00001260748,7.1714325e-8,0.0003697361,0.0008177034,0.0024260094,0.6989897,0.0010218306,0.29624414],"study_design_scores_gemma":[0.0003647754,0.000058529826,0.00002009505,0.000022954238,0.000011872155,0.000002138611,0.000047519075,0.7232168,0.0106522385,0.26289457,0.002595338,0.0001131925],"about_ca_topic_score_codex":7.734048e-7,"about_ca_topic_score_gemma":5.913331e-7,"teacher_disagreement_score":0.72239906,"about_ca_system_score_codex":0.000011696823,"about_ca_system_score_gemma":0.000028552651,"threshold_uncertainty_score":0.34207126},"labels":[],"label_agreement":null},{"id":"W2024633871","doi":"10.1016/j.dam.2009.02.013","title":"Broadcasting from multiple originators","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cooperative Communication and Network Coding","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":"Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Combinatorics; Mathematics; Graph; Broadcasting (networking); Wheel graph; Discrete mathematics; Computer science; Graph power; Computer network; Line graph","score_opus":0.028759445797102177,"score_gpt":0.26979773367387655,"score_spread":0.24103828787677437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024633871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02497398,0.00014243164,0.9313123,0.00047199367,0.00007646306,0.0002029608,0.0000021521262,0.00034669324,0.042471014],"genre_scores_gemma":[0.710622,0.000044493823,0.28889373,0.0003278297,0.000041493604,0.000009574122,0.000007001505,0.0000069452262,0.00004690992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.000016102744,0.0002584398,0.00024501196,0.00019225142,0.00021608957],"domain_scores_gemma":[0.998687,0.00024499887,0.00011318108,0.0008328217,0.000041012874,0.00008093461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015597063,0.00015125045,0.00018542557,0.000047565405,0.00019145335,0.00017049702,0.00093001773,0.0000435354,0.000026440637],"category_scores_gemma":[0.000057672827,0.00013446432,0.0000469511,0.00030218755,0.000026575219,0.00016679299,0.00019799198,0.00014885682,0.00010748041],"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.0000017104709,0.00006726376,0.00003141262,0.0000055263645,0.000011796432,0.000001912646,0.0023832459,0.000069522845,0.00957833,0.87162423,0.0004081012,0.11581696],"study_design_scores_gemma":[0.001158132,0.00006318724,0.0015770466,0.00014080021,0.000024268626,0.0000060370376,0.00040208828,0.74473053,0.017265638,0.21803014,0.015696073,0.0009060826],"about_ca_topic_score_codex":0.0000018583469,"about_ca_topic_score_gemma":0.0000034221741,"teacher_disagreement_score":0.744661,"about_ca_system_score_codex":0.000031354273,"about_ca_system_score_gemma":0.000021736063,"threshold_uncertainty_score":0.5483296},"labels":[],"label_agreement":null},{"id":"W2025257509","doi":"10.1016/s0166-218x(01)00197-4","title":"Antidirected hamiltonian paths between specified vertices of a tournament","year":2002,"lang":"en","type":"article","venue":"Discrete Applied 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":"Simon Fraser University","funders":"","keywords":"Tournament; Mathematics; Vertex (graph theory); Hamiltonian path; Combinatorics; Hamiltonian path problem; Hamiltonian (control theory); Neighbourhood (mathematics); Discrete mathematics; Graph; Mathematical optimization; Mathematical analysis","score_opus":0.04023299807498762,"score_gpt":0.27597158219442364,"score_spread":0.23573858411943602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025257509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2046846,0.00025466207,0.7379644,0.0003295528,0.00008730955,0.00085339835,0.000022257129,0.00032821644,0.05547564],"genre_scores_gemma":[0.79274756,0.000056189438,0.20690937,0.000024169585,0.000036629215,0.000030086398,0.0000025945208,0.00002406046,0.00016937472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99798733,0.000035770347,0.00053435715,0.00035772187,0.0006374262,0.00044737742],"domain_scores_gemma":[0.9980765,0.000326716,0.000347527,0.0010189093,0.00007673424,0.00015358567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035986817,0.00021750339,0.00042469203,0.00017439038,0.000110129746,0.00008838988,0.001199776,0.00007147701,0.00009188933],"category_scores_gemma":[0.00007638507,0.00018492149,0.00010084642,0.0006566057,0.000139308,0.00020358156,0.00036057993,0.00019696123,0.0000921113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001526225,0.00037463842,0.0003370179,0.0003900998,0.00017906417,0.000022153159,0.008928465,0.000056349316,0.035031248,0.9212366,0.00044773682,0.03298137],"study_design_scores_gemma":[0.0031833432,0.00049018156,0.0048583345,0.00048703843,0.00015961852,0.000026088175,0.001635342,0.10290399,0.252071,0.62916887,0.003161483,0.0018546875],"about_ca_topic_score_codex":0.0000016291094,"about_ca_topic_score_gemma":0.0000010874611,"teacher_disagreement_score":0.58806294,"about_ca_system_score_codex":0.00003734233,"about_ca_system_score_gemma":0.000014727625,"threshold_uncertainty_score":0.754088},"labels":[],"label_agreement":null},{"id":"W2025264288","doi":"10.1016/j.dam.2007.11.001","title":"Impact of memory size on graph exploration capability","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","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":"Université du Québec en Outaouais","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Automaton; Theoretical computer science; Graph; Finite-state machine; Algorithm","score_opus":0.039807105362277787,"score_gpt":0.2876512014303654,"score_spread":0.2478440960680876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025264288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12652798,0.0000061814476,0.84930885,0.0001439167,0.00003673717,0.0005035459,0.000006384989,0.00014023566,0.023326172],"genre_scores_gemma":[0.83177185,0.000023462491,0.16801222,0.00004072277,0.0000115597395,0.0000370661,0.0000048962515,0.000010678584,0.00008753883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886966,0.00002369087,0.00032439857,0.00022392395,0.0003691489,0.00018917187],"domain_scores_gemma":[0.99882406,0.00020664,0.00014861453,0.00066319824,0.00006894865,0.00008855902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002541827,0.00013633318,0.0002193731,0.00007192489,0.00009847966,0.000028436549,0.00040316654,0.000050906907,0.000046175333],"category_scores_gemma":[0.000076880664,0.00010465337,0.00011468679,0.00035629852,0.00009835714,0.0002264771,0.000084219704,0.00009819284,0.000041054813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005565655,0.0015301526,0.00023759283,0.00036378673,0.00014207547,0.000009123459,0.036933098,0.05423865,0.015094424,0.88380617,0.0020980756,0.005491204],"study_design_scores_gemma":[0.0028916178,0.0011551727,0.005417394,0.000115336,0.000031427502,0.00002983711,0.00091865606,0.3641902,0.031028083,0.5929572,0.00006367485,0.0012014109],"about_ca_topic_score_codex":0.0000071281743,"about_ca_topic_score_gemma":8.1343046e-7,"teacher_disagreement_score":0.7052439,"about_ca_system_score_codex":0.00003563574,"about_ca_system_score_gemma":0.00007150978,"threshold_uncertainty_score":0.42676407},"labels":[],"label_agreement":null},{"id":"W2025282997","doi":"10.1016/j.dam.2004.01.001","title":"Stable skew partition problem","year":2004,"lang":"en","type":"article","venue":"Discrete Applied 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":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Mathematics; Skew; Partition (number theory); Combinatorics; Computer science","score_opus":0.0208943018571142,"score_gpt":0.2776431011556697,"score_spread":0.2567487992985555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025282997","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037917367,0.000028543827,0.95239806,0.00027786772,0.00002974917,0.0004555925,0.0000034609304,0.0002907584,0.042724248],"genre_scores_gemma":[0.25154188,0.0000143630305,0.74796396,0.00009189121,0.00002533357,0.00015399228,0.0000065805884,0.00002351198,0.00017849561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849653,0.000011423954,0.00028058622,0.0003315336,0.00042967364,0.00045024848],"domain_scores_gemma":[0.9988817,0.00006953379,0.000105195104,0.00076601305,0.00005195904,0.00012560957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036534414,0.00016499398,0.00019345085,0.000089772526,0.00016145674,0.00015414722,0.0007650085,0.000054805205,0.000024120369],"category_scores_gemma":[0.000020928466,0.00014221098,0.000055248132,0.000481091,0.0000861204,0.0003479722,0.00027794353,0.00016548124,0.0003919518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028485247,0.00007693864,0.0000013308778,0.000080358834,0.000010030501,0.0000042858965,0.0009812338,0.00063052354,0.005984458,0.99091923,0.000057677782,0.0012510575],"study_design_scores_gemma":[0.00036736147,0.000033082906,0.0000071636596,0.000034675413,0.0000046462324,0.000007705479,0.000121847275,0.0013214608,0.022317661,0.97493285,0.0006670496,0.00018449362],"about_ca_topic_score_codex":0.0000023395537,"about_ca_topic_score_gemma":0.0000018527384,"teacher_disagreement_score":0.24775013,"about_ca_system_score_codex":0.00006690422,"about_ca_system_score_gemma":0.000062129664,"threshold_uncertainty_score":0.5799195},"labels":[],"label_agreement":null},{"id":"W2027444730","doi":"10.1016/j.dam.2009.06.001","title":"On the packing chromatic number of some lattices","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chromatic scale; Vertex (graph theory); Wheel graph; Lattice (music); Integer (computer science); Graph; Planar graph; Set packing; Discrete mathematics; Set (abstract data type); Graph power; Computer science; Physics","score_opus":0.024180041491205256,"score_gpt":0.30785306982656063,"score_spread":0.28367302833535535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027444730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26813054,0.00005164726,0.6410251,0.0017818367,0.000069486436,0.0009163918,0.000004946911,0.0002569183,0.087763086],"genre_scores_gemma":[0.9242371,0.0000074409863,0.07529633,0.0003323703,0.000021365717,0.00002312422,8.661289e-7,0.0000127986705,0.000068610876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985758,0.000031430733,0.00032229233,0.00022750226,0.00053153903,0.0003114258],"domain_scores_gemma":[0.9978141,0.0008605729,0.00020766591,0.0010229798,0.000036083344,0.000058578225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544418,0.00016441185,0.00024498955,0.00006005392,0.00012883382,0.000088043606,0.0012044664,0.000043856868,0.000041534568],"category_scores_gemma":[0.00010523712,0.0001018385,0.00007700973,0.00037815294,0.00011760325,0.00019915782,0.00015028538,0.0001793809,0.00016750945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003446877,0.00006723157,0.0000021380924,0.000050471528,0.000013701839,0.0000016886197,0.0012234895,0.00005303648,0.0035162312,0.9930441,0.000068584624,0.0019558733],"study_design_scores_gemma":[0.00013320244,0.00003867669,0.000044813696,0.000069563146,0.000006654338,0.000004432416,0.00019698247,0.009164165,0.0110370945,0.9791564,0.00002351967,0.0001245048],"about_ca_topic_score_codex":3.20999e-7,"about_ca_topic_score_gemma":1.4097172e-7,"teacher_disagreement_score":0.6561066,"about_ca_system_score_codex":0.000018221772,"about_ca_system_score_gemma":0.000019945355,"threshold_uncertainty_score":0.41528535},"labels":[],"label_agreement":null},{"id":"W2027505077","doi":"10.1016/j.dam.2014.10.001","title":"The Capacitated Orienteering Problem","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orienteering; Mathematics; Mathematical optimization; Upper and lower bounds; Vehicle routing problem; Generalization; Subroutine; Facility location problem; Combinatorics; Euclidean geometry; Approximation algorithm; Adjacency list; Node (physics); Routing (electronic design automation); Computer science","score_opus":0.009095838749054999,"score_gpt":0.22291782385226225,"score_spread":0.21382198510320724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027505077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008329506,0.000022067614,0.89136803,0.00004083757,0.000113610884,0.00024918892,0.0000018995992,0.00066358567,0.09921126],"genre_scores_gemma":[0.36880094,0.000020517866,0.6307278,0.000023725099,0.000068074136,0.00008845536,0.000007058758,0.000090668174,0.00017271891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910736,0.000015159034,0.00029838932,0.00011571172,0.00017781371,0.00028558882],"domain_scores_gemma":[0.99921817,0.00027487543,0.000053304026,0.00036416904,0.000029566827,0.000059939342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005812403,0.00015658743,0.00015717102,0.000029699613,0.00017424862,0.00009156624,0.00021867764,0.000055790966,0.000010506441],"category_scores_gemma":[0.0000746375,0.00011446959,0.000036279525,0.00019787143,0.00004990098,0.000038906805,0.000037487465,0.0001498922,0.000064452724],"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.000004054892,0.000019554978,0.00001543421,0.00039750212,0.000089245674,5.0358824e-7,0.0035795392,0.33563927,0.01686109,0.6248662,0.0010753229,0.017452285],"study_design_scores_gemma":[0.00022975093,0.000008673209,0.000013876514,0.000032458513,0.000022467037,0.0000035291957,0.00045284652,0.96210223,0.007017647,0.021061372,0.008802547,0.00025258958],"about_ca_topic_score_codex":5.1817204e-7,"about_ca_topic_score_gemma":0.0000011706113,"teacher_disagreement_score":0.626463,"about_ca_system_score_codex":0.000030978037,"about_ca_system_score_gemma":0.000004734993,"threshold_uncertainty_score":0.46679345},"labels":[],"label_agreement":null},{"id":"W2027590663","doi":"10.1016/s0166-218x(99)00232-2","title":"On the orthogonal designs of order 24","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimal Experimental Design Methods","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":"University of Lethbridge","funders":"","keywords":"Mathematics; Orthogonal array; Order (exchange); Construct (python library); Combinatorics; Mathematical optimization; Statistics; Computer science; Taguchi methods","score_opus":0.16773208217413743,"score_gpt":0.4070227853266725,"score_spread":0.2392907031525351,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027590663","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24398054,0.00004071292,0.1817645,0.0005534725,0.00011148311,0.00088956446,0.000031174535,0.00006453409,0.572564],"genre_scores_gemma":[0.5575139,0.000007827857,0.43754134,0.00070037413,0.000030184834,0.00008221354,0.0000030195708,0.00004074916,0.004080398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970185,0.00012726295,0.00077969924,0.00034216882,0.001470909,0.0002614488],"domain_scores_gemma":[0.9946956,0.0038923298,0.00024904154,0.0009877271,0.00009040179,0.00008488562],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0027154603,0.00020918077,0.00038401422,0.000085840235,0.00013323936,0.00010493991,0.0009651067,0.000077933255,0.0113398265],"category_scores_gemma":[0.00078124093,0.00011110279,0.00013504448,0.00074371666,0.00026210857,0.00006893662,0.00008306558,0.00016585946,0.0014909598],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008307853,0.00018619368,0.0000054662996,0.000010443532,0.000028008144,0.0000018971975,0.0018896164,0.0006171949,0.030144917,0.9486987,0.0045391265,0.013795371],"study_design_scores_gemma":[0.00036714802,0.0001450887,0.00006928545,0.00003109936,0.000026462254,0.0000066876396,0.0025755966,0.008236345,0.06860112,0.9173654,0.0022877608,0.00028805315],"about_ca_topic_score_codex":0.0000016921823,"about_ca_topic_score_gemma":6.9846294e-7,"teacher_disagreement_score":0.5684836,"about_ca_system_score_codex":0.000017180797,"about_ca_system_score_gemma":0.00004466994,"threshold_uncertainty_score":0.9992865},"labels":[],"label_agreement":null},{"id":"W2028254056","doi":"10.1016/j.dam.2014.08.018","title":"Reconstructing trees from digitally convex sets","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Convex hull; Convex set; Vertex (graph theory); Subderivative; Orthogonal convex hull; Convexity; Convex combination; Convex analysis; Regular polygon; Absolutely convex set; Convex polytope; Discrete mathematics; Graph; Convex body; Convex optimization; Geometry","score_opus":0.014076264276921234,"score_gpt":0.24145394871815765,"score_spread":0.2273776844412364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028254056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009353807,0.000013243573,0.8007136,0.000112798996,0.000058535195,0.00014120108,0.0000073239944,0.00095883314,0.18864065],"genre_scores_gemma":[0.45889893,0.0000012048222,0.5408374,0.00013979292,0.000025027966,0.000021315307,0.000008246756,0.00002013702,0.000047902508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985524,0.000009973173,0.00039798944,0.00042726696,0.00030464496,0.00030775822],"domain_scores_gemma":[0.9984542,0.00029025602,0.00024930463,0.00084679335,0.00005431436,0.00010509292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022644764,0.0002372654,0.00032439953,0.00007109788,0.00009517519,0.00095885206,0.0011563641,0.00007734189,0.000010031877],"category_scores_gemma":[0.00014070365,0.00021151137,0.00006599822,0.0001961097,0.00011709871,0.0007603771,0.00046415234,0.0001313465,0.0001202841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029957964,0.00008982258,0.00008573569,0.000108726155,0.000042519616,0.0000049671917,0.0018369252,0.000006726026,0.007175886,0.6946823,0.0007903566,0.29517305],"study_design_scores_gemma":[0.00019614058,0.000025173977,0.000027334805,0.00010552881,0.000012127163,0.000013133861,0.00013473876,0.07221486,0.03240216,0.89358854,0.0008816509,0.0003986351],"about_ca_topic_score_codex":0.0000033331182,"about_ca_topic_score_gemma":0.0000014392696,"teacher_disagreement_score":0.44954515,"about_ca_system_score_codex":0.000022582997,"about_ca_system_score_gemma":0.000030976214,"threshold_uncertainty_score":0.92462325},"labels":[],"label_agreement":null},{"id":"W2028416100","doi":"10.1016/j.dam.2007.03.028","title":"On the restricted homomorphism problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphism; Mathematics; Digraph; Combinatorics; Conjecture; Bipartite graph; Algebra homomorphism; Graph homomorphism; Discrete mathematics; Graph; Line graph; Graph power","score_opus":0.03203550194932333,"score_gpt":0.26153920296882865,"score_spread":0.22950370101950532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028416100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034725726,0.000027880888,0.8509843,0.001400238,0.000049236714,0.0010419547,0.000005582614,0.0004086673,0.11135643],"genre_scores_gemma":[0.7354765,0.000040008024,0.26268634,0.0004698804,0.00003878949,0.00030658868,0.0000045581405,0.000043339183,0.00093398447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983069,0.000038280894,0.00028070866,0.0003375002,0.000620458,0.00041615978],"domain_scores_gemma":[0.99760896,0.00079476245,0.0001268502,0.0013125709,0.00005665457,0.000100193785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029953083,0.0001961873,0.00019871775,0.00010820602,0.00043692446,0.00007492518,0.0015597395,0.000058462356,0.00003426665],"category_scores_gemma":[0.00009982833,0.00012152435,0.00007036575,0.000783405,0.00024512084,0.00011740565,0.00034247595,0.0003239859,0.0004073619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005780656,0.00006576855,0.0000013933908,0.000015278729,0.0000129415985,0.000017822615,0.0011700413,0.0000610492,0.0018782899,0.99435294,0.0019616392,0.00045706469],"study_design_scores_gemma":[0.00025406873,0.00006113423,0.000044503,0.000022058844,0.00000384959,0.000041329356,0.00010938058,0.0061218925,0.0044876765,0.9878407,0.0008017537,0.00021161982],"about_ca_topic_score_codex":0.0000010356039,"about_ca_topic_score_gemma":3.8603665e-7,"teacher_disagreement_score":0.70075077,"about_ca_system_score_codex":0.000031944044,"about_ca_system_score_gemma":0.000051374816,"threshold_uncertainty_score":0.5235949},"labels":[],"label_agreement":null},{"id":"W2028766875","doi":"10.1016/j.dam.2014.10.017","title":"On triangulating <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-outerplanar graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Outerplanar graph; Graph; Discrete mathematics; Geometry; Pathwidth; Line graph","score_opus":0.017658212282446108,"score_gpt":0.2632708256364772,"score_spread":0.2456126133540311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028766875","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7846969,0.000046831105,0.2038823,0.00016841228,0.00030439874,0.00019085422,0.000039633418,0.00033591912,0.010334798],"genre_scores_gemma":[0.90678644,0.000033291075,0.091773994,0.00052622234,0.00023648854,0.00030070284,0.00008317453,0.00016165734,0.0000980379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574655,0.000093061,0.0008839139,0.00093097007,0.001298869,0.0010466342],"domain_scores_gemma":[0.99548906,0.0013783162,0.0006687573,0.002042828,0.000066447676,0.00035457284],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014530105,0.0005222262,0.0004284267,0.00025038602,0.0006435473,0.00051215244,0.0017719644,0.00037458408,0.000027270185],"category_scores_gemma":[0.00047102603,0.0005429789,0.00043926263,0.00064273976,0.00034570447,0.0004727075,0.00090814946,0.00068602985,0.000991057],"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.0001179074,0.00014083431,0.0000021946869,0.00033976353,0.0001320555,0.00005183028,0.0015423653,0.0009849959,0.002162348,0.99158776,0.00020750462,0.0027304573],"study_design_scores_gemma":[0.0008356684,0.00028016578,0.000010873121,0.00024102014,0.000066523695,0.000059168593,0.00032474278,0.826742,0.0059214877,0.16455907,0.00047652997,0.00048277015],"about_ca_topic_score_codex":0.000017372406,"about_ca_topic_score_gemma":0.000016206639,"teacher_disagreement_score":0.8270287,"about_ca_system_score_codex":0.000023457305,"about_ca_system_score_gemma":0.00012035081,"threshold_uncertainty_score":0.9997868},"labels":[],"label_agreement":null},{"id":"W2028974574","doi":"10.1016/j.dam.2008.08.003","title":"Tree-width of graphs without a 3×3 grid minor","year":2008,"lang":"en","type":"article","venue":"Discrete Applied 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":"McGill University","funders":"","keywords":"Mathematics; Minor (academic); Combinatorics; Grid; Tree (set theory); Treewidth; Discrete mathematics; Graph; Pathwidth; Line graph; Geometry; Humanities","score_opus":0.02752094913056216,"score_gpt":0.27632646765058766,"score_spread":0.2488055185200255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028974574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10044424,0.000089285226,0.84913206,0.00008276942,0.00009021144,0.0006369031,0.000013250784,0.00024007338,0.049271204],"genre_scores_gemma":[0.53603953,0.000034305536,0.46349183,0.000042957312,0.000024077108,0.00006623193,0.000004198395,0.000027332128,0.00026954178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980825,0.000024828692,0.00045756513,0.00037694056,0.0006265873,0.00043156525],"domain_scores_gemma":[0.99817634,0.00021079702,0.00023261132,0.0011493356,0.000084762476,0.00014612875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031693737,0.00022954849,0.00042007313,0.00021657578,0.00014318318,0.000027828717,0.0012798826,0.00006976064,0.000022041388],"category_scores_gemma":[0.00005137142,0.00018924383,0.00013593581,0.00071835174,0.00035588723,0.00019858062,0.00035257544,0.00018072764,0.00006443046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018415209,0.00015725174,0.0002448159,0.00014627587,0.00004263526,0.000014628329,0.0028882814,0.000021725064,0.011514341,0.9812543,0.00034914384,0.003348201],"study_design_scores_gemma":[0.001085202,0.00015071484,0.00054253824,0.00006477679,0.000023306364,0.000095189134,0.00041962863,0.011277395,0.05530319,0.93003434,0.00044664997,0.00055706355],"about_ca_topic_score_codex":0.0000024355536,"about_ca_topic_score_gemma":0.0000024888209,"teacher_disagreement_score":0.4355953,"about_ca_system_score_codex":0.000014946043,"about_ca_system_score_gemma":0.000058447768,"threshold_uncertainty_score":0.771714},"labels":[],"label_agreement":null},{"id":"W2030135656","doi":"10.1016/j.dam.2005.02.001","title":"Affine equivalence in the AES round function","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":18,"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; Concordia University","funders":"","keywords":"Mathematics; Affine transformation; Monomial; Equivalence (formal languages); Bijection; Advanced Encryption Standard; Transformation (genetics); Affine coordinate system; Combinatorics; Affine space; Pure mathematics; Discrete mathematics; Algebra over a field; Cryptography; Algorithm","score_opus":0.02214921237079641,"score_gpt":0.2764806049613431,"score_spread":0.25433139259054666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030135656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07453992,0.000044515873,0.9054144,0.0016529211,0.000055254553,0.00037603924,0.0000028598702,0.00008033808,0.017833717],"genre_scores_gemma":[0.9253273,0.000020542644,0.07409426,0.00039631064,0.000056315825,0.000071691116,0.0000058113474,0.0000054811285,0.000022262326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990415,0.00001524729,0.00025879015,0.0001829727,0.0002893096,0.00021218388],"domain_scores_gemma":[0.99925834,0.00011915874,0.000077916935,0.000502537,0.000017162303,0.000024883358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004698342,0.000107674394,0.000106628744,0.00008116663,0.000119044584,0.00017525909,0.0005947637,0.000029025732,0.00003888497],"category_scores_gemma":[0.000008977026,0.00007449858,0.00004173875,0.00046149435,0.00003650819,0.00022696728,0.000103546525,0.00010676831,0.000041872954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019152837,0.00007972822,0.00001546859,0.000018077826,0.000004658107,6.4847706e-7,0.006022175,0.000044218552,0.00034962976,0.97587246,0.0003187366,0.01727229],"study_design_scores_gemma":[0.0020806454,0.00019429585,0.0039196103,0.000057778674,0.000058029127,0.000037119018,0.011943006,0.111596696,0.0010619296,0.82745975,0.040774815,0.000816323],"about_ca_topic_score_codex":0.000007086988,"about_ca_topic_score_gemma":0.00008524448,"teacher_disagreement_score":0.8507874,"about_ca_system_score_codex":0.00001894189,"about_ca_system_score_gemma":0.000014235193,"threshold_uncertainty_score":0.30379638},"labels":[],"label_agreement":null},{"id":"W2030626227","doi":"10.1016/j.dam.2010.12.002","title":"Messy broadcasting — Decentralized broadcast schemes with limited knowledge","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cooperative Communication and Network Coding","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; Concordia University","funders":"","keywords":"Broadcasting (networking); Mathematics; Atomic broadcast; Computer science; Computer network","score_opus":0.025570749307354167,"score_gpt":0.27676043545745355,"score_spread":0.2511896861500994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030626227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07627346,0.00030266427,0.84691447,0.00038367012,0.00017319882,0.0005708429,0.0000022889908,0.0006109912,0.07476839],"genre_scores_gemma":[0.6039893,0.00010720263,0.39550206,0.00010105424,0.000046467296,0.00005941701,0.000008578219,0.000027747728,0.00015816801],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860454,0.000027540571,0.00035738587,0.00036486506,0.00024731035,0.00039838656],"domain_scores_gemma":[0.99796325,0.00028333286,0.00018812316,0.0012442623,0.00015745583,0.00016359298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032645313,0.00026901482,0.00030387114,0.00009498306,0.00033480208,0.00031275552,0.0012726719,0.00008410026,0.00007417012],"category_scores_gemma":[0.00007832742,0.0002100267,0.000057975383,0.00065867405,0.00013254175,0.00023262203,0.000528103,0.0004310993,0.000108149936],"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.000009193308,0.00017156659,0.00006609958,0.00006048409,0.000046729787,0.0000028886975,0.003886798,0.0000144127125,0.04182309,0.86760503,0.00032073012,0.08599297],"study_design_scores_gemma":[0.0061793495,0.00021032868,0.0010303953,0.0006435833,0.00016388524,0.00020926743,0.0013421754,0.6642053,0.09304231,0.016872969,0.21289115,0.0032092866],"about_ca_topic_score_codex":7.950977e-7,"about_ca_topic_score_gemma":0.000027183562,"teacher_disagreement_score":0.8507321,"about_ca_system_score_codex":0.000021942402,"about_ca_system_score_gemma":0.000082569466,"threshold_uncertainty_score":0.856464},"labels":[],"label_agreement":null},{"id":"W2031053758","doi":"10.1016/j.dam.2010.06.015","title":"‘Strong’–‘weak’ precedence in scheduling: Extensions to series–parallel orders","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Series (stratigraphy); Computational complexity theory; Scheduling (production processes); Modular design; Combinatorics; Computer science; Algorithm; Mathematical optimization","score_opus":0.011927761941974542,"score_gpt":0.24181885120117422,"score_spread":0.22989108925919968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031053758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16669953,0.00002618642,0.7927395,0.0003567047,0.0006264369,0.0007969509,0.000014680441,0.0008289829,0.037911016],"genre_scores_gemma":[0.26921982,0.000010951354,0.7303469,0.000045340537,0.00005562117,0.00010655427,0.000015025077,0.000058262503,0.00014154274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883455,0.000004104702,0.00036140566,0.00023196972,0.00020483184,0.00036312325],"domain_scores_gemma":[0.99923164,0.00006275615,0.00003958518,0.00044637837,0.000042544354,0.00017708428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017317203,0.00023060059,0.00025894216,0.00013709709,0.000070616064,0.00006746338,0.00026454352,0.00013678058,0.00013542033],"category_scores_gemma":[0.0001146593,0.00022881395,0.000042013515,0.0003985688,0.000045071967,0.00009556426,0.000061086605,0.00040257027,0.00021998853],"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.000012265268,0.00006833124,0.000031450414,0.00013232592,0.000025637799,0.0000036529464,0.0023435112,0.8844478,0.014895717,0.09676703,0.0002732553,0.0009990095],"study_design_scores_gemma":[0.0007201805,0.000028292427,0.00013333654,0.00009973513,0.000029408111,0.00001959635,0.0031060702,0.9834488,0.0042705364,0.006163108,0.0012097902,0.0007711647],"about_ca_topic_score_codex":0.000003550067,"about_ca_topic_score_gemma":0.00006080738,"teacher_disagreement_score":0.10252028,"about_ca_system_score_codex":0.000024079813,"about_ca_system_score_gemma":0.000025530144,"threshold_uncertainty_score":0.9330762},"labels":[],"label_agreement":null},{"id":"W2031833962","doi":"10.1016/j.dam.2006.11.007","title":"Generalized hyper-bent functions over <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mtext>GF</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>p</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bent molecular geometry; Mathematics; Quadratic equation; Function (biology); Quadratic function; Combinatorics; Scroll; Algorithm; Discrete mathematics; Geometry; Theology","score_opus":0.019055043462171014,"score_gpt":0.24291491727254108,"score_spread":0.22385987381037006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031833962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9427976,0.0010501925,0.03777335,0.00043648682,0.0024169544,0.00034071977,0.00048232696,0.0007743311,0.013928062],"genre_scores_gemma":[0.9728166,0.0008047328,0.020645346,0.0016400744,0.00177267,0.0008799098,0.00051974505,0.0006973356,0.00022359555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9874096,0.0003134276,0.003003359,0.002753511,0.0032588867,0.0032612535],"domain_scores_gemma":[0.9902709,0.0018912635,0.002507863,0.003603735,0.00029176407,0.001434484],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.003473887,0.0017557486,0.0010295921,0.0007759467,0.002504649,0.0023248906,0.0035565167,0.0021905592,0.0014496566],"category_scores_gemma":[0.0005644651,0.0024069236,0.002433494,0.0021154948,0.0016211865,0.001341465,0.002803512,0.0021928456,0.003434023],"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.000837597,0.0009226155,0.000012616502,0.0012434836,0.0016091147,0.00033330673,0.0051836325,0.0016088042,0.005064972,0.96748775,0.008034564,0.0076615503],"study_design_scores_gemma":[0.005774013,0.002378282,0.00007772962,0.0022412115,0.0037127407,0.0011564735,0.008301986,0.58870316,0.13600242,0.23303755,0.013463026,0.0051513813],"about_ca_topic_score_codex":0.00042857477,"about_ca_topic_score_gemma":0.00037761364,"teacher_disagreement_score":0.7344502,"about_ca_system_score_codex":0.000080536345,"about_ca_system_score_gemma":0.0008434135,"threshold_uncertainty_score":0.9995188},"labels":[],"label_agreement":null},{"id":"W2033642621","doi":"10.1016/j.dam.2015.04.004","title":"The bipartite unconstrained 0–1 quadratic programming problem: Polynomially solvable cases","year":2015,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Generalization; Rank (graph theory); Discrete mathematics; Time complexity; Quadratic equation; Matrix (chemical analysis)","score_opus":0.043573282218933806,"score_gpt":0.2789088800179288,"score_spread":0.235335597798995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033642621","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023755038,0.0008266187,0.9588093,0.0014018093,0.0010589433,0.0036144918,0.000059886188,0.0011367952,0.030716628],"genre_scores_gemma":[0.061950106,0.00005710714,0.9359002,0.00011347567,0.00029823318,0.0010240134,0.000059961603,0.00007953187,0.0005173733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646306,0.000060226022,0.0009869606,0.0008210099,0.0008111775,0.0008575797],"domain_scores_gemma":[0.9959787,0.00063087384,0.0007218791,0.0022003585,0.00020232474,0.00026584283],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014410985,0.0006261371,0.00070570415,0.00013411503,0.00066169904,0.0019081433,0.0030074245,0.00026843866,0.000007978677],"category_scores_gemma":[0.00013632604,0.00044980904,0.00026336563,0.0004418481,0.000458686,0.00016869737,0.0029938943,0.00082872587,0.000072267016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012263063,0.0002110715,0.0000040836053,0.00086528953,0.00022104834,0.000043459768,0.004289083,0.00075869216,0.00012450817,0.9523149,0.0029847005,0.03817088],"study_design_scores_gemma":[0.000450783,0.000094148665,0.0000025520258,0.0003765465,0.00011434537,0.00007569405,0.0010659457,0.099831015,0.00039841517,0.8865246,0.010081436,0.0009845232],"about_ca_topic_score_codex":0.000051800413,"about_ca_topic_score_gemma":0.0001278068,"teacher_disagreement_score":0.09907232,"about_ca_system_score_codex":0.00011339274,"about_ca_system_score_gemma":0.0007333256,"threshold_uncertainty_score":0.9997954},"labels":[],"label_agreement":null},{"id":"W2034904496","doi":"10.1016/j.dam.2006.07.019","title":"Efficient algorithms for finding critical subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Algorithm; Combinatorics","score_opus":0.04092502635496184,"score_gpt":0.3561048761321663,"score_spread":0.3151798497772045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034904496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005479184,0.000041035564,0.9855627,0.00014705786,0.00014231888,0.0006392038,0.000009254691,0.00022070804,0.00775857],"genre_scores_gemma":[0.32434803,0.0000013743643,0.675373,0.000065167165,0.000051146373,0.00008055218,0.0000031649408,0.000026307633,0.000051239385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776524,0.000010888101,0.0004217073,0.0004582113,0.00052429945,0.00081963686],"domain_scores_gemma":[0.9970579,0.0017790364,0.0000864793,0.0007507794,0.00010952477,0.00021628142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016826321,0.00021254798,0.00026424343,0.0002359976,0.0002838651,0.00013708066,0.00096857216,0.00008966709,0.000009806693],"category_scores_gemma":[0.0002888847,0.00018659893,0.0001336485,0.0005974653,0.00019737688,0.000075119264,0.00028782134,0.00019142988,0.00004852197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011681191,0.000090350855,0.0000024579208,0.000112297304,0.000012238351,0.0000063500133,0.00088266423,0.00014199509,0.004275533,0.98792917,0.00004746634,0.006487829],"study_design_scores_gemma":[0.0005143178,0.00007688793,0.00002884822,0.000037983824,0.00001428384,0.00001646975,0.00065547647,0.19130057,0.021866078,0.78466094,0.00043844202,0.00038973123],"about_ca_topic_score_codex":3.8303918e-7,"about_ca_topic_score_gemma":7.108424e-7,"teacher_disagreement_score":0.31886885,"about_ca_system_score_codex":0.000046587957,"about_ca_system_score_gemma":0.00002971788,"threshold_uncertainty_score":0.76092833},"labels":[],"label_agreement":null},{"id":"W2035974993","doi":"10.1016/j.dam.2004.02.014","title":"Multi-terminal multipath flows: synthesis","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics; Path (computing); Flow network; Disjoint sets; Shortest path problem; Undirected graph; Flow (mathematics); Enhanced Data Rates for GSM Evolution; Polynomial; Discrete mathematics; Maximum flow problem; Multi-commodity flow problem; Topology (electrical circuits); Graph; Computer science; Geometry; Telecommunications","score_opus":0.02898757932986056,"score_gpt":0.2962409616097549,"score_spread":0.2672533822798943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035974993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027153684,0.000032676064,0.96855325,0.00012583531,0.000063082785,0.0004682724,0.000009038281,0.00034564818,0.003248537],"genre_scores_gemma":[0.34931037,0.000009626696,0.6503451,0.000048563248,0.000026093536,0.00017484098,0.0000017219566,0.000029149156,0.000054533037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99793947,0.000021805135,0.0003918994,0.00052178174,0.000531438,0.0005935982],"domain_scores_gemma":[0.99807113,0.00029648622,0.00013770125,0.0012315525,0.000059845184,0.00020327195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044505473,0.00028834312,0.0003401297,0.00016940241,0.0002100568,0.00016379717,0.001541233,0.00009402078,0.000021121828],"category_scores_gemma":[0.00016030316,0.00024518187,0.0001239051,0.00045533935,0.00013451745,0.0003097646,0.00049267965,0.0002461792,0.0004535882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014799975,0.00042639507,0.000008965874,0.00020239086,0.000049118895,0.000090021196,0.003798039,0.0015751364,0.036257945,0.94387126,0.000016268456,0.013689683],"study_design_scores_gemma":[0.0025856488,0.000107693864,0.00020392978,0.0002927608,0.000055044027,0.00016443613,0.0014428203,0.16864832,0.1227148,0.70183736,0.0004729466,0.0014742537],"about_ca_topic_score_codex":0.0000035001024,"about_ca_topic_score_gemma":0.0000055343185,"teacher_disagreement_score":0.3221567,"about_ca_system_score_codex":0.00006541111,"about_ca_system_score_gemma":0.00006867815,"threshold_uncertainty_score":0.9998226},"labels":[],"label_agreement":null},{"id":"W2036199750","doi":"10.1016/j.dam.2006.08.006","title":"Partially ordered knapsack and applications to scheduling","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":48,"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":"Knapsack problem; Mathematics; Combinatorics; Continuous knapsack problem; Generalization; Scheduling (production processes); Bounded function; Discrete mathematics; Polynomial-time approximation scheme; Partially ordered set; Time complexity; Class (philosophy); Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.00967514078976895,"score_gpt":0.22611988469736596,"score_spread":0.21644474390759702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036199750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0110327415,0.00009292226,0.9698119,0.000059744158,0.000034824236,0.00041660035,0.000009866557,0.00047298925,0.018068422],"genre_scores_gemma":[0.22664574,0.000015308462,0.77270776,0.000054822012,0.00015146707,0.0002429905,0.000034227727,0.000055082164,0.00009261013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922943,0.0000022556644,0.00026571515,0.00016414937,0.0001286337,0.00020983604],"domain_scores_gemma":[0.9995697,0.00004266729,0.000030311905,0.00023622626,0.000028693483,0.00009239763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008428919,0.00015560215,0.00017014089,0.000065987,0.0000841348,0.00008135401,0.00010407925,0.000065918524,0.000026744372],"category_scores_gemma":[0.000008394705,0.00015648897,0.000023855835,0.00023246212,0.000024670093,0.000035497513,0.000031256088,0.00008424386,0.00011790738],"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.0000031039028,0.000048732294,0.000018960976,0.00022130444,0.000033884982,8.5625226e-7,0.00048928946,0.83739305,0.005275818,0.15094765,0.0002610798,0.005306298],"study_design_scores_gemma":[0.00057552464,0.000014155666,0.00007877741,0.000046429108,0.000065452965,0.000007554202,0.0007360036,0.9636957,0.008120629,0.021491371,0.004519663,0.00064875686],"about_ca_topic_score_codex":0.0000021174,"about_ca_topic_score_gemma":0.0000057088314,"teacher_disagreement_score":0.215613,"about_ca_system_score_codex":0.000017178221,"about_ca_system_score_gemma":0.000008153268,"threshold_uncertainty_score":0.6381435},"labels":[],"label_agreement":null},{"id":"W2036433802","doi":"10.1016/j.dam.2009.03.003","title":"Counting feasible solutions of the traveling salesman problem with pickups and deliveries is <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>#</mml:mi><mml:mi>P</mml:mi></mml:math>-complete","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","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; HEC Montréal","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Algorithm; Mathematical optimization; Discrete mathematics","score_opus":0.02324561272859016,"score_gpt":0.2381692861386059,"score_spread":0.21492367341001575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036433802","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7568701,0.00016506166,0.22373663,0.0009277242,0.0001528596,0.00023571582,0.000096552234,0.00020916772,0.017606212],"genre_scores_gemma":[0.88739586,0.00013015521,0.11157691,0.0005164802,0.00008798955,0.00011065537,0.000054267337,0.00007456085,0.00005314976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971894,0.000043524073,0.0006823741,0.00054242363,0.0008578045,0.0006844924],"domain_scores_gemma":[0.99791825,0.00025080098,0.0006211028,0.00091423705,0.00010631771,0.00018930782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006876081,0.0003153536,0.00023667676,0.00009729892,0.0008930325,0.000515126,0.0008899532,0.00024158605,0.00007008337],"category_scores_gemma":[0.00008510734,0.0003284273,0.000208978,0.00048441612,0.00040985807,0.00048210804,0.00056630245,0.00039493383,0.00006588553],"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.000041249186,0.000099592675,0.000004977567,0.00042322683,0.00011341548,0.0000111171485,0.00495048,0.0040758043,0.001675299,0.9875673,0.0004953492,0.00054219697],"study_design_scores_gemma":[0.0007529827,0.00026342776,0.00004270603,0.00051360845,0.00015209464,0.000109225875,0.0012596311,0.9698516,0.013621861,0.012690247,0.0003115085,0.0004310687],"about_ca_topic_score_codex":0.00006396583,"about_ca_topic_score_gemma":0.00008518768,"teacher_disagreement_score":0.97487706,"about_ca_system_score_codex":0.00001191058,"about_ca_system_score_gemma":0.00028261717,"threshold_uncertainty_score":0.9999168},"labels":[],"label_agreement":null},{"id":"W2036589342","doi":"10.1016/s0166-218x(03)00383-4","title":"Whist tournaments with the three person property","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Tournament; Mathematics; Property (philosophy); Mathematical economics; Combinatorics; Spectrum (functional analysis); Existential quantification; Discrete mathematics; Epistemology","score_opus":0.012532181091227152,"score_gpt":0.18093137730837014,"score_spread":0.168399196217143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036589342","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22068575,0.0002197181,0.08438927,0.00010368037,0.00017830604,0.0011800234,0.000008717187,0.00042513176,0.6928094],"genre_scores_gemma":[0.99624383,0.0000038482535,0.0029625546,0.000030795814,0.000025954636,0.0001238632,0.0000021984454,0.000051748717,0.0005551723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930537,0.000010132272,0.0001405178,0.00011427707,0.00019636091,0.0002333649],"domain_scores_gemma":[0.99949557,0.00003207943,0.000043034284,0.00036295876,0.0000137771085,0.000052555388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021360483,0.00018355912,0.00017840521,0.000023760327,0.00013138325,0.0000618657,0.00018404184,0.000046133413,0.00006481064],"category_scores_gemma":[0.000004744381,0.0000834369,0.000043088898,0.00013418235,0.000059631057,0.000043226388,0.000007884856,0.0001437879,0.00008323367],"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.000028857281,0.00011474599,0.00013079646,0.0010407346,0.00046891323,0.000013578342,0.01499193,0.003278372,0.015800385,0.9547486,0.0073801954,0.0020029445],"study_design_scores_gemma":[0.011681759,0.000880145,0.0010118182,0.0021001252,0.0018807872,0.00090711087,0.20268092,0.09763632,0.103464596,0.25453597,0.3140987,0.009121792],"about_ca_topic_score_codex":0.0000012282088,"about_ca_topic_score_gemma":0.0000127030735,"teacher_disagreement_score":0.7755581,"about_ca_system_score_codex":0.000025060033,"about_ca_system_score_gemma":0.000007545836,"threshold_uncertainty_score":0.34024578},"labels":[],"label_agreement":null},{"id":"W2036695067","doi":"10.1016/j.dam.2006.05.001","title":"The proof theoretic strength of the Steinitz exchange theorem","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computability, Logic, AI Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Mathematical proof; Discrete mathematics; Compactness theorem; Analytic proof; Combinatorics; Algebra over a field; Fundamental theorem; Pure mathematics; Fixed-point theorem","score_opus":0.008982201345938648,"score_gpt":0.21642624557041187,"score_spread":0.2074440442244732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036695067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03600626,0.00042534235,0.84764946,0.0014539849,0.00050696306,0.0023195,0.000023827208,0.00030630283,0.11130839],"genre_scores_gemma":[0.9466861,0.000010626812,0.05271063,0.000054865857,0.00011302683,0.00011800563,0.0000024670028,0.000029725286,0.00027457793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977359,0.000094799434,0.0006147709,0.0003931205,0.00070579955,0.0004555755],"domain_scores_gemma":[0.9963442,0.0009792288,0.00041411238,0.0021064132,0.00010318829,0.000052858486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010289551,0.00028722154,0.00032521575,0.000041990916,0.00034729912,0.00018915068,0.0026963528,0.0000842914,0.00001713643],"category_scores_gemma":[0.00008535737,0.00014493955,0.0001814872,0.0005506915,0.0005829498,0.00008754473,0.0011189699,0.00022700161,0.00001677529],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031205188,0.00012808737,0.000013449667,0.000110687964,0.00001568186,6.5791727e-7,0.0013984782,0.000100970574,0.0002932854,0.98696,0.00019153829,0.01078403],"study_design_scores_gemma":[0.00028139222,0.00004237754,0.00024513924,0.00003405057,0.000026614814,0.00000764637,0.0004091265,0.049141724,0.011444102,0.9373123,0.0008256417,0.00022985847],"about_ca_topic_score_codex":0.000009257558,"about_ca_topic_score_gemma":0.00001998695,"teacher_disagreement_score":0.9106798,"about_ca_system_score_codex":0.000046638543,"about_ca_system_score_gemma":0.00006750301,"threshold_uncertainty_score":0.59104633},"labels":[],"label_agreement":null},{"id":"W2037298352","doi":"10.1016/s0166-218x(00)00198-0","title":"Resolvability in graphs and the metric dimension of a graph","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":982,"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 Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Graph; Connectivity; Dimension (graph theory); Discrete mathematics; Line graph; Pathwidth","score_opus":0.009040591071365865,"score_gpt":0.21914114404383414,"score_spread":0.21010055297246827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037298352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9804764,0.0005442077,0.009080304,0.00040598545,0.000032581254,0.0005957548,0.0000020027735,0.00009731455,0.008765465],"genre_scores_gemma":[0.94498575,0.00011616158,0.054751713,0.000087991924,7.3936434e-7,0.000029460794,8.3007615e-7,0.0000069455464,0.00002040643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987776,0.000042869124,0.00043949462,0.0002697421,0.00027853865,0.00019172393],"domain_scores_gemma":[0.9987454,0.0003722379,0.00011314014,0.0006914442,0.000028919065,0.000048894242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010867445,0.00013231041,0.00030443352,0.00018193021,0.000073552605,0.000038290298,0.00038326712,0.000053140982,0.000009761005],"category_scores_gemma":[0.0000432623,0.00007995146,0.000068036585,0.0011617288,0.0002890164,0.00007196876,0.00012308128,0.00012279837,0.000006553396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022215712,0.00007817009,0.000069330534,0.00006373533,0.000010115565,5.684969e-7,0.0019996017,0.0001460566,0.0005937528,0.99203455,0.000031906453,0.004949997],"study_design_scores_gemma":[0.0011230514,0.000022187662,0.00031797367,0.000035793906,0.000013713234,0.0000030669928,0.00013969508,0.021151692,0.0011399376,0.9759241,0.000018357254,0.000110447],"about_ca_topic_score_codex":0.000034029916,"about_ca_topic_score_gemma":0.0000046138516,"teacher_disagreement_score":0.045671407,"about_ca_system_score_codex":0.0000051044794,"about_ca_system_score_gemma":0.000012061028,"threshold_uncertainty_score":0.3260326},"labels":[],"label_agreement":null},{"id":"W2038047385","doi":"10.1016/j.dam.2012.04.002","title":"On graphs which can or cannot induce Chinese Postman games with a non-empty core","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Traverse; Characterization (materials science); Core (optical fiber); Enhanced Data Rates for GSM Evolution; Graph; Undirected graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.029788432610125332,"score_gpt":0.24329480211644156,"score_spread":0.2135063695063162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038047385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9232239,0.000052117706,0.0014278085,0.00009290477,0.00018600297,0.00054490624,0.00014568453,0.00008470219,0.07424194],"genre_scores_gemma":[0.9965677,0.000006452453,0.0019584836,0.00019640231,0.0001197554,0.000114371236,0.000036320227,0.00007839605,0.0009220691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984046,0.000008086221,0.00059555203,0.00034847614,0.00009308167,0.00055019744],"domain_scores_gemma":[0.9984327,0.00016593558,0.00051733985,0.0006586894,0.000031024323,0.00019429081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071977725,0.0003520241,0.00066299137,0.0001918169,0.00015491266,0.00007143294,0.00032245583,0.00014311247,0.00016894282],"category_scores_gemma":[0.000104512226,0.00025551106,0.00007490711,0.0005204711,0.00007162262,0.00010389684,0.000060315993,0.0002649689,0.0003799589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087068714,0.0002084638,0.008048648,0.00025719704,0.000100013574,0.0000021274086,0.008524738,0.000030807027,0.00011865309,0.9823299,0.00023384688,0.000058539885],"study_design_scores_gemma":[0.005003251,0.0010407246,0.040310476,0.00069072563,0.00015119476,0.00014251041,0.007764455,0.0030154497,0.0012038369,0.9351222,0.0021475912,0.0034075726],"about_ca_topic_score_codex":0.00008201762,"about_ca_topic_score_gemma":0.00012588668,"teacher_disagreement_score":0.07334381,"about_ca_system_score_codex":0.00005835149,"about_ca_system_score_gemma":0.000026195998,"threshold_uncertainty_score":0.9999897},"labels":[],"label_agreement":null},{"id":"W2038298858","doi":"10.1016/j.dam.2011.11.034","title":"Vertex covers and eternal dominating sets","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Neighbourhood (mathematics); Dominating set; Vertex cover; Domination analysis; Guard (computer science); Graph; Discrete mathematics; Computer science","score_opus":0.032096494888659774,"score_gpt":0.2774815119098863,"score_spread":0.2453850170212265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038298858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08034475,0.000032790773,0.8541403,0.000029251394,0.000056713547,0.0002861184,0.0000035549722,0.00014056079,0.06496596],"genre_scores_gemma":[0.61065423,0.000009464214,0.38917953,0.000054778302,0.0000060978145,0.000023654102,7.8526864e-7,0.000014442154,0.000057026937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988554,0.000016208498,0.00021682496,0.00029280252,0.0002948231,0.00032392054],"domain_scores_gemma":[0.9990496,0.00018692458,0.000103399245,0.0005056229,0.000030334786,0.00012411419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003643213,0.000151935,0.00018422765,0.00008487816,0.00012406216,0.00008392866,0.0006438071,0.0000478544,0.000025085616],"category_scores_gemma":[0.000048024533,0.00013030457,0.00003743082,0.00019000318,0.00013054839,0.00024405764,0.00044590724,0.00015748916,0.000055601613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008947236,0.00003136798,0.000038352802,0.000055023498,0.000018331473,0.000011410921,0.005134344,0.0000026419514,0.0038395459,0.97840697,0.000030467118,0.012422583],"study_design_scores_gemma":[0.000541579,0.000055927714,0.00027662993,0.000041047206,0.000010039659,0.0000344899,0.0006647857,0.026566654,0.01383937,0.9576068,0.00007517037,0.00028752134],"about_ca_topic_score_codex":0.0000024445017,"about_ca_topic_score_gemma":9.174446e-7,"teacher_disagreement_score":0.5303095,"about_ca_system_score_codex":0.00001814121,"about_ca_system_score_gemma":0.000017340943,"threshold_uncertainty_score":0.53136665},"labels":[],"label_agreement":null},{"id":"W2038655901","doi":"10.1016/j.dam.2011.10.027","title":"Strong and weak edges of a graph and linkages with the vertex cover problem","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Edge cover; Vertex cover; Mathematics; Combinatorics; Vertex (graph theory); Neighbourhood (mathematics); Feedback vertex set; Time complexity; Graph; Discrete mathematics","score_opus":0.023108284779005294,"score_gpt":0.22237611605044405,"score_spread":0.19926783127143877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038655901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076229153,0.00008547292,0.9501754,0.0002414863,0.000009120017,0.0004997577,0.0000029833316,0.000052177504,0.041310664],"genre_scores_gemma":[0.64278203,0.0000839748,0.35685113,0.000053896398,0.0000044710155,0.0000413832,0.0000011900702,0.0000122734755,0.00016964918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999363,0.000011864206,0.00014400217,0.00016439658,0.00017205413,0.00014469116],"domain_scores_gemma":[0.99944574,0.00007649216,0.000098025695,0.00028664453,0.000038898543,0.000054176886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019727834,0.00010461442,0.0001453751,0.000041155417,0.00008189749,0.00006762815,0.0002648385,0.000031364678,0.000009899071],"category_scores_gemma":[0.0000047073154,0.000059030895,0.000014439174,0.00014583448,0.00018660953,0.000121397636,0.00017147974,0.000080554215,0.0000028363436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048291186,0.000049703645,0.00009937735,0.00019808259,0.000039482675,6.055616e-7,0.011401022,0.00004791418,0.00036872743,0.984564,0.00021443305,0.003011789],"study_design_scores_gemma":[0.005814305,0.0015550302,0.0065558995,0.0007581681,0.0002894633,0.000104374005,0.016440222,0.26688653,0.026297925,0.67107725,0.0022273592,0.001993494],"about_ca_topic_score_codex":0.0000032978094,"about_ca_topic_score_gemma":0.000002235299,"teacher_disagreement_score":0.63515913,"about_ca_system_score_codex":0.0000025712352,"about_ca_system_score_gemma":0.000018441719,"threshold_uncertainty_score":0.240721},"labels":[],"label_agreement":null},{"id":"W2039275622","doi":"10.1016/j.dam.2010.08.011","title":"Enumeration of polyominoes inscribed in a rectangle","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polyomino; Inscribed figure; Enumeration; Mathematics; Rectangle; Combinatorics; Amortized analysis; Discrete mathematics; Data structure; Geometry; Computer science; Regular polygon","score_opus":0.019644921668255436,"score_gpt":0.29851666490602996,"score_spread":0.2788717432377745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039275622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.936401,0.000016534486,0.027273,0.00007782378,0.00042655994,0.0011665508,0.000018391593,0.00019339345,0.034426726],"genre_scores_gemma":[0.7124411,0.00000444826,0.287204,0.000013925104,0.00006753369,0.00011069515,0.0000068439986,0.000067082605,0.000084370746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977675,0.000021769742,0.0010550063,0.00030443,0.00046865005,0.00038264052],"domain_scores_gemma":[0.9975253,0.0008378368,0.0005596402,0.0008867886,0.000097008306,0.0000934329],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060421485,0.00032319137,0.0007290539,0.00022443062,0.00005898784,0.000030872456,0.00042333585,0.00022994855,0.000096681244],"category_scores_gemma":[0.0010594247,0.0002946631,0.00011110571,0.00046998792,0.00013452207,0.00014575008,0.0001320051,0.00046722626,0.000027624987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019714023,0.00035873384,0.000032064407,0.00039486514,0.000019139436,0.000002383318,0.0028266483,0.0000030040437,0.17646885,0.81925887,0.0000827327,0.0005329922],"study_design_scores_gemma":[0.0008342257,0.00003965662,0.000033495402,0.00008929486,0.000040748506,0.000008090238,0.00083325803,0.000755507,0.09614931,0.9008077,0.00011240675,0.00029634236],"about_ca_topic_score_codex":0.0000066432194,"about_ca_topic_score_gemma":0.00007597359,"teacher_disagreement_score":0.259931,"about_ca_system_score_codex":0.000044925207,"about_ca_system_score_gemma":0.00006183505,"threshold_uncertainty_score":0.9999505},"labels":[],"label_agreement":null},{"id":"W2042811967","doi":"10.1016/j.dam.2006.10.015","title":"Generalization of matching extensions in graphs (II)","year":2006,"lang":"en","type":"article","venue":"Discrete Applied 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":"Thompson Rivers University","funders":"","keywords":"Combinatorics; Mathematics; Generalization; Matching (statistics); Discrete mathematics; Graph","score_opus":0.015407767139256798,"score_gpt":0.27308289447956163,"score_spread":0.25767512734030484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042811967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18472718,0.00003876604,0.8076205,0.000069613954,0.000025122747,0.0002471654,0.0000026509467,0.00007026729,0.007198687],"genre_scores_gemma":[0.6810975,0.000008013001,0.3187595,0.000019471256,0.000008063585,0.00002671572,0.0000066212056,0.000012986328,0.000061124854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873906,0.000020407164,0.00040987844,0.00023883031,0.00032871653,0.0002630977],"domain_scores_gemma":[0.9990895,0.000108289605,0.00014627105,0.0005700588,0.000048857553,0.00003701575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034603302,0.00012684897,0.00021914652,0.00025288304,0.00009610611,0.00003056975,0.0005377669,0.0000496399,0.0000070553674],"category_scores_gemma":[0.000017397824,0.00011346601,0.00005242227,0.0007803847,0.00007220592,0.00016771036,0.00028754896,0.000108593136,0.000007454712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020958598,0.00008029929,0.000030793355,0.000045941866,0.0000030642016,0.000002322978,0.00071128906,0.0033252104,0.045756504,0.949565,0.000038986305,0.00043852534],"study_design_scores_gemma":[0.0002134355,0.000013520843,0.0002626508,0.000033537184,0.0000028884904,0.000003110632,0.000122018086,0.022422053,0.012418413,0.96435255,0.000030345109,0.00012546174],"about_ca_topic_score_codex":0.000019868636,"about_ca_topic_score_gemma":0.000021635436,"teacher_disagreement_score":0.49637032,"about_ca_system_score_codex":0.000019089099,"about_ca_system_score_gemma":0.0000199876,"threshold_uncertainty_score":0.46270096},"labels":[],"label_agreement":null},{"id":"W2043979455","doi":"10.1016/j.dam.2006.04.021","title":"Generalized metarationalities in the graph model for conflict resolution","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University; Toronto Metropolitan University","funders":"Ministry of Education, Culture, Sports, Science and Technology; Social Sciences and Humanities Research Council of Canada; Natural Sciences and Engineering Research Council of Canada; Kagawa University","keywords":"Stability (learning theory); Mathematics; Graph; Tree (set theory); Set (abstract data type); Resolution (logic); Conflict resolution; Mathematical optimization; Mathematical economics; Computer science; Combinatorics; Artificial intelligence; Machine learning","score_opus":0.16254883111292573,"score_gpt":0.380060997582261,"score_spread":0.21751216646933524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043979455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060177956,0.000051981864,0.9092589,0.001054214,0.000018435017,0.0009255871,0.00009265317,0.00003385467,0.028386392],"genre_scores_gemma":[0.8898191,0.0000037363448,0.106413536,0.00034458516,0.00007151027,0.0009434574,0.000079488214,0.000013406505,0.002311207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982385,0.000049228867,0.0006518296,0.0002515968,0.00060563063,0.00020320204],"domain_scores_gemma":[0.99776083,0.001339051,0.00021299103,0.0005750021,0.000089667,0.000022451484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027038658,0.00013182183,0.00023335662,0.00011665818,0.00021433587,0.00017138122,0.00059861003,0.00005703279,0.000030589144],"category_scores_gemma":[0.00015270147,0.00007948536,0.00011958474,0.00039771703,0.00013431058,0.00009206404,0.000033701777,0.000073647585,0.00004294188],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012809274,0.00005173387,0.0000023654236,0.0000066587645,0.0000040883565,6.942965e-8,0.0016726026,0.024794076,0.0013496907,0.96767306,0.0043818206,0.000051050094],"study_design_scores_gemma":[0.00024303794,0.0000041552057,0.00003828025,0.0000022867011,0.00001526023,9.892666e-7,0.0013145405,0.25517505,0.00029705424,0.74004304,0.0027852487,0.00008104518],"about_ca_topic_score_codex":0.000009911683,"about_ca_topic_score_gemma":0.0000500033,"teacher_disagreement_score":0.8296411,"about_ca_system_score_codex":0.000012909239,"about_ca_system_score_gemma":0.00002697017,"threshold_uncertainty_score":0.3241319},"labels":[],"label_agreement":null},{"id":"W2044564598","doi":"10.1016/s0166-218x(01)00211-6","title":"On the binary solitaire cone","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Inoue Foundation for Science","keywords":"Solitaire Cryptographic Algorithm; Mathematics; Cone (formal languages); Combinatorics; Binary number; Arithmetic; Algorithm","score_opus":0.035849167485007674,"score_gpt":0.2792160222905045,"score_spread":0.24336685480549686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044564598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07822009,0.000034522833,0.7679242,0.0055539967,0.00017427634,0.00051014643,0.0000020537707,0.000344628,0.14723612],"genre_scores_gemma":[0.9684349,0.000017713764,0.029639933,0.0012167788,0.00005976894,0.000078074656,0.0000013974186,0.000020542815,0.0005309295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875015,0.000016727703,0.00029090032,0.00027025546,0.00035201357,0.00031995034],"domain_scores_gemma":[0.99819666,0.00057212106,0.00011323156,0.0010144884,0.00003546735,0.00006805627],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031543453,0.00017518229,0.00017254334,0.000048113583,0.00022400623,0.00014951725,0.0011915275,0.00005777153,0.00010431942],"category_scores_gemma":[0.00008402748,0.00011060167,0.00006698825,0.00030996214,0.00014823447,0.00011085099,0.000260056,0.00016938928,0.0012551504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032900105,0.00006110038,0.0000029892583,0.000008928804,0.000010480948,0.000009720805,0.0016741182,0.00012260128,0.0011330235,0.9908308,0.002077317,0.0040656533],"study_design_scores_gemma":[0.000052581065,0.0000585257,0.000017901983,0.000036452606,0.000008172236,0.000014332461,0.0013576588,0.07888597,0.009476645,0.9077473,0.002100155,0.00024429627],"about_ca_topic_score_codex":0.0000032812882,"about_ca_topic_score_gemma":0.0000020571028,"teacher_disagreement_score":0.89021474,"about_ca_system_score_codex":0.000028406703,"about_ca_system_score_gemma":0.000025488513,"threshold_uncertainty_score":0.9995225},"labels":[],"label_agreement":null},{"id":"W2046372295","doi":"10.1016/s0166-218x(01)00229-3","title":"A note on reconfiguring tree linkages: trees can lock","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Waterloo","funders":"McGill University","keywords":"Mathematics; Regular polygon; Tree (set theory); Polygon (computer graphics); Combinatorics; Equivalence (formal languages); Plane (geometry); Convex polygon; Line (geometry); Discrete mathematics; Geometry; Computer science; Telecommunications; Frame (networking)","score_opus":0.013618757394759295,"score_gpt":0.2017129523917255,"score_spread":0.1880941949969662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046372295","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28220153,0.00030095468,0.1042272,0.00046950128,0.00035355712,0.00087965786,0.000055131193,0.0015975252,0.60991496],"genre_scores_gemma":[0.9818906,0.000109938585,0.017313525,0.000055139175,0.00010478607,0.00002687996,0.00002158438,0.00005068726,0.00042682502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991789,0.0000031814593,0.00027763555,0.00015814485,0.00016698777,0.00021514973],"domain_scores_gemma":[0.99952775,0.000052719042,0.000052976633,0.0002866351,0.000013344267,0.00006655078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000395133,0.00020241839,0.00025184764,0.00008513875,0.00006495404,0.000054799308,0.00013725687,0.00007986191,0.00034077186],"category_scores_gemma":[0.000012113884,0.00016538674,0.00008310852,0.00017872686,0.000018111194,0.000033325956,0.000013882079,0.00012872469,0.0001254513],"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.000008186704,0.000113546535,0.00003084856,0.00072530966,0.00041849219,0.000016782184,0.012435067,0.79546446,0.024567267,0.037746705,0.0047540767,0.12371927],"study_design_scores_gemma":[0.0003412521,0.000022719025,0.0001253177,0.00007040837,0.00008654589,0.0000034697912,0.0003115,0.9810666,0.013717121,0.0031730947,0.00067662227,0.00040538778],"about_ca_topic_score_codex":0.000002268402,"about_ca_topic_score_gemma":0.000024953562,"teacher_disagreement_score":0.6996891,"about_ca_system_score_codex":0.00004474489,"about_ca_system_score_gemma":0.0000014814744,"threshold_uncertainty_score":0.67442757},"labels":[],"label_agreement":null},{"id":"W2046384546","doi":"10.1016/j.dam.2006.04.018","title":"Minimum edge ranking spanning trees of split graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Discrete mathematics; Chordal graph; k-minimum spanning tree; Indifference graph; Time complexity; Graph; K-ary tree; Tree structure; Binary tree","score_opus":0.01762151411447972,"score_gpt":0.27094719792071237,"score_spread":0.25332568380623266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046384546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10674736,0.00013206153,0.85252815,0.000057618738,0.000057954465,0.00039990645,0.000005846751,0.00018379527,0.039887287],"genre_scores_gemma":[0.62795115,0.000004981076,0.37177896,0.000015992984,0.000028484137,0.000035636815,0.0000050067647,0.000024705141,0.00015504616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802744,0.000023671315,0.0005346803,0.00037918903,0.0005594206,0.00047558383],"domain_scores_gemma":[0.99830645,0.00034245942,0.0002665488,0.0009393769,0.000072522955,0.00007263371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005264977,0.00022924792,0.0003854007,0.00025234322,0.00013033683,0.00009043498,0.001155505,0.000074158874,0.000014662589],"category_scores_gemma":[0.00003339746,0.00020233903,0.00013578101,0.0007500514,0.00020284657,0.00021677797,0.0003737928,0.00017412659,0.00003086101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010205848,0.00007261873,0.00007080443,0.000120648816,0.00001761357,0.0000038993553,0.0007437046,0.000165393,0.023360597,0.97281045,0.0000884629,0.0025356293],"study_design_scores_gemma":[0.00048756824,0.0000381949,0.00031896582,0.00007286322,0.000013869388,0.000006966751,0.00028110115,0.018333185,0.023930458,0.9560708,0.0001734175,0.00027262708],"about_ca_topic_score_codex":0.0000058171645,"about_ca_topic_score_gemma":0.0000039648685,"teacher_disagreement_score":0.5212038,"about_ca_system_score_codex":0.000021116839,"about_ca_system_score_gemma":0.00003068952,"threshold_uncertainty_score":0.8251146},"labels":[],"label_agreement":null},{"id":"W2047444378","doi":"10.1016/j.dam.2006.02.003","title":"Improved bottleneck domination algorithms","year":2006,"lang":"en","type":"article","venue":"Discrete Applied 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 Lethbridge","funders":"","keywords":"Bottleneck; Dominating set; Chordal graph; Mathematics; Combinatorics; Treewidth; Time complexity; Independent set; Maximal independent set; Interval graph; Discrete mathematics; Algorithm; Graph; Pathwidth; 1-planar graph; Computer science; Vertex (graph theory); Line graph","score_opus":0.01158698130081266,"score_gpt":0.2668749870525507,"score_spread":0.25528800575173805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047444378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033183962,0.000036282498,0.9666254,0.00015216201,0.00006673445,0.00041496145,0.000004644524,0.000264667,0.029116742],"genre_scores_gemma":[0.26392198,0.0000060999246,0.7350126,0.000050525246,0.00008847852,0.00013291238,0.000015353718,0.000032176133,0.0007398836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984421,0.000016669801,0.00034474317,0.00037694527,0.00040311224,0.0004163913],"domain_scores_gemma":[0.99871916,0.00017334767,0.00014906102,0.0008094578,0.00007380729,0.00007518273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041927132,0.0001937491,0.00021806009,0.00013388664,0.00014728818,0.0001688459,0.00088572875,0.000074054675,0.000016080796],"category_scores_gemma":[0.000029127401,0.00016875997,0.00007343721,0.0004638056,0.00009300323,0.0002803449,0.00028478628,0.00015548938,0.00010509989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034530851,0.000071510345,0.0000018615807,0.000040186944,0.000007811991,0.0000028109127,0.000207289,0.000063119114,0.03373785,0.9559867,0.0001604817,0.009716938],"study_design_scores_gemma":[0.0004895503,0.000030343557,0.000045296576,0.000011894388,0.0000069268913,0.000008015253,0.00009880266,0.16056594,0.044283397,0.79359895,0.0005845181,0.00027636223],"about_ca_topic_score_codex":0.0000052242153,"about_ca_topic_score_gemma":0.0000029698763,"teacher_disagreement_score":0.26060358,"about_ca_system_score_codex":0.000049849004,"about_ca_system_score_gemma":0.000029321025,"threshold_uncertainty_score":0.6881832},"labels":[],"label_agreement":null},{"id":"W2047797996","doi":"10.1016/j.dam.2003.04.003","title":"The average connectivity of a digraph","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Digraph; Mathematics; Combinatorics; Disjoint sets; Tree (set theory); Discrete mathematics","score_opus":0.011225174986959772,"score_gpt":0.22210074871429863,"score_spread":0.21087557372733887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047797996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013436988,0.000057070793,0.8907582,0.000055571658,0.0002468327,0.00023896593,0.0000011459913,0.00005918158,0.09514605],"genre_scores_gemma":[0.987301,0.00001176959,0.012398307,0.000034590958,0.000018893943,0.000037268655,3.097535e-7,0.000008422503,0.00018942296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905986,0.000038327224,0.00031586023,0.00016868272,0.00021345183,0.00020381408],"domain_scores_gemma":[0.99865794,0.00042450547,0.00019134374,0.00063502183,0.00004952113,0.000041667146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066726055,0.00011308402,0.00019484102,0.00003082423,0.00018791152,0.00010261679,0.00044931532,0.00004511295,0.000007405341],"category_scores_gemma":[0.000058895796,0.00007102802,0.00009116391,0.00023966252,0.00006060461,0.00007387193,0.00006276827,0.00009268033,0.000017466064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012549774,0.000025476505,0.000009952264,0.000025351294,0.000020563391,5.281362e-7,0.00091160147,0.00009122962,0.0005723308,0.9974039,0.00029038312,0.00064738083],"study_design_scores_gemma":[0.0009430098,0.00012725941,0.00013180211,0.00010891653,0.000027747581,0.00006907619,0.0021711288,0.11662875,0.028378757,0.8222882,0.028477365,0.00064799166],"about_ca_topic_score_codex":0.000003066128,"about_ca_topic_score_gemma":0.000008093146,"teacher_disagreement_score":0.973864,"about_ca_system_score_codex":0.00001242854,"about_ca_system_score_gemma":0.000021265187,"threshold_uncertainty_score":0.28964385},"labels":[],"label_agreement":null},{"id":"W2048457435","doi":"10.1016/j.dam.2007.06.002","title":"Fire containment in grids of dimension three and higher","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"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":"University of Manitoba","keywords":"Conjecture; Mathematics; Combinatorics; Outbreak; Vertex (graph theory); Lattice (music); Square lattice; Integer (computer science); Discrete mathematics; Computer science; Graph","score_opus":0.017490995095231006,"score_gpt":0.28066873052227853,"score_spread":0.26317773542704753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048457435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34594056,0.00016145916,0.6445236,0.00010021342,0.000041800722,0.00044244877,0.0000017243575,0.000047465146,0.008740696],"genre_scores_gemma":[0.8738048,0.000013322086,0.12608373,0.00003092453,0.000007962638,0.000012420241,9.460229e-7,0.000010078447,0.000035826346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887645,0.000008018852,0.00031206865,0.00021919917,0.000313332,0.0002709027],"domain_scores_gemma":[0.9991143,0.00024804354,0.0000962192,0.00044679648,0.000024339108,0.000070356415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006990067,0.00011644906,0.00021369499,0.000089187466,0.000036106616,0.000019195539,0.0003357019,0.0000502944,0.0000076840915],"category_scores_gemma":[0.000014764704,0.00009513105,0.000025028956,0.00027890623,0.000108497494,0.00009529068,0.0003226211,0.000115239854,0.0000059063823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016738102,0.000059616956,0.00021957699,0.00008191539,0.0000074392397,0.0000081397,0.00080222555,0.00001215353,0.011424971,0.9740948,0.000010026011,0.013262372],"study_design_scores_gemma":[0.0008997367,0.0001001089,0.007013892,0.00010177109,0.000006264781,0.0000050717313,0.00037743,0.0073753283,0.024164801,0.95957714,0.00012652893,0.0002519318],"about_ca_topic_score_codex":0.0000033820795,"about_ca_topic_score_gemma":0.000010226168,"teacher_disagreement_score":0.5278642,"about_ca_system_score_codex":0.000028353323,"about_ca_system_score_gemma":0.000010636399,"threshold_uncertainty_score":0.38793316},"labels":[],"label_agreement":null},{"id":"W2048827438","doi":"10.1016/j.dam.2007.05.054","title":"Skew partitions in perfect graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied 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":"Skew; Mathematics; Combinatorics; Discrete mathematics; Computer science","score_opus":0.02124849550104199,"score_gpt":0.3031963948444367,"score_spread":0.28194789934339476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048827438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049175154,0.00004115046,0.8939442,0.000102299324,0.000045738372,0.00038014865,0.0000023317366,0.0001742088,0.056134738],"genre_scores_gemma":[0.6867212,0.000013536982,0.31297642,0.000078031124,0.00001542559,0.000060590068,0.0000036560293,0.000018806566,0.000112317946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838287,0.0000142428635,0.00036167778,0.00032246485,0.00036673815,0.00055198267],"domain_scores_gemma":[0.9986696,0.00032310237,0.00007856425,0.00076398964,0.000033322667,0.00013139282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010986514,0.00016087046,0.00020904519,0.0002965538,0.00010991047,0.0000767521,0.0007867099,0.000063030224,0.00003498692],"category_scores_gemma":[0.00004813626,0.00014394552,0.000071768765,0.0010382258,0.000115814946,0.00019826557,0.00023926444,0.00024301518,0.00014958002],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004514911,0.00008256336,0.00007384269,0.0000380455,0.000006521172,0.000015558297,0.0009475226,0.000037047612,0.0026536519,0.9911801,0.000036836984,0.004923803],"study_design_scores_gemma":[0.00030023156,0.000027663156,0.00064187904,0.000027470845,0.0000034992913,0.000009524791,0.00022971151,0.0023185674,0.006608939,0.98906744,0.0005497932,0.00021530774],"about_ca_topic_score_codex":0.0000023257069,"about_ca_topic_score_gemma":0.000023419965,"teacher_disagreement_score":0.63754606,"about_ca_system_score_codex":0.00004064177,"about_ca_system_score_gemma":0.000026101648,"threshold_uncertainty_score":0.5869928},"labels":[],"label_agreement":null},{"id":"W2048831243","doi":"10.1016/j.dam.2012.03.009","title":"Minimizing the error of linear separators on linearly inseparable data","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Lakes Environmental (Canada)","funders":"","keywords":"Mathematics; Classifier (UML); Separable space; Separator (oil production); Algorithm; Mean squared prediction error; Mathematical optimization; Artificial intelligence; Computer science; Mathematical analysis","score_opus":0.07884777409949395,"score_gpt":0.3250418174041744,"score_spread":0.24619404330468048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048831243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08236689,0.00014341729,0.90569067,0.00031296024,0.0002763292,0.00036857385,0.000023620543,0.00007999737,0.010737551],"genre_scores_gemma":[0.7262156,0.000006113714,0.2732112,0.000207633,0.00017360634,0.000016843464,0.000042660595,0.000011276287,0.000115069655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886364,0.000021714644,0.00032064723,0.00020723174,0.00036126448,0.00022550224],"domain_scores_gemma":[0.9982885,0.00030983877,0.0001914053,0.0010969145,0.00004481469,0.00006850383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065864786,0.00013226333,0.00017282432,0.000066700835,0.00014663213,0.000052169704,0.001034222,0.000045819244,0.000009939656],"category_scores_gemma":[0.00006657561,0.0000903006,0.00003816955,0.00040576435,0.000040534625,0.00031052207,0.00037694786,0.000110503715,0.00008793276],"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.00001647641,0.00038782728,0.00004063318,0.00012779354,0.00007618066,6.832632e-7,0.0067639058,0.008277157,0.0049328296,0.96856534,0.0041057775,0.006705363],"study_design_scores_gemma":[0.000522843,0.00009834019,0.0003116765,0.000061297,0.0000609897,0.000012008889,0.0006205568,0.9316351,0.035188876,0.012137462,0.018914446,0.00043642445],"about_ca_topic_score_codex":0.000001963578,"about_ca_topic_score_gemma":7.028467e-7,"teacher_disagreement_score":0.95642793,"about_ca_system_score_codex":0.000011647114,"about_ca_system_score_gemma":0.000044553053,"threshold_uncertainty_score":0.36823517},"labels":[],"label_agreement":null},{"id":"W2048988825","doi":"10.1016/j.dam.2006.02.009","title":"Digraph matrix partitions and trigraph homomorphisms","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Capilano University; Simon Fraser University","funders":"","keywords":"Digraph; Homomorphism; Mathematics; Combinatorics; Partition (number theory); Graph homomorphism; Directed graph; Matrix (chemical analysis); Discrete mathematics; Undirected graph; Graph; Algebra over a field; Line graph; Voltage graph; Pure mathematics","score_opus":0.012057152574411534,"score_gpt":0.26709409134703294,"score_spread":0.2550369387726214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048988825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033559095,0.00028618696,0.9362702,0.00031142187,0.000046576493,0.00054080517,0.000022796725,0.0003879456,0.028575001],"genre_scores_gemma":[0.71040916,0.00004525875,0.28891018,0.00004574325,0.000040665505,0.00015671858,0.0000143560255,0.00002768999,0.00035021946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983956,0.000021081734,0.00035537014,0.0003972618,0.0003805646,0.00045007755],"domain_scores_gemma":[0.99870116,0.00023194827,0.00012156944,0.00077326247,0.000045951143,0.00012609699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030958492,0.00021661268,0.00026371883,0.00023041725,0.0002616828,0.00021588756,0.0006132236,0.00007032121,0.000018524192],"category_scores_gemma":[0.000017135639,0.00018769802,0.00008666998,0.0007305489,0.00026609542,0.00025408829,0.00024925073,0.00017412128,0.00006650112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033126503,0.00007498908,0.000029812049,0.000045112716,0.000012190616,0.000007282207,0.00016846924,0.000046525805,0.003170856,0.99535716,0.00038136015,0.00070293195],"study_design_scores_gemma":[0.0003762257,0.00002769335,0.00030803386,0.000016468826,0.000013559074,0.000023459652,0.00011557447,0.0034641789,0.0026754339,0.9917607,0.0009634703,0.00025524234],"about_ca_topic_score_codex":0.00000513574,"about_ca_topic_score_gemma":0.0000055146775,"teacher_disagreement_score":0.6768501,"about_ca_system_score_codex":0.000014379684,"about_ca_system_score_gemma":0.000020320116,"threshold_uncertainty_score":0.7654103},"labels":[],"label_agreement":null},{"id":"W2049890507","doi":"10.1016/s0166-218x(00)00258-4","title":"Efficient algorithms on distributive lattices","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Commutative Algebra and Its Applications","field":"Mathematics","cited_by":33,"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":"Distributive property; Partially ordered set; Distributive lattice; Mathematics; Lattice (music); Congruence lattice problem; Gray code; Algorithm; Time complexity; Ideal (ethics); Exploit; Combinatorics; Discrete mathematics; Theoretical computer science; Computer science; Pure mathematics","score_opus":0.04540149450965496,"score_gpt":0.3291268513853606,"score_spread":0.2837253568757056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049890507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38205987,0.00004411144,0.38364598,0.00079315965,0.00009235922,0.0016082514,0.00018367446,0.0005305089,0.23104207],"genre_scores_gemma":[0.938384,0.000017802628,0.06024846,0.00015492618,0.00011743083,0.0003460282,0.0000639284,0.00008006381,0.00058739143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981537,0.00002208055,0.00049637747,0.0003758438,0.000463162,0.0004888454],"domain_scores_gemma":[0.9976339,0.0010536491,0.00026925342,0.00080539344,0.00009104982,0.00014680364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034807302,0.00033517386,0.00041233108,0.000090707705,0.000320435,0.00007495582,0.00040299,0.00009796183,0.00030756337],"category_scores_gemma":[0.00014571287,0.0002691347,0.00011331482,0.0003972625,0.00014443297,0.000027661987,0.0001579565,0.00025433695,0.0005915848],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018705301,0.0005051942,0.00001015021,0.00006600467,0.00006613166,0.0000050811454,0.001599632,0.00008490657,0.0005927708,0.9930714,0.0013048756,0.0026751647],"study_design_scores_gemma":[0.0009806891,0.00012319144,0.00024496595,0.000103130085,0.0001954162,0.000022927228,0.0035256413,0.019338124,0.0036018284,0.9648353,0.0062907445,0.00073806226],"about_ca_topic_score_codex":0.0000027513033,"about_ca_topic_score_gemma":0.000003602659,"teacher_disagreement_score":0.55632406,"about_ca_system_score_codex":0.00008129519,"about_ca_system_score_gemma":0.000025752535,"threshold_uncertainty_score":0.9999761},"labels":[],"label_agreement":null},{"id":"W2050912278","doi":"10.1016/j.dam.2014.07.029","title":"The fast robber on interval and chordal graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Artificial Intelligence in Games","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":"Interval graph; Chordal graph; Combinatorics; Mathematics; Vertex (graph theory); Graph; Pathwidth; Discrete mathematics; Split graph; Interval (graph theory); Line graph; 1-planar graph","score_opus":0.01634910283833329,"score_gpt":0.2565800278507998,"score_spread":0.2402309250124665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050912278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0318921,0.000022390535,0.92136526,0.00097295037,0.0002123293,0.0002663266,0.0000012981044,0.00015713941,0.045110185],"genre_scores_gemma":[0.93710613,0.000019251956,0.062182963,0.0003448105,0.00006377493,0.000047392117,8.564253e-7,0.000019619156,0.00021519388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988966,0.000021145755,0.0002738468,0.00026993826,0.00026477358,0.00027367056],"domain_scores_gemma":[0.99860704,0.0005045384,0.0001076576,0.00067625794,0.000027643018,0.0000768668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044489515,0.00016261764,0.00016192328,0.000039799503,0.00025372425,0.000319851,0.00079260115,0.00004796257,0.000005669068],"category_scores_gemma":[0.00007867482,0.00010245704,0.000051088882,0.00013930668,0.00018938443,0.00009150928,0.00029476997,0.00015446777,0.00015148045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030264428,0.000019251658,0.000007717963,0.0000113470405,0.000009276981,3.785496e-7,0.001412478,0.000026133584,0.0003740073,0.9443749,0.00030413343,0.05345732],"study_design_scores_gemma":[0.00008613189,0.0001004892,0.00010779045,0.00004051443,0.00001076178,0.00000731298,0.00079087395,0.110281855,0.010496218,0.8717121,0.006083925,0.0002820154],"about_ca_topic_score_codex":0.0000037252937,"about_ca_topic_score_gemma":0.000012595344,"teacher_disagreement_score":0.905214,"about_ca_system_score_codex":0.000011767044,"about_ca_system_score_gemma":0.0000084437615,"threshold_uncertainty_score":0.41780767},"labels":[],"label_agreement":null},{"id":"W2051308394","doi":"10.1016/j.dam.2008.08.033","title":"On column generation formulations for the RWA problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Concordia University; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Mathematics; Blocking (statistics); Column (typography); Routing and wavelength assignment; Mathematical optimization; Relaxation (psychology); Routing (electronic design automation); Algorithm; Computer science; Wavelength; Wavelength-division multiplexing; Computer network; Statistics","score_opus":0.02652789412521884,"score_gpt":0.23687077099483844,"score_spread":0.2103428768696196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051308394","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0106940735,0.000045837372,0.97635317,0.000098720266,0.0000501625,0.0009874566,0.000011649785,0.00060396746,0.011154958],"genre_scores_gemma":[0.43850186,0.00006176113,0.56043804,0.00003944512,0.00007697165,0.00069846696,0.000022989947,0.00004573461,0.000114723975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938744,9.959431e-7,0.00019755337,0.00010217899,0.00011322272,0.00019859403],"domain_scores_gemma":[0.99932534,0.00030594078,0.00003199853,0.00029454392,0.000020189558,0.000021974061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005254884,0.00012567965,0.00012645483,0.00002581768,0.00022222464,0.000017700315,0.0001459635,0.00007378498,0.0000082488505],"category_scores_gemma":[0.000033568278,0.00008997196,0.000042643744,0.00011855184,0.000063238105,0.000042560678,0.000022717724,0.0001075168,0.000026848576],"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.000002341259,0.000014678451,5.2289136e-7,0.000044863657,0.000022923441,2.4391363e-7,0.00020554377,0.25382286,0.0018622911,0.73833203,0.003380991,0.0023106842],"study_design_scores_gemma":[0.00021357764,0.00002692743,0.0000074782806,0.000010870445,0.000021830016,0.0000028198078,0.00008923763,0.81043136,0.0025313029,0.18409303,0.002409189,0.00016237413],"about_ca_topic_score_codex":1.3016214e-7,"about_ca_topic_score_gemma":0.000002869733,"teacher_disagreement_score":0.5566085,"about_ca_system_score_codex":0.000034939214,"about_ca_system_score_gemma":0.000004745287,"threshold_uncertainty_score":0.36689502},"labels":[],"label_agreement":null},{"id":"W2052776056","doi":"10.1016/j.dam.2011.04.016","title":"Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Homomorphism; Combinatorics; Mathematics; Digraph; Discrete mathematics; Interval (graph theory); Interval graph; Characterization (materials science); Conjecture; Time complexity; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.053733698770790504,"score_gpt":0.2908855560509496,"score_spread":0.2371518572801591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052776056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08408007,0.00025794344,0.8464703,0.000117176365,0.00020726245,0.00094299595,0.000028787616,0.00055985077,0.06733564],"genre_scores_gemma":[0.72764444,0.000058207457,0.2718036,0.00012309343,0.000021138401,0.00010575459,0.000009149975,0.000044838882,0.00018982282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997669,0.000055024575,0.00054325757,0.00065967574,0.00045998086,0.0006130788],"domain_scores_gemma":[0.9979912,0.00018850945,0.0002372013,0.0012015117,0.000098815166,0.00028278062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005558279,0.00037794758,0.00048047185,0.00032050157,0.00019765946,0.00017022231,0.001512089,0.00012414159,0.0000697675],"category_scores_gemma":[0.00005558256,0.00032066467,0.00014967758,0.00069669116,0.00056003506,0.00043733983,0.0010398959,0.0003957909,0.00007117323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004183183,0.00012662381,0.000055191053,0.000119941185,0.00006855404,0.000027467617,0.0057002762,6.076115e-7,0.0016401435,0.9855584,0.00013097753,0.006529971],"study_design_scores_gemma":[0.00062883005,0.00021757018,0.00039039348,0.000107737666,0.000034091034,0.000062913394,0.0013435592,0.0033153254,0.00912807,0.9839869,0.00026310302,0.00052146474],"about_ca_topic_score_codex":0.000011886071,"about_ca_topic_score_gemma":0.000013719144,"teacher_disagreement_score":0.64356434,"about_ca_system_score_codex":0.000029746743,"about_ca_system_score_gemma":0.000027033864,"threshold_uncertainty_score":0.99992454},"labels":[],"label_agreement":null},{"id":"W2052843332","doi":"10.1016/j.dam.2011.08.019","title":"Three value TSP and linkages with the three value linear spanning 2-forests","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Digraph; Combinatorics; Spanning tree; Disjoint sets; Hamiltonian path; Characterization (materials science); Directed graph; Graph; Travelling salesman problem; Hamiltonian (control theory); Discrete mathematics; Mathematical optimization","score_opus":0.018973592382432364,"score_gpt":0.21943211445236588,"score_spread":0.2004585220699335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052843332","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1515876,0.00035278618,0.8314147,0.000079499616,0.00003988233,0.00054042385,0.000004624152,0.0010778047,0.014902657],"genre_scores_gemma":[0.48146126,0.000049039623,0.5182159,0.00002504535,0.00005839717,0.000086984364,0.0000027609265,0.00008914172,0.000011480205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988795,0.0000028355971,0.00024765686,0.00023323654,0.00021713061,0.00041963081],"domain_scores_gemma":[0.99903804,0.00018776227,0.000067768415,0.00061650993,0.000020974452,0.0000689211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014975788,0.00031613663,0.0003126719,0.000046616602,0.000130219,0.000036489157,0.00037729173,0.00015428975,0.000012696773],"category_scores_gemma":[0.000029133802,0.00019486017,0.00003852374,0.0002050884,0.00032250126,0.000083068,0.00018210222,0.0004145873,0.000037819562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018649616,0.00004317254,0.0005454016,0.00046056777,0.00023110998,0.00002719688,0.0023033514,0.0412311,0.0007793453,0.94763976,0.0002768219,0.006443523],"study_design_scores_gemma":[0.00058726955,0.00013055633,0.002984834,0.00023295675,0.00019813041,0.00003662369,0.0015185917,0.46279138,0.003775951,0.5265361,0.00036893348,0.0008386709],"about_ca_topic_score_codex":0.0000027648605,"about_ca_topic_score_gemma":0.000038274495,"teacher_disagreement_score":0.4215603,"about_ca_system_score_codex":0.000020508518,"about_ca_system_score_gemma":0.0000066058114,"threshold_uncertainty_score":0.7946167},"labels":[],"label_agreement":null},{"id":"W2053535344","doi":"10.1016/j.dam.2007.05.009","title":"Approximating the fixed linear crossing number","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","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":"ASTER","funders":"","keywords":"Mathematics; Combinatorics; Randomized algorithm; Approximation algorithm; Time complexity; Crossing number (knot theory); Discrete mathematics; Conjecture; Random graph; Graph","score_opus":0.019367477242300483,"score_gpt":0.28515869318712406,"score_spread":0.2657912159448236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053535344","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030542107,0.000014040227,0.94238466,0.00016816625,0.000120948294,0.00021462045,8.587682e-7,0.0001341977,0.026420387],"genre_scores_gemma":[0.4075953,4.7287455e-7,0.5917949,0.0003044355,0.00014269869,0.000011673693,0.0000051350194,0.0000097008315,0.00013564703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987631,0.000010082505,0.0003853376,0.00021879701,0.00035467447,0.00026804573],"domain_scores_gemma":[0.99893224,0.0003532722,0.0001757869,0.0004202022,0.000059848782,0.000058666337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010714646,0.0001344156,0.00013420991,0.00004021009,0.0005078102,0.000344554,0.00049265806,0.00004882044,0.000016717564],"category_scores_gemma":[0.00006388787,0.000094255825,0.00005600128,0.00046137103,0.00006827365,0.00015761636,0.00018564014,0.00013744221,0.0001330246],"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.0000033549127,0.00005366156,0.00001884453,0.000055386765,0.000018659188,0.0000028398792,0.0051209885,0.0018363086,0.0052461014,0.96052575,0.0002553695,0.026862744],"study_design_scores_gemma":[0.00050876505,0.000018804585,0.00036262345,0.000045261975,0.00002417976,0.000064676555,0.0009896732,0.78857225,0.033294372,0.16800715,0.007621425,0.0004908158],"about_ca_topic_score_codex":0.0000014763955,"about_ca_topic_score_gemma":0.0000017061133,"teacher_disagreement_score":0.7925186,"about_ca_system_score_codex":0.000023463266,"about_ca_system_score_gemma":0.000041885534,"threshold_uncertainty_score":0.39057168},"labels":[],"label_agreement":null},{"id":"W2053545243","doi":"10.1016/s0166-218x(01)00180-9","title":"Boundary uniqueness of fusenes","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Planar; Boundary (topology); Uniqueness; Enhanced Data Rates for GSM Evolution; Combinatorics; Code (set theory); Geometry; Mathematical analysis; Computer science","score_opus":0.04865502189627554,"score_gpt":0.2874226682189233,"score_spread":0.23876764632264777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053545243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63984615,0.00023801881,0.06727857,0.0003373685,0.00009393965,0.001347303,0.00009087326,0.0005115406,0.2902562],"genre_scores_gemma":[0.8954109,0.000051779956,0.10343189,0.000048825445,0.00003967605,0.00015224084,0.000009154254,0.000059588026,0.0007959283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870086,0.000019284138,0.0005459803,0.000217505,0.00026291225,0.00025344052],"domain_scores_gemma":[0.9983417,0.00045022916,0.00029575717,0.00077134155,0.000060698476,0.0000802902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029543828,0.0002198189,0.00040452753,0.00009475268,0.00014289132,0.000027712467,0.00035846725,0.00010503027,0.00048890914],"category_scores_gemma":[0.00007075637,0.00019070225,0.00012973456,0.00032538912,0.00023498668,0.000060680482,0.00008038726,0.00013028158,0.00009049289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003995352,0.00027758634,0.000007669897,0.0003860083,0.000042749867,8.303926e-7,0.0016458519,0.000002306782,0.013352107,0.9821948,0.0010905993,0.0009955242],"study_design_scores_gemma":[0.00026006543,0.000017177208,0.000014300096,0.000052179694,0.00008148802,0.0000080376085,0.0008308739,0.00042342447,0.021595621,0.9744513,0.0020405937,0.0002249608],"about_ca_topic_score_codex":0.0000010927602,"about_ca_topic_score_gemma":0.0000016539932,"teacher_disagreement_score":0.2894603,"about_ca_system_score_codex":0.000013936055,"about_ca_system_score_gemma":0.000010467007,"threshold_uncertainty_score":0.7776612},"labels":[],"label_agreement":null},{"id":"W2054681864","doi":"10.1016/s0166-218x(99)00161-4","title":"Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Injective function; Neighbourhood (mathematics); Graph; Discrete mathematics","score_opus":0.008419413781472318,"score_gpt":0.21658444924436557,"score_spread":0.20816503546289325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054681864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139734,0.000071376424,0.17329526,0.0001387116,0.00012559492,0.00040611817,0.000006264755,0.00015351865,0.011829726],"genre_scores_gemma":[0.9586434,0.000015627742,0.040971532,0.000037803802,0.00003940626,0.000036122976,0.000006725533,0.000017025783,0.0002323912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883085,0.000018694122,0.00037388146,0.00030324495,0.00026218448,0.00021113576],"domain_scores_gemma":[0.99921924,0.00009529107,0.00014550018,0.00041332355,0.000048036076,0.00007862593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020465278,0.00019595548,0.00034490888,0.0000728111,0.00011645462,0.00009884341,0.0002809471,0.000071529226,0.00004792694],"category_scores_gemma":[0.0000048478328,0.00014754575,0.00004802361,0.00021974908,0.00011108655,0.0002006855,0.00008183476,0.000107187916,0.000019027115],"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.00015607876,0.0003202229,0.00006122285,0.00066763524,0.00019522483,0.00002299767,0.023358624,0.0030247867,0.014246434,0.8995898,0.0010760574,0.05728093],"study_design_scores_gemma":[0.0022285779,0.0012452563,0.0032033154,0.0007518921,0.00010089229,0.00041284625,0.002665415,0.9241231,0.0024460168,0.0608044,0.0009533191,0.0010649447],"about_ca_topic_score_codex":0.000019230742,"about_ca_topic_score_gemma":0.0000108283275,"teacher_disagreement_score":0.92109835,"about_ca_system_score_codex":0.000021708234,"about_ca_system_score_gemma":0.00001711938,"threshold_uncertainty_score":0.60167414},"labels":[],"label_agreement":null},{"id":"W2054772581","doi":"10.1016/s0166-218x(99)00183-3","title":"The even adjacency split problem for graphs","year":2000,"lang":"en","type":"article","venue":"Discrete Applied 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":"Simon Fraser University; University of Saskatchewan","funders":"","keywords":"Mathematics; Adjacency list; Combinatorics; Discrete mathematics","score_opus":0.016811688592944133,"score_gpt":0.2797410441744027,"score_spread":0.2629293555814586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054772581","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003912069,0.00018782108,0.9139444,0.0011328724,0.0000612015,0.0023765494,0.000016364456,0.00034606125,0.07802266],"genre_scores_gemma":[0.06500637,0.00019107551,0.92827606,0.00016254705,0.000060491646,0.0014432326,0.000010142146,0.000068955065,0.004781127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981767,0.00002251176,0.00037628555,0.0003869344,0.00042022878,0.00061736675],"domain_scores_gemma":[0.99792147,0.00062767934,0.00010564179,0.0011617717,0.00006488209,0.000118574746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007475816,0.00020944953,0.0002143319,0.00005654266,0.00053329545,0.00023383254,0.0017617573,0.00006146239,0.000040289902],"category_scores_gemma":[0.0000342241,0.0001378212,0.00013118629,0.00046606094,0.00016904404,0.0001878125,0.0001747033,0.00017089558,0.00016375612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015820564,0.00003704974,0.0000011406142,0.000059975227,0.000020517215,9.1280845e-7,0.00069995667,0.000044547414,0.0005064799,0.9381451,0.000503208,0.059965268],"study_design_scores_gemma":[0.00030588376,0.000046835765,0.00001027403,0.000018365887,0.000007838306,0.000006437487,0.00013071181,0.008010269,0.0011290862,0.9780347,0.012101733,0.00019787415],"about_ca_topic_score_codex":7.654659e-7,"about_ca_topic_score_gemma":0.00000239429,"teacher_disagreement_score":0.07324153,"about_ca_system_score_codex":0.00002468407,"about_ca_system_score_gemma":0.00004281634,"threshold_uncertainty_score":0.5620186},"labels":[],"label_agreement":null},{"id":"W2055422348","doi":"10.1016/j.dam.2011.07.016","title":"Maximizing edge-ratio is NP-complete","year":2011,"lang":"en","type":"article","venue":"Discrete Applied 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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Maximum cut; Graph; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.06736649496454762,"score_gpt":0.2829218158582461,"score_spread":0.2155553208936985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055422348","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017205218,0.0000330371,0.88419783,0.00012118743,0.00007405618,0.00037449837,0.00000744713,0.00027064618,0.11320078],"genre_scores_gemma":[0.1864404,0.000013648665,0.8124533,0.0004660673,0.000044663022,0.00011202603,0.0000041626363,0.000046473626,0.0004192434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802196,0.000023647803,0.00041203087,0.0004904638,0.00048685918,0.00056506274],"domain_scores_gemma":[0.9980421,0.0001404065,0.00017035865,0.0013986272,0.000076503355,0.00017198722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044556163,0.0002594963,0.0003079467,0.00015852561,0.00021700947,0.00013863356,0.0016473703,0.000077619196,0.00016959468],"category_scores_gemma":[0.000035656503,0.00022740584,0.000105465304,0.00050708407,0.00015519846,0.00035521295,0.0006005663,0.00024344375,0.00071920926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006420712,0.000058532703,0.000007393241,0.000063722786,0.000026215917,0.000007708842,0.007276522,0.0000040401724,0.007148294,0.9820545,0.00037383725,0.002972857],"study_design_scores_gemma":[0.00032668552,0.000044845376,0.000042502008,0.000023880086,0.000012072815,0.000020321657,0.0004466359,0.014773144,0.027130315,0.95512134,0.0016576258,0.00040061047],"about_ca_topic_score_codex":0.00000283431,"about_ca_topic_score_gemma":0.0000010800143,"teacher_disagreement_score":0.18471988,"about_ca_system_score_codex":0.0000322782,"about_ca_system_score_gemma":0.000037094564,"threshold_uncertainty_score":0.92733413},"labels":[],"label_agreement":null},{"id":"W2056386139","doi":"10.1016/j.dam.2008.02.012","title":"Representation of graphs by OBDDs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Representation (politics); Combinatorics; Discrete mathematics","score_opus":0.037407934197245675,"score_gpt":0.2960625244126115,"score_spread":0.2586545902153658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056386139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03533073,0.00002697969,0.94316655,0.000030566862,0.00006196976,0.00020714682,0.0000036089446,0.00010023916,0.021072207],"genre_scores_gemma":[0.26328433,0.000030229347,0.7365374,0.000026229016,0.000006360718,0.000029548395,0.0000069199023,0.000008377205,0.00007062009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989665,0.000019135692,0.00035061408,0.00020205954,0.00031867888,0.00014301848],"domain_scores_gemma":[0.9988655,0.000085272586,0.0002438401,0.0007141975,0.00004748641,0.00004374374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022302197,0.000101598635,0.00019677848,0.00006555546,0.0000732185,0.00001682526,0.00055245147,0.000051875435,0.000007912074],"category_scores_gemma":[0.00005833005,0.00009270711,0.00005565245,0.00050199195,0.000100763755,0.00020149774,0.00010401921,0.000068608024,0.00002452748],"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.000002569007,0.000061181854,0.000032849624,0.000052889693,0.000011852369,6.215912e-7,0.002451967,0.000020204234,0.03658124,0.95689297,0.0011678354,0.002723843],"study_design_scores_gemma":[0.0005119035,0.000070388094,0.00066508603,0.000028625016,0.000021322896,0.000035534016,0.0004433529,0.065634064,0.6503654,0.28127104,0.00056568417,0.000387565],"about_ca_topic_score_codex":0.0000036088109,"about_ca_topic_score_gemma":1.0977487e-7,"teacher_disagreement_score":0.67562187,"about_ca_system_score_codex":0.000013058459,"about_ca_system_score_gemma":0.000016552727,"threshold_uncertainty_score":0.3780486},"labels":[],"label_agreement":null},{"id":"W2057195120","doi":"10.1016/j.dam.2006.07.006","title":"Automorphisms and blocking in simple games","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"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":"Generalitat de Catalunya; European Regional Development Fund; Royal Canadian Geographical Society","keywords":"Mathematics; Simple (philosophy); Automorphism; Blocking (statistics); Combinatorics; Discrete mathematics; Arithmetic; Statistics","score_opus":0.043183217795595245,"score_gpt":0.33286524075159857,"score_spread":0.2896820229560033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057195120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8999288,0.000046643738,0.030644394,0.00026983555,0.000017039974,0.00032385404,0.000014979873,0.00007400265,0.068680435],"genre_scores_gemma":[0.9848559,0.0000033554998,0.0143889645,0.000066758264,0.000034151926,0.000058681304,0.0000066592693,0.000013840285,0.00057168223],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844444,0.000019684501,0.0005532115,0.00030954165,0.0004495072,0.00022363596],"domain_scores_gemma":[0.99849737,0.00076300395,0.00017600521,0.00047970543,0.00003284867,0.000051043946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011076309,0.00013468368,0.00026800545,0.00014162558,0.00010410752,0.00015691083,0.00033564866,0.00005828212,0.00011006425],"category_scores_gemma":[0.0001270771,0.00010249611,0.000038427803,0.00045885873,0.00014229311,0.00007427841,0.00012426844,0.00010165516,0.00015178027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038238027,0.00006634383,0.00046265466,0.000009368337,0.0000027785813,0.000002021848,0.0007630989,0.00022331404,0.007111333,0.985513,0.0010645222,0.004777752],"study_design_scores_gemma":[0.00023425362,0.000006228731,0.0022646764,0.000008598981,0.000007924702,0.000005821797,0.0014376038,0.004680345,0.0033171352,0.98304844,0.0048430534,0.00014593916],"about_ca_topic_score_codex":0.000012840773,"about_ca_topic_score_gemma":0.000035266778,"teacher_disagreement_score":0.0849271,"about_ca_system_score_codex":0.0000130159115,"about_ca_system_score_gemma":0.000013564113,"threshold_uncertainty_score":0.417967},"labels":[],"label_agreement":null},{"id":"W2059857922","doi":"10.1016/j.dam.2008.08.017","title":"On probe permutation graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"National Science Council","keywords":"Combinatorics; Chordal graph; Mathematics; Permutation graph; Pathwidth; Split graph; Indifference graph; Treewidth; Discrete mathematics; Partial k-tree; Cograph; 1-planar graph; Graph; Line graph","score_opus":0.01724167408746066,"score_gpt":0.2901345644692842,"score_spread":0.27289289038182357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059857922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010513957,0.000012885447,0.9415747,0.0003888391,0.000032193006,0.00046793505,0.0000017386318,0.0002796854,0.046728097],"genre_scores_gemma":[0.71426487,0.0000050638732,0.28516737,0.0003472554,0.000013439566,0.000045005876,0.000005121867,0.00001348622,0.00013839247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986028,0.000016715274,0.00023760094,0.0003353239,0.00047184067,0.0003357175],"domain_scores_gemma":[0.99885124,0.00016050972,0.00009862018,0.00074512576,0.000045133016,0.00009935859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028962846,0.00017152492,0.00017740179,0.00016335204,0.00013767058,0.00012353543,0.0007568746,0.00005297187,0.000013213413],"category_scores_gemma":[0.000051224775,0.00014111416,0.00006614865,0.0005091959,0.000053630552,0.00019633726,0.00007588518,0.00017803427,0.00018714809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072059665,0.0000851759,5.8612005e-7,0.000018554294,0.0000054184834,0.000003874231,0.0009439469,0.000110612826,0.0060553188,0.9819748,0.000095604686,0.0106989425],"study_design_scores_gemma":[0.00022533664,0.00011607052,0.00006221687,0.000019599986,0.000003394415,0.000004933153,0.000086061875,0.009462688,0.006201826,0.9835853,0.00006009569,0.00017246399],"about_ca_topic_score_codex":1.566593e-7,"about_ca_topic_score_gemma":1.912318e-7,"teacher_disagreement_score":0.7037509,"about_ca_system_score_codex":0.000027576181,"about_ca_system_score_gemma":0.000021164318,"threshold_uncertainty_score":0.57544684},"labels":[],"label_agreement":null},{"id":"W2061436084","doi":"10.1016/j.dam.2008.01.027","title":"Constant memory routing in quasi-planar and quasi-polyhedral graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","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":"Simon Fraser University; Carleton University","funders":"","keywords":"Mathematics; Constant (computer programming); Planar graph; Combinatorics; Routing (electronic design automation); Planar; Discrete mathematics; Graph; Computer science","score_opus":0.02407151804749936,"score_gpt":0.249513418155564,"score_spread":0.22544190010806464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061436084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049382117,0.000079928555,0.91140723,0.0004974486,0.00006766818,0.00063440134,0.0000059240865,0.00024020846,0.037685063],"genre_scores_gemma":[0.785721,0.000094012794,0.21385099,0.00018060967,0.000010714544,0.000029850904,0.000005457687,0.000016099255,0.00009126575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855924,0.000028661925,0.0004059993,0.0003233424,0.0003135436,0.00036922688],"domain_scores_gemma":[0.9991675,0.00014794777,0.000120903314,0.0004040197,0.000028822375,0.00013079884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039182298,0.00017872639,0.00028690178,0.0001602885,0.00017673917,0.00009103159,0.00039516162,0.00007130076,0.000011960924],"category_scores_gemma":[0.000034832978,0.0001582673,0.000038021662,0.00039072646,0.00016158621,0.00019928846,0.00014593212,0.00018551691,0.000025713802],"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.0000037281993,0.00013159426,0.00019330949,0.000065950764,0.000010326105,0.000029394138,0.00870313,0.0000624721,0.00073598215,0.988676,0.00009807316,0.0012900273],"study_design_scores_gemma":[0.0022703367,0.00017860043,0.000461335,0.00015258536,0.000013595352,0.00021845191,0.0038830636,0.78298825,0.0012724372,0.20754918,0.000106479354,0.0009056995],"about_ca_topic_score_codex":0.000017058677,"about_ca_topic_score_gemma":0.000012414702,"teacher_disagreement_score":0.7829258,"about_ca_system_score_codex":0.000023922223,"about_ca_system_score_gemma":0.00006191901,"threshold_uncertainty_score":0.6453953},"labels":[],"label_agreement":null},{"id":"W2061601299","doi":"10.1016/j.dam.2012.08.003","title":"Batching and delivery in semi-online distribution systems","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","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":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Competitive analysis; Online algorithm; Distribution center; Instant; Distribution (mathematics); Order (exchange); Total cost; Line (geometry); Simple (philosophy); Computer science; Mathematics; Mathematical optimization; Operations research; Business; Upper and lower bounds; Marketing","score_opus":0.021888167250066887,"score_gpt":0.2541182552183995,"score_spread":0.23223008796833258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061601299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07649408,0.00015828857,0.92113477,0.00009515756,0.000070637565,0.00028364154,0.000014434762,0.00008404945,0.0016649354],"genre_scores_gemma":[0.9210801,0.00006536905,0.0786574,0.000036128382,0.000035681882,0.000026463287,0.000051645522,0.000008709752,0.00003849117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991041,0.00001877703,0.00024085658,0.00014288614,0.00018799346,0.0003054102],"domain_scores_gemma":[0.9994822,0.00008788425,0.00007132492,0.00023314073,0.000022240221,0.00010321441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004360843,0.00010233183,0.00014929759,0.000048498066,0.000068337264,0.00011542977,0.00020464837,0.000050391587,0.0000029019222],"category_scores_gemma":[0.000020595506,0.000088325934,0.000015845522,0.00020085508,0.000023889794,0.00031513654,0.00020233972,0.00011139929,0.000014315458],"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.0000023607618,0.00018355339,0.0008494121,0.00026857897,0.00001121722,0.0000014820146,0.0041416646,0.0022358852,0.001098662,0.9880604,0.0001467599,0.0029999998],"study_design_scores_gemma":[0.0004063391,0.000013518381,0.0011456733,0.000087938985,0.000006378147,0.000014161282,0.0010296747,0.99122864,0.00016642858,0.0050192615,0.0006351939,0.00024679297],"about_ca_topic_score_codex":0.0000086838545,"about_ca_topic_score_gemma":0.0000019271554,"teacher_disagreement_score":0.98899275,"about_ca_system_score_codex":0.000035151064,"about_ca_system_score_gemma":0.000014104776,"threshold_uncertainty_score":0.3601827},"labels":[],"label_agreement":null},{"id":"W2065074947","doi":"10.1016/j.dam.2005.02.013","title":"On uniform k-partition problems","year":2005,"lang":"en","type":"article","venue":"Discrete Applied 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":"Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Partition (number theory); Cardinality (data modeling); Combinatorics; Partition problem; Discrete mathematics; Scheduling (production processes); Set (abstract data type); Mathematical optimization; Computer science; Data mining","score_opus":0.021193475896767008,"score_gpt":0.2787988693872797,"score_spread":0.2576053934905127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065074947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00862332,0.000012307411,0.89691895,0.00048798672,0.000029929586,0.0004323741,0.0000029175078,0.00027839706,0.09321379],"genre_scores_gemma":[0.6211552,0.000010815636,0.3778523,0.00026965144,0.000055841676,0.00014167465,0.000007153482,0.000026605,0.00048073247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986137,0.0000114002205,0.0002637879,0.00029768297,0.0004401713,0.00037324618],"domain_scores_gemma":[0.99881357,0.00015631478,0.00009874914,0.0007850297,0.000037574504,0.00010878813],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003545647,0.0001626119,0.000163978,0.00011823697,0.00013411582,0.000111083355,0.00074027077,0.00005380146,0.000044963686],"category_scores_gemma":[0.00002993247,0.00013334562,0.000053464013,0.00035513547,0.00006673455,0.0002791056,0.0001843547,0.00018302041,0.00086415873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003642869,0.000086434884,6.566772e-7,0.0000385019,0.0000074841982,9.578439e-7,0.0007242049,0.0017615196,0.0021553882,0.9861586,0.00022323588,0.008839386],"study_design_scores_gemma":[0.00029152774,0.00006196913,0.000007066459,0.00003281975,0.0000035311964,0.0000051527422,0.0000650658,0.06532605,0.012124529,0.9195334,0.0023413997,0.0002075409],"about_ca_topic_score_codex":2.8987864e-7,"about_ca_topic_score_gemma":0.0000022249105,"teacher_disagreement_score":0.6125319,"about_ca_system_score_codex":0.000056988538,"about_ca_system_score_gemma":0.00002094184,"threshold_uncertainty_score":0.9999138},"labels":[],"label_agreement":null},{"id":"W2065163895","doi":"10.1016/s0166-218x(03)00462-1","title":"Interval data minmax regret network optimization problems","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":134,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"","keywords":"Mathematics; Regret; Interval (graph theory); Minimax; Logarithm; Shortest path problem; Combinatorics; Minimum spanning tree; Path (computing); Function (biology); Bounded function; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Graph; Statistics; Computer science","score_opus":0.12630091945201155,"score_gpt":0.3558418059577799,"score_spread":0.22954088650576837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065163895","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00081767363,0.00011217245,0.887346,0.000113372655,0.00028651409,0.00054531096,0.000034618824,0.00008817044,0.11065611],"genre_scores_gemma":[0.085826725,0.00033842688,0.91035765,0.000223993,0.00019843427,0.00005828382,0.00042986468,0.00007279578,0.0024938209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967274,0.00008404874,0.0010711943,0.0006543609,0.0010680988,0.00039486558],"domain_scores_gemma":[0.9964665,0.00045164142,0.0006020947,0.0021786292,0.00016309656,0.00013801559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031996402,0.00025339302,0.00043374256,0.00012540756,0.00020977436,0.0004121029,0.0013270363,0.00013967894,0.00059543556],"category_scores_gemma":[0.0009933676,0.00018697047,0.00007228618,0.00096323976,0.00009508234,0.00042094954,0.00029498004,0.00015623063,0.0002967624],"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.000016113141,0.000114707356,0.00025381718,0.00002676931,0.00004454772,0.0000030195613,0.0016091901,0.7447596,0.000036449514,0.19120163,0.05598189,0.0059522446],"study_design_scores_gemma":[0.000544378,0.000039896797,0.000023552919,0.000052754076,0.00007677349,0.000020505116,0.0013815842,0.7346318,0.00015145609,0.19427247,0.06831574,0.0004891253],"about_ca_topic_score_codex":0.0000023554846,"about_ca_topic_score_gemma":0.00000804141,"teacher_disagreement_score":0.10816229,"about_ca_system_score_codex":0.00002269113,"about_ca_system_score_gemma":0.00006936775,"threshold_uncertainty_score":0.7624434},"labels":[],"label_agreement":null},{"id":"W2066414833","doi":"10.1016/j.dam.2014.01.024","title":"Brushing without capacity restrictions","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Memorial University of Newfoundland; Carleton University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Ryerson University","keywords":"Traverse; Graph; Mathematics; Vertex (graph theory); Brush; Cartesian product; Combinatorics","score_opus":0.030951904321558123,"score_gpt":0.28422814721289763,"score_spread":0.2532762428913395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066414833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018406004,0.0000056607046,0.9169297,0.00016363643,0.00006371186,0.00023604558,0.0000018102938,0.00033078788,0.06386265],"genre_scores_gemma":[0.55219734,0.0000033204742,0.44748974,0.0000740682,0.00004135452,0.00004547623,0.000001309394,0.000017501558,0.00012988299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99850416,0.000038540562,0.00027583612,0.00035051443,0.00043114796,0.00039979623],"domain_scores_gemma":[0.99827003,0.0003214934,0.00012171888,0.0010870243,0.00005304539,0.00014669952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064668996,0.00017052531,0.00022543888,0.00013225277,0.00027454598,0.00018249151,0.0010297566,0.00006388818,0.000010113682],"category_scores_gemma":[0.00016243254,0.00014777703,0.000064096035,0.00050859136,0.00011745549,0.00027638345,0.0003246358,0.0002702332,0.00018072684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001590809,0.000031695454,0.000028275112,0.000031396172,0.00000958451,4.81582e-7,0.00079120445,0.00011105724,0.004315365,0.9917305,0.000086936285,0.0028619196],"study_design_scores_gemma":[0.00025658472,0.000028582914,0.00013501501,0.000022955863,0.000008132054,0.000010764486,0.00012925909,0.067143664,0.0049109734,0.9251694,0.0019295093,0.00025516038],"about_ca_topic_score_codex":0.000004834698,"about_ca_topic_score_gemma":0.000004475302,"teacher_disagreement_score":0.53379136,"about_ca_system_score_codex":0.000035327033,"about_ca_system_score_gemma":0.000022080772,"threshold_uncertainty_score":0.6026172},"labels":[],"label_agreement":null},{"id":"W2066511028","doi":"10.1016/j.dam.2012.09.011","title":"Faster optimal algorithms for segment minimization with small maximal value","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Medical Imaging Techniques and Applications","field":"Medicine","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 Manitoba; University of Waterloo","funders":"","keywords":"Mathematics; Matrix (chemical analysis); Speedup; Minification; Integer matrix; Algorithm; Combinatorics; Integer (computer science); Logical matrix; Mathematical optimization; Group (periodic table); Symmetric matrix; Computer science; Nonnegative matrix","score_opus":0.0413001135795605,"score_gpt":0.301615034316777,"score_spread":0.2603149207372165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066511028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018541513,0.000020059935,0.97338575,0.0011316398,0.000023157136,0.0016247235,0.000020608866,0.0001749032,0.005077624],"genre_scores_gemma":[0.06583005,0.000007917929,0.93200046,0.00046681493,0.00019745687,0.0008500643,0.00016479213,0.00005376837,0.0004286494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989362,0.0000039016295,0.00028501145,0.000190693,0.00023247422,0.0003517326],"domain_scores_gemma":[0.9991842,0.000067365116,0.000115611336,0.0003513979,0.00005551482,0.0002259212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019893494,0.00018219589,0.00027721454,0.00004631846,0.000075932105,0.000023077011,0.00009529826,0.00007920974,0.000058634967],"category_scores_gemma":[0.000020022544,0.00012823283,0.00006266851,0.00010583757,0.000079292426,0.000042467924,0.000045079738,0.00010999398,0.00002274756],"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.0006460915,0.0046982295,0.0007037407,0.0046671955,0.00071179616,0.0000096048625,0.009819496,0.0001883915,0.06134284,0.84436953,0.02841204,0.04443107],"study_design_scores_gemma":[0.017202226,0.0022282563,0.0011866397,0.0018321178,0.004965164,0.0007461835,0.00897242,0.4446347,0.2963917,0.018276934,0.200033,0.0035306748],"about_ca_topic_score_codex":0.000001302453,"about_ca_topic_score_gemma":1.2379375e-7,"teacher_disagreement_score":0.82609254,"about_ca_system_score_codex":0.000038196435,"about_ca_system_score_gemma":0.00003105006,"threshold_uncertainty_score":0.52291834},"labels":[],"label_agreement":null},{"id":"W2066759919","doi":"10.1016/j.dam.2011.12.023","title":"A parallelogram tile fills the plane by translation in at most two distinct ways","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Parallelogram; Polyomino; Substitution tiling; Mathematics; Tile; Square tiling; Conjecture; Hexagonal tiling; Combinatorics; Tessellation (computer graphics); Plane (geometry); Translation (biology); Square (algebra); Grid; Geometry; Regular polygon; Hinge; Physics","score_opus":0.014189761195813425,"score_gpt":0.21222244802066792,"score_spread":0.1980326868248545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066759919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8299367,0.0012261664,0.04709289,0.00004156561,0.00029253095,0.0014282889,0.00019650951,0.00047361347,0.11931174],"genre_scores_gemma":[0.998363,0.000012344676,0.0011306024,0.000015799531,0.00005301629,0.00018055268,0.00014275777,0.000040550884,0.000061358005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990703,0.000014615933,0.00030862412,0.00010171168,0.00015398198,0.00035079115],"domain_scores_gemma":[0.99938786,0.00020683666,0.00004936043,0.00028409538,0.0000042296883,0.00006761421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031151823,0.00018960607,0.0002161769,0.000032645858,0.000083740524,0.000025274037,0.00016507567,0.00007221548,0.000103576254],"category_scores_gemma":[0.0000063879,0.00013387257,0.000046868572,0.0001672033,0.0000441984,0.0000637723,0.000019664209,0.00013659362,0.00012370839],"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.0001558455,0.0007595663,0.0025079409,0.002839702,0.0004787841,0.000009723642,0.08995608,0.01271807,0.14304428,0.6940986,0.03380138,0.019630032],"study_design_scores_gemma":[0.014157942,0.0002329909,0.0044963243,0.0011430968,0.0009099331,0.00027599832,0.02589496,0.37749785,0.09619348,0.2345231,0.23680381,0.007870508],"about_ca_topic_score_codex":0.000005651688,"about_ca_topic_score_gemma":0.00003717709,"teacher_disagreement_score":0.45957547,"about_ca_system_score_codex":0.00003063579,"about_ca_system_score_gemma":0.0000021216545,"threshold_uncertainty_score":0.5459165},"labels":[],"label_agreement":null},{"id":"W2066946142","doi":"10.1016/j.dam.2007.02.006","title":"Lower bounds on the pathwidth of some grid-like graphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Victoria","funders":"","keywords":"Mathematics; Pathwidth; Combinatorics; Upper and lower bounds; Vertex (graph theory); Chordal graph; Mathematical proof; Discrete mathematics; Matching (statistics); Grid; Graph; Line graph; Statistics","score_opus":0.02064470322813984,"score_gpt":0.27836073905114567,"score_spread":0.25771603582300584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066946142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105785616,0.000068263136,0.85481435,0.00030916993,0.0003477698,0.0008115293,0.000014200721,0.00019608276,0.03765299],"genre_scores_gemma":[0.9366483,0.000022051414,0.062404264,0.00058266876,0.00006949662,0.000051038955,0.0000037466043,0.000041060153,0.00017735467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99783385,0.000026112104,0.00045712935,0.00034752596,0.00079597713,0.00053942023],"domain_scores_gemma":[0.99716026,0.00093574054,0.00021914781,0.0015009935,0.00007170213,0.000112182825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015657485,0.00023061651,0.0002810303,0.00018212131,0.00018597273,0.00008170423,0.0016223103,0.00007786461,0.00002069268],"category_scores_gemma":[0.000060685794,0.00014739721,0.00014259705,0.00070990727,0.0003266601,0.0001727334,0.00037422686,0.0002961113,0.00008336861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023610863,0.00012232228,0.0000056261624,0.000045935198,0.000024962283,0.000008070166,0.0010416658,0.000024327279,0.0046429546,0.9921572,0.00026290622,0.0016404161],"study_design_scores_gemma":[0.00027719035,0.00011385966,0.00006732528,0.000038753828,0.000007669963,0.000005115314,0.00043784548,0.001296349,0.020262482,0.9762977,0.000974195,0.00022153214],"about_ca_topic_score_codex":8.7838066e-7,"about_ca_topic_score_gemma":0.0000015936722,"teacher_disagreement_score":0.8308627,"about_ca_system_score_codex":0.000026927215,"about_ca_system_score_gemma":0.00003615004,"threshold_uncertainty_score":0.6010684},"labels":[],"label_agreement":null},{"id":"W2067475075","doi":"10.1016/j.dam.2011.03.020","title":"Polynomial-time recognition of clique-width ≤3 graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Toronto","funders":"","keywords":"Treewidth; Combinatorics; Mathematics; Clique-sum; Chordal graph; Bounded function; Discrete mathematics; Clique-width; Partial k-tree; 1-planar graph; Pathwidth; Graph; Line graph","score_opus":0.039311531153480864,"score_gpt":0.26537067493229455,"score_spread":0.2260591437788137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067475075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06278682,0.000038967424,0.76964396,0.000045194236,0.00008528054,0.0008287312,0.00002617339,0.00034272607,0.16620214],"genre_scores_gemma":[0.32884097,0.000021091399,0.6708158,0.000050691247,0.00001583137,0.00007061549,0.000009925329,0.000032283635,0.000142752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847466,0.000034083783,0.0004552235,0.00033074594,0.000349216,0.00035610117],"domain_scores_gemma":[0.9984762,0.00017754959,0.00026200188,0.00087388116,0.00009327873,0.00011706238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005492617,0.00018956681,0.00031561198,0.00021596349,0.00007548347,0.00003084081,0.000969407,0.00008559577,0.00012432925],"category_scores_gemma":[0.00005356595,0.00016755033,0.00011484412,0.0005263083,0.00018772445,0.00025114632,0.00029629265,0.00015849348,0.00030190856],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006989174,0.000372557,0.000023977187,0.0002552632,0.00008841005,0.000008766816,0.0064980974,0.000003291306,0.063227855,0.8931304,0.0007086599,0.035612803],"study_design_scores_gemma":[0.00034360224,0.00009743729,0.000065798304,0.00004373285,0.00001587887,0.000007930694,0.00015367636,0.0017645515,0.12614767,0.87102395,0.00007450665,0.00026127903],"about_ca_topic_score_codex":0.000003657784,"about_ca_topic_score_gemma":7.3194315e-7,"teacher_disagreement_score":0.26605415,"about_ca_system_score_codex":0.000016905286,"about_ca_system_score_gemma":0.000036527003,"threshold_uncertainty_score":0.6832504},"labels":[],"label_agreement":null},{"id":"W2067731498","doi":"10.1016/s0166-218x(02)00415-8","title":"Stability number of bull- and chair-free graphs revisited","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Independent set; Chordal graph; Clique; Graph; Split graph; Discrete mathematics; Bounded function; 1-planar graph","score_opus":0.020516878573116577,"score_gpt":0.2839838116839609,"score_spread":0.26346693311084435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067731498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13346362,0.00013912385,0.80495846,0.000091422364,0.000033684373,0.00071900146,0.000021174472,0.00015044918,0.060423035],"genre_scores_gemma":[0.60840195,0.000034772416,0.39142776,0.00003105278,0.0000041764065,0.000036636775,0.0000020253945,0.000018433953,0.000043192213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842274,0.00005592293,0.00039811712,0.00038040197,0.00041451427,0.00032831373],"domain_scores_gemma":[0.99772227,0.00033575503,0.0001665605,0.0015565548,0.00009115383,0.00012769432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008836031,0.00018558664,0.00034603992,0.00007372842,0.00008778775,0.000050941424,0.0007877462,0.0000650538,0.000074169024],"category_scores_gemma":[0.0002720628,0.00015743212,0.00006731928,0.00058180536,0.0002650059,0.00015513854,0.0003617824,0.00016265496,0.000018911005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005274311,0.00006265199,0.00020783044,0.00024549043,0.000017893735,0.0000013419536,0.0008744611,0.000001397693,0.0034815688,0.9945393,0.00004895479,0.0005138325],"study_design_scores_gemma":[0.00040127095,0.000021497865,0.00008249341,0.000028556735,0.0000090239955,0.00001355151,0.00028796276,0.0008359274,0.016868295,0.98106915,0.00019822584,0.00018402345],"about_ca_topic_score_codex":0.0000010038361,"about_ca_topic_score_gemma":6.548206e-7,"teacher_disagreement_score":0.47493833,"about_ca_system_score_codex":0.0000145317545,"about_ca_system_score_gemma":0.000026025702,"threshold_uncertainty_score":0.6419895},"labels":[],"label_agreement":null},{"id":"W2068387692","doi":"10.1016/j.dam.2012.08.017","title":"Generating functions for inscribed polyominoes","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université du Québec à Trois-Rivières","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polyomino; Mathematics; Combinatorics; Inscribed figure; Rectangle; Generating function; Diagonal; Regular polygon; Sublinear function; Discrete mathematics; Geometry","score_opus":0.05300014329784335,"score_gpt":0.32085735894993367,"score_spread":0.2678572156520903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068387692","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090455845,0.00013686823,0.8893723,0.00009922335,0.0010254774,0.0020933684,0.000072839095,0.0006327427,0.016111363],"genre_scores_gemma":[0.3107699,0.000005483019,0.6862473,0.00009267484,0.0008565024,0.00088601245,0.000036634483,0.00018178503,0.0009237477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99738026,0.000021145,0.0009055734,0.00032618167,0.00044290005,0.0009239547],"domain_scores_gemma":[0.99671644,0.0014995203,0.0004985419,0.00088430906,0.00012933368,0.0002718536],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007297749,0.000478005,0.00068632734,0.00012904579,0.00040564206,0.00008266104,0.00037192716,0.0002033985,0.000080175734],"category_scores_gemma":[0.0010009094,0.0004226541,0.00023396841,0.0002817094,0.00009523109,0.00028550762,0.0001665677,0.00023385831,0.00011603434],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016711796,0.00041242328,0.000011669943,0.00054253475,0.00009388261,2.8210914e-7,0.0027598974,0.000016893346,0.017322449,0.974843,0.0030954548,0.0008847679],"study_design_scores_gemma":[0.0012200223,0.0000628863,0.000004805241,0.00008197101,0.00032020063,0.00001754385,0.0035930837,0.0029846982,0.013546849,0.9723564,0.0050587165,0.00075282186],"about_ca_topic_score_codex":8.5786326e-7,"about_ca_topic_score_gemma":0.0000015797998,"teacher_disagreement_score":0.22031406,"about_ca_system_score_codex":0.00012023433,"about_ca_system_score_gemma":0.00004308897,"threshold_uncertainty_score":0.99982256},"labels":[],"label_agreement":null},{"id":"W2069386249","doi":"10.1016/j.dam.2014.06.004","title":"Chasing robbers on random geometric graphs—An alternative approach","year":2014,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Tel Aviv University; Ryerson University","keywords":"Mathematics; Combinatorics; Random graph; Random regular graph; Vertex (graph theory); Euclidean geometry; Graph; Upper and lower bounds; Discrete mathematics; Pathwidth; Line graph; Geometry","score_opus":0.02754310243246816,"score_gpt":0.2856310862076679,"score_spread":0.25808798377519976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069386249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013280274,0.000014658203,0.92859995,0.00004628245,0.000080836995,0.00057846674,0.0000029705666,0.00024833772,0.057148244],"genre_scores_gemma":[0.63514036,0.000008965344,0.36441958,0.000136011,0.00005552097,0.00011205143,0.000010428078,0.000042061813,0.00007505351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997387,0.00010112534,0.00039088837,0.0006802188,0.00083212875,0.00060862023],"domain_scores_gemma":[0.9974179,0.0006781636,0.0002278976,0.0013634566,0.00007001681,0.00024252373],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001360053,0.00032320915,0.00043902302,0.0006744265,0.00026692945,0.00025220515,0.0016962673,0.0000845136,0.000008637447],"category_scores_gemma":[0.00017187699,0.00026317916,0.00012565625,0.0014654048,0.00016705031,0.00035414146,0.00030793692,0.00035010613,0.000088250905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003173897,0.00017429779,0.0000027830445,0.000057223708,0.000034062185,0.0000015850485,0.0015278152,0.002715873,0.0007135027,0.9782344,0.000020522131,0.01648617],"study_design_scores_gemma":[0.0014760453,0.00015416753,0.000016353857,0.000026000289,0.000012453275,0.000008272073,0.0003585955,0.27878663,0.00493282,0.7136906,0.00014718814,0.00039091104],"about_ca_topic_score_codex":0.0000026750356,"about_ca_topic_score_gemma":4.8173234e-7,"teacher_disagreement_score":0.62186,"about_ca_system_score_codex":0.000050423965,"about_ca_system_score_gemma":0.00002013217,"threshold_uncertainty_score":0.99998206},"labels":[],"label_agreement":null},{"id":"W2069543418","doi":"10.1016/j.dam.2012.01.019","title":"Using local similarity measures to efficiently address approximate graph matching","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Heuristics; Tabu search; Local search (optimization); Initialization; Computation; Algorithm; Graph; Similarity (geometry); Matching (statistics); Path (computing); Mathematical optimization; Theoretical computer science; Combinatorics; Computer science; Artificial intelligence","score_opus":0.042613035051992015,"score_gpt":0.28219360824365386,"score_spread":0.23958057319166184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069543418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044149894,0.00005834161,0.9506939,0.00004343278,0.00024839636,0.00044760943,0.000010126524,0.00026731036,0.004080972],"genre_scores_gemma":[0.6244075,0.0000011297739,0.3752813,0.00018820257,0.000057396355,0.000029113455,0.000002507294,0.00002423189,0.000008614901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978046,0.00004575841,0.00040232897,0.0003853431,0.00057893514,0.00078303757],"domain_scores_gemma":[0.9984789,0.00012621174,0.00015110966,0.0008424335,0.000051693747,0.00034965228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011548151,0.00031916538,0.00036583765,0.00018271193,0.00034310692,0.00021133783,0.0010193924,0.0001008574,0.000009606716],"category_scores_gemma":[0.000023453162,0.00027434793,0.00013008332,0.00065040577,0.00010518825,0.00034659676,0.0005171307,0.00023071322,0.00006481393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106204125,0.0002331044,0.000009995435,0.00014375671,0.000040029965,0.000003142269,0.0096297655,0.0059881355,0.0065405006,0.97320276,0.000035044224,0.004163166],"study_design_scores_gemma":[0.0007136,0.00006495079,0.00007840712,0.00020356243,0.00010875809,0.00006933996,0.0036373786,0.12133732,0.057277076,0.81482846,0.00025098992,0.0014301458],"about_ca_topic_score_codex":0.00000502322,"about_ca_topic_score_gemma":9.645536e-7,"teacher_disagreement_score":0.5802576,"about_ca_system_score_codex":0.000039934566,"about_ca_system_score_gemma":0.000022346678,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2070158492","doi":"10.1016/s0166-218x(03)00275-0","title":"On simplicial and co-simplicial vertices in graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","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":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Mathematics; h-vector; Vertex (graph theory); Abstract simplicial complex; Simplicial homology; Simplicial complex; Neighbourhood (mathematics); Chordal graph; Independent set; Simplicial set; Simplicial manifold; Simplicial approximation theorem; Discrete mathematics; Graph; Pure mathematics","score_opus":0.019054387248265452,"score_gpt":0.3035012931768905,"score_spread":0.28444690592862504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070158492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58300453,0.0000584226,0.31883994,0.00014232894,0.00008859436,0.0009501902,0.000008796619,0.00019464934,0.09671256],"genre_scores_gemma":[0.9608635,0.000016383632,0.038783204,0.00020578763,0.000011862668,0.00007142896,0.0000018938986,0.000023122997,0.000022858796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840057,0.00004411288,0.00030987064,0.00040855032,0.0003765819,0.00046034224],"domain_scores_gemma":[0.9987039,0.0004898366,0.0000864261,0.00057457335,0.000021204689,0.00012404821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004894116,0.00020714228,0.00027221197,0.00022930594,0.00013084243,0.00012340382,0.0005308,0.000078945915,0.000013901846],"category_scores_gemma":[0.00013172238,0.00018211378,0.00004301948,0.0005173272,0.00013944639,0.0001679933,0.0001187122,0.00023425283,0.000048958416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014230339,0.000077786,0.000045823643,0.000037730948,0.0000075669327,0.000006300524,0.00094326976,0.000043857395,0.002538323,0.99406785,0.000041904008,0.002175349],"study_design_scores_gemma":[0.0005251111,0.0000696045,0.00017873265,0.000019940055,0.0000037055827,0.0000063636326,0.0002260834,0.0021419958,0.0063573173,0.98999345,0.000247046,0.00023064592],"about_ca_topic_score_codex":0.0000019128072,"about_ca_topic_score_gemma":0.000008473331,"teacher_disagreement_score":0.37785894,"about_ca_system_score_codex":0.000027941265,"about_ca_system_score_gemma":0.00003185373,"threshold_uncertainty_score":0.74263847},"labels":[],"label_agreement":null},{"id":"W2070349606","doi":"10.1016/j.dam.2011.05.014","title":"The periodic capacitated arc routing problem with irregular services","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":39,"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; Transport Canada","funders":"","keywords":"Arc routing; Heuristic; Arc (geometry); Routing (electronic design automation); Hierarchy; Time horizon; Mathematics; Cover (algebra); Set (abstract data type); Mathematical optimization; Vehicle routing problem; Computer science; Computer network; Engineering","score_opus":0.014794452863391894,"score_gpt":0.21091339920184088,"score_spread":0.19611894633844898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070349606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13368769,0.00017939569,0.7131158,0.000044295997,0.000102325415,0.0011304441,0.000010858444,0.0016497419,0.15007941],"genre_scores_gemma":[0.48107988,0.00001841983,0.51861966,0.000016679782,0.000022571212,0.000083171,0.000007692389,0.000086879,0.000065059234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880683,0.000019665054,0.00036045557,0.00017916625,0.00024408607,0.00038977657],"domain_scores_gemma":[0.9991836,0.00010338553,0.00011636393,0.0004651302,0.000052005904,0.000079502155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046230774,0.00024821857,0.00022736764,0.000041605566,0.00028019206,0.00011664056,0.0003323549,0.00007630418,0.000029788092],"category_scores_gemma":[0.000008107505,0.00016359372,0.000039140406,0.00027189782,0.00010559358,0.00008270726,0.0000486944,0.00019594151,0.00003972749],"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.00012270876,0.00022980002,0.00081923616,0.005036656,0.0012744088,0.00003159194,0.23773219,0.15455,0.03063909,0.5419831,0.00026049887,0.02732071],"study_design_scores_gemma":[0.0009634386,0.00006623276,0.00031243073,0.00035688793,0.00020905622,0.000044465593,0.01831337,0.93744314,0.020405916,0.020024836,0.00080897694,0.0010512389],"about_ca_topic_score_codex":0.0000056752165,"about_ca_topic_score_gemma":0.000010504765,"teacher_disagreement_score":0.7828931,"about_ca_system_score_codex":0.00003364894,"about_ca_system_score_gemma":0.000014134126,"threshold_uncertainty_score":0.66711587},"labels":[],"label_agreement":null},{"id":"W2070458953","doi":"10.1016/s0166-218x(02)00572-3","title":"Bounds on the average connectivity of a graph","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Combinatorics; Bipartite graph; Discrete mathematics; Planar graph; Disjoint sets; Cograph; Graph; Clique number; Upper and lower bounds; Split graph; Cartesian product; 1-planar graph; Chordal graph","score_opus":0.018037644797928777,"score_gpt":0.2266575634988209,"score_spread":0.20861991870089214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070458953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04588954,0.00001285769,0.7947844,0.00012859676,0.00022076747,0.00029307016,0.0000019018763,0.000058638314,0.15861018],"genre_scores_gemma":[0.9931563,0.0000029584032,0.0064330087,0.00017964542,0.00002215024,0.000045691682,4.432224e-7,0.000010103702,0.00014966552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990198,0.000051956737,0.00028594735,0.00019777931,0.00025506952,0.0001894276],"domain_scores_gemma":[0.9985849,0.00044301577,0.00018282996,0.00070982886,0.000041439624,0.00003797475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006947717,0.00013421135,0.00022137792,0.000049260772,0.00013843861,0.00008858385,0.0004380987,0.000052522246,0.000033416636],"category_scores_gemma":[0.000060055776,0.000083150626,0.0001001775,0.0002785001,0.00005718902,0.000059490863,0.00005169607,0.00012671808,0.00003817706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016873687,0.00005052208,0.0000045727897,0.000027438062,0.000021178841,7.0689873e-7,0.0012602295,0.00019391492,0.0006208865,0.99709153,0.0005927947,0.0001345476],"study_design_scores_gemma":[0.0006247068,0.00018577272,0.00006179785,0.00014318583,0.000020757221,0.00003775545,0.001417571,0.059755206,0.02948266,0.9017512,0.0060224943,0.000496846],"about_ca_topic_score_codex":0.000003164665,"about_ca_topic_score_gemma":0.0000033990054,"teacher_disagreement_score":0.9472668,"about_ca_system_score_codex":0.00001667427,"about_ca_system_score_gemma":0.000020678563,"threshold_uncertainty_score":0.33907843},"labels":[],"label_agreement":null},{"id":"W2070639743","doi":"10.1016/j.dam.2009.06.002","title":"2-dimensional optical orthogonal codes from singer groups","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":26,"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 New Brunswick","funders":"","keywords":"Cardinality (data modeling); Mathematics; Code word; Dimension (graph theory); Code (set theory); Finite geometry; Finite field; Combinatorics; Asymptotically optimal algorithm; Discrete mathematics; Projective test; Algorithm; Pure mathematics; Projective space; Computer science; Decoding methods","score_opus":0.007475241600825216,"score_gpt":0.19862031549488754,"score_spread":0.19114507389406232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070639743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.925895,0.00015513002,0.025713034,0.00004306655,0.00023906204,0.00023919152,0.000046569916,0.0005011743,0.04716781],"genre_scores_gemma":[0.97726315,0.000003701046,0.022300737,0.00008948366,0.00018877715,0.00001790269,0.00006963779,0.000035361594,0.000031236625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889666,0.000007635592,0.00034476668,0.00018795162,0.00027324492,0.00028974275],"domain_scores_gemma":[0.99937946,0.00013649806,0.000039839088,0.0003090171,0.000016175207,0.0001189963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001504471,0.00023696662,0.0003205286,0.000048447804,0.00007316666,0.000048250353,0.00016863443,0.00012325287,0.000119024415],"category_scores_gemma":[0.000009423996,0.00020626243,0.00009441054,0.00011270679,0.000053299555,0.00005987373,0.000020714746,0.00018008646,0.00022547555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021630478,0.00010245457,0.000014086702,0.00007922514,0.00010227706,0.000014392551,0.00092859817,0.0027017482,0.1068645,0.8865635,0.0011106881,0.0014969172],"study_design_scores_gemma":[0.0010547319,0.00007296558,0.0014624955,0.00020975947,0.00016916907,0.000036653528,0.0008496195,0.044817496,0.03361203,0.9152863,0.0012740532,0.001154745],"about_ca_topic_score_codex":4.4026677e-7,"about_ca_topic_score_gemma":0.0000011156152,"teacher_disagreement_score":0.07325247,"about_ca_system_score_codex":0.000020180307,"about_ca_system_score_gemma":0.0000069001953,"threshold_uncertainty_score":0.84111375},"labels":[],"label_agreement":null},{"id":"W2070761038","doi":"10.1016/j.dam.2003.05.005","title":"Hard cases of the multifacility location problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Combinatorics; Mathematical optimization","score_opus":0.024164265586103864,"score_gpt":0.24281019983535757,"score_spread":0.21864593424925372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070761038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04909145,0.000028869856,0.9436342,0.00009471276,0.00008155344,0.0003456895,0.0000031890193,0.000038398808,0.0066819396],"genre_scores_gemma":[0.73568046,0.0000013035725,0.26409286,0.000037073878,0.000007503068,0.00002389165,0.0000026355349,0.0000032693704,0.00015101064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991987,0.00002490204,0.00025389306,0.00016460309,0.00025254386,0.0001053804],"domain_scores_gemma":[0.99915797,0.00012439766,0.00014679001,0.00043939188,0.000102838894,0.000028590885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029425428,0.00008729384,0.000109309236,0.000031695403,0.00009740044,0.000037207537,0.00030160855,0.000030716994,0.000008320402],"category_scores_gemma":[0.00010879875,0.00006120146,0.000043441873,0.00043784015,0.000039271672,0.000094087925,0.00006819534,0.00005434771,0.000015782209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011238544,0.0000765531,0.000031004503,0.00011650076,0.000009608674,2.0552011e-7,0.00086446805,0.005355832,0.0075578783,0.9827689,0.000117285934,0.0031006597],"study_design_scores_gemma":[0.0009432753,0.0000740266,0.0038789597,0.00010817557,0.000056071298,0.00006216837,0.000588881,0.15985903,0.34188122,0.4872706,0.004679289,0.00059829396],"about_ca_topic_score_codex":0.0000023265807,"about_ca_topic_score_gemma":0.0000020850034,"teacher_disagreement_score":0.686589,"about_ca_system_score_codex":0.000018470097,"about_ca_system_score_gemma":0.0000712697,"threshold_uncertainty_score":0.24957232},"labels":[],"label_agreement":null},{"id":"W2070790034","doi":"10.1016/s0166-218x(02)00198-1","title":"Edge dominating set and colorings on graphs with fixed clique-width","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":149,"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; Fields Institute for Research in Mathematical Sciences","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Chordal graph; Discrete mathematics; Clique-sum; 1-planar graph; Brooks' theorem; Graph coloring; Indifference graph; Edge coloring; Independent set; Maximal independent set; Vertex (graph theory); Pathwidth; Dominating set; Bounded function; Graph; Line graph; Graph power","score_opus":0.02828176812337445,"score_gpt":0.26735332624816743,"score_spread":0.23907155812479297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070790034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2841811,0.000095427706,0.61170113,0.0004913137,0.000058488495,0.001476066,0.000014183567,0.0005536824,0.1014286],"genre_scores_gemma":[0.7427121,0.000028874096,0.25656834,0.00015928043,0.000014732184,0.00013217801,0.0000022227339,0.000035852965,0.00034643628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99836105,0.000026354068,0.0002640777,0.00046134056,0.00044148008,0.0004456772],"domain_scores_gemma":[0.9984662,0.00048185614,0.00015306912,0.0006975153,0.000048220878,0.00015312791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033990838,0.00024583723,0.00028750615,0.00016257,0.00022269762,0.00016898013,0.0006218244,0.00006492148,0.000021042706],"category_scores_gemma":[0.000042766707,0.00018684231,0.0000404275,0.00050920923,0.00020284815,0.00020725149,0.00027487648,0.00027040506,0.000052501626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018855062,0.00006590782,0.000039727012,0.000115250055,0.000023834073,0.000014044375,0.0024472813,0.000026967522,0.0013966575,0.98908454,0.00014253378,0.0066244244],"study_design_scores_gemma":[0.0022695865,0.0007181376,0.00021076074,0.0002500798,0.0000320508,0.00007043511,0.0012278575,0.057621423,0.014541007,0.92113924,0.0009181075,0.0010013048],"about_ca_topic_score_codex":7.635042e-7,"about_ca_topic_score_gemma":0.0000018623377,"teacher_disagreement_score":0.458531,"about_ca_system_score_codex":0.000026916117,"about_ca_system_score_gemma":0.000009241199,"threshold_uncertainty_score":0.76192087},"labels":[],"label_agreement":null},{"id":"W2071324240","doi":"10.1016/s0166-218x(02)00249-4","title":"On sum coloring of graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":60,"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; Greedy coloring; Combinatorics; Complete coloring; Edge coloring; Brooks' theorem; Graph coloring; Fractional coloring; List coloring; Discrete mathematics; Chordal graph; Graph; 1-planar graph; Line graph","score_opus":0.023378729893770576,"score_gpt":0.28389298125915063,"score_spread":0.26051425136538003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071324240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061658956,0.000024777553,0.81294566,0.000026804362,0.00006946599,0.00036803976,0.0000028786546,0.00011251518,0.12479087],"genre_scores_gemma":[0.7817481,0.000007338932,0.21805319,0.00003338738,0.0000033792087,0.000041222298,7.3446716e-7,0.00001650128,0.00009613926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987206,0.000024882442,0.0002793568,0.00025697384,0.00040816603,0.00031005932],"domain_scores_gemma":[0.99853396,0.00039920717,0.00012889679,0.00080969,0.000044886623,0.00008334893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047370716,0.00014417803,0.00023234931,0.00015145952,0.000078008896,0.00003532603,0.0006841054,0.00004621054,0.000019933928],"category_scores_gemma":[0.00011869454,0.00012243225,0.00007165057,0.00053870026,0.00010558376,0.00009800998,0.00011715915,0.00014568807,0.000050799666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046773657,0.00006815993,0.0000067771352,0.00006232186,0.000013308774,0.0000019989982,0.00046060552,0.00011808136,0.0065126526,0.99222916,0.000035488443,0.00048679268],"study_design_scores_gemma":[0.00023706265,0.000057167115,0.0000108699005,0.000024652536,0.000003762979,0.000002832644,0.00016151702,0.0012420431,0.06939694,0.92856765,0.00016192286,0.0001335585],"about_ca_topic_score_codex":3.3076057e-7,"about_ca_topic_score_gemma":3.8208248e-7,"teacher_disagreement_score":0.72008914,"about_ca_system_score_codex":0.000018020228,"about_ca_system_score_gemma":0.000027352777,"threshold_uncertainty_score":0.49926424},"labels":[],"label_agreement":null},{"id":"W2071347182","doi":"10.1016/j.dam.2012.08.013","title":"Cyclotomic orthomorphisms of finite fields","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","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 Toronto","funders":"","keywords":"Mathematics; Prime (order theory); Cyclotomic field; Finite field; Cyclotomic polynomial; Index (typography); Discrete mathematics; Pure mathematics; Algebra over a field; Combinatorics; Mathematical analysis; Polynomial","score_opus":0.014880436468860397,"score_gpt":0.23108414275738287,"score_spread":0.21620370628852248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071347182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07716822,0.000051877774,0.88703763,0.000065426284,0.00018057787,0.00016731562,0.0000036079782,0.00012837851,0.035196975],"genre_scores_gemma":[0.8909673,0.000009597559,0.10879413,0.000108768676,0.000051706043,0.000021256476,0.0000021526823,0.000009957905,0.00003511452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991217,0.000013019785,0.00026841427,0.00013569536,0.00019020404,0.00027092313],"domain_scores_gemma":[0.9988818,0.00024191853,0.0001487783,0.0006199433,0.000019812374,0.00008773608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003624499,0.00013032176,0.00020980075,0.00008287257,0.00005928341,0.000027474485,0.0005673399,0.00006649368,0.000038031074],"category_scores_gemma":[0.000022434017,0.00011128647,0.00009968786,0.00028149807,0.00006366373,0.00015047593,0.00019626616,0.000099492856,0.00005701103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034716486,0.00008596964,0.000116285,0.00006452556,0.000019440797,4.5883553e-7,0.0025800408,0.000019835636,0.0018316989,0.9932378,0.00015964823,0.0018808575],"study_design_scores_gemma":[0.0007407462,0.00011086035,0.0008132159,0.00010124448,0.00008198294,0.000021689653,0.0005935106,0.009061312,0.0495854,0.9336101,0.004499764,0.00078021194],"about_ca_topic_score_codex":0.000001043582,"about_ca_topic_score_gemma":4.461463e-7,"teacher_disagreement_score":0.8137991,"about_ca_system_score_codex":0.0000057299703,"about_ca_system_score_gemma":0.000011720228,"threshold_uncertainty_score":0.45381305},"labels":[],"label_agreement":null},{"id":"W2076258407","doi":"10.1016/j.dam.2008.04.021","title":"Efficient algorithms for wavelength assignment on trees of rings","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Tree (set theory); Combinatorics","score_opus":0.0204723766676356,"score_gpt":0.23677624384754278,"score_spread":0.21630386717990718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076258407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13390835,0.0000447168,0.85642606,0.00002103754,0.000062097904,0.0006425811,0.000024224695,0.0005840553,0.00828686],"genre_scores_gemma":[0.6131443,0.00002947747,0.3866126,0.0000060441143,0.000020394411,0.000121269084,0.0000040823975,0.000038139136,0.000023748842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990534,0.0000012282045,0.0003094897,0.00015269654,0.00020509755,0.00027808695],"domain_scores_gemma":[0.9993384,0.00021901804,0.000060049206,0.00032251095,0.000018320598,0.000041734682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000663244,0.00019002327,0.00030215108,0.00005807288,0.000051494517,0.0000045070074,0.00018052984,0.00009048774,0.0000050036438],"category_scores_gemma":[0.000033512813,0.00015945858,0.000069694914,0.00011650021,0.00011055243,0.000010432595,0.000042222175,0.00011224089,0.000012861718],"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.000022238102,0.00020697198,0.000002602472,0.00045051315,0.00009981712,0.0000037286704,0.00095213304,0.6212817,0.011724879,0.34490725,0.0003905777,0.01995761],"study_design_scores_gemma":[0.00059114455,0.0001223467,0.000039999526,0.000080741534,0.000030119229,0.000003850323,0.00049392594,0.9206548,0.048835512,0.028404824,0.0004033116,0.0003394476],"about_ca_topic_score_codex":1.09979105e-7,"about_ca_topic_score_gemma":1.4910657e-7,"teacher_disagreement_score":0.47923592,"about_ca_system_score_codex":0.000051131596,"about_ca_system_score_gemma":0.0000043352393,"threshold_uncertainty_score":0.6502532},"labels":[],"label_agreement":null},{"id":"W2076513440","doi":"10.1016/j.dam.2006.03.003","title":"Approximating the minimum clique cover and other hard problems in subtree filament graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Chordal graph; Clique-sum; Mathematics; Indifference graph; Maximal independent set; Discrete mathematics; Split graph; Treewidth; Clique problem; Pathwidth; 1-planar graph; Graph; Line graph","score_opus":0.020750884686091344,"score_gpt":0.22998158125748325,"score_spread":0.2092306965713919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076513440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10796094,0.0002057042,0.85014164,0.00070420105,0.00010716792,0.0014552374,0.000017183094,0.0002213382,0.039186597],"genre_scores_gemma":[0.6056417,0.000014332367,0.39319196,0.0005228292,0.000058181493,0.00027903603,0.0000059313297,0.000036084733,0.00024990056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985053,0.000026550628,0.00047429165,0.0003504886,0.00030149752,0.00034190153],"domain_scores_gemma":[0.9989273,0.00023057996,0.00018960687,0.00059393345,0.000017516584,0.000041059564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057987124,0.00021655003,0.00025811957,0.00009369942,0.00015573908,0.00024426484,0.0006370632,0.00006557321,0.0000138129235],"category_scores_gemma":[0.000012639431,0.00015157867,0.00006397725,0.00038260786,0.00015446826,0.00011524486,0.0003132541,0.00019870077,0.000019785957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017754912,0.00011667181,0.0002513885,0.00014978785,0.000013177489,0.0000019342954,0.003088741,0.00028362236,0.0008692244,0.9933071,0.00033839326,0.0015781805],"study_design_scores_gemma":[0.0005134875,0.000028370889,0.0008223336,0.00010415833,0.000011267617,0.000013719565,0.00044486916,0.15848541,0.00081349513,0.8369189,0.0015112973,0.0003327076],"about_ca_topic_score_codex":0.000043792155,"about_ca_topic_score_gemma":0.000036459678,"teacher_disagreement_score":0.4976808,"about_ca_system_score_codex":0.000020555155,"about_ca_system_score_gemma":0.00001805483,"threshold_uncertainty_score":0.6181199},"labels":[],"label_agreement":null},{"id":"W2078743813","doi":"10.1016/j.dam.2011.12.018","title":"A survey of Nordhaus–Gaddum type relations","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":203,"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":"Mathematics; Graph; Combinatorics; Windmill graph; Complement (music); Chromatic scale; Petersen graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.03774536950012889,"score_gpt":0.26342814145880217,"score_spread":0.22568277195867328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078743813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2582674,0.0006784663,0.6819796,0.00020209588,0.0007047052,0.0006092923,0.000024897241,0.00043063867,0.057102922],"genre_scores_gemma":[0.83358335,0.000005235548,0.16618894,0.00004060925,0.0000043710616,0.000007796152,0.000012290223,0.000011330685,0.0001460929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990017,0.000021351665,0.00033513756,0.00014299124,0.00024517087,0.00025365394],"domain_scores_gemma":[0.9987857,0.00020773162,0.00017551263,0.00060972763,0.00011953277,0.00010180492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144947,0.000116116564,0.00019968348,0.0000787756,0.000072270224,0.000026784273,0.00036384616,0.00006438437,0.000024655796],"category_scores_gemma":[0.000104219784,0.00009633029,0.00003699962,0.0006097024,0.000051538158,0.00014099083,0.000159219,0.00009349909,0.00020543709],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020555672,0.00013360458,0.0012541863,0.00004188931,0.000022137918,1.3883174e-7,0.0016395922,0.000053854335,0.0024889142,0.99260086,0.0012648078,0.00049793243],"study_design_scores_gemma":[0.002084816,0.00027063902,0.06161675,0.00026193872,0.00019706125,0.000028061198,0.000726323,0.111061856,0.024224972,0.7949843,0.002511242,0.0020320576],"about_ca_topic_score_codex":0.000024247925,"about_ca_topic_score_gemma":0.000005002616,"teacher_disagreement_score":0.57531595,"about_ca_system_score_codex":0.0000087051385,"about_ca_system_score_gemma":0.00003353817,"threshold_uncertainty_score":0.39282352},"labels":[],"label_agreement":null},{"id":"W2079519561","doi":"10.1016/j.dam.2004.06.014","title":"The maximum traveling salesman problem on van der Veen matrices","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Travelling salesman problem; Mathematics; Combinatorics; Mathematical optimization","score_opus":0.010447572942887381,"score_gpt":0.21582752492751808,"score_spread":0.20537995198463072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079519561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012876841,0.00032443795,0.51622784,0.0004935429,0.00029809616,0.0013888946,0.000020686794,0.0014529553,0.46691668],"genre_scores_gemma":[0.85964066,0.00032157247,0.13913682,0.000124062,0.00012637222,0.00013571826,0.000035970585,0.0001651145,0.00031368516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990015,0.0000044962003,0.00031796438,0.00014741273,0.0002233568,0.0003052531],"domain_scores_gemma":[0.9994423,0.000085317224,0.000066305874,0.00031782594,0.000019499135,0.000068746194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001806532,0.00021115849,0.00017046295,0.000042818665,0.00020749026,0.00014338885,0.00023883542,0.000083194864,0.000024167346],"category_scores_gemma":[0.000007682089,0.00015083353,0.000054899538,0.00014841143,0.00004092612,0.0000451754,0.000025267731,0.00018709902,0.00025844475],"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.000007922476,0.00005950005,0.0000035867322,0.0004319504,0.000103942315,0.0000025427937,0.004828431,0.6693779,0.0010019625,0.3189401,0.0004103784,0.0048317285],"study_design_scores_gemma":[0.002728394,0.00013606103,0.000055416655,0.00064096827,0.00022210494,0.000026894782,0.0030263755,0.0945156,0.016191738,0.8574323,0.02332319,0.0017009588],"about_ca_topic_score_codex":0.0000011614126,"about_ca_topic_score_gemma":0.0000060373413,"teacher_disagreement_score":0.84676385,"about_ca_system_score_codex":0.00004844999,"about_ca_system_score_gemma":0.000013623352,"threshold_uncertainty_score":0.61508125},"labels":[],"label_agreement":null},{"id":"W2079563996","doi":"10.1016/s0166-218x(03)00395-0","title":"Stable sets in two subclasses of banner-free graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Banner; Mathematics; Combinatorics; Chordal graph; Cograph; Characterization (materials science); Indifference graph; Discrete mathematics; Class (philosophy); Graph; Split graph; Maximal independent set; Time complexity; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.022515680311258036,"score_gpt":0.3050782653327763,"score_spread":0.28256258502151826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079563996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18547592,0.00014569932,0.71644616,0.00007758721,0.00010418667,0.0008293482,0.000018189236,0.0001628876,0.096740015],"genre_scores_gemma":[0.680966,0.00001887391,0.31881842,0.00002506444,0.000002990723,0.000057347785,0.0000021568285,0.000022509941,0.0000866069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981265,0.000056457084,0.0004651551,0.00035518652,0.0004992122,0.00049746543],"domain_scores_gemma":[0.9978173,0.00039375233,0.00016918159,0.00145126,0.00006677754,0.00010175525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082559756,0.00020158886,0.00036524612,0.0002776547,0.000060627597,0.000056824392,0.0013610935,0.000046081543,0.000027867776],"category_scores_gemma":[0.0002002218,0.00017916263,0.000074062256,0.0011048968,0.00014973058,0.00025642506,0.00031868782,0.0002027367,0.000023302138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005242907,0.00010989974,0.000111545785,0.000116556104,0.00001204417,0.000003823075,0.00075790874,0.00017334921,0.007961789,0.99035376,0.000094575,0.00029951322],"study_design_scores_gemma":[0.0007039746,0.000026149359,0.000045008877,0.000035142424,0.0000043870527,0.0000044196527,0.0004002292,0.0033063074,0.05874416,0.93635875,0.00017340531,0.0001980872],"about_ca_topic_score_codex":0.000005870012,"about_ca_topic_score_gemma":0.000020786127,"teacher_disagreement_score":0.4954901,"about_ca_system_score_codex":0.000030847852,"about_ca_system_score_gemma":0.00007068823,"threshold_uncertainty_score":0.730604},"labels":[],"label_agreement":null},{"id":"W2079611596","doi":"10.1016/j.dam.2007.08.001","title":"Remembering Leo Khachiyan","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Colonial History and Postcolonial Studies","field":"Social Sciences","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":"Concordia University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.024020782059945272,"score_gpt":0.3174691964451673,"score_spread":0.293448414385222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079611596","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101141825,0.00010259934,0.0046031363,0.00036214478,0.0002983861,0.00035132738,0.0000025354987,0.00018751337,0.89295053],"genre_scores_gemma":[0.9858446,0.000042417716,0.009237204,0.00015092088,0.0004367552,0.000020533098,0.0000023333507,0.0000205153,0.0042447364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881035,0.000013920201,0.00025773258,0.00016283477,0.00033151847,0.00042362322],"domain_scores_gemma":[0.9993345,0.0002252214,0.00010508218,0.00017706912,0.00003522383,0.00012289424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011647502,0.00012355148,0.0001966843,0.00006579197,0.00094756467,0.000036368754,0.00021966973,0.00009129539,0.00014243406],"category_scores_gemma":[0.00010990681,0.00012094705,0.00006575075,0.00029373667,0.00027982597,0.00005940511,0.000067062676,0.00012826158,0.00016228],"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.000021758362,0.000051168514,0.00008234757,0.000037897953,0.000020874912,0.0000060354896,0.06350786,0.0000025634488,0.0012788,0.9290197,0.0008962503,0.0050747325],"study_design_scores_gemma":[0.00030842674,0.000039480357,0.00081066607,0.000036288446,0.000056199755,0.0000014920823,0.01728152,0.000009990821,0.0009549625,0.039598156,0.9404617,0.00044111846],"about_ca_topic_score_codex":0.00012751194,"about_ca_topic_score_gemma":0.0030923337,"teacher_disagreement_score":0.9395654,"about_ca_system_score_codex":0.00012885196,"about_ca_system_score_gemma":0.000045880195,"threshold_uncertainty_score":0.7287997},"labels":[],"label_agreement":null},{"id":"W2079817983","doi":"10.1016/j.dam.2013.03.028","title":"Some advances on Lovász–Schrijver semidefinite programming relaxations of the fractional stable set polytope","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Universidad Nacional de Rosario; Consejo Nacional de Investigaciones Científicas y Técnicas; Agencia Nacional de Promoción Científica y Tecnológica; University of Waterloo","keywords":"Polytope; Mathematics; Semidefinite programming; Combinatorics; Operator (biology); Hierarchy; Set (abstract data type); Relaxation (psychology); Birkhoff polytope; Regular polygon; Convex polytope; Discrete mathematics; Convex set; Convex optimization; Mathematical optimization; Computer science","score_opus":0.020210425048021223,"score_gpt":0.24943018901719527,"score_spread":0.22921976396917404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079817983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043443784,0.00048792624,0.9185532,0.0023474444,0.0008495175,0.0023597928,0.00007534251,0.00044112297,0.03144188],"genre_scores_gemma":[0.5301964,0.000050708175,0.46856883,0.00043514196,0.00012579419,0.00018967023,0.000013394779,0.000028190192,0.00039180642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986231,0.000018310258,0.00035525855,0.0002545057,0.00048204797,0.00026682866],"domain_scores_gemma":[0.99850506,0.00031165962,0.0003140876,0.00073904544,0.00007061661,0.000059527818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001543649,0.00016826736,0.00020382057,0.000075996024,0.00026619853,0.00013544703,0.0008040375,0.000055632536,0.000057275887],"category_scores_gemma":[0.000049800827,0.00011668023,0.00010610708,0.00044258262,0.00013235451,0.00051196956,0.00029199055,0.00022240357,0.000107286614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014228582,0.00010182347,0.000030356483,0.00006829491,0.000021360764,2.260267e-7,0.0007739148,0.0003925764,0.0008859453,0.991583,0.00040040383,0.005740693],"study_design_scores_gemma":[0.00034988442,0.00006055912,0.0006154577,0.00013450635,0.00002318585,0.000008013955,0.00073515147,0.03730858,0.007760743,0.9422966,0.010341799,0.00036549108],"about_ca_topic_score_codex":0.000015045589,"about_ca_topic_score_gemma":0.000003242292,"teacher_disagreement_score":0.48675266,"about_ca_system_score_codex":0.000022922364,"about_ca_system_score_gemma":0.00004039495,"threshold_uncertainty_score":0.47580817},"labels":[],"label_agreement":null},{"id":"W2080110511","doi":"10.1016/j.dam.2011.06.024","title":"Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cooperative Communication and Network Coding","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; Strong perfect graph theorem; Chordal graph; Indifference graph; Corollary; Cograph; Complement (music); Pathwidth; Discrete mathematics; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.04422250929995786,"score_gpt":0.2523215182814113,"score_spread":0.20809900898145345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080110511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13785529,0.00035498678,0.74369293,0.00055833935,0.0002592353,0.0011978179,0.0000427223,0.000504518,0.11553418],"genre_scores_gemma":[0.84199727,0.00015950568,0.15746145,0.0001768605,0.000018131066,0.0000712207,0.000026857391,0.000019780662,0.00006895829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877876,0.00003780398,0.000273921,0.0003254668,0.0003169791,0.00026708428],"domain_scores_gemma":[0.998519,0.00014180226,0.00015364152,0.0009825624,0.00008282697,0.0001201406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002820111,0.00022407848,0.0002370261,0.00010716524,0.00034932053,0.000114592745,0.00092369306,0.00004507789,0.00019655896],"category_scores_gemma":[0.00001619238,0.00017351151,0.000055432043,0.0003249517,0.00017846035,0.00026202077,0.00055887515,0.00024310335,0.000029039209],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019006584,0.00010006963,0.0004306226,0.000023927894,0.00007020419,0.0000017397615,0.0018984138,0.0000050412154,0.000159974,0.99331397,0.0016818505,0.0022951823],"study_design_scores_gemma":[0.011831732,0.0016986453,0.022375403,0.0008395866,0.00048780954,0.00017259465,0.008341454,0.10858427,0.0055429325,0.7988985,0.03734502,0.0038820496],"about_ca_topic_score_codex":0.000005816217,"about_ca_topic_score_gemma":0.00004113915,"teacher_disagreement_score":0.7041419,"about_ca_system_score_codex":0.000025685777,"about_ca_system_score_gemma":0.000034789984,"threshold_uncertainty_score":0.7075594},"labels":[],"label_agreement":null},{"id":"W2080125678","doi":"10.1016/j.dam.2008.07.006","title":"On the complexity of constructing Golomb Rulers","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":29,"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; University of Toronto; HEC Montréal","funders":"","keywords":"Golomb coding; Ruler; Mathematics; Completeness (order theory); Computational complexity theory; Theoretical computer science; Integer (computer science); Discrete mathematics; Combinatorics; Algorithm; Computer science; Artificial intelligence; Programming language","score_opus":0.03598714576227698,"score_gpt":0.20918483667840654,"score_spread":0.17319769091612955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080125678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80276626,0.00002081513,0.008605143,0.000018320578,0.00009257437,0.00025124237,0.000015896903,0.0001464064,0.1880833],"genre_scores_gemma":[0.99530107,0.00000505627,0.0045927907,0.000017739365,0.000017658274,0.000021468608,0.0000031988545,0.000023481158,0.000017547003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932396,0.000011040874,0.00027165978,0.000081149985,0.00015459553,0.00015757121],"domain_scores_gemma":[0.9993527,0.0002117843,0.00007334134,0.00031793746,0.0000124465205,0.000031808875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016919461,0.00013258132,0.0002258958,0.000031808166,0.00009066967,0.000007044916,0.00018037009,0.000046092307,0.00006353377],"category_scores_gemma":[0.000019404159,0.00009096726,0.000066571796,0.00011592406,0.0004184592,0.000017872037,0.000019740828,0.00012787053,0.000047332713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033074068,0.000011686093,0.0000093939025,0.0001453877,0.0000409656,0.0000010084041,0.001842098,0.0003650001,0.006255951,0.99098045,0.00027373,0.00007101888],"study_design_scores_gemma":[0.00067388616,0.000045751363,0.00010117256,0.00022657281,0.00005948499,0.00009371778,0.017458495,0.014250915,0.08896983,0.87716824,0.0003517145,0.0006002349],"about_ca_topic_score_codex":7.9977104e-7,"about_ca_topic_score_gemma":4.7016613e-7,"teacher_disagreement_score":0.19253477,"about_ca_system_score_codex":0.000010604042,"about_ca_system_score_gemma":0.000004793121,"threshold_uncertainty_score":0.3709537},"labels":[],"label_agreement":null},{"id":"W2080300451","doi":"10.1016/j.dam.2011.10.013","title":"Treewidth of Erdős–Rényi random graphs, random intersection graphs, and scale-free random graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Combinatorics; Mathematics; Treewidth; Clique-sum; Random graph; Partial k-tree; Chordal graph; 1-planar graph; Vertex (graph theory); Discrete mathematics; Indifference graph; Pathwidth; Graph; Line graph","score_opus":0.020404195276392634,"score_gpt":0.2513674268184035,"score_spread":0.23096323154201087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080300451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15437979,0.00042448097,0.82477236,0.000060368846,0.00025806582,0.0020304844,0.000036305766,0.00040060267,0.017637573],"genre_scores_gemma":[0.8502736,0.00032225047,0.14886795,0.000055330525,0.000017967775,0.00027634855,0.000012836237,0.000072797404,0.00010093358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996352,0.0001720025,0.0010676067,0.00082518044,0.00083375967,0.000749432],"domain_scores_gemma":[0.99616325,0.0008217583,0.0005601683,0.0019641728,0.00017753677,0.0003130985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017389157,0.00055264897,0.0011234429,0.000760114,0.00028242066,0.0001270175,0.0019049734,0.00019860228,0.000045395744],"category_scores_gemma":[0.00018758047,0.00045120984,0.00041971737,0.0013146128,0.00083826995,0.0005523868,0.0007939066,0.00044253113,0.000015762533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023801625,0.00033342585,0.00026062666,0.00044020175,0.00027718305,0.000011706918,0.009900179,0.000013515325,0.008789586,0.9699955,0.0002742955,0.007323595],"study_design_scores_gemma":[0.019129861,0.00018740774,0.00020668094,0.0001343097,0.000109845205,0.000038784878,0.0010452637,0.0036871112,0.017132433,0.95776665,0.00004376556,0.0005178716],"about_ca_topic_score_codex":0.00003064266,"about_ca_topic_score_gemma":0.00004573094,"teacher_disagreement_score":0.6958938,"about_ca_system_score_codex":0.00002885063,"about_ca_system_score_gemma":0.000045036824,"threshold_uncertainty_score":0.99979395},"labels":[],"label_agreement":null},{"id":"W2080754473","doi":"10.1016/j.dam.2011.03.017","title":"Acyclic chromatic indices of planar graphs with large girth","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Combinatorics; Edge coloring; Mathematics; Girth (graph theory); Planar graph; Directed acyclic graph; Graph; Chromatic scale; Discrete mathematics; Graph power; Line graph","score_opus":0.023512222786875547,"score_gpt":0.25689347813527696,"score_spread":0.23338125534840143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080754473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13274902,0.000053152544,0.8356657,0.000018402896,0.000024658362,0.00057526364,0.000015467587,0.00018426325,0.03071409],"genre_scores_gemma":[0.65156907,0.000010255076,0.34827,0.000028825192,0.000005312148,0.00005666043,0.00000388439,0.000023148998,0.00003286512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982074,0.000026159461,0.00039760856,0.00033823572,0.0005540469,0.00047657895],"domain_scores_gemma":[0.99825317,0.00016614323,0.00032561654,0.0010733466,0.000050711722,0.00013101521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043401594,0.000231269,0.00038388494,0.00024370254,0.00011107715,0.000038673672,0.0013807613,0.000065517335,0.000043792057],"category_scores_gemma":[0.000021825497,0.00016641903,0.00006812817,0.0007325074,0.00021529724,0.000279128,0.00022735425,0.00017973228,0.000054137334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018972136,0.0001801017,0.00019167019,0.00028526885,0.00006539164,0.000009953752,0.007549367,0.0000022075003,0.0017063186,0.9894678,0.000020598754,0.00050236617],"study_design_scores_gemma":[0.000820613,0.00022982297,0.00093133823,0.00012515718,0.000031579933,0.000021499745,0.0015170656,0.0021150848,0.021969052,0.9718056,0.000058521036,0.0003747175],"about_ca_topic_score_codex":0.000003418116,"about_ca_topic_score_gemma":0.000007428056,"teacher_disagreement_score":0.51882005,"about_ca_system_score_codex":0.000012699407,"about_ca_system_score_gemma":0.000040839932,"threshold_uncertainty_score":0.67863715},"labels":[],"label_agreement":null},{"id":"W2080824882","doi":"10.1016/j.dam.2005.09.009","title":"On constant composition codes","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":102,"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":"Army Research Office; Deutscher Akademischer Austauschdienst","keywords":"Mathematics; Constant (computer programming); Code word; Composition (language); Permutation (music); Alphabet; Combinatorics; Discrete mathematics; Block code; Linear code; Binary number; Arithmetic; Algorithm; Computer science; Decoding methods","score_opus":0.00705399009592934,"score_gpt":0.20282023286750203,"score_spread":0.1957662427715727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080824882","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35765138,0.00008586352,0.0759709,0.00004636375,0.00013739,0.0004417856,0.00004135806,0.0007366775,0.5648883],"genre_scores_gemma":[0.99432075,0.0000072616067,0.0054402165,0.000053546348,0.000053550444,0.000039777355,0.000017464243,0.000030426072,0.000037022608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993865,0.000005426346,0.00021745102,0.00009399831,0.00013001909,0.00016660824],"domain_scores_gemma":[0.9996109,0.00007931625,0.0000315451,0.00021909796,0.000008145667,0.000050967454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010969373,0.00014234982,0.00017965231,0.00004617134,0.00005477332,0.00003063506,0.000097282486,0.000047258512,0.00005909855],"category_scores_gemma":[0.0000021825222,0.00012472684,0.0000446947,0.00007196996,0.00003792154,0.00003392096,0.000009382373,0.00010604324,0.0003913412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065987692,0.00003343859,5.880394e-7,0.00013104636,0.000032219177,0.000001111959,0.00063527917,0.006736872,0.023184648,0.9667447,0.000816993,0.0016764922],"study_design_scores_gemma":[0.0018961901,0.000109419176,0.00003338526,0.00054001,0.00015066304,0.000046688412,0.001947574,0.20361522,0.19209038,0.58824086,0.00976173,0.001567861],"about_ca_topic_score_codex":1.305464e-7,"about_ca_topic_score_gemma":8.63115e-7,"teacher_disagreement_score":0.63666934,"about_ca_system_score_codex":0.000027421745,"about_ca_system_score_gemma":0.0000027134704,"threshold_uncertainty_score":0.5086213},"labels":[],"label_agreement":null},{"id":"W2081034336","doi":"10.1016/j.dam.2008.03.017","title":"Locating a minisum circle in the plane","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Plane (geometry); RADIUS; Combinatorics; Set (abstract data type); Great circle; Unit circle; Variable (mathematics); Circle packing; Geometry; Mathematical analysis; Computer science","score_opus":0.03351671842817862,"score_gpt":0.22889553057763515,"score_spread":0.19537881214945652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081034336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6181451,0.00004292719,0.010519283,0.0026171752,0.00019431228,0.0011207602,0.0000029785692,0.00020599389,0.36715147],"genre_scores_gemma":[0.99619734,0.0000074069985,0.0015704066,0.001751188,0.00016128269,0.00010777752,0.00003843008,0.000016450475,0.00014970802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988653,0.0000041999056,0.00035439464,0.00019557853,0.00032917722,0.0002513397],"domain_scores_gemma":[0.9994618,0.0000352689,0.000077277145,0.00039140173,0.000026765365,0.0000074520635],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045804115,0.00014073195,0.00016017638,0.00011337511,0.00019120984,0.000074489115,0.0003752837,0.000041201616,0.00017112114],"category_scores_gemma":[0.000053081207,0.0001113734,0.000043900887,0.0004500216,0.00006218231,0.00017586688,0.00010050814,0.00012529806,0.00091967545],"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.00003998884,0.0010191976,0.0019513418,0.0027829083,0.00006245323,0.000054497894,0.013617582,0.0023224084,0.0010178859,0.94459057,0.023922063,0.008619128],"study_design_scores_gemma":[0.0078278715,0.00007459597,0.10465835,0.00047587723,0.00051003625,0.0000728142,0.14636481,0.28351653,0.0008249249,0.18140464,0.26931477,0.004954801],"about_ca_topic_score_codex":0.00015574277,"about_ca_topic_score_gemma":0.00015588918,"teacher_disagreement_score":0.7631859,"about_ca_system_score_codex":0.000013825799,"about_ca_system_score_gemma":0.000008423365,"threshold_uncertainty_score":0.9998582},"labels":[],"label_agreement":null},{"id":"W2081336934","doi":"10.1016/j.dam.2013.11.018","title":"Directed weighted improper coloring for cellular channel allocation","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Wireless Network 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; École de Technologie Supérieure; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Fractional coloring; Integer (computer science); Complete coloring; Edge coloring; Discrete mathematics; Graph coloring; Channel (broadcasting); Graph; Integer programming; Set (abstract data type); Algorithm; Computer science; Line graph; Graph power","score_opus":0.008197128570197996,"score_gpt":0.1945219894499761,"score_spread":0.1863248608797781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081336934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032353796,0.000068252164,0.9602745,0.00002385846,0.00013938449,0.0014968425,0.0000068110744,0.00095784967,0.0046787118],"genre_scores_gemma":[0.72298276,0.000045778266,0.27483052,0.00001823128,0.0001375207,0.0015194499,0.00016879657,0.00013352984,0.00016338698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906766,0.000003248884,0.000312452,0.00017845453,0.00012638001,0.00031178907],"domain_scores_gemma":[0.99944246,0.00007026412,0.00007112417,0.00026379872,0.00008248717,0.00006985236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006509506,0.00021336143,0.00023073102,0.000059569273,0.000080998354,0.000049654922,0.00013515633,0.00010310496,0.000041742907],"category_scores_gemma":[0.000011428961,0.00019953922,0.00004382388,0.0001945586,0.00002286448,0.00015387668,0.000026466781,0.00008962646,0.00008244815],"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.000014079178,0.00008304878,0.000002167694,0.0011524413,0.00015891188,5.655337e-7,0.0019136661,0.5746847,0.38586575,0.027506175,0.0025551333,0.006063406],"study_design_scores_gemma":[0.00030917657,0.000010633354,0.000005028831,0.000032047068,0.000026825292,4.2698355e-7,0.00016067839,0.9279621,0.06260819,0.008347427,0.00028011916,0.00025731063],"about_ca_topic_score_codex":0.0000013196673,"about_ca_topic_score_gemma":9.3539313e-7,"teacher_disagreement_score":0.690629,"about_ca_system_score_codex":0.00006275829,"about_ca_system_score_gemma":0.000005915017,"threshold_uncertainty_score":0.81369734},"labels":[],"label_agreement":null},{"id":"W2083057776","doi":"10.1016/j.dam.2004.03.001","title":"A polynomial time algorithm for strong edge coloring of partial k-trees","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"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; Time complexity; Combinatorics; Enhanced Data Rates for GSM Evolution; Algorithm; Edge coloring; Polynomial; Discrete mathematics; Computer science; Artificial intelligence; Graph","score_opus":0.021726425792253926,"score_gpt":0.28840991294514706,"score_spread":0.26668348715289314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083057776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009031251,0.000020172636,0.9881418,0.00006132313,0.00006020797,0.00069817,0.000030477633,0.00010960066,0.0018470424],"genre_scores_gemma":[0.15952605,0.0000025629795,0.8400511,0.000013599912,0.00009003978,0.00018411268,0.000009347683,0.000029031784,0.000094133335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985113,0.000010098154,0.00038324416,0.0003157565,0.00033330644,0.00044626434],"domain_scores_gemma":[0.99882865,0.00023505127,0.00018092028,0.00058296975,0.00006440022,0.00010801823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003720706,0.00018139712,0.00033324544,0.00010851708,0.00011797958,0.000061914216,0.0008459535,0.000066495275,0.0000068759828],"category_scores_gemma":[0.00004005782,0.00016396993,0.00011585912,0.00027161595,0.00014545993,0.00019382984,0.0003090372,0.00011446675,0.00004541905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000369555,0.0002284888,0.0000020735429,0.0001414017,0.00008092541,0.000003875153,0.0021451805,0.001456008,0.041055772,0.9230317,0.00013063179,0.031687],"study_design_scores_gemma":[0.0041208393,0.00047994385,0.000023090934,0.00013571489,0.000057223035,0.000014576256,0.00064882485,0.27858278,0.34221375,0.37193027,0.0010065992,0.0007863742],"about_ca_topic_score_codex":0.0000017371608,"about_ca_topic_score_gemma":9.6151e-7,"teacher_disagreement_score":0.5511014,"about_ca_system_score_codex":0.000053310778,"about_ca_system_score_gemma":0.00008751987,"threshold_uncertainty_score":0.66865},"labels":[],"label_agreement":null},{"id":"W2083686860","doi":"10.1016/j.dam.2012.12.002","title":"Corner cuts are close to optimal: From solid grids to polygons and back","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Mathematics; Maximum cut; Cut; Minimum cut; Grid; Combinatorics; Limiting; Mathematical optimization; Graph; Geometry; Computer science","score_opus":0.015290763607425633,"score_gpt":0.2407192676714727,"score_spread":0.22542850406404707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083686860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44230333,0.0002794496,0.48142865,0.00042389487,0.00061678025,0.0014206626,0.00037782415,0.0008163924,0.072332986],"genre_scores_gemma":[0.70334786,0.00003210762,0.29530665,0.0003927421,0.00018655403,0.00007409401,0.00005115063,0.00011432468,0.0004944908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910194,0.0000043796745,0.00024754653,0.00015667306,0.0001374485,0.00035200582],"domain_scores_gemma":[0.99924386,0.00005323176,0.0000383277,0.00031480656,0.000018106792,0.00033167854],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008920736,0.00021347639,0.00026071948,0.00006933513,0.000049594768,0.000072830684,0.00012526612,0.00008568457,0.00018591227],"category_scores_gemma":[0.000015292717,0.00019915779,0.000031135914,0.00016271751,0.000017431385,0.000074605145,0.00008699874,0.00010362472,0.0010670742],"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.000107933214,0.0006323649,0.0017440565,0.0022838148,0.00081590115,0.000009415085,0.13307656,0.49092212,0.07901976,0.09533212,0.18957226,0.0064836815],"study_design_scores_gemma":[0.0066361567,0.00036521847,0.007286085,0.0024766321,0.0010789401,0.00007387201,0.025044622,0.45967865,0.13424441,0.02261271,0.3294658,0.011036896],"about_ca_topic_score_codex":0.0000028177578,"about_ca_topic_score_gemma":0.000003084351,"teacher_disagreement_score":0.26104456,"about_ca_system_score_codex":0.000023168457,"about_ca_system_score_gemma":0.0000042248053,"threshold_uncertainty_score":0.99971074},"labels":[],"label_agreement":null},{"id":"W2083923137","doi":"10.1016/j.dam.2007.03.005","title":"New classes of facets of the cut polytope and tightness of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si17.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant=\"italic\">mm</mml:mi><mml:mn>22</mml:mn></mml:mrow></mml:msub></mml:math> Bell inequalities","year":2007,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Geometric and Algebraic Topology","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Polytope; Scroll; Algorithm; Combinatorics; Theology","score_opus":0.021315821128699824,"score_gpt":0.2509121246194622,"score_spread":0.2295963034907624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083923137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.519935,0.0010566544,0.00428844,0.00035671066,0.0010900798,0.00007559297,0.00041373918,0.000118166536,0.4726656],"genre_scores_gemma":[0.9841162,0.000948399,0.011092313,0.0006144078,0.0008834517,0.00039983817,0.0004293973,0.00069240393,0.00082361524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9905845,0.00028320614,0.0029680661,0.0013522663,0.0026254733,0.0021864988],"domain_scores_gemma":[0.98892075,0.0033767906,0.0038242224,0.0028141807,0.00020891541,0.0008551513],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026289087,0.0009687947,0.0006788192,0.0006818438,0.00092885626,0.0005927958,0.002318484,0.0023074113,0.27500045],"category_scores_gemma":[0.0020856054,0.0015615963,0.0015400366,0.0015719854,0.0023493292,0.00077649753,0.0024434414,0.0013326659,0.0005481274],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070795265,0.00043081935,0.0000135655755,0.0049104947,0.0017721717,0.00025500418,0.0069411835,0.00019430522,0.004110515,0.8488172,0.13077553,0.0010712214],"study_design_scores_gemma":[0.0022348857,0.0011180236,0.000076456665,0.0016275679,0.0022136627,0.00073995173,0.010765241,0.007171595,0.96702766,0.0044253883,0.0011807252,0.0014188194],"about_ca_topic_score_codex":0.0011640466,"about_ca_topic_score_gemma":0.00088216166,"teacher_disagreement_score":0.96291715,"about_ca_system_score_codex":0.000014848378,"about_ca_system_score_gemma":0.0014380213,"threshold_uncertainty_score":0.9989878},"labels":[],"label_agreement":null},{"id":"W2084877920","doi":"10.1016/j.dam.2003.04.004","title":"Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Saskatchewan","funders":"","keywords":"Mathematics; Combinatorics; Bounded function; Embedding; Complement (music); Discrete mathematics; Domination analysis; Graph; Pathwidth; Trapezoid graph; Dominating set; Chordal graph; 1-planar graph; Line graph; Computer science","score_opus":0.02394368564801446,"score_gpt":0.29349967969196944,"score_spread":0.26955599404395497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084877920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37627882,0.00049694785,0.60084635,0.00030486734,0.00011461545,0.002898001,0.00004754937,0.00008082621,0.018932024],"genre_scores_gemma":[0.89646184,0.00004978726,0.10327468,0.00007250009,0.0000028825336,0.00009941656,0.0000026581813,0.0000173077,0.000018944249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762017,0.00017180448,0.0007677817,0.00031215732,0.0007195714,0.00040853667],"domain_scores_gemma":[0.9971418,0.0011044045,0.0005540851,0.0010213804,0.00011497069,0.00006335307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020248396,0.00023312138,0.00050223776,0.00011283722,0.00035229986,0.00008018325,0.0013144335,0.000035962625,0.000017615655],"category_scores_gemma":[0.00009769395,0.000136126,0.0001315771,0.0007215348,0.001066679,0.00013361564,0.0003277353,0.00020378403,0.0000020725404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002703545,0.00006890589,0.00007414124,0.00015340529,0.00007264599,4.4505182e-7,0.0047020023,0.000023521217,0.0039649354,0.98965913,0.000020724488,0.0012330794],"study_design_scores_gemma":[0.0022522523,0.000043827953,0.00017262336,0.000062418054,0.00002897272,0.000006518,0.0024178075,0.00581624,0.011691792,0.97724336,0.00010487588,0.00015931312],"about_ca_topic_score_codex":0.0000060908997,"about_ca_topic_score_gemma":0.0000066031034,"teacher_disagreement_score":0.52018297,"about_ca_system_score_codex":0.000011250863,"about_ca_system_score_gemma":0.00003160365,"threshold_uncertainty_score":0.5551057},"labels":[],"label_agreement":null},{"id":"W2085363133","doi":"10.1016/j.dam.2014.05.018","title":"Tight lower bounds on broadcast function for<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>=</mml:mo><mml:mn>24</mml:mn></mml:math>and 25","year":2014,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Monotone polygon; Function (biology); Combinatorics; Upper and lower bounds; Algorithm; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.011757781158669128,"score_gpt":0.21539413493358425,"score_spread":0.20363635377491512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085363133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9445982,0.0005433555,0.022449324,0.00012481399,0.0025392752,0.00026575127,0.00039086642,0.00041944627,0.028668942],"genre_scores_gemma":[0.99154603,0.00024239878,0.0038795972,0.00040314338,0.001441219,0.00095310697,0.00057440664,0.00060025736,0.0003598408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944475,0.00010710991,0.0015443059,0.0011874175,0.0012324527,0.0014811745],"domain_scores_gemma":[0.99564034,0.0010347096,0.0010196035,0.0016354905,0.00009720359,0.0005726557],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016091838,0.001008482,0.00064053445,0.0002765567,0.001100592,0.00090340234,0.00086613256,0.0014266558,0.00034564067],"category_scores_gemma":[0.00032379088,0.0012975751,0.00095531496,0.0004903816,0.00055997266,0.0005155384,0.0005021945,0.0011176828,0.0015659838],"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.0006944376,0.0002856795,0.0000022621223,0.003427464,0.00097632775,0.00005075746,0.0025439546,0.0017480348,0.004466701,0.9795765,0.0046899063,0.0015379647],"study_design_scores_gemma":[0.002557328,0.001357952,0.00001902785,0.0018244041,0.0016734636,0.00029363603,0.0023244182,0.9011054,0.041433543,0.025143322,0.020474069,0.0017934041],"about_ca_topic_score_codex":0.000061910236,"about_ca_topic_score_gemma":0.00006402088,"teacher_disagreement_score":0.9544332,"about_ca_system_score_codex":0.00003361874,"about_ca_system_score_gemma":0.0001684561,"threshold_uncertainty_score":0.9998697},"labels":[],"label_agreement":null},{"id":"W2085493165","doi":"10.1016/j.dam.2015.01.022","title":"Polynomial-time algorithms for minimum weighted colorings of (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mrow><mml:mover accent=\"false\"><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mo accent=\"true\">¯</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs and similar graph classes","year":2015,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Mathematics; Graph; Combinatorics; Discrete mathematics","score_opus":0.023608886727163506,"score_gpt":0.25954621043510984,"score_spread":0.23593732370794634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085493165","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24948211,0.0035601635,0.0065392624,0.0015712916,0.005679355,0.0002537287,0.0023796633,0.00091043103,0.729624],"genre_scores_gemma":[0.9551294,0.0042830915,0.019144084,0.003168785,0.003967896,0.005743261,0.004238877,0.003394618,0.000929979],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96865004,0.0014719625,0.006356198,0.006139939,0.008941637,0.008440229],"domain_scores_gemma":[0.971925,0.0068569323,0.0075864596,0.007996673,0.00090633077,0.004728573],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0069834664,0.0032509118,0.0013592871,0.0026904226,0.00456977,0.0055365255,0.010408864,0.0072016693,0.704804],"category_scores_gemma":[0.0058563002,0.006691932,0.006052366,0.00543811,0.0073746466,0.005439936,0.0100232735,0.005202801,0.0031547374],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0054570385,0.001072909,0.000023246359,0.003814163,0.0050587594,0.0022013632,0.0040952493,0.0021037809,0.0068271128,0.394876,0.57130915,0.0031612185],"study_design_scores_gemma":[0.007747171,0.0048027346,0.00010080198,0.0031696262,0.0048109055,0.0029912083,0.0056449366,0.036423184,0.91846836,0.0023481105,0.007592961,0.0059000254],"about_ca_topic_score_codex":0.00255548,"about_ca_topic_score_gemma":0.002780441,"teacher_disagreement_score":0.91164124,"about_ca_system_score_codex":0.00007177973,"about_ca_system_score_gemma":0.0051111863,"threshold_uncertainty_score":0.9980218},"labels":[],"label_agreement":null},{"id":"W2085596541","doi":"10.1016/j.dam.2012.08.006","title":"Spanning cactus of a graph: Existence, extension, optimization, and approximation","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cactus; Mathematics; Extension (predicate logic); Combinatorics; Graph; Approximation algorithm; Discrete mathematics; Botany; Computer science","score_opus":0.02074061584606133,"score_gpt":0.2399834890233004,"score_spread":0.2192428731772391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085596541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024858855,0.00008571642,0.9882784,0.00005283617,0.00007052931,0.00023830477,0.0000030122571,0.00007779171,0.0087075345],"genre_scores_gemma":[0.12587123,0.000032705982,0.8739001,0.000046763063,0.000028183995,0.000021220858,0.000020542442,0.000010504383,0.00006873009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909633,0.000007650999,0.00027424074,0.00017837074,0.00023243997,0.00021094218],"domain_scores_gemma":[0.9991929,0.000047179063,0.0001986377,0.0004476059,0.00004324532,0.00007042414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034162262,0.00012168748,0.0001780012,0.00011097939,0.00007763946,0.00008002785,0.00030594665,0.000034321074,0.0000074414297],"category_scores_gemma":[0.000023827663,0.00010290393,0.000025863052,0.00031080612,0.000054737466,0.0006169929,0.00027134563,0.000047960446,0.0000073241863],"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.0000013539758,0.000082319355,0.000043787095,0.00021207152,0.000021014486,4.426181e-7,0.0026664927,0.0005712854,0.0004664937,0.99112076,0.0002901812,0.004523812],"study_design_scores_gemma":[0.0006989551,0.000043002496,0.0006672897,0.0001327848,0.00008886499,0.000015793808,0.0017845393,0.9120639,0.0037282782,0.07943239,0.0007572894,0.0005869344],"about_ca_topic_score_codex":0.0000015416464,"about_ca_topic_score_gemma":1.0594737e-7,"teacher_disagreement_score":0.9116884,"about_ca_system_score_codex":0.0000058261508,"about_ca_system_score_gemma":0.0000061270734,"threshold_uncertainty_score":0.41963002},"labels":[],"label_agreement":null},{"id":"W2086423153","doi":"10.1016/j.dam.2009.10.001","title":"On end-vertices of Lexicographic Breadth First Searches","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Lexicographical order; Combinatorics; Mathematics; Set (abstract data type); Computer science; Graph; Programming language","score_opus":0.01951648551427771,"score_gpt":0.2548718604261763,"score_spread":0.23535537491189862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086423153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033720132,0.00008197719,0.9358148,0.0005215125,0.00006730043,0.00034293567,0.000020304415,0.00020085758,0.029230198],"genre_scores_gemma":[0.81986827,0.000029561656,0.17988713,0.00013486383,0.000022665203,0.000009477844,0.000009131013,0.000008524303,0.000030358184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873066,0.000009416095,0.00028385117,0.00027887843,0.00044983855,0.00024738014],"domain_scores_gemma":[0.9987208,0.00019887464,0.00014899304,0.0008118657,0.000032201264,0.000087221175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020982312,0.00016466425,0.00024276857,0.000114632065,0.00011248778,0.000086449814,0.00088031957,0.00005725083,0.000022769971],"category_scores_gemma":[0.000020550331,0.00012332661,0.00007292293,0.00031823097,0.00006542337,0.00018709083,0.00017683467,0.0001188206,0.00003061034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008738044,0.00022677776,0.0000049842515,0.000080692495,0.000014525974,0.0000029750147,0.0012527963,0.00008884737,0.0018249819,0.9697892,0.0004998108,0.026205692],"study_design_scores_gemma":[0.0010076178,0.0005809488,0.0018896767,0.0004075129,0.000038975813,0.000013020035,0.000384419,0.16455992,0.036159236,0.7927166,0.0015447498,0.0006972972],"about_ca_topic_score_codex":0.0000061396063,"about_ca_topic_score_gemma":0.0000021777196,"teacher_disagreement_score":0.78614813,"about_ca_system_score_codex":0.000010236266,"about_ca_system_score_gemma":0.000020441492,"threshold_uncertainty_score":0.5029113},"labels":[],"label_agreement":null},{"id":"W2086552038","doi":"10.1016/j.dam.2006.06.009","title":"The strong metric dimension of graphs and digraphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":174,"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 Winnipeg","funders":"","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Distance; Discrete mathematics; Neighbourhood (mathematics); Graph; Bound graph; Shortest path problem; Graph power; Line graph; Pathwidth","score_opus":0.008347250750734546,"score_gpt":0.21421262712170225,"score_spread":0.2058653763709677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086552038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6925774,0.003601594,0.2745395,0.0005425427,0.00027679768,0.0009538907,0.000008588398,0.0004828445,0.027016804],"genre_scores_gemma":[0.9306274,0.000057508416,0.069221154,0.000018867893,0.000002201849,0.000015225818,0.000002079149,0.000010316456,0.000045267643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881035,0.000013140202,0.0003789237,0.00023085652,0.00032900125,0.00023773294],"domain_scores_gemma":[0.99882126,0.00029259545,0.00021010832,0.0005715071,0.000054301036,0.00005023105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065869,0.00014595897,0.00020046235,0.00014630095,0.00022937453,0.000099925994,0.0003833493,0.000047623704,7.318373e-7],"category_scores_gemma":[0.000018205781,0.00009072653,0.000064697815,0.0006811886,0.00016285264,0.000077242556,0.00019750609,0.000085359985,0.000004098014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015794146,0.00003525169,0.00006343639,0.000032266133,0.000012271606,4.6491726e-7,0.00013898789,0.00006636246,0.0049354685,0.9928786,0.00020957975,0.0016257421],"study_design_scores_gemma":[0.00028428162,0.00003318073,0.0002894914,0.000025324545,0.000023541554,0.0000046399273,0.00017969194,0.016816163,0.007935799,0.97415024,0.000106823296,0.000150814],"about_ca_topic_score_codex":0.000018879104,"about_ca_topic_score_gemma":0.0000040863715,"teacher_disagreement_score":0.23804992,"about_ca_system_score_codex":0.000004385972,"about_ca_system_score_gemma":0.000011816643,"threshold_uncertainty_score":0.36997205},"labels":[],"label_agreement":null},{"id":"W2087681531","doi":"10.1016/j.dam.2010.02.010","title":"Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments","year":2010,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tardiness; Scheduling (production processes); Mathematical optimization; Due date; Job shop scheduling; Mathematics; Computer science; Time complexity; Assignment problem; Algorithm; Schedule","score_opus":0.009948922805564427,"score_gpt":0.2184411400504964,"score_spread":0.20849221724493197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087681531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1603629,0.000023209914,0.83589494,0.00008682292,0.000288149,0.0008043498,0.000024759818,0.00015571644,0.0023591355],"genre_scores_gemma":[0.3226943,0.000023714307,0.67682433,0.00004973195,0.00004673605,0.00022428857,0.00003505782,0.000067771165,0.000034087676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988386,0.0000058362966,0.00037879738,0.00026216905,0.00019531605,0.00031928063],"domain_scores_gemma":[0.9994098,0.000050104725,0.000048322596,0.0003244211,0.000007783278,0.00015958556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023615085,0.00024756306,0.0003016228,0.00011743885,0.000053889187,0.00010406691,0.00016867944,0.00012304987,0.00006625822],"category_scores_gemma":[0.000024596715,0.00024176348,0.000024016494,0.00016417529,0.000036188143,0.00006689131,0.00009181164,0.0002507551,0.00006359245],"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.000033044304,0.0002593854,0.00016287455,0.0007198656,0.0001246895,0.000025868103,0.0076405895,0.766657,0.20680839,0.0063427263,0.00005893224,0.011166651],"study_design_scores_gemma":[0.0018349678,0.000021430611,0.00045656253,0.00015665586,0.00005843537,0.000026049938,0.0010276833,0.96859866,0.022167437,0.003365347,0.0013727307,0.00091406616],"about_ca_topic_score_codex":0.000003373413,"about_ca_topic_score_gemma":0.00000551434,"teacher_disagreement_score":0.20194164,"about_ca_system_score_codex":0.000026816419,"about_ca_system_score_gemma":0.0000075978787,"threshold_uncertainty_score":0.9858829},"labels":[],"label_agreement":null},{"id":"W2088030665","doi":"10.1016/s0166-218x(99)00167-5","title":"Naturally submodular digraphs and forbidden digraph configurations","year":2000,"lang":"en","type":"article","venue":"Discrete Applied 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 British Columbia","funders":"","keywords":"Digraph; Submodular set function; Mathematics; Combinatorics; Characterization (materials science); Class (philosophy); Directed graph; Discrete mathematics; Property (philosophy); Graph; Computer science","score_opus":0.010686594292096537,"score_gpt":0.25419747432809087,"score_spread":0.24351088003599433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088030665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1766587,0.0005213794,0.6902324,0.0008015665,0.00007217102,0.0014232184,0.00002970809,0.0006978816,0.12956299],"genre_scores_gemma":[0.8494765,0.0001567313,0.1494817,0.00015929,0.000025104158,0.0001120118,0.000013518541,0.000029142084,0.000545994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841046,0.000021354042,0.00031200942,0.00042421828,0.000403963,0.00042800594],"domain_scores_gemma":[0.9986724,0.00019372387,0.00007606129,0.00083755807,0.000050726754,0.00016950906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025057295,0.00022614586,0.00025392673,0.00015052508,0.0002586173,0.00026367302,0.000807467,0.000081859434,0.000097761345],"category_scores_gemma":[0.000024008234,0.00019070586,0.000080314865,0.0005590107,0.00023525643,0.0003951804,0.00013560356,0.00022551259,0.00008523723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067020933,0.000038150705,0.0000103190805,0.00004247669,0.000029006113,0.000005690098,0.0011577276,0.000024310333,0.0047765784,0.97408086,0.00009941094,0.019728778],"study_design_scores_gemma":[0.0004900868,0.000049476097,0.00045870827,0.00002989416,0.000016811418,0.00003391979,0.00024708256,0.011851064,0.0037767033,0.98033214,0.0022953197,0.0004187756],"about_ca_topic_score_codex":0.000002183048,"about_ca_topic_score_gemma":0.000004142028,"teacher_disagreement_score":0.6728178,"about_ca_system_score_codex":0.000011821272,"about_ca_system_score_gemma":0.000023175195,"threshold_uncertainty_score":0.7776759},"labels":[],"label_agreement":null},{"id":"W2088080526","doi":"10.1016/j.dam.2006.11.011","title":"On dimensional rigidity of bar-and-joint frameworks","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":40,"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 Windsor","funders":"","keywords":"Combinatorics; Mathematics; Semidefinite programming; Rigidity (electromagnetism); Graph; Undirected graph; Discrete mathematics; Mathematical optimization; Physics","score_opus":0.007634329035387115,"score_gpt":0.21090468980229823,"score_spread":0.20327036076691113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088080526","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69887483,0.000039187573,0.28851578,0.000017267326,0.000060860817,0.00012285811,0.000006364744,0.000081911494,0.012280917],"genre_scores_gemma":[0.9394675,0.000010819529,0.060428347,0.000028259694,0.000024773992,0.0000024732012,0.000012027834,0.00001498355,0.000010842893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936795,0.0000014809408,0.00026462015,0.00008706313,0.0001600484,0.000118819975],"domain_scores_gemma":[0.99964577,0.000093150506,0.00005235388,0.0001442129,0.00001836228,0.000046131114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000129564,0.00010791922,0.00020140636,0.000051273226,0.000028667211,0.000009411853,0.00004141165,0.00010860924,0.00008887599],"category_scores_gemma":[0.000018346198,0.00008234496,0.00004598448,0.00009021073,0.00003060533,0.000019515837,0.000019880994,0.00014730134,0.0000092759155],"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.000021266937,0.000047112753,0.000031772735,0.00039108566,0.00016094984,0.000002338653,0.0009419931,0.21553537,0.0220779,0.7550527,0.0005624204,0.00517509],"study_design_scores_gemma":[0.0005330871,0.000046986883,0.0028379643,0.00015835128,0.00015296499,0.000005685677,0.00036924754,0.688266,0.076733455,0.23027974,0.000081917184,0.0005345921],"about_ca_topic_score_codex":9.90245e-7,"about_ca_topic_score_gemma":0.0000010026744,"teacher_disagreement_score":0.52477294,"about_ca_system_score_codex":0.000013767784,"about_ca_system_score_gemma":0.0000018780389,"threshold_uncertainty_score":0.335793},"labels":[],"label_agreement":null},{"id":"W2089589410","doi":"10.1016/j.dam.2012.07.001","title":"Distance edge-colourings and matchings","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Random graph; Upper and lower bounds; Counterexample; Bounded function; Conjecture; Chromatic scale; Matching (statistics); Discrete mathematics; Edge coloring; Graph; Line graph; Statistics; Graph power","score_opus":0.018994174500257012,"score_gpt":0.2721251010885043,"score_spread":0.25313092658824726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089589410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440434,0.00035494706,0.04226127,0.00010515414,0.00028315367,0.00065809395,0.000014225357,0.0003039509,0.111975856],"genre_scores_gemma":[0.86999756,0.00002884116,0.1290324,0.00014241472,0.000167257,0.000056078563,0.0000034943141,0.00006997673,0.0005019646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848825,0.000015954674,0.0004139466,0.00023598428,0.00030174706,0.0005441114],"domain_scores_gemma":[0.9985875,0.0004401245,0.00022239285,0.00051999674,0.000024975938,0.00020504296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054835243,0.00031118907,0.00041639846,0.00006575129,0.0003327286,0.000057091383,0.00025899382,0.00013282784,0.00008471284],"category_scores_gemma":[0.00012344142,0.00024000244,0.00008430571,0.000121794605,0.00020239704,0.00016094073,0.00028251874,0.0002381613,0.000021539592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011740864,0.00006882618,0.00024826906,0.00042672982,0.000043674267,9.108802e-7,0.00964825,1.9990208e-7,0.0005683349,0.98729897,0.00085783587,0.0008262645],"study_design_scores_gemma":[0.00032095716,0.000012808418,0.00030388436,0.000052739793,0.000092981325,0.000029763436,0.0011493523,0.00009558077,0.0014249872,0.99200594,0.0041362927,0.0003747098],"about_ca_topic_score_codex":0.0000018432236,"about_ca_topic_score_gemma":9.576011e-7,"teacher_disagreement_score":0.11147389,"about_ca_system_score_codex":0.000027752094,"about_ca_system_score_gemma":0.0000074334266,"threshold_uncertainty_score":0.97870153},"labels":[],"label_agreement":null},{"id":"W2089762633","doi":"10.1016/s0166-218x(02)00240-8","title":"Tight bounds for synchronous communication of information using bits and silence","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Oracle; Communication complexity; Mathematics; Upper and lower bounds; Constant (computer programming); Broadcast communication network; Telecommunications network; Computational complexity theory; Discrete mathematics; Computer science; Combinatorics; Algorithm; Computer network","score_opus":0.021449610106186193,"score_gpt":0.23441759657590241,"score_spread":0.2129679864697162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089762633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017838081,0.00011151012,0.975778,0.000049133283,0.000060463066,0.00033600326,0.0000038053277,0.000039985134,0.005783048],"genre_scores_gemma":[0.8107544,0.000025407639,0.18910517,0.000035529596,0.000014381519,0.000029281973,0.0000033357544,0.0000046737637,0.000027831933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933815,0.000008784538,0.00034043577,0.00008396627,0.00011519155,0.00011346934],"domain_scores_gemma":[0.9991638,0.0001155425,0.00025113017,0.00037070524,0.00007025161,0.00002858146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021861916,0.00008216797,0.00015441256,0.000059811042,0.00012406072,0.00011155685,0.00027072043,0.000048907405,0.000005854231],"category_scores_gemma":[0.000015969465,0.00007206717,0.000029377174,0.00012248626,0.000040556064,0.00038788686,0.00008614131,0.000043744298,0.0000052329665],"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.00000261651,0.00003876331,0.0000063026814,0.00045957242,0.000022940629,7.008958e-8,0.013880256,0.0006705431,0.0013124979,0.9721498,0.00055680313,0.010899863],"study_design_scores_gemma":[0.00020324723,0.000028553373,0.0000066348016,0.000086584936,0.000009308985,0.000009810159,0.0004886474,0.9864213,0.000979583,0.010948815,0.00071460876,0.00010291717],"about_ca_topic_score_codex":0.000005118908,"about_ca_topic_score_gemma":0.0000013886947,"teacher_disagreement_score":0.98575073,"about_ca_system_score_codex":0.000020172545,"about_ca_system_score_gemma":0.0000068227264,"threshold_uncertainty_score":0.2938814},"labels":[],"label_agreement":null},{"id":"W2090354123","doi":"10.1016/j.dam.2008.08.020","title":"Finding a maximum-weight induced <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-partite subgraph of an <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>i</mml:mi></mml:math>-triangulated graph","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Bipartite graph; Mathematics; Clique graph; Block graph; Complete bipartite graph; Discrete mathematics; Graph; Line graph; Induced subgraph isomorphism problem; Induced subgraph; Cograph; Split graph; Algorithm; Pathwidth; Graph power; Voltage graph; Vertex (graph theory)","score_opus":0.02428673182251163,"score_gpt":0.2640691380083284,"score_spread":0.23978240618581675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090354123","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97334725,0.00052668323,0.019653603,0.00025940523,0.0011893627,0.00056171336,0.0005081231,0.0009154497,0.0030384143],"genre_scores_gemma":[0.95440567,0.0007348263,0.040190738,0.0006572672,0.0008204988,0.0013190272,0.00091722026,0.0008157726,0.00013896321],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9855136,0.00037874837,0.0035016886,0.003028392,0.0040812446,0.0034962695],"domain_scores_gemma":[0.98768705,0.0019259091,0.0031893393,0.0053435205,0.0003877395,0.0014664606],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0031270324,0.0019912848,0.0014919672,0.0011217437,0.0023469704,0.0012182617,0.0047182715,0.0021068447,0.000118104464],"category_scores_gemma":[0.0010203985,0.0023285223,0.0020679825,0.0031445224,0.0019301878,0.002524408,0.0031141199,0.0025895156,0.0015695938],"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.0011014355,0.0010559378,0.000021169553,0.0014698628,0.0012017116,0.0010432312,0.004969268,0.0020233013,0.01869962,0.9666998,0.00040554555,0.0013091208],"study_design_scores_gemma":[0.0032808424,0.0012174633,0.000098545504,0.0011549502,0.00070186047,0.0009871499,0.0013258646,0.920936,0.050495762,0.016922392,0.0008316389,0.0020475294],"about_ca_topic_score_codex":0.0002684254,"about_ca_topic_score_gemma":0.00020212322,"teacher_disagreement_score":0.9497774,"about_ca_system_score_codex":0.00009110833,"about_ca_system_score_gemma":0.0011587484,"threshold_uncertainty_score":0.99981856},"labels":[],"label_agreement":null},{"id":"W2091219277","doi":"10.1016/j.dam.2014.05.040","title":"Partial-route inequalities for the multi-vehicle routing problem with stochastic demands","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vehicle routing problem; Bounding overwatch; Mathematical optimization; Stochastic programming; Integer (computer science); Routing (electronic design automation); Integer programming; Reduction (mathematics); Point (geometry); Mathematics; Computer science","score_opus":0.026159374279052298,"score_gpt":0.2626392306662744,"score_spread":0.23647985638722213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091219277","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059814285,0.000026915513,0.99087834,0.00006958783,0.000053219603,0.00088239525,0.000014116152,0.00049878086,0.001595222],"genre_scores_gemma":[0.5127568,0.00000194009,0.48663685,0.000036648413,0.00007553615,0.00032850416,0.000010842416,0.000082674174,0.00007020049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869883,0.000024506071,0.0004410709,0.00020479382,0.00021864093,0.00041214188],"domain_scores_gemma":[0.9983354,0.00097469613,0.00013293166,0.0004287099,0.00005643165,0.00007182912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009655498,0.000263066,0.00031796255,0.000041177995,0.00023842067,0.00011638054,0.00025641397,0.00008185057,0.000009693384],"category_scores_gemma":[0.0001259515,0.00017745324,0.00005983283,0.00017510162,0.00007233861,0.00007114931,0.000050700106,0.00016160765,0.0000110768015],"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.000012087344,0.000022627359,0.000023269948,0.00041015542,0.00009351936,1.2618237e-7,0.0040194276,0.8886623,0.0008881684,0.10336899,0.000044546352,0.0024547928],"study_design_scores_gemma":[0.00079512276,0.000027958622,0.000016986965,0.00007635022,0.000108300424,0.0000024265034,0.0011497635,0.99312085,0.0017466827,0.002461174,0.00021203181,0.00028232767],"about_ca_topic_score_codex":0.0000029158018,"about_ca_topic_score_gemma":0.0000064678648,"teacher_disagreement_score":0.5067754,"about_ca_system_score_codex":0.000035921614,"about_ca_system_score_gemma":0.000014986686,"threshold_uncertainty_score":0.72363335},"labels":[],"label_agreement":null},{"id":"W2091612923","doi":"10.1016/s0166-218x(00)00281-x","title":"Diameter determination on restricted graph families","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":85,"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":"Chordal graph; Interval graph; Mathematics; Combinatorics; Split graph; Pathwidth; Indifference graph; Cograph; Induced subgraph; Block graph; Distance-hereditary graph; Discrete mathematics; Vertex (graph theory); Maximal independent set; Graph; Line graph; 1-planar graph; Graph power","score_opus":0.024168770563783654,"score_gpt":0.28948888538458695,"score_spread":0.2653201148208033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091612923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044157594,0.0000143092,0.9121478,0.00014719022,0.000066400586,0.00042985778,0.0000034146674,0.0003084668,0.042724945],"genre_scores_gemma":[0.6190067,0.00010450478,0.37999418,0.00023252814,0.00004612732,0.00017734118,0.000010482867,0.000042286254,0.00038584418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982558,0.00003288014,0.0003187881,0.00041088456,0.00055737863,0.00042430032],"domain_scores_gemma":[0.99822783,0.00044852577,0.00013223621,0.0010134149,0.00006438152,0.00011363586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441877,0.00022147517,0.00022826814,0.00036910587,0.00016262142,0.00014638022,0.00094986067,0.00007966034,0.000017021912],"category_scores_gemma":[0.00010787652,0.00018452026,0.00008407115,0.0010179463,0.00011277483,0.00025497627,0.0002220148,0.00020924996,0.00018232672],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002076271,0.00012552367,0.00002702141,0.000040570045,0.000015324364,0.000023198545,0.0010242538,0.00008042981,0.0065188133,0.9477693,0.00012468958,0.04423013],"study_design_scores_gemma":[0.0006158661,0.00016403336,0.0005224218,0.0000511532,0.000012079257,0.000022203487,0.00037131735,0.025474267,0.011448841,0.9596233,0.0012184242,0.00047613724],"about_ca_topic_score_codex":0.0000012494828,"about_ca_topic_score_gemma":0.0000020258674,"teacher_disagreement_score":0.5748491,"about_ca_system_score_codex":0.000038082326,"about_ca_system_score_gemma":0.000019261728,"threshold_uncertainty_score":0.7524518},"labels":[],"label_agreement":null},{"id":"W2091867238","doi":"10.1016/j.dam.2005.04.015","title":"Complexity of minimizing the total flow time with interval data and minmax regret criterion","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Mathematics; Minimax; Interval (graph theory); Mathematical optimization; Scheduling (production processes); Time complexity; Combinatorics; Interval data; Statistics","score_opus":0.08831245293251806,"score_gpt":0.32945453873333586,"score_spread":0.2411420858008178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091867238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5870184,0.00014970433,0.36209694,0.00084428815,0.0000892106,0.00082483125,0.0004362645,0.00006399224,0.048476387],"genre_scores_gemma":[0.756875,0.000018195504,0.24212825,0.000035375586,0.00006929825,0.000009027904,0.00018439285,0.000021219379,0.0006592878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982574,0.000032453612,0.00059031363,0.0003122663,0.00065185496,0.00015572747],"domain_scores_gemma":[0.9980468,0.00040063838,0.00037911625,0.0010461095,0.00008868505,0.000038612267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010719087,0.00014806195,0.00032605368,0.00006895716,0.0001220934,0.00017702616,0.0006201256,0.000048225815,0.00009899274],"category_scores_gemma":[0.00010933247,0.000078518235,0.00003239473,0.00027278642,0.00039587618,0.00018719408,0.00033865706,0.00007949083,0.000021327582],"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.0018885549,0.0018171169,0.0037659733,0.00068833696,0.00058303203,0.00005515949,0.05599845,0.027809918,0.029994804,0.49092647,0.20828253,0.17818965],"study_design_scores_gemma":[0.00064883655,0.000085000946,0.0015937425,0.00007819474,0.00010116181,0.000058451875,0.0029330843,0.88219845,0.0011909388,0.109128885,0.0016768643,0.00030637122],"about_ca_topic_score_codex":0.000014979311,"about_ca_topic_score_gemma":0.000013801443,"teacher_disagreement_score":0.85438854,"about_ca_system_score_codex":0.0000062975673,"about_ca_system_score_gemma":0.000021424608,"threshold_uncertainty_score":0.32018808},"labels":[],"label_agreement":null},{"id":"W2091876458","doi":"10.1016/j.dam.2008.03.011","title":"Variable neighborhood search for extremal graphs. 21. Conjectures and results about the independence number","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":18,"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":"Mathematics; Combinatorics; Vertex (graph theory); Independence number; Upper and lower bounds; Chromatic scale; Independent set; Invariant (physics); Cardinality (data modeling); Independence (probability theory); Graph; Matching (statistics); Discrete mathematics; Statistics","score_opus":0.026732982838881217,"score_gpt":0.2558371971350205,"score_spread":0.2291042142961393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091876458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04623018,0.0003426882,0.90682316,0.000804825,0.00020384301,0.0014410611,0.0000509981,0.00033146402,0.043771777],"genre_scores_gemma":[0.7480824,0.000038779926,0.251254,0.0002662545,0.000012567529,0.00009007616,0.0000074028544,0.000020032447,0.00022845769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811184,0.000025241674,0.00046426101,0.00047746595,0.00048959727,0.00043157485],"domain_scores_gemma":[0.9981939,0.0005787977,0.00016405876,0.0008095782,0.00013244552,0.000121183126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009105871,0.00022752066,0.0002671062,0.000058452006,0.00057099416,0.00017224325,0.00070609164,0.00012294634,0.000008728036],"category_scores_gemma":[0.00007787329,0.00014713014,0.00006725055,0.0003754275,0.00023966869,0.00013332184,0.0002868407,0.00024007281,0.000020778101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019232619,0.000048167392,0.00004561009,0.00006920369,0.000028590171,0.000004103097,0.003248609,0.00012457889,0.0010818841,0.99382937,0.0010746273,0.00042601922],"study_design_scores_gemma":[0.0014254636,0.00006144156,0.00017657093,0.00006233986,0.000030899897,0.00023430276,0.00032047252,0.042930637,0.0042317514,0.94965845,0.00048696552,0.00038068468],"about_ca_topic_score_codex":0.000019639188,"about_ca_topic_score_gemma":0.0000015109181,"teacher_disagreement_score":0.70185226,"about_ca_system_score_codex":0.000008774406,"about_ca_system_score_gemma":0.00008335499,"threshold_uncertainty_score":0.5999793},"labels":[],"label_agreement":null},{"id":"W2092080501","doi":"10.1016/j.dam.2014.04.016","title":"Finding clubs in graph classes","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Norges Forskningsråd","keywords":"Combinatorics; Chordal graph; Mathematics; Split graph; Interval graph; Discrete mathematics; Block graph; Treewidth; Distance-hereditary graph; Pathwidth; Cograph; Bipartite graph; Perfect graph; Clique graph; Graph; Line graph; Graph power; 1-planar graph","score_opus":0.02453978569575146,"score_gpt":0.2973679752228418,"score_spread":0.27282818952709037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092080501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024201324,0.000018666124,0.92911,0.00014454636,0.00005395818,0.00027938996,0.0000011116751,0.00016376124,0.046027243],"genre_scores_gemma":[0.70581645,0.000010161638,0.29385918,0.00009812734,0.000024524674,0.00007234475,0.0000022295656,0.000021699781,0.00009526772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983847,0.0000378296,0.00033619715,0.00037031242,0.0003942905,0.00047668553],"domain_scores_gemma":[0.9984117,0.0005086538,0.000108111424,0.00084308506,0.000028178089,0.00010027923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007900309,0.00018141928,0.00026698486,0.0002839256,0.00009896531,0.00012870065,0.001136511,0.00007083134,0.000013003515],"category_scores_gemma":[0.00012457828,0.00015866794,0.00006253123,0.000789306,0.00009586187,0.00023150981,0.00036598885,0.00024560848,0.00012490552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029301837,0.00004076486,0.00006486123,0.00006003695,0.0000056078215,0.0000025855027,0.00078063644,0.00015016188,0.0028308786,0.99150103,0.000055597604,0.0045048967],"study_design_scores_gemma":[0.00033679348,0.000027952594,0.00017910195,0.000039968912,0.0000027523536,0.0000045847423,0.00021518137,0.030225428,0.0046333796,0.96350914,0.00058919244,0.00023651468],"about_ca_topic_score_codex":0.0000013726,"about_ca_topic_score_gemma":0.0000071213603,"teacher_disagreement_score":0.6816151,"about_ca_system_score_codex":0.00003159913,"about_ca_system_score_gemma":0.000020976922,"threshold_uncertainty_score":0.6470291},"labels":[],"label_agreement":null},{"id":"W2092316005","doi":"10.1016/j.dam.2004.09.011","title":"Algorithms for polyominoes based on the discrete Green theorem","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Digital Image Processing Techniques","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":"Université du Québec à Montréal","funders":"Direction Générale de la Compétitivité, de l’Industrie et des Services","keywords":"Polyomino; Mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.02514378036693904,"score_gpt":0.27655141192817767,"score_spread":0.25140763156123863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092316005","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017515018,0.000018499408,0.93900794,0.005406387,0.00003183907,0.0007758246,0.000023684424,0.00062191894,0.053938758],"genre_scores_gemma":[0.2244027,0.0000015128566,0.77287406,0.0017602893,0.00010395574,0.00039382972,0.000008974226,0.000045970923,0.00040871324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834156,0.000014187369,0.0003611985,0.00042702127,0.0004311165,0.0004249064],"domain_scores_gemma":[0.99784005,0.00061585585,0.00020879043,0.0011815106,0.000066025445,0.00008779095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056739396,0.0003034822,0.0002658964,0.00008993261,0.00022523715,0.0005744304,0.0017844674,0.00007593999,0.000010678525],"category_scores_gemma":[0.00008838695,0.00018682821,0.00013957494,0.0002557795,0.00016585061,0.00036138954,0.00026799788,0.00014904463,0.00006109802],"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.000009066096,0.00009265318,6.316177e-7,0.00007617711,0.000015137735,8.8051223e-7,0.00063471106,0.00003478408,0.0008387677,0.9254235,0.0014721811,0.0714015],"study_design_scores_gemma":[0.0002534475,0.00007094855,0.000003204886,0.00007159348,0.000017756322,0.0000030926244,0.00008674114,0.5235572,0.04859624,0.4236578,0.0033490283,0.00033294968],"about_ca_topic_score_codex":0.0000017173093,"about_ca_topic_score_gemma":0.0000012968882,"teacher_disagreement_score":0.5235224,"about_ca_system_score_codex":0.000044625613,"about_ca_system_score_gemma":0.000051594016,"threshold_uncertainty_score":0.7618633},"labels":[],"label_agreement":null},{"id":"W2092358235","doi":"10.1016/j.dam.2007.08.004","title":"A framework for incremental generation of closed itemsets","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":36,"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; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Association rule learning; Database transaction; Data mining; Computer science; Lattice (music); Implementation; Closed set; Limit (mathematics); Set (abstract data type); Mathematics; Theoretical computer science; Database; Discrete mathematics; Programming language","score_opus":0.052337768151854445,"score_gpt":0.31925921598017054,"score_spread":0.2669214478283161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092358235","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01211357,0.0000124001135,0.98544997,0.000084261475,0.00005926268,0.00043731567,0.000040207855,0.00006374745,0.0017392423],"genre_scores_gemma":[0.2101124,0.0000021157869,0.789595,0.000063205785,0.00008018689,0.00006821976,0.000054989105,0.000009998935,0.000013876614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990478,0.0000025735471,0.0003534345,0.00021096715,0.00019647437,0.00018875953],"domain_scores_gemma":[0.9989937,0.00020152584,0.00019220501,0.00051385886,0.000044813885,0.000053913885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046938437,0.00010383152,0.00015648271,0.000056149962,0.00008979691,0.00005510872,0.000458206,0.000062680396,0.000004438179],"category_scores_gemma":[0.000038425358,0.00009491238,0.000047346934,0.00020991087,0.000032126245,0.000096683696,0.00011053408,0.00005939463,0.00001045292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017877129,0.000068714406,0.0000020100335,0.00004292657,0.000012686978,1.6937405e-7,0.0008305239,0.000004556822,0.02524448,0.94761366,0.00035142837,0.025827076],"study_design_scores_gemma":[0.00078095455,0.00011600963,0.00014647967,0.00007527941,0.000046762405,0.000006179191,0.0008242079,0.3140174,0.268293,0.41249245,0.002727314,0.0004739802],"about_ca_topic_score_codex":0.0000023547661,"about_ca_topic_score_gemma":0.000002112614,"teacher_disagreement_score":0.5351212,"about_ca_system_score_codex":0.000018033918,"about_ca_system_score_gemma":0.000019483941,"threshold_uncertainty_score":0.38704145},"labels":[],"label_agreement":null},{"id":"W2092383642","doi":"10.1016/j.dam.2007.07.003","title":"Hybrid one-dimensional reversible cellular automata are regular","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","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":"University of British Columbia","funders":"","keywords":"Cellular automaton; Mathematics; Constant (computer programming); Boundary (topology); Set (abstract data type); Automaton; Discrete mathematics; Combinatorics; Null (SQL); Uniform distribution (continuous); Periodic boundary conditions; Algorithm; Boundary value problem; Theoretical computer science; Computer science; Mathematical analysis; Statistics","score_opus":0.015882856268701333,"score_gpt":0.2307198706222915,"score_spread":0.21483701435359015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092383642","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053279664,0.000079165344,0.92882305,0.00047922786,0.00009491134,0.0004933496,0.0000150895285,0.00068542315,0.0160501],"genre_scores_gemma":[0.49127847,0.000006713108,0.5074474,0.00028245267,0.000092182534,0.00004381166,0.00005624857,0.000044860823,0.00074784126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99769324,0.000010897722,0.000528682,0.00056246424,0.0006684992,0.000536204],"domain_scores_gemma":[0.9975632,0.00015298159,0.00029131665,0.0017027011,0.00007187873,0.00021791682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007245978,0.00027570355,0.00035632652,0.00014570856,0.00028632098,0.00015532893,0.0012394433,0.00009154169,0.00004925473],"category_scores_gemma":[0.000022101309,0.0002721474,0.00012941317,0.00041480255,0.00009191525,0.00021703615,0.0005514182,0.00019799828,0.0006308688],"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.0000047008466,0.0002785712,0.000010657059,0.00014747612,0.000051226045,0.000038974504,0.00037307997,0.000054435925,0.1005082,0.8915968,0.0047116512,0.0022242104],"study_design_scores_gemma":[0.0015512261,0.000058085876,0.000709326,0.00021364534,0.0001392622,0.00010792317,0.00044244644,0.1264385,0.511513,0.3349252,0.022331996,0.0015693867],"about_ca_topic_score_codex":0.000004202552,"about_ca_topic_score_gemma":0.000002225916,"teacher_disagreement_score":0.5566716,"about_ca_system_score_codex":0.00006481513,"about_ca_system_score_gemma":0.000051567305,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W2092516150","doi":"10.1016/j.dam.2007.05.013","title":"On the discrete version of Picone's identity","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Spectral Theory in Mathematical Physics","field":"Mathematics","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cegep de Sainte Foy","funders":"","keywords":"Mathematics; Identity (music); Combinatorics","score_opus":0.02661642208872166,"score_gpt":0.3132547763041394,"score_spread":0.2866383542154177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092516150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45089966,0.000015972808,0.22166738,0.0002635354,0.00016967172,0.0013647963,0.000038347294,0.00024502733,0.3253356],"genre_scores_gemma":[0.962687,0.0000051518487,0.036656644,0.00015647434,0.00010640804,0.000033914188,0.000007397353,0.0000966893,0.00025032298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969761,0.000032871878,0.0009874065,0.0003505789,0.0010809702,0.00057210866],"domain_scores_gemma":[0.992447,0.005363147,0.00060089567,0.0013540987,0.00009382734,0.00014104076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024231519,0.00041683263,0.0006596331,0.0001107758,0.00021363689,0.000058325237,0.0009272916,0.00015982946,0.0005547938],"category_scores_gemma":[0.0010526109,0.00026943095,0.00029755375,0.00048736902,0.0004180641,0.00016070777,0.00024468123,0.00043378412,0.00032383754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006736806,0.00030032347,0.000002981138,0.00037740156,0.00010004564,0.0000034347686,0.0013249397,0.0000037388802,0.008981964,0.9875476,0.0011346438,0.00015561206],"study_design_scores_gemma":[0.00037677874,0.0000774893,0.000027459113,0.0001645019,0.00015110464,0.000003901762,0.0017759049,0.00023150664,0.055527348,0.94130546,0.00006157534,0.00029697188],"about_ca_topic_score_codex":0.0000027134126,"about_ca_topic_score_gemma":0.0000053668286,"teacher_disagreement_score":0.51178735,"about_ca_system_score_codex":0.00007806502,"about_ca_system_score_gemma":0.000023957942,"threshold_uncertainty_score":0.9999758},"labels":[],"label_agreement":null},{"id":"W2092811992","doi":"10.1016/j.dam.2011.11.026","title":"Some bounds on global alliances in trees","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Dominating set; Graph; Upper and lower bounds; Offensive; Cardinality (data modeling); Simple graph; Alliance; Closed set; Simple (philosophy); Discrete mathematics; Computer science; Operations research; Data mining","score_opus":0.044389517821247136,"score_gpt":0.302027125385454,"score_spread":0.2576376075642069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092811992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11876683,0.00032111938,0.5856313,0.00030747027,0.0002906886,0.0011631083,0.000021394892,0.0005919783,0.29290608],"genre_scores_gemma":[0.7713836,0.000039885304,0.22811107,0.00017357814,0.000040807023,0.000103081526,0.0000020492173,0.00001807178,0.00012787693],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984227,0.000021768645,0.00030006366,0.0003852981,0.00041019006,0.00046001407],"domain_scores_gemma":[0.99886954,0.00010445524,0.000097311044,0.0008040375,0.000020193997,0.00010445195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034446717,0.00019711466,0.00024760337,0.00009426427,0.00007516221,0.0000819383,0.0012863507,0.00006553769,0.0000200144],"category_scores_gemma":[0.000031796244,0.00016309644,0.000058650454,0.00051515753,0.00014535563,0.0003077323,0.00027063797,0.00016256525,0.00022162212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016122049,0.00013206247,0.00008354291,0.000027947013,0.0000094554225,0.000013622519,0.0013484835,0.000026216318,0.0002161573,0.9947867,0.000044691715,0.0032950311],"study_design_scores_gemma":[0.00030069673,0.00007279705,0.00085538713,0.000036292724,0.000002489915,0.0000031748073,0.00026352785,0.0031910464,0.002469409,0.99246126,0.00013525964,0.0002086476],"about_ca_topic_score_codex":0.000005350589,"about_ca_topic_score_gemma":0.000021776474,"teacher_disagreement_score":0.65261674,"about_ca_system_score_codex":0.00006578412,"about_ca_system_score_gemma":0.00003448487,"threshold_uncertainty_score":0.665088},"labels":[],"label_agreement":null},{"id":"W2092998591","doi":"10.1016/j.dam.2006.07.017","title":"An adaptive memory algorithm for the k-coloring problem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":105,"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é Laval; Polytechnique Montréal","funders":"","keywords":"Graph coloring; Mathematics; Algorithm; Adaptive memory; Edge coloring; Vertex (graph theory); Greedy coloring; Set (abstract data type); Graph; Computer science; Combinatorics; Line graph; Graph power","score_opus":0.10988681558696006,"score_gpt":0.38501938187302603,"score_spread":0.27513256628606597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092998591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034468777,0.00006911933,0.97989404,0.00015541022,0.00019051414,0.0008304022,0.000024733225,0.00011606528,0.015272811],"genre_scores_gemma":[0.24562995,0.0000026454604,0.7532822,0.000100590754,0.00024197818,0.0001452662,0.0000050305816,0.000028658236,0.00056369096],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99757683,0.000018306739,0.0006624858,0.000397826,0.0008604507,0.000484105],"domain_scores_gemma":[0.9944824,0.003994441,0.0002883657,0.00086271553,0.00023031165,0.00014177592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072868573,0.0001835951,0.0002923771,0.00014080569,0.00062059273,0.0002495441,0.0008976869,0.0000908585,0.00004605902],"category_scores_gemma":[0.00041742812,0.000107377266,0.00014944181,0.0005755151,0.00015241264,0.00014451215,0.000084511594,0.00017704774,0.00014844371],"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.00005950692,0.00026224292,0.000008882084,0.000018463581,0.00014169411,0.0000026181497,0.00723332,0.0036441467,0.0020630884,0.49117312,0.0012174166,0.49417552],"study_design_scores_gemma":[0.00066181336,0.0001394234,0.00013005687,0.00002185906,0.00015095189,0.000010179473,0.029109744,0.45284173,0.0058446387,0.50703526,0.0036692773,0.00038509598],"about_ca_topic_score_codex":0.000008271144,"about_ca_topic_score_gemma":0.000016416034,"teacher_disagreement_score":0.49379042,"about_ca_system_score_codex":0.00003319283,"about_ca_system_score_gemma":0.000056461973,"threshold_uncertainty_score":0.47731602},"labels":[],"label_agreement":null},{"id":"W2093259407","doi":"10.1016/s0166-218x(02)00598-x","title":"Approximating covering integer programs with multiplicity constraints","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplicity (mathematics); Multiplicative function; Mathematics; Row and column spaces; Integer (computer science); Combinatorics; Linear programming relaxation; Discrete mathematics; Row; Integer programming; Mathematical optimization; Mathematical analysis; Computer science","score_opus":0.02111996281326427,"score_gpt":0.2295895729394317,"score_spread":0.2084696101261674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093259407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012645833,0.000009593461,0.94391876,0.000028264329,0.00005197666,0.0005075649,0.000002118589,0.00030844452,0.042527445],"genre_scores_gemma":[0.4701184,7.614559e-7,0.52974105,0.000040290484,0.00000955236,0.00006172082,0.000002309475,0.000013347057,0.00001253203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843156,0.000018176293,0.00036284392,0.00040026766,0.00036522653,0.0004219132],"domain_scores_gemma":[0.9988561,0.00013088639,0.00019524676,0.000660264,0.000041463656,0.00011599651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039674662,0.00025577113,0.00030721372,0.000064876775,0.00020546859,0.00026552496,0.0006046424,0.00006180106,0.000019258077],"category_scores_gemma":[0.000041094787,0.00020115265,0.000068038615,0.00041157156,0.00024939422,0.00019205517,0.00017133549,0.0002335507,0.000028946903],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000191458,0.00013185012,0.00004447685,0.00012331357,0.000033601336,0.000007819571,0.0025532593,0.0000709576,0.0002941372,0.98114043,0.0000060721145,0.015592145],"study_design_scores_gemma":[0.002439176,0.00023510467,0.00009984506,0.0005315922,0.00006322423,0.00032885864,0.0042632823,0.28626302,0.01612463,0.68643177,0.0013734318,0.0018460456],"about_ca_topic_score_codex":0.0000027286983,"about_ca_topic_score_gemma":0.0000035235244,"teacher_disagreement_score":0.4574726,"about_ca_system_score_codex":0.000029097717,"about_ca_system_score_gemma":0.000043799886,"threshold_uncertainty_score":0.82027674},"labels":[],"label_agreement":null},{"id":"W2093687145","doi":"10.1016/j.dam.2014.05.048","title":"The average reliability of a graph","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Reliability (semiconductor); Bounded function; Graph; Combinatorics; Discrete mathematics","score_opus":0.004022009903919438,"score_gpt":0.1857318155078487,"score_spread":0.18170980560392927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093687145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050423864,0.00002863687,0.86136055,0.000071211805,0.00012173942,0.00037843446,0.000005210572,0.00019344356,0.08741691],"genre_scores_gemma":[0.9706983,0.00010318684,0.029051038,0.000011402971,0.000019010728,0.000042941818,0.000004822426,0.000022164792,0.00004711196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993071,0.000008377901,0.0002956003,0.000093685914,0.0001361509,0.00015908762],"domain_scores_gemma":[0.9991762,0.00022567844,0.000055534823,0.00047397916,0.000036813683,0.00003178832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043655725,0.000103594524,0.00016282886,0.000017996923,0.00006602898,0.000019772833,0.00016778028,0.000052652165,0.000009478231],"category_scores_gemma":[0.000117588934,0.00006796604,0.000059431,0.0001201509,0.00010459407,0.00003521274,0.000025567118,0.000088875444,0.000013155446],"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.000013565608,0.000053756517,0.000025290909,0.0008897381,0.0000334794,1.08997405e-7,0.0015373694,0.35378262,0.004795371,0.6329943,0.0009770124,0.004897366],"study_design_scores_gemma":[0.00031435522,0.000027174303,0.00013331906,0.000046629386,0.000029872708,0.0000010560628,0.00034794825,0.6127321,0.009760699,0.37185466,0.0045165117,0.00023565089],"about_ca_topic_score_codex":0.0000011905237,"about_ca_topic_score_gemma":0.0000020517157,"teacher_disagreement_score":0.92027444,"about_ca_system_score_codex":0.00001532171,"about_ca_system_score_gemma":0.0000044095,"threshold_uncertainty_score":0.27715746},"labels":[],"label_agreement":null},{"id":"W2093765879","doi":"10.1016/s0166-218x(00)00237-7","title":"Minimum convex partition of a constrained point set","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Convex hull; Mathematics; Convex set; Combinatorics; Convex polytope; Subderivative; Convex analysis; Convex combination; Partition (number theory); Absolutely convex set; Orthogonal convex hull; Proper convex function; Convex body; Convex polygon; Regular polygon; Mixed volume; Convex optimization; Geometry","score_opus":0.02204595755920176,"score_gpt":0.25765646289923866,"score_spread":0.2356105053400369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093765879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07569881,0.000014139988,0.9100594,0.00038115185,0.00007128632,0.00021955092,0.0000072124185,0.00007313908,0.013475345],"genre_scores_gemma":[0.8419069,0.000007581617,0.15779635,0.00011739973,0.000034008805,0.000022802531,0.000029503915,0.000005718857,0.00007972569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907357,0.000011356751,0.0003352367,0.00018226916,0.00024729254,0.00015027572],"domain_scores_gemma":[0.9992885,0.00011848454,0.00016938303,0.00029126677,0.00007307809,0.00005926624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022665173,0.00010833356,0.00018457606,0.00008201986,0.000053432246,0.0000435941,0.00023604538,0.0000434749,0.000052911833],"category_scores_gemma":[0.000027480975,0.000100032594,0.00005248358,0.0003262297,0.00005387089,0.00013062716,0.000073806164,0.00005133054,0.000044275468],"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.0000078905505,0.000093315386,0.000008622187,0.00007480042,0.000024123738,0.0000040234477,0.0017106003,0.00080830645,0.028723812,0.96462226,0.0006783872,0.0032438687],"study_design_scores_gemma":[0.0013013013,0.00014492059,0.00017714022,0.0000691234,0.000040692266,0.000088781446,0.0008808795,0.54991126,0.056952722,0.38766226,0.0023041149,0.0004667828],"about_ca_topic_score_codex":0.0000010030471,"about_ca_topic_score_gemma":9.1488505e-7,"teacher_disagreement_score":0.7662081,"about_ca_system_score_codex":0.000012928096,"about_ca_system_score_gemma":0.000043661985,"threshold_uncertainty_score":0.40792108},"labels":[],"label_agreement":null},{"id":"W2093778504","doi":"10.1016/j.dam.2008.06.051","title":"Haplotype inferring via galled-tree networks using a hypergraph covering problem for special genotype matrices","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genetic Associations and Epidemiology","field":"Biochemistry, Genetics and Molecular Biology","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":"Hypergraph; Mathematics; Combinatorics; Tree (set theory)","score_opus":0.02069339047961006,"score_gpt":0.25356574335960663,"score_spread":0.23287235287999658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093778504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46129107,0.0002582811,0.5334341,0.000022202845,0.000121948906,0.0005652661,0.00001223168,0.000029563182,0.0042653563],"genre_scores_gemma":[0.7416393,0.00026778143,0.25654152,0.00009377923,0.0010905372,0.00009132853,0.00010583986,0.00006244569,0.00010742877],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864537,0.000016950999,0.00044391645,0.00034170333,0.00011847919,0.0004335766],"domain_scores_gemma":[0.9991934,0.00005808335,0.0002686393,0.00031937833,0.00007746898,0.000083031286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002514232,0.00023868433,0.00035085896,0.0000554736,0.00027836874,0.000019655217,0.00020659699,0.00024107986,0.000013918637],"category_scores_gemma":[0.00005858024,0.00022795919,0.00015149795,0.00012632269,0.000077708646,0.0000044076546,0.00014016005,0.00009676449,0.000008042586],"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.00067267637,0.00079629204,0.028661484,0.0010601977,0.0019565756,0.000017765797,0.0029839887,0.18480964,0.73338354,0.02224419,0.011505842,0.011907799],"study_design_scores_gemma":[0.0146709215,0.0024625957,0.032990128,0.00039849486,0.0021930798,0.00071938394,0.0027514596,0.70727295,0.04574333,0.11258731,0.06941353,0.008796805],"about_ca_topic_score_codex":0.000013186547,"about_ca_topic_score_gemma":0.000035393183,"teacher_disagreement_score":0.6876402,"about_ca_system_score_codex":0.000027320428,"about_ca_system_score_gemma":0.00005465906,"threshold_uncertainty_score":0.9295906},"labels":[],"label_agreement":null},{"id":"W2093856210","doi":"10.1016/j.dam.2011.01.021","title":"An integer <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si28.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi></mml:math>-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Mathematics; Integer (computer science); Computer science","score_opus":0.017507335040693933,"score_gpt":0.23230529831175645,"score_spread":0.21479796327106251,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093856210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44853044,0.000025460007,0.5486249,0.000035872865,0.00015634217,0.0003310138,0.00019559848,0.0002963091,0.0018041146],"genre_scores_gemma":[0.9111109,0.000019053094,0.08652315,0.0001556757,0.00014892018,0.0014905726,0.0003366089,0.00018558637,0.00002954615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980615,0.00000891374,0.00065510924,0.0003624726,0.00041209164,0.0004999243],"domain_scores_gemma":[0.99851394,0.0002598133,0.00024750235,0.00074074237,0.000085700005,0.0001522923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035805814,0.00036499335,0.00024455416,0.00009150783,0.00030576048,0.00012583907,0.00041440895,0.00024733267,0.000056209516],"category_scores_gemma":[0.000032755543,0.00032297563,0.00018201288,0.0002919378,0.00020551406,0.0002533912,0.000050981205,0.00036345253,0.00020853207],"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.00006621462,0.00014077446,0.0000010497774,0.00037297473,0.00028237258,0.000007927982,0.004478415,0.007830702,0.0012272198,0.98413026,0.00010246718,0.0013596226],"study_design_scores_gemma":[0.0006806711,0.00013619431,0.000028744762,0.00012380477,0.00038938562,0.000029133058,0.0019077059,0.99187195,0.002124574,0.0019647614,0.00035779612,0.00038529042],"about_ca_topic_score_codex":0.000038077415,"about_ca_topic_score_gemma":0.0001249034,"teacher_disagreement_score":0.9840412,"about_ca_system_score_codex":0.00001660041,"about_ca_system_score_gemma":0.000099552555,"threshold_uncertainty_score":0.9999222},"labels":[],"label_agreement":null},{"id":"W2094337274","doi":"10.1016/j.dam.2002.12.005","title":"Embeddings of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si88.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>-connected graphs of pathwidth <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si89.gif\" overflow=\"scroll\"><mml:mi>k</mml:mi></mml:math>","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Mathematics; Scroll; Algorithm; Discrete mathematics; Theology","score_opus":0.018003696424160012,"score_gpt":0.25559724461823347,"score_spread":0.23759354819407347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094337274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9579249,0.00068060594,0.028491216,0.00028338056,0.0010294012,0.0005162338,0.00044205875,0.0008858916,0.009746316],"genre_scores_gemma":[0.9369617,0.00067328254,0.05852396,0.00075615733,0.00049685186,0.0012270975,0.00042814424,0.00077492336,0.00015784455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858695,0.00029374877,0.003552534,0.0027979368,0.004205041,0.0032811842],"domain_scores_gemma":[0.9873076,0.0021539442,0.003600824,0.005244939,0.00048397877,0.0012086799],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0034080658,0.0018417414,0.0015123638,0.00095157104,0.0015671365,0.0010796953,0.0049612056,0.001929681,0.0002218476],"category_scores_gemma":[0.0013916416,0.002245161,0.0021178583,0.002687253,0.002087603,0.002041516,0.0036734326,0.002275473,0.0018684377],"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.0008126187,0.00093589886,0.000007775713,0.0024733834,0.0011536932,0.00048615952,0.006560579,0.0031117871,0.018323813,0.96415424,0.0007512021,0.0012288302],"study_design_scores_gemma":[0.003989669,0.0015320345,0.000038073136,0.0018010477,0.0007794347,0.0006775923,0.002965736,0.78673345,0.1288872,0.06932107,0.0011238303,0.0021508532],"about_ca_topic_score_codex":0.00034941887,"about_ca_topic_score_gemma":0.00015542482,"teacher_disagreement_score":0.8948332,"about_ca_system_score_codex":0.00010631887,"about_ca_system_score_gemma":0.0015168254,"threshold_uncertainty_score":0.99995726},"labels":[],"label_agreement":null},{"id":"W2094348308","doi":"10.1016/j.dam.2013.10.029","title":"The intersection spectrum of hooked Skolem sequences and applications","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","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":"Memorial University of Newfoundland","funders":"","keywords":"Intersection (aeronautics); Mathematics; Sequence (biology); Combinatorics; Order (exchange); Integer (computer science); Spectrum (functional analysis); Integer sequence; Discrete mathematics; Computer science; Generating function; Physics","score_opus":0.006822453473603833,"score_gpt":0.2100070667718314,"score_spread":0.20318461329822757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094348308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031246034,0.000051121136,0.9497507,0.0004328376,0.000039276263,0.000476211,0.0000011172542,0.00009086861,0.017911797],"genre_scores_gemma":[0.9658515,0.00003326344,0.03380659,0.000036210324,0.000024206458,0.0002067256,7.442366e-7,0.0000057702814,0.00003498357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993842,0.000011142233,0.00019991248,0.00014997477,0.00012021735,0.00013453532],"domain_scores_gemma":[0.9992049,0.00018980622,0.00012715573,0.00041626714,0.000023095401,0.00003878399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002087113,0.00008814299,0.000105940875,0.000034534838,0.00018319338,0.00013454519,0.00044714828,0.000027492244,0.000008225021],"category_scores_gemma":[0.0000066757516,0.00005809333,0.00003973761,0.0002268681,0.0001631995,0.00011505731,0.00014069435,0.00006863374,0.000021194344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.217965e-7,0.000013621059,0.000010486473,0.000026546002,0.000013092236,4.132385e-8,0.00075145514,0.0000024553226,0.0027832387,0.98228484,0.000049137423,0.014064168],"study_design_scores_gemma":[0.00007179959,0.000025654577,0.00016640474,0.000012740204,0.000008667214,0.0000041778753,0.0009946335,0.00436262,0.005280182,0.9884568,0.00052770966,0.00008860457],"about_ca_topic_score_codex":0.000007063205,"about_ca_topic_score_gemma":0.000004623606,"teacher_disagreement_score":0.9346055,"about_ca_system_score_codex":0.0000072720372,"about_ca_system_score_gemma":0.000010059988,"threshold_uncertainty_score":0.23689772},"labels":[],"label_agreement":null},{"id":"W2095382269","doi":"10.1016/j.dam.2014.12.017","title":"Practical algorithms for branch-decompositions of planar graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; D-Wave Systems (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Mathematics; Planar graph; Algorithm; Time complexity; Graph; Planar; Decomposition; Combinatorics; Discrete mathematics; Computer science; Mathematical optimization","score_opus":0.078365028692375,"score_gpt":0.3703406906755415,"score_spread":0.2919756619831665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095382269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091578026,0.000021124988,0.9912934,0.00046128352,0.000064673266,0.000610395,0.000034167646,0.000105818355,0.0064933603],"genre_scores_gemma":[0.06302962,0.0000043038553,0.93665016,0.000046513105,0.000024322675,0.00015879182,0.000016040978,0.000021458678,0.000048773432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857527,0.000021784967,0.0003590829,0.00027804615,0.00043688188,0.00032893394],"domain_scores_gemma":[0.9981884,0.0005912238,0.00017121829,0.000687915,0.00016415496,0.00019711188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060293754,0.00015172733,0.00028489562,0.00013905353,0.00008579425,0.000056566478,0.00063067785,0.00006573096,0.0000036710176],"category_scores_gemma":[0.00013456296,0.00013183604,0.00009758521,0.00038995518,0.00015079643,0.00023999297,0.00014311432,0.00013370399,0.000026630194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001897266,0.00013213522,0.0000019676963,0.000076557175,0.000030412994,0.0000018491584,0.00082450523,0.000038219532,0.002569643,0.9942595,0.0011181056,0.0009281251],"study_design_scores_gemma":[0.00061239116,0.00011445551,0.000004726901,0.000018463485,0.000015976457,0.000019896792,0.00034575918,0.023041513,0.008798538,0.9663062,0.00055539905,0.0001666772],"about_ca_topic_score_codex":0.0000010193065,"about_ca_topic_score_gemma":8.912668e-7,"teacher_disagreement_score":0.062113833,"about_ca_system_score_codex":0.000023639328,"about_ca_system_score_gemma":0.0000913216,"threshold_uncertainty_score":0.5376118},"labels":[],"label_agreement":null},{"id":"W2096146759","doi":"10.1016/j.dam.2005.03.002","title":"Orientable convexity, geodetic and hull numbers in graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":25,"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":"University of Waterloo","keywords":"Mathematics; Geodetic datum; Combinatorics; Convexity; Hull; Geodesy; Geography; Geology","score_opus":0.014271766572100894,"score_gpt":0.27461718913780303,"score_spread":0.26034542256570214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096146759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2749685,0.00021466102,0.6568324,0.00066077063,0.00007636581,0.0009817871,0.0000070859105,0.00028107286,0.065977365],"genre_scores_gemma":[0.74229175,0.000045572662,0.25720903,0.00014919195,0.0000147175515,0.00006879249,0.0000024990516,0.000021003769,0.00019741798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843735,0.00002159548,0.00031987362,0.0003934607,0.00035348072,0.00047426412],"domain_scores_gemma":[0.99890995,0.0001974333,0.000084967774,0.00064099673,0.000027631195,0.00013900925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004864291,0.00018471539,0.00025946106,0.00017751064,0.00009558621,0.00012214672,0.00065745966,0.00006532063,0.000028078002],"category_scores_gemma":[0.00003092369,0.00016899202,0.00003764602,0.0005652703,0.00018652643,0.00032135306,0.0004492726,0.00022200336,0.0000912102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005532781,0.00006805256,0.00017281504,0.0000630958,0.000008018105,0.000004571964,0.0019136508,0.000095495576,0.0010177402,0.99299777,0.00006169839,0.0035915663],"study_design_scores_gemma":[0.00071644364,0.000027356198,0.00016544685,0.00003410583,0.0000057756292,0.000018167642,0.00055379345,0.032919377,0.003701557,0.96061796,0.0009356633,0.00030437548],"about_ca_topic_score_codex":0.0000063409834,"about_ca_topic_score_gemma":0.000028505496,"teacher_disagreement_score":0.46732327,"about_ca_system_score_codex":0.000039878047,"about_ca_system_score_gemma":0.00002580919,"threshold_uncertainty_score":0.6891294},"labels":[],"label_agreement":null},{"id":"W2096789153","doi":"10.1016/j.dam.2008.03.036","title":"The minimum degree distance of graphs of given order and size","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":57,"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","keywords":"Mathematics; Degree (music); Wiener index; Combinatorics; Graph; Connectivity; Order (exchange); Discrete mathematics","score_opus":0.03530198614291502,"score_gpt":0.2710003486580169,"score_spread":0.2356983625151019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096789153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9483125,0.00022712824,0.021637086,0.0001979198,0.000028340874,0.00088313874,0.00007086522,0.00006274277,0.028580258],"genre_scores_gemma":[0.93718714,0.00015934453,0.062230498,0.000011857142,0.0000092329265,0.00009055663,0.000002532705,0.00002938455,0.0002794881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987896,0.000019437299,0.0005663967,0.00017237928,0.00025008133,0.00020211315],"domain_scores_gemma":[0.996753,0.0020167078,0.0004265443,0.0006479995,0.0000991953,0.000056602934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312977,0.00017941085,0.000374353,0.000025902453,0.00024057028,0.000008964159,0.00031226364,0.00006973368,0.000017956341],"category_scores_gemma":[0.00026756912,0.00012136424,0.000089815694,0.00031271804,0.0007405842,0.000033189386,0.00008586489,0.00010766845,0.0000031970073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022131537,0.00011636602,0.000057232548,0.00029114148,0.000057668865,4.970389e-7,0.0022434602,7.666002e-7,0.005653867,0.99087155,0.00042196427,0.00026334514],"study_design_scores_gemma":[0.00034112943,0.000025435864,0.0002809832,0.000046844198,0.00007419045,0.000009691691,0.0015709528,0.00009743974,0.008286616,0.98867184,0.00045038565,0.00014451648],"about_ca_topic_score_codex":0.0000015696951,"about_ca_topic_score_gemma":0.000006547431,"teacher_disagreement_score":0.04059341,"about_ca_system_score_codex":0.0000052144583,"about_ca_system_score_gemma":0.000023291244,"threshold_uncertainty_score":0.49490902},"labels":[],"label_agreement":null},{"id":"W2098531449","doi":"10.1016/j.dam.2014.08.006","title":"Excluding cycles with a fixed number of chords","year":2014,"lang":"en","type":"article","venue":"Discrete Applied 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":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Combinatorics; Chromatic scale; Chord (peer-to-peer); Graph; Discrete mathematics; Chordal graph; Computer science","score_opus":0.01986480492450143,"score_gpt":0.2981553816262689,"score_spread":0.2782905767017675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098531449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06990272,0.0000057598113,0.87149584,0.000058145306,0.000016672528,0.00015495485,0.0000017279929,0.000110781184,0.058253404],"genre_scores_gemma":[0.5920664,0.0000030312276,0.40772966,0.000023468487,0.000015464515,0.000035007677,0.0000012336524,0.000018578978,0.000107148706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986463,0.000024450634,0.00028976315,0.00024138167,0.0004771107,0.00032094654],"domain_scores_gemma":[0.9984598,0.00033194554,0.00018968986,0.000857253,0.00006603053,0.000095264215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043028552,0.00016734572,0.0003118913,0.0000737036,0.000084084684,0.000057153993,0.00085816305,0.000047959304,0.000020933992],"category_scores_gemma":[0.000062663756,0.0001227656,0.00005176458,0.00042227138,0.00015858446,0.00017133352,0.00028635925,0.00013822253,0.00005695534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010869366,0.00004698294,0.00012923936,0.00013000569,0.000022848892,8.409935e-7,0.0011108716,0.000069430345,0.005233946,0.9869644,0.000025947233,0.006254617],"study_design_scores_gemma":[0.00085192884,0.00009517721,0.0003100621,0.00013971554,0.000020232845,0.000025235357,0.00072237576,0.027705505,0.031420022,0.93778074,0.0004872804,0.0004417075],"about_ca_topic_score_codex":0.0000016928132,"about_ca_topic_score_gemma":0.0000015249477,"teacher_disagreement_score":0.5221637,"about_ca_system_score_codex":0.000015307613,"about_ca_system_score_gemma":0.000024773797,"threshold_uncertainty_score":0.50062364},"labels":[],"label_agreement":null},{"id":"W2101752896","doi":"10.1016/s0166-218x(02)00251-2","title":"Finding paths in graphs avoiding forbidden transitions","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Graph isomorphism; Line graph","score_opus":0.04135075435661177,"score_gpt":0.2841048643191326,"score_spread":0.24275410996252084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101752896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033258572,0.00008340773,0.92756855,0.00031843167,0.000051463336,0.0005029645,0.000007359583,0.0002205984,0.03798867],"genre_scores_gemma":[0.84839886,0.000031321095,0.15125461,0.00005994062,0.000013206997,0.000110749825,0.0000027943136,0.00002405403,0.00010444234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983257,0.00003771856,0.0003678436,0.0003665286,0.00037964474,0.0005225614],"domain_scores_gemma":[0.99880075,0.0003129653,0.00008524851,0.00066714414,0.000024138439,0.000109735134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353668,0.00019140136,0.0002509914,0.0003456493,0.00023287626,0.00012698326,0.000847257,0.00007323929,0.000065284345],"category_scores_gemma":[0.000053667718,0.00018140495,0.00009159929,0.0010065266,0.00008130609,0.00033968425,0.000160527,0.00036567246,0.00014381536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014882548,0.00007998509,0.000014292495,0.000060602266,0.000009259914,0.000016098342,0.0071704485,0.00012695616,0.005127475,0.98380125,0.000067081324,0.0035250674],"study_design_scores_gemma":[0.00046569435,0.000026025073,0.00004394865,0.00007352354,0.0000063365087,0.000012495652,0.0013263811,0.093158305,0.0024901354,0.9019639,0.000115470735,0.00031782233],"about_ca_topic_score_codex":0.0000010471653,"about_ca_topic_score_gemma":0.000005658987,"teacher_disagreement_score":0.8151403,"about_ca_system_score_codex":0.00004539502,"about_ca_system_score_gemma":0.000009522886,"threshold_uncertainty_score":0.7397479},"labels":[],"label_agreement":null},{"id":"W2105075386","doi":"10.1016/s0166-218x(00)00283-3","title":"The vehicle routing problem with pickups and deliveries on some special graphs","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Vehicle routing problem; Pickup; Depot; Mathematics; Combinatorics; Routing (electronic design automation); Tree (set theory); Time complexity; Computer science; Graph; Mathematical optimization; Artificial intelligence; Geography","score_opus":0.012250185658381098,"score_gpt":0.20777666955318044,"score_spread":0.19552648389479935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105075386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65567,0.0004813968,0.12201904,0.0006325226,0.0002974605,0.0020386581,0.00003109344,0.0017542571,0.21707559],"genre_scores_gemma":[0.76170635,0.0002451434,0.237323,0.00007656884,0.00022954831,0.00008287282,0.0000039273277,0.00012452075,0.00020808341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906224,0.000014113418,0.00025327128,0.0001611746,0.00021915704,0.00029001661],"domain_scores_gemma":[0.9993444,0.00023642088,0.000068684436,0.00026667613,0.000020865093,0.0000629219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023405439,0.00019831905,0.00018568212,0.00003933767,0.00029387066,0.00013994689,0.00014187691,0.000058461173,0.000023570867],"category_scores_gemma":[0.00002210541,0.00013552242,0.000026719701,0.00016529007,0.000110790425,0.00008150148,0.000040030933,0.0001825823,0.00002139333],"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.000023502886,0.00005204307,0.00010265898,0.00027857418,0.0001333122,0.000005197779,0.008639575,0.057847217,0.0015124384,0.90700597,0.00087442546,0.023525087],"study_design_scores_gemma":[0.0013788547,0.00014501388,0.00024072775,0.00019669862,0.000110506735,0.000021958303,0.0032451462,0.9291613,0.0054946104,0.05709059,0.0020082395,0.00090633397],"about_ca_topic_score_codex":6.5797803e-7,"about_ca_topic_score_gemma":0.0000026723162,"teacher_disagreement_score":0.8713141,"about_ca_system_score_codex":0.000026177857,"about_ca_system_score_gemma":0.000003262705,"threshold_uncertainty_score":0.55264443},"labels":[],"label_agreement":null},{"id":"W2106378021","doi":"10.1016/j.dam.2004.06.026","title":"Numerical representation of PQI interval orders","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Interval (graph theory); Mathematics; Preference; Intersection (aeronautics); Representation (politics); Order (exchange); Combinatorics; Set (abstract data type); Discrete mathematics; Statistics; Computer science","score_opus":0.016052980249342323,"score_gpt":0.2692880239622094,"score_spread":0.2532350437128671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106378021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037381535,0.000003954469,0.974783,0.0005330748,0.000047353515,0.00014681931,0.0000010616085,0.0000962242,0.02065038],"genre_scores_gemma":[0.59930533,0.0000034473733,0.40055114,0.00007054932,0.000016362372,0.000008676624,0.000003707619,0.000005216575,0.000035578367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920493,0.000009305404,0.00030176804,0.00016489609,0.0002072742,0.00011182614],"domain_scores_gemma":[0.9993753,0.00006674145,0.00015539603,0.00031781252,0.000040888524,0.00004385914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088712724,0.00008629916,0.00015450554,0.00006487373,0.000036093013,0.000039926254,0.0002369723,0.000036903042,0.000091307586],"category_scores_gemma":[0.000030038156,0.000079603225,0.000052556697,0.00026992202,0.00003914178,0.00018372708,0.00006247974,0.000061250415,0.000050313727],"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.000007237518,0.00011408227,0.00009683623,0.000061864295,0.00003364856,7.2696264e-7,0.003859181,0.009878828,0.003026767,0.85581183,0.00059561897,0.12651338],"study_design_scores_gemma":[0.0006266536,0.000035323483,0.00054065505,0.000030963452,0.000020189062,0.000014380169,0.0006093676,0.9574035,0.022545727,0.016989607,0.00090696616,0.0002766564],"about_ca_topic_score_codex":0.0000034760967,"about_ca_topic_score_gemma":0.0000021939838,"teacher_disagreement_score":0.94752467,"about_ca_system_score_codex":0.000020697733,"about_ca_system_score_gemma":0.000020771973,"threshold_uncertainty_score":0.32461253},"labels":[],"label_agreement":null},{"id":"W2107489311","doi":"10.1016/j.dam.2007.08.033","title":"On polyhedra induced by point sets in space","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","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":"Polyhedron; Mathematics; Space (punctuation); Point (geometry); Combinatorics; Dual polyhedron; Geometry; Computer science","score_opus":0.013710954617112605,"score_gpt":0.26433591996709116,"score_spread":0.2506249653499786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107489311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18466309,0.000015615295,0.7905013,0.00043133524,0.00009446771,0.00023636952,0.000002232066,0.000079750615,0.023975825],"genre_scores_gemma":[0.894584,0.0000017313465,0.10489996,0.00037109107,0.000024967043,0.000012368883,0.000014434915,0.000010681908,0.00008075491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988146,0.000009465002,0.00029762308,0.0002737809,0.0003374949,0.00026702794],"domain_scores_gemma":[0.99920255,0.00024003765,0.00010383212,0.0003446621,0.000024021501,0.000084918785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053927186,0.00014772484,0.00015752454,0.00017647962,0.00006066622,0.000077509634,0.00032198807,0.00006909578,0.00001190156],"category_scores_gemma":[0.000038784387,0.00013715803,0.000034106208,0.000524286,0.000013691576,0.00012606027,0.000097523094,0.00014127455,0.00009223472],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007509658,0.00012682522,0.0000024002115,0.000021276923,0.000005899918,0.0000043479586,0.0012224028,0.00035698627,0.027997695,0.96164554,0.00077183754,0.007837286],"study_design_scores_gemma":[0.0015956184,0.0002148958,0.00080357003,0.00009211193,0.000010767203,0.000017499868,0.0005679216,0.09219216,0.17362863,0.7289707,0.0010477147,0.00085841055],"about_ca_topic_score_codex":0.0000041242947,"about_ca_topic_score_gemma":0.0000057923444,"teacher_disagreement_score":0.70992094,"about_ca_system_score_codex":0.000056801575,"about_ca_system_score_gemma":0.000028528822,"threshold_uncertainty_score":0.5593142},"labels":[],"label_agreement":null},{"id":"W2108792210","doi":"10.1016/j.dam.2009.02.023","title":"On minimally b-imperfect graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Imperfect; Combinatorics; Discrete mathematics","score_opus":0.010895283184130326,"score_gpt":0.23200242214121836,"score_spread":0.22110713895708803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108792210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41884282,0.00017752149,0.3066423,0.0025216904,0.00037927533,0.0010248764,0.000006500901,0.0018222887,0.26858273],"genre_scores_gemma":[0.816421,0.000008043642,0.1821212,0.0013235434,0.0000047409353,0.000014354656,0.0000029900166,0.000011989806,0.00009218508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985966,0.000010698744,0.00030688875,0.0003758631,0.00037354333,0.00033638766],"domain_scores_gemma":[0.99876404,0.00012504704,0.00011647336,0.0008330555,0.00003548394,0.0001258874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002788399,0.00021740644,0.00024105338,0.00014054248,0.0001348085,0.00014007944,0.0006617738,0.00007458478,0.000012190835],"category_scores_gemma":[0.000030194791,0.00017076281,0.00010390401,0.0003934168,0.000040619154,0.00009064819,0.00007207174,0.00014748232,0.000250175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004133558,0.00011704029,8.566744e-7,0.000014518499,0.000008936569,0.000004321866,0.0004892114,0.000059606675,0.009353838,0.9852592,0.0013988618,0.0032894996],"study_design_scores_gemma":[0.00034799392,0.00020066762,0.000040269315,0.000038667327,0.000010438426,0.000007045019,0.00003189776,0.007395622,0.0067486838,0.98480284,0.00012445533,0.0002514349],"about_ca_topic_score_codex":5.774907e-7,"about_ca_topic_score_gemma":2.5447093e-7,"teacher_disagreement_score":0.39757815,"about_ca_system_score_codex":0.000011551932,"about_ca_system_score_gemma":0.000021929358,"threshold_uncertainty_score":0.6963505},"labels":[],"label_agreement":null},{"id":"W2109468620","doi":"10.1016/j.dam.2013.06.004","title":"Directed graphs, decompositions, and spatial linkages","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Structural Analysis and Optimization","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":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Modular decomposition; Mathematics; Combinatorics; Linkage (software); Strongly connected component; Pathwidth; Rigidity (electromagnetism); Graph; Line graph","score_opus":0.0040679574926973895,"score_gpt":0.18564963340390778,"score_spread":0.18158167591121038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109468620","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.783527,0.00026334065,0.20008634,0.000087448425,0.00008442471,0.0004994148,0.000014398547,0.00082904747,0.014608591],"genre_scores_gemma":[0.9383943,0.00008957637,0.061337736,0.000015804626,0.000026249732,0.000044241777,0.00005089582,0.000020284528,0.000020927222],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995409,0.0000025476202,0.00017076358,0.00009014489,0.00008070344,0.00011490515],"domain_scores_gemma":[0.99975353,0.000030294168,0.000027277409,0.00011850681,0.000020254158,0.000050115334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002092561,0.000114769726,0.00014964236,0.00005102026,0.0000575622,0.00006985769,0.000053433057,0.000046858127,0.00017103992],"category_scores_gemma":[0.00000401091,0.00009181269,0.000030252766,0.00010687589,0.000023126755,0.000054912784,0.000018274555,0.000057129713,0.000034338565],"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.000011468962,0.00021717283,0.0021096643,0.0027996995,0.0018710808,0.000008382571,0.009136347,0.103948295,0.40895066,0.24721968,0.017377488,0.20635007],"study_design_scores_gemma":[0.00025444964,0.000009208081,0.007004265,0.00002774111,0.00010127877,0.000004819763,0.00022237505,0.9405388,0.00747541,0.04392725,0.00009223659,0.00034215482],"about_ca_topic_score_codex":0.000018367755,"about_ca_topic_score_gemma":0.0000074313402,"teacher_disagreement_score":0.8365905,"about_ca_system_score_codex":0.000007888244,"about_ca_system_score_gemma":0.0000012778358,"threshold_uncertainty_score":0.37440127},"labels":[],"label_agreement":null},{"id":"W2109612762","doi":"10.1016/j.dam.2015.09.024","title":"A note on easy and efficient computation of full abelian periods of a word","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Abelian group; Mathematics; Word (group theory); Computation; Alphabet; Constant (computer programming); Arithmetic of abelian varieties; Combinatorics; Simple (philosophy); Period length; Rank of an abelian group; Algorithm; Discrete mathematics; Elementary abelian group; Arithmetic; Computer science; Linguistics","score_opus":0.021681295995195048,"score_gpt":0.2721986936672689,"score_spread":0.25051739767207387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109612762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09128201,0.000038833015,0.90658456,0.000041566364,0.00005020774,0.00019026102,0.000010027595,0.00003227033,0.0017702379],"genre_scores_gemma":[0.61947167,0.0000023309308,0.38047752,0.000015679041,0.000009672652,0.000006247681,0.0000045768693,0.0000064823553,0.0000058555047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990345,0.000011143628,0.0002940546,0.00019327161,0.0003450233,0.00012197598],"domain_scores_gemma":[0.9991904,0.00006905808,0.00022238199,0.00036393688,0.00006648989,0.00008771795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002435149,0.00011445502,0.00023526182,0.00007696534,0.000033522974,0.000033535878,0.00027826894,0.000042178228,0.0000010926144],"category_scores_gemma":[0.000023392216,0.00008850248,0.000028336024,0.00018532206,0.00006637797,0.000052246065,0.00024590976,0.00006033454,0.0000065699282],"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.00012272732,0.00086677173,0.000015835258,0.00086224393,0.00005242539,0.000006759576,0.038076624,0.021359574,0.026951538,0.80846155,0.0004842586,0.102739684],"study_design_scores_gemma":[0.00070886774,0.00018582215,0.00010999298,0.0001792956,0.00001349832,0.0000066917855,0.00043721835,0.9744234,0.0036441018,0.019995876,0.00013137057,0.00016383956],"about_ca_topic_score_codex":0.00000599631,"about_ca_topic_score_gemma":7.052352e-7,"teacher_disagreement_score":0.95306385,"about_ca_system_score_codex":0.000013294111,"about_ca_system_score_gemma":0.000035467456,"threshold_uncertainty_score":0.36090264},"labels":[],"label_agreement":null},{"id":"W2109692166","doi":"10.1016/s0166-218x(03)00382-2","title":"On spaced seeds for similarity search","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Similarity (geometry); Mathematics; Sensitivity (control systems); Combinatorics; Nearest neighbor search; Algorithm; Computer science; Data mining; Artificial intelligence","score_opus":0.02766122019691645,"score_gpt":0.2810312807924654,"score_spread":0.25337006059554895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109692166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027155443,0.000011194584,0.9731091,0.00014030977,0.00009606295,0.0004941036,0.000019124682,0.00012396598,0.023290578],"genre_scores_gemma":[0.13021497,0.0000049658715,0.86908066,0.00026168633,0.00003454103,0.000089351466,0.000018777771,0.000024043264,0.000270968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879456,0.00001482261,0.0002021884,0.00033413953,0.00032845914,0.0003258111],"domain_scores_gemma":[0.99865174,0.00029619882,0.00006777184,0.0008318623,0.000044716053,0.00010773764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041485028,0.00016796605,0.00020667621,0.000059591155,0.00018704815,0.00014405671,0.00058079005,0.00007469211,0.000020789923],"category_scores_gemma":[0.000060107643,0.00013240987,0.0000660783,0.00018423724,0.000031604253,0.00012214841,0.00015975769,0.0001318075,0.00006442283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004450343,0.00008366148,9.684965e-7,0.00006145417,0.000009314784,0.0000010286868,0.00049761316,0.0001146072,0.0010136305,0.9949217,0.0017317956,0.0015597809],"study_design_scores_gemma":[0.0013089803,0.00017845983,0.0000260395,0.00006890174,0.000020261798,0.000008302149,0.00040887762,0.29068953,0.03560638,0.6592716,0.011823055,0.0005895906],"about_ca_topic_score_codex":0.0000013656067,"about_ca_topic_score_gemma":6.010126e-7,"teacher_disagreement_score":0.3356501,"about_ca_system_score_codex":0.000025401734,"about_ca_system_score_gemma":0.000041793526,"threshold_uncertainty_score":0.5399518},"labels":[],"label_agreement":null},{"id":"W2109716789","doi":"10.1016/s0166-218x(00)00221-3","title":"On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":208,"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; Bounded function; Treewidth; Combinatorics; Monadic predicate calculus; Enumeration; Discrete mathematics; Clique-width; Time complexity; Graph; Second-order logic; Computational complexity theory; Upper and lower bounds; Clique; Pathwidth; Algorithm; Line graph; Computer science; Theoretical computer science","score_opus":0.061928593949755986,"score_gpt":0.28571349968552445,"score_spread":0.22378490573576848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109716789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2155292,0.000042012744,0.7654068,0.0004729044,0.000029764544,0.0011128013,0.0000063982498,0.00006936217,0.017330771],"genre_scores_gemma":[0.8919675,0.00001620413,0.10743138,0.00021513087,0.000006177801,0.00021149682,0.000006975518,0.000017603503,0.00012753304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983678,0.00007167897,0.00042953904,0.00032751617,0.0004080559,0.00039541876],"domain_scores_gemma":[0.9980745,0.00072605355,0.0001920722,0.00088123104,0.00007068807,0.000055478522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536593,0.00019185312,0.00028555375,0.00017941478,0.00013328192,0.00007517198,0.0008642633,0.00006897307,0.00010923515],"category_scores_gemma":[0.00012354799,0.00013066358,0.000066018874,0.0010152613,0.0002791944,0.00016104201,0.0001903571,0.00027243796,0.00004573382],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012807617,0.00013054506,0.000035141416,0.00007365401,0.000011821004,0.0000027000888,0.00101263,0.0011375541,0.0022279273,0.9948533,0.00005413908,0.0004477336],"study_design_scores_gemma":[0.00028899114,0.000064994114,0.00017417556,0.000033843746,0.000003225878,0.000005019549,0.00016147042,0.033493735,0.0026285173,0.9629403,0.000057510653,0.00014823524],"about_ca_topic_score_codex":0.000008848126,"about_ca_topic_score_gemma":0.00005254976,"teacher_disagreement_score":0.6764383,"about_ca_system_score_codex":0.000036548812,"about_ca_system_score_gemma":0.000032020984,"threshold_uncertainty_score":0.5328306},"labels":[],"label_agreement":null},{"id":"W2110254595","doi":"10.1016/j.dam.2005.05.009","title":"Resolution complexity of random constraint satisfaction problems: Another half of the story","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","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 Alberta","funders":"","keywords":"Mathematics; Constraint satisfaction problem; Resolution (logic); Constraint (computer-aided design); Constraint satisfaction; Combinatorics; Mathematical optimization; Statistics; Artificial intelligence; Computer science; Geometry; Probabilistic logic","score_opus":0.025823883426195713,"score_gpt":0.23554820806666535,"score_spread":0.20972432464046964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110254595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00826367,0.00002134241,0.9810605,0.0009935694,0.000079378035,0.00056245405,0.000010174491,0.0000657868,0.008943113],"genre_scores_gemma":[0.80442256,0.000007532567,0.19544357,0.000051643412,0.000014773046,0.000015596335,0.000002079335,0.0000076152282,0.000034613233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989156,0.000049403658,0.00042576157,0.00016743682,0.0003094965,0.00013231074],"domain_scores_gemma":[0.9988701,0.00010003083,0.00045195103,0.00047133194,0.00007879915,0.000027835507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003980842,0.00012157282,0.00022936921,0.00006428656,0.00010158633,0.000021235139,0.00026324592,0.000062863975,0.00006712222],"category_scores_gemma":[0.00003520436,0.000090805304,0.000089959576,0.00021532104,0.0003722833,0.00014266379,0.000083841944,0.00012086568,0.0000072642933],"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.0000136133785,0.000078669655,0.00011058447,0.00015832964,0.000037407724,6.639013e-8,0.0030199543,0.009156034,0.016142018,0.9427826,0.00016940218,0.028331323],"study_design_scores_gemma":[0.0069158804,0.0001060824,0.0185194,0.0004608549,0.0001477028,0.000046110952,0.0018283837,0.7944045,0.064390935,0.109326355,0.0029781635,0.0008755999],"about_ca_topic_score_codex":0.000016458896,"about_ca_topic_score_gemma":0.00009657297,"teacher_disagreement_score":0.8334562,"about_ca_system_score_codex":0.0000516024,"about_ca_system_score_gemma":0.00006084752,"threshold_uncertainty_score":0.3702933},"labels":[],"label_agreement":null},{"id":"W2111106757","doi":"10.1016/j.dam.2008.01.014","title":"On routing in VLSI design and communication networks","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Canadian Imperial Bank of Commerce (Canada); McMaster University","funders":"","keywords":"Very-large-scale integration; Routing (electronic design automation); Mathematics; Theoretical computer science; Arithmetic; Computer network; Computer science; Embedded system","score_opus":0.02662654992573895,"score_gpt":0.23293808351134665,"score_spread":0.2063115335856077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111106757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014174514,0.00003382397,0.97663826,0.00006907743,0.0000506485,0.00027310144,1.1129234e-7,0.00007197616,0.008688502],"genre_scores_gemma":[0.8951622,0.000042225765,0.10456325,0.00011738824,0.000019762492,0.000038729722,0.0000012231776,0.000009358072,0.00004583331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991895,0.000045215605,0.00028294977,0.0001800238,0.00012482978,0.0001774746],"domain_scores_gemma":[0.9989923,0.00037314201,0.00011187785,0.00046731145,0.000017159888,0.00003817656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049168157,0.000109874585,0.00017401921,0.000056121648,0.00015770644,0.00006791617,0.0003289682,0.00006423678,0.0000025258867],"category_scores_gemma":[0.000016860728,0.00009486828,0.000021763168,0.00017853388,0.00003598148,0.000094706906,0.00011747883,0.00015496589,0.000011514153],"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.0000041362614,0.000033531727,0.000017251956,0.000012045621,0.0000060790803,0.0000033426504,0.0036530804,0.020796502,0.000043525724,0.9738572,0.00038010193,0.0011931808],"study_design_scores_gemma":[0.00022194868,0.000023654364,0.00007046446,0.00007391432,0.0000016779057,0.000024631066,0.00016256777,0.9807242,0.00007792922,0.018464303,0.000033159424,0.00012155415],"about_ca_topic_score_codex":0.0000060279267,"about_ca_topic_score_gemma":0.0000033213025,"teacher_disagreement_score":0.9599277,"about_ca_system_score_codex":0.00002679752,"about_ca_system_score_gemma":0.000009198033,"threshold_uncertainty_score":0.3868616},"labels":[],"label_agreement":null},{"id":"W2112945167","doi":"10.1016/j.dam.2005.04.022","title":"Asymptotic expected number of base pairs in optimal secondary structure for random RNA using the Nussinov–Jacobson energy model","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"RNA and protein synthesis mechanisms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University","funders":"","keywords":"Mathematics; Nucleic acid secondary structure; Limit (mathematics); Central limit theorem; Combinatorics; Base (topology); Moment (physics); Binary number; Alphabet; Discrete mathematics; RNA; Mathematical analysis; Statistics; Quantum mechanics; Physics","score_opus":0.010094559538819313,"score_gpt":0.23697519891303906,"score_spread":0.22688063937421973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112945167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57428694,0.00010544539,0.42375797,0.000018668512,0.000024322344,0.00038990955,0.000078400895,0.000009142052,0.0013291903],"genre_scores_gemma":[0.86531836,0.000008769088,0.134226,0.00004293263,0.00008235929,0.000084463194,0.00010499325,0.000045976278,0.000086162225],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99885833,0.000028461702,0.00042042296,0.0002693643,0.00015614965,0.00026727255],"domain_scores_gemma":[0.9992191,0.00007146982,0.00022602921,0.00040473192,0.000044108638,0.00003452295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018727487,0.0002296994,0.00031594583,0.000034543555,0.00008070593,0.000025195393,0.00023024443,0.00019344379,0.000039068924],"category_scores_gemma":[0.000030696378,0.00016724002,0.00013276728,0.000084263025,0.00007433752,0.000005040183,0.00006974637,0.00007040004,4.3292286e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001686695,0.00005427341,0.0000058779515,0.00012161605,0.00003573578,6.38717e-7,0.00015612389,0.011250742,0.9691845,0.018569846,0.00009415072,0.00035779292],"study_design_scores_gemma":[0.0014935537,0.000026635813,0.0000051472716,0.000039225913,0.000058240912,0.00000820344,0.00044288134,0.058759402,0.9094972,0.029376466,0.000054702243,0.00023834064],"about_ca_topic_score_codex":0.000019302965,"about_ca_topic_score_gemma":0.000026446083,"teacher_disagreement_score":0.2910314,"about_ca_system_score_codex":0.00001545554,"about_ca_system_score_gemma":0.000089262285,"threshold_uncertainty_score":0.681985},"labels":[],"label_agreement":null},{"id":"W2115059819","doi":"10.1016/j.dam.2003.08.008","title":"Exchange relations, Dyck paths and copolymer adsorption","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Copolymer; Mathematics; Van Dyke beard; Adsorption; Combinatorics; Polymer; Chemistry; Organic chemistry; Art history","score_opus":0.006355870375461483,"score_gpt":0.21582070124729652,"score_spread":0.20946483087183504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115059819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2271288,0.00009742102,0.44052273,0.00010182631,0.00006619585,0.00037973045,0.000045004763,0.00006743549,0.33159083],"genre_scores_gemma":[0.9892817,0.0000018223275,0.01007687,0.00004040039,0.00006769587,0.00004384991,0.000043499524,0.000018269782,0.00042588546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939996,0.000011874859,0.00016957552,0.00014939472,0.00012565574,0.00014355064],"domain_scores_gemma":[0.9996139,0.00009325283,0.00007193248,0.00013496664,0.000020686575,0.0000652935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000077928686,0.00012461685,0.00013602622,0.000019983658,0.00008131898,0.00003637159,0.000050056184,0.000027489577,0.00055876654],"category_scores_gemma":[0.0000037055702,0.000108062886,0.00003969744,0.00008322554,0.00006956117,0.000051099974,0.000026080428,0.00008418897,0.00015304206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020703583,0.000058793867,0.00009637676,0.000020392787,0.000019017878,8.89474e-8,0.00045404636,0.000018965336,0.0006444153,0.9963451,0.00017318761,0.0021675127],"study_design_scores_gemma":[0.00028236627,0.00001069541,0.00008346191,0.00001248457,0.000033662098,6.152608e-7,0.0007540834,0.0010837752,0.0021824688,0.9944375,0.0009572712,0.00016162556],"about_ca_topic_score_codex":0.0000019129234,"about_ca_topic_score_gemma":9.4881074e-8,"teacher_disagreement_score":0.7621529,"about_ca_system_score_codex":0.0000065504264,"about_ca_system_score_gemma":0.000013204237,"threshold_uncertainty_score":0.6118102},"labels":[],"label_agreement":null},{"id":"W2115816066","doi":"10.1016/s0166-218x(00)00388-7","title":"Optimal irreversible dynamos in chordal rings","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Mathematics; Chordal graph; Constructive; Upper and lower bounds; Dynamo; Combinatorics; Simple (philosophy); Class (philosophy); Discrete mathematics; Pure mathematics; Graph; Mathematical analysis; Computer science; Physics; Magnetic field","score_opus":0.01130383720653694,"score_gpt":0.23722613059077993,"score_spread":0.225922293384243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115816066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11642735,0.000023811353,0.82731104,0.00034436156,0.000035626083,0.00035210303,0.0000025001168,0.00023228537,0.055270944],"genre_scores_gemma":[0.6456874,0.000019843601,0.35349408,0.00009531773,0.00002723999,0.00011970942,0.000012510243,0.000019179135,0.00052470167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988275,0.0000055269866,0.0002884737,0.00032218662,0.00023084147,0.00032545408],"domain_scores_gemma":[0.9990579,0.000056836765,0.0000880938,0.0006943176,0.000016428728,0.00008645375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017850213,0.00015862791,0.00019684287,0.00010444725,0.000088034234,0.0001215341,0.00081964035,0.000061360886,0.0000460975],"category_scores_gemma":[0.00000808153,0.00015289841,0.000055009772,0.0005721316,0.00003986013,0.00018991092,0.0002819633,0.0001394869,0.0003153439],"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.000004798718,0.00032251718,0.00015596353,0.00008289998,0.000018883078,0.00003297899,0.0028146207,0.0010408371,0.010994204,0.97693825,0.0011071856,0.006486865],"study_design_scores_gemma":[0.0015002735,0.000045803194,0.0014908954,0.00007653825,0.000028823244,0.000107641376,0.0010147671,0.900949,0.0076625217,0.06549572,0.020627366,0.0010006177],"about_ca_topic_score_codex":0.000010008229,"about_ca_topic_score_gemma":0.000006274109,"teacher_disagreement_score":0.9114425,"about_ca_system_score_codex":0.00004563305,"about_ca_system_score_gemma":0.00002906342,"threshold_uncertainty_score":0.62350166},"labels":[],"label_agreement":null},{"id":"W2116753102","doi":"10.1016/j.dam.2013.07.013","title":"Automated generation of conjectures on forbidden subgraph characterization","year":2013,"lang":"en","type":"article","venue":"Discrete Applied 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":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Mathematics; Combinatorics; Characterization (materials science); Induced subgraph isomorphism problem; Induced subgraph; Split graph; Cograph; Discrete mathematics; Graph; Heuristic; Distance-hereditary graph; Line graph; Pathwidth; Graph power; Voltage graph; Mathematical optimization","score_opus":0.02682042991999696,"score_gpt":0.27926116335299517,"score_spread":0.2524407334329982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116753102","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27817726,0.0000062304875,0.7158144,0.00011796597,0.000060084938,0.00077908527,0.000008416401,0.00039820606,0.004638329],"genre_scores_gemma":[0.91933,0.00000741602,0.08026198,0.0000968571,0.000030036981,0.00013942253,0.000054374286,0.000017383343,0.000062540304],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987769,0.000025553993,0.0003360008,0.0002539914,0.00037057744,0.00023696177],"domain_scores_gemma":[0.9988778,0.000107863445,0.00021198462,0.0006228736,0.00011273756,0.000066700224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018901608,0.00015734971,0.00021617334,0.00017905142,0.00008187548,0.00010553138,0.000536047,0.000069753536,0.000041113857],"category_scores_gemma":[0.000039148938,0.00012687373,0.000053369335,0.00040485265,0.0000735121,0.00026457728,0.00011088529,0.00009596226,0.00010214208],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000234732,0.00004149052,0.0000058641604,0.00004334389,0.000013445036,3.2275236e-7,0.00054421654,0.00009284023,0.41522926,0.5814958,0.000110932124,0.0024201188],"study_design_scores_gemma":[0.0004192482,0.00011903353,0.0009773483,0.000039177856,0.000009297181,0.0000036909832,0.00010062657,0.4789088,0.3498721,0.16916405,0.00008359415,0.00030302344],"about_ca_topic_score_codex":0.000002317365,"about_ca_topic_score_gemma":6.4362064e-7,"teacher_disagreement_score":0.64115274,"about_ca_system_score_codex":0.00001731348,"about_ca_system_score_gemma":0.00002100462,"threshold_uncertainty_score":0.51737607},"labels":[],"label_agreement":null},{"id":"W2118175818","doi":"10.1016/j.dam.2013.04.005","title":"Network descriptors based on betweenness centrality and transmission and their extremal values","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Betweenness centrality; Centrality; Mathematics; Network theory; Transmission (telecommunications); Key (lock); Information transmission; Transmission network; Theoretical computer science; Combinatorics; Discrete mathematics; Computer science; Computer network; Telecommunications; Computer security","score_opus":0.013323665500559644,"score_gpt":0.22446025656908775,"score_spread":0.2111365910685281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118175818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48201683,0.00006407549,0.50849694,0.0001676458,0.000017844848,0.00071604335,0.000013507865,0.00013463394,0.0083724875],"genre_scores_gemma":[0.9661394,0.000004206473,0.03347486,0.00005889939,0.00014081849,0.000081646824,0.000039150134,0.000029635812,0.00003140072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893636,0.00002837973,0.00029224614,0.0002897486,0.00013322232,0.00032003692],"domain_scores_gemma":[0.99923587,0.00017721496,0.000116640185,0.00030735641,0.000024452282,0.00013846431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019108185,0.00026905313,0.0003737792,0.000037333513,0.00017934968,0.0001175042,0.00012627136,0.000049881077,0.00022263866],"category_scores_gemma":[0.0000014691235,0.00019520927,0.00007669318,0.00012574575,0.00009691562,0.00006585842,0.000054317734,0.00013910567,0.0000052561863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008494778,0.0009073057,0.035096344,0.000596961,0.00053740694,0.0000012673172,0.005760631,0.0016236426,0.008999881,0.5886081,0.009840868,0.34794265],"study_design_scores_gemma":[0.0006855896,0.0000723144,0.0065079625,0.0002457889,0.00018003922,4.7034007e-7,0.0011344255,0.23784402,0.0042347154,0.747511,0.0008522787,0.0007313683],"about_ca_topic_score_codex":0.000032471973,"about_ca_topic_score_gemma":6.5356676e-7,"teacher_disagreement_score":0.48412254,"about_ca_system_score_codex":0.000010608946,"about_ca_system_score_gemma":0.000009017858,"threshold_uncertainty_score":0.7960403},"labels":[],"label_agreement":null},{"id":"W2120708918","doi":"10.1016/j.dam.2013.10.016","title":"Matrix partitions of split graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Applied 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","funders":"","keywords":"Mathematics; Combinatorics; Partition (number theory); Bipartite graph; Chordal graph; Cograph; Discrete mathematics; Complete bipartite graph; Graph; 1-planar graph","score_opus":0.018241546581663645,"score_gpt":0.29076085388082396,"score_spread":0.2725193072991603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120708918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06582932,0.00005161683,0.8986166,0.00024881787,0.00004451001,0.00076730375,0.000009680178,0.00019946399,0.034232654],"genre_scores_gemma":[0.5264047,0.0000116588235,0.47311231,0.000030255744,0.000009032862,0.00019133557,0.0000037656675,0.000016409344,0.00022054878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862814,0.000016604921,0.000379596,0.00025118014,0.0003785277,0.00034594894],"domain_scores_gemma":[0.9984486,0.00020850076,0.00015323516,0.00097044784,0.00009838867,0.00012080909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023443825,0.00014869432,0.00024366059,0.00014908906,0.00009038282,0.00008235446,0.00093291554,0.00005240411,0.00015163339],"category_scores_gemma":[0.000035840272,0.00012459146,0.000093161005,0.0005841701,0.00016955842,0.0002866545,0.0003055567,0.00013173815,0.00045445428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014168655,0.000061659804,0.000014509447,0.00008451194,0.000016256676,5.4416813e-7,0.00048508932,0.00003280162,0.008071004,0.9896683,0.00030596764,0.0012579241],"study_design_scores_gemma":[0.0001698568,0.00002966278,0.00012279194,0.000019291167,0.0000062258255,0.0000037371924,0.00023979277,0.0071343738,0.008103047,0.9838866,0.00013826125,0.00014637967],"about_ca_topic_score_codex":0.0000040054965,"about_ca_topic_score_gemma":7.196325e-7,"teacher_disagreement_score":0.46057534,"about_ca_system_score_codex":0.0000126610785,"about_ca_system_score_gemma":0.00002410762,"threshold_uncertainty_score":0.58412415},"labels":[],"label_agreement":null},{"id":"W2121321202","doi":"10.1016/j.dam.2011.04.021","title":"On cryptographic protocols employing asymmetric pairings — The role of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>Ψ</mml:mi></mml:math>revisited","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":134,"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":"Cryptography; Type (biology); Isomorphism (crystallography); Computer science; Cryptographic protocol; Cryptographic primitive; Theoretical computer science; Mathematics; Discrete mathematics; Computer security","score_opus":0.0213364122456201,"score_gpt":0.24710699067022135,"score_spread":0.22577057842460124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121321202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90933955,0.00013374536,0.07937439,0.00004882711,0.00012845558,0.0013998296,0.00009824116,0.00033160584,0.009145382],"genre_scores_gemma":[0.9376107,0.000051480143,0.058808595,0.00028590235,0.00011698794,0.0029667518,0.0000615421,0.000095514115,0.000002539358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966261,0.00006061515,0.00087983947,0.000732115,0.0009977816,0.00070356537],"domain_scores_gemma":[0.99618334,0.00061532174,0.0008526545,0.0020558801,0.000075620075,0.00021716411],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010890167,0.00046065397,0.00038312125,0.00031875388,0.0005168143,0.00037726745,0.0018748913,0.0003297248,0.000021932286],"category_scores_gemma":[0.00021001726,0.00041257107,0.00054368854,0.0014566277,0.00033280757,0.00047681908,0.00095075107,0.00056601636,0.00024102777],"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.00009055808,0.00033766736,0.00003130514,0.00047761766,0.00017255283,0.000018529228,0.0028951252,0.000024771154,0.00083634845,0.99302065,0.00011835188,0.0019765357],"study_design_scores_gemma":[0.0010477363,0.0006119347,0.0003350529,0.000768257,0.00025662893,0.0000670826,0.0010562734,0.82242876,0.019357432,0.15151247,0.0016980413,0.00086029735],"about_ca_topic_score_codex":0.000053431235,"about_ca_topic_score_gemma":0.00001441107,"teacher_disagreement_score":0.84150815,"about_ca_system_score_codex":0.000009329219,"about_ca_system_score_gemma":0.000103734455,"threshold_uncertainty_score":0.99983263},"labels":[],"label_agreement":null},{"id":"W2124994312","doi":"10.1016/j.dam.2007.05.059","title":"Degree constrained subgraphs","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":121,"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; Conjecture; Combinatorics; Weighting; Degree (music); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.024134379307381403,"score_gpt":0.24711142689510557,"score_spread":0.22297704758772416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124994312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021330636,0.00005957402,0.8734045,0.00016784917,0.00014017787,0.00024065527,0.000001989264,0.00045894377,0.10419564],"genre_scores_gemma":[0.591892,0.0000039974193,0.407764,0.0002332923,0.0000063637153,0.000008259903,0.000003122313,0.000012752894,0.000076241566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984644,0.0000059176136,0.00041624674,0.00032379056,0.00035421626,0.00043540538],"domain_scores_gemma":[0.99871206,0.00017854777,0.00014426622,0.0007356959,0.00006008585,0.00016936673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008169932,0.00019137248,0.00022367045,0.00015498065,0.00013795939,0.00010385434,0.00062997726,0.00008674746,0.000017255095],"category_scores_gemma":[0.000029708568,0.00015861973,0.00008627707,0.00050116,0.00012993619,0.00009794553,0.00015996801,0.00013960508,0.00014048177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022288023,0.000050861294,0.000012037317,0.000031311956,0.000015677442,0.000008721487,0.0007015106,0.0000068679205,0.010314169,0.98231953,0.0002926216,0.0062444727],"study_design_scores_gemma":[0.0006786647,0.00004359539,0.0001218821,0.000039870996,0.000021078376,0.00003853304,0.00041752862,0.0060204663,0.021549636,0.9699855,0.0006447687,0.00043849996],"about_ca_topic_score_codex":0.0000032447688,"about_ca_topic_score_gemma":0.000004446068,"teacher_disagreement_score":0.57056135,"about_ca_system_score_codex":0.000011612383,"about_ca_system_score_gemma":0.000029836494,"threshold_uncertainty_score":0.6468325},"labels":[],"label_agreement":null},{"id":"W2127188248","doi":"10.1016/j.dam.2007.09.023","title":"Minimum cost homomorphisms to semicomplete multipartite digraphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Homomorphism; Digraph; Multipartite; Combinatorics; Mathematics; Bipartite graph; Discrete mathematics; Graph; Directed graph; Graph homomorphism; Line graph; Voltage graph","score_opus":0.0414669072239449,"score_gpt":0.28795422467880716,"score_spread":0.24648731745486224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127188248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06559129,0.000035803885,0.91920257,0.00026462457,0.000098509554,0.0012120457,0.000025840043,0.00041089178,0.013158447],"genre_scores_gemma":[0.5859754,0.000023569359,0.41274512,0.00040880972,0.000044665725,0.00034324866,0.000010955228,0.000049302398,0.0003989043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99735075,0.000030217263,0.0004950155,0.00062905933,0.00070150197,0.00079345045],"domain_scores_gemma":[0.99745536,0.00033847408,0.00014472459,0.0015409224,0.000098760676,0.00042178627],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035088474,0.00033370656,0.00042998663,0.0002841436,0.0003653947,0.0001077934,0.0017459681,0.000082344886,0.000030411047],"category_scores_gemma":[0.00008256431,0.0002986148,0.00013462652,0.0010592013,0.00024419924,0.00025937855,0.00070637517,0.00026103776,0.0008471151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028336563,0.00019067529,0.000053890126,0.00007509635,0.000047672722,0.00007060928,0.005427134,0.00036237738,0.05406011,0.9347873,0.0018247998,0.003072009],"study_design_scores_gemma":[0.0035128787,0.0004077732,0.0008296107,0.00021527083,0.00004808174,0.00045314291,0.0012075858,0.087709874,0.11775708,0.7564551,0.028318087,0.0030855082],"about_ca_topic_score_codex":0.0000023662692,"about_ca_topic_score_gemma":0.0000025385107,"teacher_disagreement_score":0.52038413,"about_ca_system_score_codex":0.000049952647,"about_ca_system_score_gemma":0.00004726319,"threshold_uncertainty_score":0.9999466},"labels":[],"label_agreement":null},{"id":"W2127348678","doi":"10.1016/s0166-218x(03)00367-6","title":"Bichromatic P4-composition schemes for perfect orderability","year":2003,"lang":"en","type":"article","venue":"Discrete Applied 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":"Mathematics; Composition (language); Combinatorics","score_opus":0.008604322185913645,"score_gpt":0.21219221978321215,"score_spread":0.2035878975972985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127348678","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59183794,0.000120205346,0.3798618,0.0000071028207,0.0001711583,0.000926227,0.000016802467,0.00040663464,0.026652155],"genre_scores_gemma":[0.9681205,0.0000043269715,0.031410016,0.000012255931,0.000029807408,0.00032905577,0.000019414892,0.000049372415,0.000025236688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991018,0.000016623482,0.00033673062,0.00016221298,0.00012645421,0.00025613565],"domain_scores_gemma":[0.99933213,0.00017587528,0.000050420243,0.00035683764,0.000022895172,0.000061818195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037911203,0.00020544972,0.0002953451,0.000049467355,0.00010794732,0.000043641903,0.00011393438,0.0000872515,0.00006296837],"category_scores_gemma":[0.000030891155,0.00018374117,0.00010704499,0.00013757721,0.000041278694,0.000055849814,0.000008058694,0.00008619883,0.00005280694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009170828,0.00009476143,0.000018095943,0.0035607556,0.00012949477,5.9235805e-7,0.0024021785,0.00084483816,0.08979152,0.90226746,0.00027669212,0.000604424],"study_design_scores_gemma":[0.0019664473,0.00010530835,0.000043108023,0.0003018976,0.00025766128,0.000038935465,0.004118998,0.06514085,0.28774652,0.63269037,0.0062848344,0.0013050699],"about_ca_topic_score_codex":3.0061852e-7,"about_ca_topic_score_gemma":5.325782e-7,"teacher_disagreement_score":0.37628257,"about_ca_system_score_codex":0.000033484906,"about_ca_system_score_gemma":0.000008673928,"threshold_uncertainty_score":0.74927473},"labels":[],"label_agreement":null},{"id":"W2127635925","doi":"10.1016/s0166-218x(00)00310-3","title":"Bundle-based relaxation methods for multicommodity capacitated fixed charge network design","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":245,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Subgradient method; Mathematics; Relaxation (psychology); Lagrangian relaxation; Combinatorics; Fixed charge; Mathematical optimization; Physics","score_opus":0.07715582862337386,"score_gpt":0.30748746412879346,"score_spread":0.2303316355054196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127635925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027446616,0.000021273083,0.984873,0.00067887444,0.0003156802,0.0018608113,0.000004617526,0.00032795954,0.009173144],"genre_scores_gemma":[0.14002778,0.000011761239,0.8556522,0.0017080059,0.00053127686,0.0009737769,0.00042636401,0.00008230837,0.00058652024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983391,0.000023712524,0.0005674451,0.00034665468,0.00022667224,0.0004963728],"domain_scores_gemma":[0.9988708,0.00020521235,0.00024889078,0.00048666872,0.00016205398,0.000026399222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019203494,0.00028392256,0.00033310958,0.00013877144,0.00038316115,0.00017150902,0.00029513726,0.000101228215,0.0004168666],"category_scores_gemma":[0.00026583511,0.00026450562,0.00012585291,0.0005389073,0.00005305928,0.00027889138,0.00007907738,0.000108679735,0.00036982616],"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.0003995118,0.0010811748,0.00013159127,0.0024398654,0.00022925602,0.0000013191184,0.0005433851,0.13110505,0.0038720912,0.8075756,0.031192299,0.021428907],"study_design_scores_gemma":[0.0010347362,0.000014713759,0.00009072147,0.000038804144,0.00015143747,1.8788604e-7,0.00023138827,0.91379124,0.0003943814,0.03869247,0.04515871,0.00040122503],"about_ca_topic_score_codex":0.00005541768,"about_ca_topic_score_gemma":0.000029708026,"teacher_disagreement_score":0.7826862,"about_ca_system_score_codex":0.000052202286,"about_ca_system_score_gemma":0.000015906795,"threshold_uncertainty_score":0.9999807},"labels":[],"label_agreement":null},{"id":"W2127787106","doi":"10.1016/j.dam.2011.03.023","title":"Vertex splitting and the recognition of trapezoid graphs","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Graph; Discrete mathematics","score_opus":0.040049433078991906,"score_gpt":0.25853679108964805,"score_spread":0.21848735801065616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127787106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111130804,0.0001360091,0.82078385,0.00008453818,0.000053988737,0.0007835555,0.0000059254985,0.00012180459,0.066899545],"genre_scores_gemma":[0.76343066,0.000044810153,0.23639642,0.000041578485,0.0000048376505,0.00005196451,0.0000013669558,0.000012072534,0.000016292477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901116,0.000036698722,0.00029604722,0.00020687527,0.0002391687,0.00021005957],"domain_scores_gemma":[0.9988186,0.00040327132,0.00016339612,0.00051409,0.000048742328,0.000051919258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008230429,0.000117515,0.00021516536,0.000081267826,0.00010450205,0.0000323431,0.00056040025,0.00003930512,0.000014057834],"category_scores_gemma":[0.00006750667,0.00007602584,0.00006190689,0.00031559088,0.00038582136,0.00014396402,0.00021339729,0.00013152235,0.000013865011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002773462,0.00002934497,0.000005631453,0.00007695613,0.00002113952,7.540395e-7,0.006155806,3.4179905e-7,0.0015480213,0.9721734,0.0000054212283,0.019955453],"study_design_scores_gemma":[0.00060694414,0.000024330742,0.00006281582,0.000029198778,0.000014477908,0.000007689475,0.00079753617,0.0038894406,0.012855083,0.98160356,0.000008341799,0.0001005754],"about_ca_topic_score_codex":0.0000028727302,"about_ca_topic_score_gemma":8.307444e-7,"teacher_disagreement_score":0.6522999,"about_ca_system_score_codex":0.000004619513,"about_ca_system_score_gemma":0.0000116184865,"threshold_uncertainty_score":0.31002438},"labels":[],"label_agreement":null},{"id":"W2129430342","doi":"10.1016/j.dam.2013.04.026","title":"Finding a smallest odd hole in a claw-free graph using global structure","year":2013,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Claw; Mathematics; Lemma (botany); Line graph; Graph; Discrete mathematics","score_opus":0.02756508440387017,"score_gpt":0.29294261870309146,"score_spread":0.2653775342992213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129430342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37219235,0.000045211673,0.622179,0.000116616306,0.000058390764,0.00072340854,0.000019607502,0.00011964626,0.0045458125],"genre_scores_gemma":[0.6086127,0.0000029975886,0.39121923,0.00006345324,0.000020637875,0.000044090757,0.0000033216888,0.000018113837,0.000015433567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782336,0.000032733828,0.00043068087,0.00049621623,0.00051859266,0.00069842214],"domain_scores_gemma":[0.998107,0.0001415512,0.00016701511,0.001362078,0.00005860215,0.0001637322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027026737,0.0002879419,0.00035396917,0.00019293616,0.00015207475,0.00029683026,0.0019586745,0.00013197052,0.000058310212],"category_scores_gemma":[0.000082245046,0.00025277838,0.000083658335,0.0012200765,0.00015183026,0.00035388864,0.0010014584,0.00031512187,0.000048305174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005226595,0.00004864739,0.00030030153,0.00010335955,0.000020566229,0.0000131923125,0.0010576466,0.0012145088,0.012368647,0.98312336,0.00008654717,0.0016579792],"study_design_scores_gemma":[0.00055209844,0.000018725825,0.0004066464,0.000059660568,0.0000056905005,0.000018558614,0.00046183003,0.067350924,0.0009674492,0.9298389,0.000014782199,0.00030473823],"about_ca_topic_score_codex":0.000029182585,"about_ca_topic_score_gemma":0.00004694645,"teacher_disagreement_score":0.23642035,"about_ca_system_score_codex":0.00012292851,"about_ca_system_score_gemma":0.000059387126,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W2129707404","doi":"10.1016/s0166-218x(00)00180-3","title":"Ray shooting from convex ranges","year":2001,"lang":"en","type":"article","venue":"Discrete Applied 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":"Carleton University","funders":"","keywords":"Mathematics; Combinatorics; Homothetic transformation; Regular polygon; Comparability; Convex set; Plane (geometry); Graph; Discrete mathematics; Convex optimization; Geometry","score_opus":0.018066393488328152,"score_gpt":0.2419161445472571,"score_spread":0.22384975105892896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129707404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056245085,0.00007709563,0.9255312,0.00036854963,0.00014216352,0.000164054,0.000003390934,0.00017279634,0.01729568],"genre_scores_gemma":[0.619618,0.000017017865,0.37967208,0.00027493248,0.0001550907,0.000023705254,0.00003075782,0.000010566413,0.00019784698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989804,0.000011393662,0.00025436134,0.0002714952,0.0002878866,0.0001944765],"domain_scores_gemma":[0.9991834,0.00021899294,0.00011091849,0.00037078717,0.000042686177,0.000073172014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001911272,0.00013759568,0.0001808504,0.00006797305,0.00012246298,0.00015616906,0.00042039115,0.000050026018,0.00006913005],"category_scores_gemma":[0.000028924827,0.00012448976,0.00004910507,0.00031036139,0.000022526689,0.00016766241,0.00013814292,0.00008227312,0.00019077961],"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.000010218158,0.00014211684,0.000057132504,0.0000483164,0.00006916644,0.0000167569,0.0044259517,0.0049028466,0.03593591,0.88935584,0.0014610164,0.06357473],"study_design_scores_gemma":[0.0010709285,0.000038286264,0.0007199203,0.00005334557,0.00003985286,0.000018686507,0.00056479714,0.63230497,0.020972027,0.3298693,0.013679152,0.0006687535],"about_ca_topic_score_codex":0.000004217024,"about_ca_topic_score_gemma":0.000002239325,"teacher_disagreement_score":0.6274021,"about_ca_system_score_codex":0.00001823583,"about_ca_system_score_gemma":0.000025960642,"threshold_uncertainty_score":0.5076545},"labels":[],"label_agreement":null},{"id":"W2130436162","doi":"10.1016/j.dam.2011.12.020","title":"The interval ordering problem","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Interval (graph theory); Bottleneck; Time complexity; Combinatorics; Cover (algebra); Real line; Function (biology); Set (abstract data type); Discrete mathematics; Constant (computer programming); Polynomial; Computer science; Mathematical analysis","score_opus":0.016370403418607012,"score_gpt":0.2497104297630086,"score_spread":0.2333400263444016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130436162","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013762411,0.00013936534,0.97348094,0.00018194156,0.00017642158,0.00019712072,0.0000015568439,0.00014456437,0.024301875],"genre_scores_gemma":[0.21881711,0.000026777183,0.78059965,0.00009260251,0.00015435049,0.00007672152,0.000004338593,0.000018968276,0.00020947118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990566,0.000008306517,0.00021465775,0.0001387827,0.00023107136,0.00035063346],"domain_scores_gemma":[0.9990187,0.00012147189,0.000097368415,0.00065671914,0.000018104243,0.000087581764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037099063,0.00012016963,0.00011505668,0.0000185663,0.00026959245,0.00021295354,0.00087308965,0.000032940196,0.0000070927417],"category_scores_gemma":[0.00001263799,0.000069591835,0.0000377345,0.00012777514,0.000037812973,0.00031350437,0.000723635,0.000111242734,0.00012709862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012528056,0.000042060998,0.000008524738,0.000031917498,0.0000115854355,3.6062085e-7,0.0021719255,0.0000076351735,0.0007607079,0.9564188,0.0013211371,0.03922405],"study_design_scores_gemma":[0.0010540783,0.00009405633,0.0004555895,0.0002497657,0.000054979857,0.000088454486,0.003433745,0.32068148,0.014277983,0.36664602,0.29148975,0.0014740903],"about_ca_topic_score_codex":0.0000020920108,"about_ca_topic_score_gemma":7.918285e-7,"teacher_disagreement_score":0.5897728,"about_ca_system_score_codex":0.000015084722,"about_ca_system_score_gemma":0.000011359702,"threshold_uncertainty_score":0.28378728},"labels":[],"label_agreement":null},{"id":"W2130863730","doi":"10.1016/j.dam.2006.04.043","title":"Solution techniques for the Large Set Covering Problem","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal","funders":"","keywords":"Mathematics; Set (abstract data type); Set cover problem; Combinatorics; Mathematical optimization; Computer science; Programming language","score_opus":0.014788920217505755,"score_gpt":0.26203942753925386,"score_spread":0.2472505073217481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130863730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006533945,0.00004980451,0.98264664,0.00005289487,0.000041299456,0.00082004647,0.00003569882,0.0007658817,0.0149343535],"genre_scores_gemma":[0.16860916,0.000013450301,0.8307727,0.000024368228,0.000116566334,0.0002452358,0.000042254676,0.000072695955,0.00010359884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919534,0.000005864292,0.00028123622,0.00011512256,0.00012935168,0.00027311087],"domain_scores_gemma":[0.9994247,0.00020194064,0.000064688764,0.00025990224,0.000028305658,0.000020471547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005039693,0.00014848544,0.0001556228,0.0000356675,0.00015152016,0.00006051133,0.00015719618,0.000077999954,0.00001082205],"category_scores_gemma":[0.000017800681,0.00011615896,0.000055140274,0.00013193327,0.000022208924,0.000051464027,0.00003899295,0.00009732583,0.000008222204],"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.000011207099,0.00007256729,0.000025676884,0.0015317128,0.0001048278,6.205774e-7,0.0015795632,0.36728674,0.05423439,0.55698466,0.010910233,0.0072577717],"study_design_scores_gemma":[0.00023254871,0.00000793486,0.0000119416845,0.000035695804,0.00004842538,0.000002593235,0.00018303789,0.93521523,0.03141187,0.023580013,0.009045744,0.00022494508],"about_ca_topic_score_codex":0.0000023414486,"about_ca_topic_score_gemma":0.0000030675808,"teacher_disagreement_score":0.5679285,"about_ca_system_score_codex":0.00004655747,"about_ca_system_score_gemma":0.00000678676,"threshold_uncertainty_score":0.4736825},"labels":[],"label_agreement":null},{"id":"W2131972975","doi":"10.1016/j.dam.2006.04.025","title":"Two-tuple balance of non-binary sequences with ideal two-level autocorrelation","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sequence (biology); Conjecture; Combinatorics; Autocorrelation; Prime (order theory); Ideal (ethics); Finite field; Tuple; Binary number; Discrete mathematics; Period (music); Pseudorandom binary sequence; Function (biology); Arithmetic; Statistics","score_opus":0.01195315731277429,"score_gpt":0.23859496720282278,"score_spread":0.22664180989004848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131972975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1270785,0.000018341112,0.83965516,0.000059019792,0.000050638202,0.00034529652,0.000008367504,0.0001366523,0.032648012],"genre_scores_gemma":[0.6736414,0.0000013413947,0.32619348,0.000025429554,0.000030659634,0.00004406284,0.0000085407655,0.000010988019,0.000044135293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871516,0.000016033739,0.0003594988,0.0003004877,0.00034958817,0.0002592191],"domain_scores_gemma":[0.9988747,0.00015806987,0.0002951246,0.00057174294,0.000053195337,0.00004716965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033111367,0.00019898971,0.0002732612,0.00010612184,0.00012228182,0.00006959435,0.00061353977,0.00004525862,0.000012170528],"category_scores_gemma":[0.000005203862,0.00015748372,0.00007151866,0.00052279036,0.00014131164,0.00022059378,0.00012289335,0.00011884498,0.000018475703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016089572,0.0000830997,0.00038891373,0.000087639564,0.000018371922,0.0000044014314,0.0007464904,0.0030054976,0.011597379,0.983078,0.000076561606,0.000897546],"study_design_scores_gemma":[0.0013380527,0.00018303463,0.0027396434,0.0001959552,0.0000505957,0.000025180028,0.00038665597,0.26876253,0.012484958,0.7132182,0.00006834163,0.0005468328],"about_ca_topic_score_codex":0.000040515308,"about_ca_topic_score_gemma":0.000015073152,"teacher_disagreement_score":0.54656285,"about_ca_system_score_codex":0.000016852395,"about_ca_system_score_gemma":0.00004898242,"threshold_uncertainty_score":0.64219993},"labels":[],"label_agreement":null},{"id":"W2132813033","doi":"10.1016/j.dam.2013.03.004","title":"Three-fast-searchable graphs","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerstwo Edukacji i Nauki; Fundacja na rzecz Nauki Polskiej","keywords":"Mathematics; Combinatorics","score_opus":0.019420457476262504,"score_gpt":0.2452834164866836,"score_spread":0.22586295901042108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132813033","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000946303,0.000017265666,0.9260095,0.000663119,0.000044719593,0.00064360147,0.0000014227604,0.0002724354,0.07140164],"genre_scores_gemma":[0.082034834,0.000022538932,0.9165656,0.00036091043,0.000024415349,0.00029860172,0.0000080763775,0.00002979518,0.00065524434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855053,0.0000091576685,0.00027523586,0.00029468103,0.00043822746,0.00043217783],"domain_scores_gemma":[0.99882567,0.00008522682,0.000081543156,0.00074113306,0.00008206347,0.00018436658],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025427103,0.00015997607,0.00018922478,0.00011409977,0.0001535512,0.00037557055,0.0009160648,0.000060705337,0.0003615254],"category_scores_gemma":[0.000019216657,0.00012957172,0.000060748796,0.00044724753,0.00007673721,0.0003681309,0.00036493002,0.0001574111,0.0014862401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.5835193e-7,0.000055597797,0.0000110326,0.00005484121,0.000013094629,8.628403e-7,0.0008012406,0.00019531431,0.001489076,0.98745316,0.0029296302,0.006995672],"study_design_scores_gemma":[0.00024753762,0.000027428532,0.00007178108,0.000014970689,0.0000032183455,0.00000356482,0.00015665333,0.38013834,0.0008836257,0.6175988,0.00064000394,0.00021410057],"about_ca_topic_score_codex":0.000019458685,"about_ca_topic_score_gemma":0.000004676802,"teacher_disagreement_score":0.379943,"about_ca_system_score_codex":0.000017428652,"about_ca_system_score_gemma":0.000038185135,"threshold_uncertainty_score":0.99929124},"labels":[],"label_agreement":null},{"id":"W2133331715","doi":"10.1016/j.dam.2012.07.020","title":"On the impact of symmetry-breaking constraints on spatial Branch-and-Bound for circle packing in a square","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":30,"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":"Circle packing; Mathematics; Square (algebra); Packing problems; Combinatorics; Branch and bound; Symmetry (geometry); Symmetry breaking; Mathematical optimization; Geometry","score_opus":0.01938644715395996,"score_gpt":0.26391685446127905,"score_spread":0.2445304073073191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133331715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78321016,0.00004627445,0.18615244,0.000033187847,0.000108592896,0.0010783958,0.00007480651,0.00010826388,0.029187897],"genre_scores_gemma":[0.99760497,0.000005806098,0.0022290447,0.000020343765,0.000034879515,0.00005021894,0.000011571213,0.00004037462,0.0000027996327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928284,0.000008208395,0.00025086539,0.00008902968,0.000117692034,0.00025138762],"domain_scores_gemma":[0.99923694,0.00044071834,0.00007801914,0.00018360683,0.000013922138,0.00004679157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027896068,0.00014926716,0.00021726631,0.0000819106,0.00004741767,0.0000336085,0.00008000341,0.00006828809,0.00005688711],"category_scores_gemma":[0.00005779979,0.000111178146,0.0000666934,0.00011886861,0.00005588569,0.000038408798,0.000014835086,0.00011873524,0.00000706121],"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.00009027952,0.00037129284,0.0011922606,0.0021423523,0.00031082926,7.1563846e-7,0.021490932,0.13705306,0.010242568,0.7750585,0.00031952438,0.05172765],"study_design_scores_gemma":[0.00757426,0.0008051205,0.018263137,0.0037034985,0.00023860933,0.000029905656,0.005127941,0.7540325,0.040767413,0.16685331,0.000117674776,0.0024866543],"about_ca_topic_score_codex":0.000007467865,"about_ca_topic_score_gemma":0.0000035652147,"teacher_disagreement_score":0.6169794,"about_ca_system_score_codex":0.000040354254,"about_ca_system_score_gemma":0.000008421131,"threshold_uncertainty_score":0.45337132},"labels":[],"label_agreement":null},{"id":"W2133703501","doi":"10.1016/j.dam.2012.05.023","title":"On the existence of Hamiltonian paths for history based pivot rules on acyclic unique sink orientations of hypercubes","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Mathematics; Hamiltonian path; Digraph; Combinatorics; Directed acyclic graph; Hamiltonian (control theory); Path (computing); Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.041477261284386294,"score_gpt":0.2545653371370211,"score_spread":0.21308807585263484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133703501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11221179,0.000048734535,0.8631022,0.00025439478,0.0004763763,0.00086041226,0.000025875086,0.000061020473,0.022959186],"genre_scores_gemma":[0.9520806,0.0000022934096,0.047326975,0.00026356822,0.00004594932,0.00016229159,0.000005338873,0.00001502314,0.000097982316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989584,0.000037192523,0.00040099464,0.00015844908,0.00024120072,0.00020374995],"domain_scores_gemma":[0.9979333,0.0010099388,0.00029854936,0.00063268293,0.00007911279,0.000046365625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005103958,0.00014133057,0.00024656559,0.000074134034,0.000088063294,0.00001690316,0.0004665117,0.00005980642,0.000013574939],"category_scores_gemma":[0.000073664494,0.000094070674,0.00011137345,0.00011159778,0.00009092507,0.00007908268,0.000040245483,0.00008438983,0.000011706344],"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.000010996328,0.00014036601,0.0000047560925,0.00012019921,0.000014110502,8.1428766e-8,0.0036475805,0.00013578688,0.0026635358,0.9921351,0.0007430323,0.0003844391],"study_design_scores_gemma":[0.002652967,0.0019269976,0.00082807796,0.0019154578,0.00020555378,0.000017153248,0.009171614,0.4894892,0.12982327,0.34357348,0.018670112,0.0017261057],"about_ca_topic_score_codex":0.000008056944,"about_ca_topic_score_gemma":0.00000383768,"teacher_disagreement_score":0.8398688,"about_ca_system_score_codex":0.00007297441,"about_ca_system_score_gemma":0.000042616062,"threshold_uncertainty_score":0.38360906},"labels":[],"label_agreement":null},{"id":"W2133943430","doi":"10.1016/j.dam.2014.08.016","title":"How many double squares can a string contain?","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Bounding overwatch; String (physics); Mathematics; Combinatorics; Upper and lower bounds; Least-squares function approximation; Discrete mathematics; Computer science; Statistics; Mathematical analysis; Mathematical physics","score_opus":0.015293524775743722,"score_gpt":0.23041399782368463,"score_spread":0.2151204730479409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133943430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058869743,0.000022497698,0.98462874,0.0004954494,0.00009924984,0.00026703774,0.0000072128623,0.00022945067,0.008363399],"genre_scores_gemma":[0.71580434,0.0000046405457,0.28361276,0.00012444785,0.00009545273,0.00005083615,0.000015695041,0.000020066109,0.00027176403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874455,0.000010367563,0.0002123397,0.00035010447,0.0003480869,0.00033452548],"domain_scores_gemma":[0.9986436,0.00009334607,0.00014786667,0.0009539397,0.00003536523,0.00012587843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002304249,0.00019784382,0.00025992098,0.00006201806,0.0001714244,0.000537795,0.0009386038,0.00006353945,0.000006497398],"category_scores_gemma":[0.000014850178,0.00015573516,0.00005450581,0.00015905968,0.000036675625,0.000245558,0.00051822246,0.00013074493,0.000026528449],"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.00000341406,0.00003195562,0.0000054536113,0.00006596097,0.000010641943,0.0000021767985,0.0008520098,0.000025164878,0.0014427084,0.9872251,0.00043370173,0.009901719],"study_design_scores_gemma":[0.0034887372,0.00017892648,0.00017417516,0.00023136662,0.00005453037,0.00003195667,0.0021279976,0.60080963,0.030645236,0.32782283,0.033070114,0.0013644748],"about_ca_topic_score_codex":0.00001948779,"about_ca_topic_score_gemma":0.000008435472,"teacher_disagreement_score":0.70991737,"about_ca_system_score_codex":0.000025564204,"about_ca_system_score_gemma":0.000021701624,"threshold_uncertainty_score":0.63506955},"labels":[],"label_agreement":null},{"id":"W2134122221","doi":"10.1016/j.dam.2008.05.026","title":"On the tiling by translation problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cellular Automata and Applications","field":"Computer Science","cited_by":35,"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":"Polyomino; Mathematics; Square (algebra); Constant (computer programming); Combinatorics; Square tiling; Translation (biology); Time complexity; Quadratic equation; Tile; Plane (geometry); Discrete mathematics; Hexagonal crystal system; Algorithm; Computer science; Geometry","score_opus":0.02565413947899917,"score_gpt":0.2280014864183632,"score_spread":0.20234734693936404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134122221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013241841,0.000031256866,0.9361393,0.0011012157,0.0000138565165,0.0004444387,0.0000048103834,0.00020851773,0.048814785],"genre_scores_gemma":[0.83405656,0.000016587472,0.16515265,0.00029592222,0.000018022109,0.00018150965,0.000019270901,0.000017904536,0.00024159548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918026,0.000007726646,0.00019998565,0.00020306194,0.00024543868,0.00016352038],"domain_scores_gemma":[0.999082,0.00020751166,0.000079006364,0.0005783577,0.000013546152,0.00003957303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014420862,0.00011516664,0.000104819956,0.000023750035,0.0002852005,0.0000597487,0.00055270724,0.0000374618,0.000018245582],"category_scores_gemma":[0.0000051173843,0.00007702319,0.000046611345,0.00022052122,0.00004930207,0.000071064154,0.000047090238,0.00010330262,0.00019530098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.415901e-7,0.000060192713,4.454723e-7,0.000014682934,0.0000071037366,5.7244364e-7,0.0020067894,0.00004564832,0.014080534,0.9779317,0.0032322595,0.0026194712],"study_design_scores_gemma":[0.0005577916,0.000047867758,0.00002132063,0.000045988887,0.000026324431,0.000036136902,0.00029069936,0.37669915,0.07058777,0.533222,0.017866723,0.0005982124],"about_ca_topic_score_codex":0.0000011524332,"about_ca_topic_score_gemma":3.5392284e-7,"teacher_disagreement_score":0.82081467,"about_ca_system_score_codex":0.000011418621,"about_ca_system_score_gemma":0.000017230523,"threshold_uncertainty_score":0.31409147},"labels":[],"label_agreement":null},{"id":"W2134683937","doi":"10.1016/j.dam.2004.01.003","title":"Fun-Sort—or the chaos of unordered binary search","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"sort; Binary number; Permutation (music); Mathematics; Binary search algorithm; Random permutation; Combinatorics; Point (geometry); Binary search tree; CHAOS (operating system); Algorithm; Element (criminal law); Discrete mathematics; Search algorithm; Binary tree; Computer science; Arithmetic; Block (permutation group theory)","score_opus":0.027464717399487384,"score_gpt":0.2710111488748926,"score_spread":0.2435464314754052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134683937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017387586,0.00006659629,0.97639686,0.000820982,0.00008927735,0.0005000081,0.000022987944,0.00011525699,0.004600457],"genre_scores_gemma":[0.53918874,0.00006626777,0.4601743,0.00017120074,0.00007311649,0.000060316266,0.000021111706,0.000028277009,0.00021665207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986922,0.000012744792,0.00032082913,0.00025579418,0.00045093131,0.0002675046],"domain_scores_gemma":[0.99853414,0.00011710028,0.00013180177,0.0011036227,0.00004612536,0.000067211375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029016225,0.00015737771,0.00022521915,0.000055961573,0.00016204569,0.00007655961,0.0012810072,0.00005749057,0.000031244075],"category_scores_gemma":[0.000014916283,0.00007713902,0.000059008064,0.00037475367,0.00013453503,0.00015620563,0.00071585074,0.00015056114,0.000056934114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026734087,0.00031528165,0.0000034026987,0.00027031015,0.00004852153,0.000016432421,0.009235158,0.0014596389,0.010167007,0.9583825,0.00050603785,0.01956899],"study_design_scores_gemma":[0.0053523704,0.00079038896,0.0007009023,0.00075227756,0.00011771841,0.00014019343,0.011221717,0.32791725,0.105043255,0.5381166,0.008087312,0.001760025],"about_ca_topic_score_codex":0.000020590347,"about_ca_topic_score_gemma":0.0000032676826,"teacher_disagreement_score":0.5218012,"about_ca_system_score_codex":0.000019864,"about_ca_system_score_gemma":0.00009434463,"threshold_uncertainty_score":0.3145638},"labels":[],"label_agreement":null},{"id":"W2135166946","doi":"10.1016/j.dam.2012.03.036","title":"Collective additive tree spanners for circle graphs and polygonal graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Tree (set theory); Spanning tree; Discrete mathematics","score_opus":0.021324002429040537,"score_gpt":0.28290842068083727,"score_spread":0.26158441825179674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135166946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032768715,0.00023838814,0.94114685,0.00017435996,0.00014128529,0.0016610867,0.00012327057,0.00025868654,0.023487369],"genre_scores_gemma":[0.72872764,0.000021673195,0.2701722,0.00012046208,0.00003714673,0.0005586672,0.000017642325,0.000043140346,0.00030140212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818015,0.000027943799,0.00027876635,0.00040189349,0.0003724808,0.0007387372],"domain_scores_gemma":[0.998163,0.00080445124,0.00014870337,0.0005141568,0.00008999285,0.0002796932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327573,0.00024557204,0.00032621273,0.00024708934,0.00031068275,0.00010341129,0.0005701624,0.00008828118,0.0000102841905],"category_scores_gemma":[0.00009812676,0.0002313366,0.00011890883,0.000673386,0.00028613897,0.00042302354,0.00028124914,0.00017504518,0.000017776194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032533488,0.00009861256,0.000032176576,0.000060386734,0.00007033893,7.670291e-7,0.005048553,0.0000027138267,0.0020661615,0.98226994,0.00033782533,0.00997996],"study_design_scores_gemma":[0.0007549375,0.00009690393,0.0007060329,0.000021978687,0.000026481031,0.000014373734,0.0014046674,0.0025382643,0.007880376,0.9858899,0.00030941266,0.00035668988],"about_ca_topic_score_codex":0.000001168166,"about_ca_topic_score_gemma":0.0000028260777,"teacher_disagreement_score":0.6959589,"about_ca_system_score_codex":0.0000646092,"about_ca_system_score_gemma":0.000081666454,"threshold_uncertainty_score":0.9433633},"labels":[],"label_agreement":null},{"id":"W2136673846","doi":"10.1016/j.dam.2002.11.006","title":"On the distance function approach to color image enhancement","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Image (mathematics); Function (biology); Computer vision; Artificial intelligence; Combinatorics; Computer science","score_opus":0.021655322853926053,"score_gpt":0.2566895215961268,"score_spread":0.23503419874220075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136673846","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001125884,0.000010312607,0.7886706,0.00019811344,0.00009469101,0.0004564479,0.0000010382544,0.00006364629,0.20937924],"genre_scores_gemma":[0.16097307,0.0000023204282,0.8361465,0.0014576477,0.00002455116,0.00024386832,0.000002054112,0.000019396855,0.0011305857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867034,0.000059291502,0.0002450336,0.0003445092,0.0003875917,0.00029323742],"domain_scores_gemma":[0.9986836,0.00028437606,0.00009513726,0.00081788446,0.000042545187,0.00007648674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008481644,0.00018448227,0.00019020292,0.000044075907,0.00022222544,0.00024069716,0.0005791424,0.000038588092,0.000026141803],"category_scores_gemma":[0.00009841655,0.0001182929,0.00005770001,0.00036812897,0.000043575754,0.000096566066,0.00008806335,0.00013375608,0.0002763494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012243954,0.00011075243,5.6461282e-8,0.000028300008,0.0000118816,7.4438583e-7,0.00095837086,0.00006318387,0.019558348,0.97584945,0.002429377,0.0009773035],"study_design_scores_gemma":[0.0008545015,0.00024477686,0.000010353988,0.00006358136,0.000046302783,0.000008876576,0.00080998003,0.031287316,0.1883962,0.7603135,0.017268186,0.00069640897],"about_ca_topic_score_codex":5.2083664e-7,"about_ca_topic_score_gemma":1.6868495e-7,"teacher_disagreement_score":0.21553591,"about_ca_system_score_codex":0.00004314944,"about_ca_system_score_gemma":0.00002441403,"threshold_uncertainty_score":0.48238444},"labels":[],"label_agreement":null},{"id":"W2136811867","doi":"10.1016/s0166-218x(01)00266-9","title":"Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":51,"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; Semidefinite programming; Polytope; Relaxation (psychology); Maximum cut; Intersection (aeronautics); Lagrangian relaxation; Flexibility (engineering); Combinatorics; Metric (unit); Constraint (computer-aided design); Set (abstract data type); Relaxation technique; Feasible region; Regular polygon; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Computer science; Geometry","score_opus":0.03249075521729931,"score_gpt":0.2356156697719298,"score_spread":0.2031249145546305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136811867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008453712,0.00012472525,0.973694,0.0008868697,0.000106170555,0.0008399551,0.000028851067,0.00025004314,0.023224007],"genre_scores_gemma":[0.11964016,0.000027749682,0.8784306,0.00036235442,0.00011091172,0.00050517183,0.000011045716,0.000037089932,0.0008749413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985418,0.000013584589,0.0004415024,0.0003445611,0.00027562378,0.00038293525],"domain_scores_gemma":[0.9976311,0.001092624,0.00026812174,0.00087191176,0.000060921604,0.00007532629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038035048,0.00022005056,0.00023275788,0.0000775123,0.00059880636,0.00026724153,0.0010484112,0.00007135259,0.000117115254],"category_scores_gemma":[0.00005411865,0.00016073028,0.00014357126,0.00043349844,0.00009421452,0.00017183056,0.00027810724,0.00020110949,0.00007760745],"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.0000015397696,0.00009960788,0.000002022408,0.0001357894,0.000063706895,9.1892935e-7,0.005906743,0.00016009793,0.00039721082,0.9640932,0.0015350804,0.027604055],"study_design_scores_gemma":[0.00036635963,0.00003135755,0.00000843104,0.0000357588,0.000032571697,0.000013012234,0.00033361948,0.5764612,0.00070816773,0.41339242,0.008358352,0.00025874484],"about_ca_topic_score_codex":0.0000020831867,"about_ca_topic_score_gemma":0.000015405712,"teacher_disagreement_score":0.5763011,"about_ca_system_score_codex":0.000021726079,"about_ca_system_score_gemma":0.0000137284715,"threshold_uncertainty_score":0.6554391},"labels":[],"label_agreement":null},{"id":"W2137357105","doi":"10.1016/j.dam.2010.11.021","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si36.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math>-facility median problem with facilities subject to failure facing uniform demand","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subject (documents); Mathematics; Algorithm; Line (geometry); Computer science","score_opus":0.02049459940847446,"score_gpt":0.21736538255006246,"score_spread":0.196870783141588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137357105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9546129,0.000014480754,0.011575825,0.00035727082,0.0001911489,0.00038451498,0.00010001534,0.00027602582,0.03248781],"genre_scores_gemma":[0.9903185,0.000017976186,0.007593988,0.0006803688,0.00016807635,0.0004895199,0.00033375484,0.0000821935,0.00031563616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969717,0.000013194643,0.0007694978,0.0006680536,0.0008639822,0.0007135668],"domain_scores_gemma":[0.9984129,0.000089115056,0.0003349292,0.00095234613,0.000096162956,0.00011451449],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00078205287,0.00050094776,0.00033754588,0.00020473648,0.0005210898,0.0003638671,0.0005769811,0.00023934765,0.00029903717],"category_scores_gemma":[0.00014405567,0.00048252434,0.00021823986,0.0004428512,0.0001976164,0.0006356692,0.00046241816,0.00032805398,0.002532772],"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.00020513436,0.00017673435,0.00002332922,0.0022112485,0.00018693818,0.000014970251,0.0033671928,0.0013171918,0.00019600318,0.9908747,0.00079632533,0.0006302194],"study_design_scores_gemma":[0.001905644,0.00036029128,0.00020766181,0.0008034613,0.00067475217,0.000017234619,0.022240043,0.92694634,0.0034860948,0.021038176,0.020470107,0.0018501902],"about_ca_topic_score_codex":0.0006235779,"about_ca_topic_score_gemma":0.0017907574,"teacher_disagreement_score":0.96983653,"about_ca_system_score_codex":0.000027637254,"about_ca_system_score_gemma":0.000074956326,"threshold_uncertainty_score":0.99976265},"labels":[],"label_agreement":null},{"id":"W2137849348","doi":"10.1016/s0166-218x(01)00338-9","title":"A survey of very large-scale neighborhood search techniques","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":639,"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 New Brunswick","funders":"","keywords":"Heuristic; Mathematics; Mathematical optimization; Local search (optimization); Variable neighborhood search; Search algorithm; Computation; Algorithm; Incremental heuristic search; Scale (ratio); Computer science; Beam search; Metaheuristic","score_opus":0.041361962283819484,"score_gpt":0.29085607512228484,"score_spread":0.24949411283846534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137849348","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00055218145,0.00006242563,0.96172154,0.00009188481,0.000034358098,0.00044873872,0.000038529048,0.00018035118,0.036869977],"genre_scores_gemma":[0.22256938,0.00009037697,0.7766513,0.00005410606,0.000023698683,0.000060457023,0.00001899492,0.00003526104,0.0004963793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770087,0.000087518274,0.00052599807,0.0003700017,0.000868696,0.00044693815],"domain_scores_gemma":[0.9978788,0.00041757966,0.00015484357,0.0011246005,0.00027858498,0.00014557726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014195913,0.00018862226,0.00039028458,0.0002071049,0.00009578081,0.00012317508,0.0012296061,0.0000974069,0.00029684513],"category_scores_gemma":[0.00019306372,0.00016662074,0.000064070904,0.0010177428,0.00009415048,0.00016148848,0.0005638502,0.00021700899,0.000153591],"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.000027704962,0.0035379734,0.0010548523,0.0016509931,0.0003024093,0.000034248933,0.018829336,0.0006344219,0.0054855337,0.8500903,0.010676144,0.107676044],"study_design_scores_gemma":[0.00031895644,0.000056148085,0.00042351618,0.000029591913,0.000008434212,0.000004612092,0.00012863081,0.98518145,0.009655465,0.0037661376,0.00017896765,0.00024807738],"about_ca_topic_score_codex":0.000012154551,"about_ca_topic_score_gemma":0.0000045414236,"teacher_disagreement_score":0.984547,"about_ca_system_score_codex":0.000029447701,"about_ca_system_score_gemma":0.000043727607,"threshold_uncertainty_score":0.67945963},"labels":[],"label_agreement":null},{"id":"W2138177131","doi":"10.1016/j.dam.2009.03.014","title":"On well-covered triangulations: Part II","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02209633187996251,"score_gpt":0.2915288947650704,"score_spread":0.26943256288510786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138177131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011244353,0.00003423248,0.8285424,0.0009170103,0.00009303482,0.0007230898,0.000006838986,0.00037926037,0.15805978],"genre_scores_gemma":[0.7171654,0.000018626866,0.27968377,0.0009438674,0.000098352444,0.00009004322,0.000017484523,0.000031737563,0.0019507207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983337,0.000022416365,0.00034832733,0.0003804839,0.0005163009,0.00039880117],"domain_scores_gemma":[0.99828047,0.0002881444,0.00013478754,0.0011323986,0.000040926607,0.00012326115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038899618,0.00020291943,0.00025061044,0.00014931089,0.00028998643,0.00011589912,0.0009035782,0.000070480324,0.00007533661],"category_scores_gemma":[0.00009906763,0.00017170674,0.000091050264,0.0005371033,0.000055876164,0.00020577421,0.00016622899,0.0001908269,0.00036887167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015638934,0.00013287038,2.5283762e-7,0.000010845884,0.000010089863,0.0000034466502,0.00054487295,0.0003076503,0.001038426,0.9911136,0.0011355075,0.005686779],"study_design_scores_gemma":[0.00052279676,0.00015056889,0.000023033956,0.000029521856,0.000005898141,0.0000036369925,0.000066392604,0.011228948,0.0039473884,0.98146826,0.0023313023,0.00022224459],"about_ca_topic_score_codex":1.9863451e-7,"about_ca_topic_score_gemma":2.6589714e-7,"teacher_disagreement_score":0.70592105,"about_ca_system_score_codex":0.0000391637,"about_ca_system_score_gemma":0.000031051542,"threshold_uncertainty_score":0.7001997},"labels":[],"label_agreement":null},{"id":"W2139924054","doi":"10.1016/j.dam.2004.12.001","title":"Balanced vertex-orderings of graphs","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); Discrete mathematics; Degree (music); Graph","score_opus":0.013829799812163146,"score_gpt":0.27034252288300126,"score_spread":0.2565127230708381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139924054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042758815,0.00007398504,0.91769105,0.00023420299,0.000045899775,0.00037440957,0.000004964234,0.0002158183,0.038600836],"genre_scores_gemma":[0.597219,0.000019676094,0.40253878,0.00006290992,0.00000983768,0.000034868186,0.0000017133624,0.000016980322,0.00009628455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985161,0.000011854304,0.00037135772,0.00029565842,0.00043790182,0.00036713388],"domain_scores_gemma":[0.9985859,0.00017984779,0.0001599083,0.00091133144,0.00006224839,0.000100774865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031024416,0.00017336152,0.000292839,0.00014451996,0.00007146653,0.00004316721,0.001139643,0.000056991496,0.000030757947],"category_scores_gemma":[0.000042789754,0.00015182876,0.0000892578,0.0005443002,0.0001379756,0.00023542046,0.00033402376,0.00014824478,0.000089000074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005875297,0.000065175445,0.000009999674,0.000078510886,0.000018088893,9.618955e-7,0.000974288,0.00013874052,0.023799215,0.96300864,0.0000903447,0.011810182],"study_design_scores_gemma":[0.0005996098,0.000050637038,0.00008281751,0.000044410077,0.0000091731845,0.000008011716,0.00021218718,0.032796875,0.07178927,0.89285624,0.0012344304,0.00031632616],"about_ca_topic_score_codex":8.827736e-7,"about_ca_topic_score_gemma":0.0000015325037,"teacher_disagreement_score":0.55446017,"about_ca_system_score_codex":0.000021333786,"about_ca_system_score_gemma":0.000027294627,"threshold_uncertainty_score":0.61913973},"labels":[],"label_agreement":null},{"id":"W2140883685","doi":"10.1016/s0166-218x(02)00217-2","title":"An external memory data structure for shortest path queries","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Shortest path problem; Distance; sort; Planar graph; Data structure; Path (computing); Graph; Spanning tree; Binary logarithm; Binary tree; Discrete mathematics; Computer science; Arithmetic","score_opus":0.03890792014784756,"score_gpt":0.27609379526152195,"score_spread":0.2371858751136744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140883685","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030228887,0.000113061564,0.99444324,0.00006260783,0.00013849483,0.00037740404,0.00041808328,0.00017260473,0.001251634],"genre_scores_gemma":[0.15258065,0.000016438677,0.8467531,0.00012689398,0.00018436006,0.000030540465,0.00021490952,0.000024873842,0.00006822483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985785,0.00000885096,0.00028728912,0.0005241717,0.00031355632,0.00028766497],"domain_scores_gemma":[0.9971618,0.000088619185,0.00013929777,0.002451173,0.000034981073,0.00012412365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015875287,0.00020727815,0.0002356298,0.0000388025,0.00019548988,0.00031015987,0.0023883772,0.00007486316,0.000074574185],"category_scores_gemma":[0.000019997924,0.00015981981,0.00003221767,0.00010698154,0.000053115742,0.00077491807,0.0006862063,0.00011366594,0.000016549438],"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.000014991352,0.00047531235,0.000018947068,0.00031199068,0.000060960276,0.00002168631,0.0073443204,0.0003191741,0.03175717,0.7330649,0.01784018,0.20877036],"study_design_scores_gemma":[0.00030860252,0.000054939614,0.000029730596,0.000039755712,0.000020230078,0.00001902912,0.00028038913,0.9445481,0.0019198263,0.049528144,0.0029329194,0.0003183784],"about_ca_topic_score_codex":0.0000037712798,"about_ca_topic_score_gemma":0.000004090859,"teacher_disagreement_score":0.9442289,"about_ca_system_score_codex":0.000011811666,"about_ca_system_score_gemma":0.000014459991,"threshold_uncertainty_score":0.65172625},"labels":[],"label_agreement":null},{"id":"W2141942969","doi":"10.1016/s0166-218x(03)00371-8","title":"Partitioning chordal graphs into independent sets and cliques","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":74,"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":"Chordal graph; Combinatorics; Mathematics; Split graph; Discrete mathematics; Indifference graph; Maximal independent set; Interval graph; Cograph; Pathwidth; Disjoint sets; Clique-sum; 1-planar graph; Graph; Line graph","score_opus":0.017726078083042853,"score_gpt":0.2947188118428381,"score_spread":0.2769927337597953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141942969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08998232,0.00012861317,0.8888231,0.00010037615,0.000050750958,0.0003833599,0.0000018978088,0.00020290609,0.020326694],"genre_scores_gemma":[0.6434745,0.000033010518,0.35629505,0.00007102224,0.0000058828255,0.00007328133,0.0000021592934,0.000016105492,0.00002897429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855995,0.000046483798,0.0002813094,0.00037234274,0.0003807998,0.00035913373],"domain_scores_gemma":[0.9989567,0.00017587084,0.00010202703,0.00056487205,0.00004588712,0.00015463732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524246,0.00018049193,0.00021144575,0.00012679768,0.00022674141,0.00020124465,0.00042860463,0.00006758494,0.000016945109],"category_scores_gemma":[0.000080902966,0.00015982741,0.000045685618,0.00033233102,0.00014481682,0.00027363133,0.00022867952,0.00021089049,0.00003312084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025626296,0.00003388749,0.00006900671,0.00006020055,0.00001502214,0.0000047857125,0.0019138095,0.000015447686,0.0023204414,0.993592,0.000028495606,0.0019442915],"study_design_scores_gemma":[0.00025182526,0.000032494427,0.00007756884,0.0000229449,0.0000058294595,0.00001828266,0.00041793127,0.0020140375,0.011968886,0.98464775,0.0003365768,0.00020584992],"about_ca_topic_score_codex":0.0000018206654,"about_ca_topic_score_gemma":0.000004963044,"teacher_disagreement_score":0.5534922,"about_ca_system_score_codex":0.000024960747,"about_ca_system_score_gemma":0.000030887484,"threshold_uncertainty_score":0.65175724},"labels":[],"label_agreement":null},{"id":"W2142162160","doi":"10.1016/j.dam.2014.07.023","title":"Finding the closest ultrametric","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Ultrametric space; Mathematics; Multiplicative function; Distortion (music); Combinatorics; Pairwise comparison; Monotonic function; Approximation algorithm; Tree (set theory); Constant (computer programming); Discrete mathematics; Metric space; Statistics; Mathematical analysis; Computer science","score_opus":0.016697596064645652,"score_gpt":0.2383872469492028,"score_spread":0.22168965088455714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142162160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011690814,0.000010143468,0.9040612,0.00044840382,0.0001236386,0.00020909839,0.000001993031,0.00016030317,0.09381616],"genre_scores_gemma":[0.5556984,0.00001585687,0.4426963,0.0006217706,0.00016319352,0.000057425685,0.0000147963365,0.000023468043,0.00070878916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896675,0.000012644246,0.00020779096,0.00024156387,0.00031144585,0.00025980567],"domain_scores_gemma":[0.99858326,0.00029460358,0.0001138502,0.0009471455,0.000013917833,0.000047199195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055695703,0.00013629418,0.0001439819,0.00008748258,0.00018388894,0.0004001591,0.0015326997,0.000029618703,0.000012987603],"category_scores_gemma":[0.00006783626,0.00008579066,0.000048785325,0.00059368217,0.00004617724,0.00020941214,0.00038699468,0.00011149849,0.00033142255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4014423e-7,0.000022853668,0.0000049138944,0.000028466056,0.0000108203285,5.302235e-7,0.000342024,0.000015304462,0.00011137012,0.962695,0.0013685932,0.035399884],"study_design_scores_gemma":[0.00072124036,0.0000697681,0.00047797477,0.000049958784,0.000072892195,0.000011062267,0.0007002305,0.43233773,0.0030392522,0.48752496,0.074197024,0.00079791824],"about_ca_topic_score_codex":0.000001633419,"about_ca_topic_score_gemma":5.997098e-7,"teacher_disagreement_score":0.5545293,"about_ca_system_score_codex":0.000011349799,"about_ca_system_score_gemma":0.0000064812016,"threshold_uncertainty_score":0.4259877},"labels":[],"label_agreement":null},{"id":"W2145071923","doi":"10.1016/j.dam.2004.06.015","title":"2-Tree probe interval graphs have a large obstruction set","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","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":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Interval graph; Partition (number theory); Interval (graph theory); Chordal graph; Discrete mathematics; Generalization; Indifference graph; Tree (set theory); Graph; 1-planar graph","score_opus":0.02324670617443626,"score_gpt":0.29506065678066845,"score_spread":0.2718139506062322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145071923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012560429,0.000041635547,0.9673064,0.00031861095,0.00007530764,0.00058847846,0.0000145969,0.00034913284,0.018745456],"genre_scores_gemma":[0.46185935,0.000011058629,0.53738344,0.00013119527,0.00006731895,0.0001408987,0.000013497217,0.000035748606,0.0003575102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99791884,0.0000305502,0.00042326475,0.00047840198,0.0005428793,0.00060607464],"domain_scores_gemma":[0.9984501,0.00012154241,0.0001756156,0.0010235368,0.00007285182,0.00015635793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052588584,0.00025932706,0.00029332098,0.00020180647,0.00018975462,0.00017709803,0.0011576638,0.0000944281,0.00005185465],"category_scores_gemma":[0.00004601654,0.00022484912,0.0001286306,0.000436788,0.00011334837,0.0004667159,0.0005747484,0.0003097677,0.00023566606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010006668,0.00009158987,0.000022438002,0.00007528655,0.00002828664,0.000003801642,0.0031716104,0.000030758973,0.0029865063,0.97568125,0.0002817854,0.017616685],"study_design_scores_gemma":[0.0007233167,0.00005644023,0.000065038854,0.000043884786,0.000014578073,0.000037815287,0.0013245433,0.06590872,0.011952337,0.91630244,0.0031562203,0.0004146915],"about_ca_topic_score_codex":8.376762e-7,"about_ca_topic_score_gemma":0.000019206787,"teacher_disagreement_score":0.44929892,"about_ca_system_score_codex":0.000052195282,"about_ca_system_score_gemma":0.000028992186,"threshold_uncertainty_score":0.9169081},"labels":[],"label_agreement":null},{"id":"W2146690815","doi":"10.1016/s0166-218x(99)00185-7","title":"The complexity of irredundant sets parameterized by size","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":30,"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":"Parameterized complexity; Combinatorics; Mathematics; Vertex (graph theory); Computational complexity theory; Graph; Discrete mathematics; Feedback vertex set; Clique; Parametric statistics; Algorithm","score_opus":0.03386305702276592,"score_gpt":0.2975807947117375,"score_spread":0.26371773768897155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146690815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19815105,0.00030115314,0.7232813,0.0018303953,0.00012164092,0.0019379848,0.00011254336,0.00045097066,0.073812954],"genre_scores_gemma":[0.6546673,0.00009503195,0.3442913,0.00009685498,0.000010622599,0.00010096197,0.000006662866,0.00003026156,0.0007010117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982238,0.000053751894,0.0004572611,0.000298022,0.00052728696,0.00043989072],"domain_scores_gemma":[0.9974673,0.0009957843,0.00016658707,0.0012181457,0.00004467475,0.000107545726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059430196,0.00019132573,0.00031387323,0.0000248114,0.00026658922,0.00013459736,0.0016190368,0.000049893475,0.000101226105],"category_scores_gemma":[0.00008113512,0.0001267263,0.00009794343,0.00037482628,0.0009044714,0.00012490163,0.00024133448,0.000179924,0.00008890732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040669962,0.00010169825,0.0000012286764,0.000057929432,0.000039051894,0.0000015701178,0.00090449257,0.000020495096,0.018042682,0.9558441,0.0005663259,0.02437976],"study_design_scores_gemma":[0.00044370495,0.00004850661,0.000031263186,0.00001828175,0.000007922113,0.0000071173768,0.00016807337,0.01423945,0.015716473,0.96638477,0.0027301884,0.00020427011],"about_ca_topic_score_codex":0.000002867772,"about_ca_topic_score_gemma":0.0000013066299,"teacher_disagreement_score":0.45651627,"about_ca_system_score_codex":0.000020473428,"about_ca_system_score_gemma":0.000030423478,"threshold_uncertainty_score":0.51677483},"labels":[],"label_agreement":null},{"id":"W2147807119","doi":"10.1016/s0166-218x(00)00172-4","title":"Three-dimensional orthogonal graph drawing algorithms","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":48,"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":"Bounded function; Combinatorics; Vertex (graph theory); Mathematics; Minimum bounding box; Intersection (aeronautics); Graph drawing; Grid; Enhanced Data Rates for GSM Evolution; Graph; Degree (music); Discrete mathematics; Geometry; Computer science; Image (mathematics); Engineering","score_opus":0.014679116435725587,"score_gpt":0.23931201544788847,"score_spread":0.22463289901216288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147807119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04330986,0.000055497887,0.94539183,0.00022096821,0.00011659631,0.0002120076,0.0000055403857,0.0001910535,0.01049664],"genre_scores_gemma":[0.20088202,0.000005511889,0.7981248,0.00040274905,0.00017551015,0.00004755781,0.00005268407,0.000019599409,0.00028957645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853545,0.000008151617,0.00032551773,0.00035605973,0.0005063253,0.00026846802],"domain_scores_gemma":[0.99925417,0.00011686164,0.000079269674,0.000392858,0.00005054483,0.00010631964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024959806,0.00018465299,0.00018736687,0.0001037688,0.00023126947,0.00014618762,0.00043130285,0.000062266176,0.0002957845],"category_scores_gemma":[0.000008006476,0.00016646333,0.00009028586,0.00049811695,0.000042275562,0.00022173887,0.00010033316,0.00012353202,0.00032643552],"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.000008046292,0.00015798477,0.000008490512,0.00003876203,0.000048665912,0.0000112388125,0.0005558637,0.019199463,0.0018819448,0.7970002,0.0011629772,0.17992632],"study_design_scores_gemma":[0.00044625363,0.000035777914,0.00040171007,0.000025696745,0.000017749428,0.00004651528,0.000017315428,0.5947886,0.0017363909,0.39985153,0.002238771,0.0003936575],"about_ca_topic_score_codex":0.000002244916,"about_ca_topic_score_gemma":0.0000037957232,"teacher_disagreement_score":0.5755892,"about_ca_system_score_codex":0.00001804045,"about_ca_system_score_gemma":0.000057250694,"threshold_uncertainty_score":0.67881775},"labels":[],"label_agreement":null},{"id":"W2148324291","doi":"10.1016/j.dam.2013.01.016","title":"The parametric complexity of graph diameter augmentation","year":2013,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Parameterized complexity; Graph; Discrete mathematics; Dominating set; Vertex (graph theory)","score_opus":0.042842473168147995,"score_gpt":0.2981992174033175,"score_spread":0.2553567442351695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148324291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035077248,0.000047845533,0.95700914,0.00025232602,0.000049814906,0.0007387649,0.0000030149545,0.000075081756,0.006746744],"genre_scores_gemma":[0.66026634,0.000022604017,0.33941197,0.000039594917,0.000008563192,0.00017194747,0.00000272729,0.000012386085,0.00006388058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985934,0.00003825441,0.0003738133,0.00021624107,0.0004692994,0.00030901763],"domain_scores_gemma":[0.99794334,0.0007873001,0.00021747603,0.0008771038,0.00009930941,0.000075450276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004544623,0.00013425722,0.000192176,0.00013691053,0.00018933894,0.00015412825,0.0010785651,0.000036256282,0.000025390858],"category_scores_gemma":[0.000089341804,0.00008592559,0.00008082259,0.0009026261,0.00044453473,0.0002326027,0.00028722777,0.00012964009,0.0001148332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026258585,0.00004201323,0.00001790174,0.000040718573,0.0000218822,1.8723335e-7,0.00046261208,0.000029593157,0.0033432697,0.9863386,0.00015066666,0.009549912],"study_design_scores_gemma":[0.00018500185,0.000030272618,0.00051506504,0.00000805872,0.000005287078,0.0000014107109,0.0003611597,0.014610792,0.010024433,0.97410136,0.000046523106,0.00011062084],"about_ca_topic_score_codex":0.000007381121,"about_ca_topic_score_gemma":0.0000018890605,"teacher_disagreement_score":0.62518907,"about_ca_system_score_codex":0.000019170331,"about_ca_system_score_gemma":0.000015951857,"threshold_uncertainty_score":0.3503944},"labels":[],"label_agreement":null},{"id":"W2150123606","doi":"10.1016/j.dam.2008.04.022","title":"0–1 reformulations of the multicommodity capacitated network design problem","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":112,"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; Computer Research Institute of Montréal; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Cutting-plane method; Integer (computer science); Residual; Variable (mathematics); Integer programming; Mathematical optimization; Network planning and design; Piecewise linear function; Branch and cut; Piecewise; Algorithm; Computer science","score_opus":0.03861793585691882,"score_gpt":0.24257225088065193,"score_spread":0.20395431502373312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150123606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028558569,0.000016081225,0.9614813,0.00001786316,0.00006104175,0.0005589579,0.000007820738,0.00025700964,0.009041371],"genre_scores_gemma":[0.42969984,0.0000068038553,0.5701803,0.000007532063,0.000019086305,0.00002806543,0.0000037478114,0.000030023648,0.000024590367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999051,0.000033365483,0.00040594832,0.00009844862,0.00019399935,0.00021726785],"domain_scores_gemma":[0.9991372,0.00021428069,0.00011765454,0.00044168736,0.000047593807,0.000041572235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003353844,0.00014740204,0.00022360789,0.000028587241,0.00016971372,0.000008894651,0.00022750658,0.00007989373,0.00001310751],"category_scores_gemma":[0.00004735575,0.00010749989,0.000061194114,0.00037630703,0.00009261219,0.000044941502,0.00004650629,0.00015739536,0.000009078078],"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.0000018732732,0.00001804707,0.00006518507,0.000090909656,0.00002986583,2.0479845e-7,0.0016251509,0.9848102,0.0024441502,0.010490455,0.00029392002,0.00013004767],"study_design_scores_gemma":[0.00025262655,0.000005700238,0.0003499422,0.000046227808,0.000033271026,0.000006933059,0.00011707346,0.9800089,0.009197952,0.009756662,0.000055663666,0.00016902213],"about_ca_topic_score_codex":0.0000020849914,"about_ca_topic_score_gemma":0.0000010316014,"teacher_disagreement_score":0.40114126,"about_ca_system_score_codex":0.000040037146,"about_ca_system_score_gemma":0.000018774885,"threshold_uncertainty_score":0.43837184},"labels":[],"label_agreement":null},{"id":"W2150704108","doi":"10.1016/s0166-218x(03)00394-9","title":"P5-free augmenting graphs and the maximum stable set problem","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Characterization (materials science); Combinatorics; Maximal independent set; Class (philosophy); Independent set; Set (abstract data type); Chordal graph; Discrete mathematics; Time complexity; Split graph; Indifference graph; Graph; 1-planar graph; Computer science; Artificial intelligence","score_opus":0.018016945328339123,"score_gpt":0.2586677644041901,"score_spread":0.24065081907585098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150704108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080735115,0.000255383,0.8899955,0.0004138714,0.000052020816,0.0012355956,0.000008288658,0.00023701666,0.09972882],"genre_scores_gemma":[0.21214816,0.00007304105,0.78654927,0.0002031907,0.0000120753175,0.0003230271,0.0000030723436,0.000050196562,0.00063798367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981471,0.00007765794,0.00034991332,0.00039264763,0.00048733506,0.0005453766],"domain_scores_gemma":[0.997846,0.0004933006,0.00016654145,0.0013352226,0.000049809783,0.0001091058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017404669,0.00022084218,0.00028877973,0.00009511568,0.00037840125,0.00031027637,0.0012314897,0.00005376699,0.000017924307],"category_scores_gemma":[0.00014078812,0.00014412195,0.00006832157,0.00055536407,0.00034707293,0.00024318787,0.00065539713,0.00024931144,0.000026195174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008281094,0.000022756272,0.000011625938,0.000101924976,0.000028140654,0.000002250499,0.0019549928,0.00003017357,0.0004487005,0.9962366,0.00019076052,0.00096375693],"study_design_scores_gemma":[0.0011601445,0.000014482111,0.0000042293964,0.000022500615,0.000013351081,0.000017817254,0.0008739359,0.004015961,0.0019674248,0.99091995,0.0008003783,0.00018983157],"about_ca_topic_score_codex":0.0000024042342,"about_ca_topic_score_gemma":0.0000026944838,"teacher_disagreement_score":0.20407465,"about_ca_system_score_codex":0.00001815977,"about_ca_system_score_gemma":0.000033793884,"threshold_uncertainty_score":0.5877123},"labels":[],"label_agreement":null},{"id":"W2150860159","doi":"10.1016/j.dam.2012.03.030","title":"Improving heuristics for network modularity maximization using an exact algorithm","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":29,"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":"Heuristics; Merge (version control); Maximization; Algorithm; Heuristic; Merge algorithm; Partition (number theory); Mathematics; Modularity (biology); Computer science; Mathematical optimization; Parallel computing","score_opus":0.027694047983033043,"score_gpt":0.2873221680629435,"score_spread":0.25962812007991043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150860159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011239512,0.000023987088,0.9865682,0.0000037008658,0.000065548345,0.0005886673,0.000041400705,0.00012658414,0.0013423581],"genre_scores_gemma":[0.4278713,5.812197e-7,0.5709118,0.0000127646845,0.00088666764,0.000062436746,0.00019662965,0.000044472512,0.000013304807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986492,0.000017876724,0.00040325616,0.00022908639,0.00017701552,0.00052359473],"domain_scores_gemma":[0.9989149,0.00008852112,0.00031489268,0.00047646635,0.00006922609,0.00013598953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044102865,0.00024420393,0.00035430686,0.00004506943,0.00026071348,0.00009573921,0.00020259232,0.00006363178,0.00006289042],"category_scores_gemma":[0.0000064473447,0.00023990055,0.00012968764,0.0001926392,0.00003602674,0.00018613735,0.000105791,0.00012429093,0.0000037675024],"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.000019752651,0.0010869513,0.0022244367,0.00026555956,0.00039072716,3.2912214e-7,0.0013854047,0.020937394,0.004088557,0.8232562,0.00076475774,0.14557995],"study_design_scores_gemma":[0.00018706289,0.000014874738,0.00003724742,0.000016123344,0.00023931857,5.84579e-7,0.00024112425,0.88417494,0.0011564546,0.113333516,0.00028462394,0.00031411968],"about_ca_topic_score_codex":0.000030632567,"about_ca_topic_score_gemma":0.0000010725707,"teacher_disagreement_score":0.86323756,"about_ca_system_score_codex":0.00004129496,"about_ca_system_score_gemma":0.00002031702,"threshold_uncertainty_score":0.978286},"labels":[],"label_agreement":null},{"id":"W2151966264","doi":"10.1016/j.dam.2009.04.015","title":"About equivalent interval colorings of weighted graphs","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","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":"Polytechnique Montréal","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Complete coloring; Edge coloring; Fractional coloring; Integer (computer science); Interval (graph theory); Discrete mathematics; Brooks' theorem; Graph; Graph coloring; Chordal graph; Graph power; 1-planar graph","score_opus":0.08162971734262851,"score_gpt":0.3677570846800396,"score_spread":0.28612736733741106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151966264","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78034884,0.00021579418,0.07969042,0.0005248959,0.00019131406,0.00043041658,0.000029047062,0.00017799178,0.1383913],"genre_scores_gemma":[0.926365,0.000014707911,0.07286002,0.0001324611,0.000024790392,0.000013182728,0.0000065766385,0.000012711744,0.00057051785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718904,0.000025134503,0.0009821632,0.0003504987,0.0011059283,0.00034725125],"domain_scores_gemma":[0.99776196,0.0006158704,0.0004645546,0.000790631,0.00019476871,0.00017223804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014667688,0.00019109018,0.00051038724,0.00029244917,0.00012898301,0.0001146773,0.00078404456,0.000093774965,0.00018984171],"category_scores_gemma":[0.0006887948,0.00013805293,0.00023399518,0.0009076077,0.00014902213,0.000099154255,0.0000996299,0.00016391907,0.00026087617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003233055,0.00022124438,0.00006882348,0.00002150417,0.00003848669,0.0000015501947,0.0021438205,0.00005800288,0.005953041,0.98647577,0.0009443324,0.004041127],"study_design_scores_gemma":[0.00053092017,0.00014620648,0.00060622056,0.00008268637,0.00006934831,0.0000060972648,0.0025474932,0.0054257005,0.010013995,0.97839147,0.0019110068,0.00026882754],"about_ca_topic_score_codex":0.0000021409005,"about_ca_topic_score_gemma":8.715058e-7,"teacher_disagreement_score":0.14601621,"about_ca_system_score_codex":0.000019795518,"about_ca_system_score_gemma":0.00005463902,"threshold_uncertainty_score":0.56296355},"labels":[],"label_agreement":null},{"id":"W2152052626","doi":"10.1016/j.dam.2015.01.039","title":"Edge intersection graphs of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si61.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>L</mml:mi></mml:math>-shaped paths in grids","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"European Social Fund; Natural Sciences and Engineering Research Council of Canada; Grantová Agentura České Republiky","keywords":"Intersection (aeronautics); Enhanced Data Rates for GSM Evolution; Degenerate energy levels; Computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Physics","score_opus":0.024358024773587825,"score_gpt":0.26992813274272287,"score_spread":0.24557010796913503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152052626","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88582104,0.000086088796,0.10887459,0.00007468142,0.0003627513,0.00018278783,0.000035101777,0.0001694733,0.0043934896],"genre_scores_gemma":[0.96070796,0.000056187713,0.038501948,0.00012349858,0.00011452459,0.0002943067,0.000056555527,0.00010089923,0.000044118962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652016,0.00007498302,0.00090425025,0.0006968092,0.0010500918,0.0007537022],"domain_scores_gemma":[0.99715036,0.00045210143,0.000591613,0.0013947857,0.00011248535,0.00029863836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013361918,0.0003963624,0.00038548498,0.0003189131,0.00019738448,0.0002117938,0.0013454546,0.0003403954,0.000013664389],"category_scores_gemma":[0.00032085174,0.00042511072,0.00031469227,0.0008880946,0.00039897286,0.0005955431,0.0010310961,0.00059124216,0.00030339096],"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.0001514559,0.00021809149,0.000010547002,0.0003888824,0.0000888361,0.000051087292,0.00384604,0.00044589554,0.0046548154,0.9888614,0.000111909205,0.0011710542],"study_design_scores_gemma":[0.0009817263,0.00032188994,0.00002858617,0.0002611713,0.000052157815,0.00006866379,0.0018394319,0.8886298,0.0101961605,0.09703914,0.00017648037,0.00040479735],"about_ca_topic_score_codex":0.000044919678,"about_ca_topic_score_gemma":0.000062169776,"teacher_disagreement_score":0.8918222,"about_ca_system_score_codex":0.00004089694,"about_ca_system_score_gemma":0.00023719812,"threshold_uncertainty_score":0.99982005},"labels":[],"label_agreement":null},{"id":"W2153601281","doi":"10.1016/j.dam.2014.07.005","title":"About the minimum mean cycle-canceling algorithm","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm; Function (biology); Constructive; Mathematical optimization; Linear programming; Acceleration; Time complexity; Computer science","score_opus":0.017111570593093244,"score_gpt":0.24394862018535263,"score_spread":0.2268370495922594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153601281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012483279,0.00008055564,0.9660543,0.00044501128,0.00028236772,0.00027259433,0.000004229118,0.00026368254,0.03134894],"genre_scores_gemma":[0.09158986,0.000032073414,0.9067142,0.0010174274,0.00033947115,0.00009541346,0.0000073298625,0.00003650969,0.00016769923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998226,0.00003124325,0.0004028375,0.00040593135,0.0004896318,0.00044437518],"domain_scores_gemma":[0.9979428,0.00040297984,0.00018873202,0.0012775435,0.000049188784,0.00013875651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006322417,0.0002528235,0.00029050742,0.00006752457,0.00041526795,0.00030839356,0.0017996171,0.00007025213,0.000018400871],"category_scores_gemma":[0.00004216859,0.00017564556,0.00013180939,0.00039839032,0.00016858158,0.0001425555,0.00048739536,0.0002545415,0.00013912522],"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.0000010050384,0.000041143023,8.908709e-7,0.000041140847,0.000022957513,0.0000010191222,0.004220843,0.00007665764,0.00017628222,0.8623335,0.00031317602,0.13277143],"study_design_scores_gemma":[0.00022310675,0.000023415327,0.000008023438,0.000036220703,0.000013233883,0.000009490169,0.00048522677,0.62958944,0.0006720499,0.3622665,0.0064188535,0.00025444443],"about_ca_topic_score_codex":0.0000058988094,"about_ca_topic_score_gemma":0.0000041177063,"teacher_disagreement_score":0.6295128,"about_ca_system_score_codex":0.000021312773,"about_ca_system_score_gemma":0.000032951306,"threshold_uncertainty_score":0.7162618},"labels":[],"label_agreement":null},{"id":"W2153654605","doi":"10.1016/j.dam.2005.05.020","title":"First vs. best improvement: An empirical study","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":115,"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":"Heuristics; Constructive; Travelling salesman problem; Mathematics; Enhanced Data Rates for GSM Evolution; Heuristic; Mathematical optimization; Greedy algorithm; Algorithm; Combinatorics; Computer science; Artificial intelligence; Process (computing)","score_opus":0.03618088057861051,"score_gpt":0.3343979954373477,"score_spread":0.2982171148587372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153654605","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013010465,0.000010016452,0.97444224,0.0008484209,0.00006647698,0.0011011241,0.000005423323,0.0002357707,0.010280045],"genre_scores_gemma":[0.22978704,0.0000096722315,0.76893836,0.00027703302,0.00014614704,0.00020119664,0.000008458524,0.000038207043,0.00059388933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974986,0.000030621344,0.0005434904,0.00056330714,0.00090678566,0.00045720473],"domain_scores_gemma":[0.9979301,0.00014853665,0.00014529645,0.0013884542,0.00011074528,0.0002768342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068139855,0.00024611803,0.00032467715,0.00014947735,0.00024892672,0.00041286534,0.001465636,0.00006793712,0.0001800786],"category_scores_gemma":[0.000076558295,0.00020890027,0.00005263067,0.0005102863,0.000061433144,0.00036241623,0.00057106366,0.00021438238,0.00064524333],"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.00010240784,0.031857993,0.0012084622,0.0009188799,0.00065958843,0.00013368687,0.09435702,0.030140914,0.0015321319,0.5644032,0.009560479,0.26512527],"study_design_scores_gemma":[0.0009570917,0.0004543014,0.00013684669,0.000010226412,0.000027023518,0.0000059215486,0.0010234759,0.9891595,0.0005341466,0.0041857525,0.0031257633,0.00037993037],"about_ca_topic_score_codex":0.0000053438102,"about_ca_topic_score_gemma":0.000018629684,"teacher_disagreement_score":0.9590186,"about_ca_system_score_codex":0.00006974202,"about_ca_system_score_gemma":0.000063844214,"threshold_uncertainty_score":0.85187054},"labels":[],"label_agreement":null},{"id":"W2153817623","doi":"10.1016/j.dam.2015.01.004","title":"Informative path planning as a maximum traveling salesman problem with submodular rewards","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Submodular set function; Mathematics; Travelling salesman problem; Greedy algorithm; Mathematical optimization; Hamiltonian path; Graph; Combinatorics","score_opus":0.029510440279979126,"score_gpt":0.2557570293357331,"score_spread":0.22624658905575395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153817623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019699564,0.000038211267,0.91304857,0.00013121161,0.000059762686,0.00051625865,0.000006201434,0.0003495529,0.06615065],"genre_scores_gemma":[0.26454023,0.0000026629261,0.7350472,0.0001652533,0.000047488036,0.00008690835,0.000016524364,0.00002851761,0.0000651868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799013,0.000018117358,0.00044634318,0.00035614823,0.0007152397,0.0004740334],"domain_scores_gemma":[0.9985652,0.000079899364,0.00026251454,0.0007256878,0.00012039882,0.00024628296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058609305,0.00031436372,0.00037319187,0.00011424874,0.00019421017,0.0002922454,0.000950488,0.00008644669,0.000004692477],"category_scores_gemma":[0.000023776834,0.0002457613,0.00006707447,0.00052190956,0.00012388108,0.00046073375,0.00034947548,0.00029176899,0.00007869601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003216083,0.00012589658,0.00003116438,0.00026285538,0.00009650222,0.000056261237,0.067803845,0.0017266724,0.00011674238,0.9226139,0.0005057195,0.0066282484],"study_design_scores_gemma":[0.0013554462,0.0003224608,0.000049213682,0.00035299317,0.00003849546,0.00016161778,0.0074175703,0.14774433,0.0015959231,0.8380698,0.0021059944,0.0007861848],"about_ca_topic_score_codex":0.000008771107,"about_ca_topic_score_gemma":0.0000016028625,"teacher_disagreement_score":0.24484067,"about_ca_system_score_codex":0.000055337616,"about_ca_system_score_gemma":0.00015618616,"threshold_uncertainty_score":0.99999946},"labels":[],"label_agreement":null},{"id":"W2154712576","doi":"10.1016/s0166-218x(03)00225-7","title":"On the equivalence between some local and global Chinese postman and traveling salesman graphs","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Submodular set function; Mathematics; Travelling salesman problem; Combinatorics; Vertex (graph theory); Equivalence (formal languages); Graph; Discrete mathematics; Mathematical optimization","score_opus":0.024638384827019345,"score_gpt":0.23228552996912247,"score_spread":0.2076471451421031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154712576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95935386,0.00035616918,0.014736818,0.0001018072,0.00005573926,0.00029737785,0.00007592984,0.00003613453,0.024986172],"genre_scores_gemma":[0.99891365,0.000033840275,0.0008020337,0.00012736005,0.00002882427,0.000018149853,0.0000042380484,0.000021179445,0.000050704093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891657,0.000018169627,0.00044752104,0.00030532278,0.000052008436,0.00026039628],"domain_scores_gemma":[0.9990481,0.000319468,0.00022804562,0.0003121205,0.0000070093993,0.0000852445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009681427,0.0002081708,0.00038763587,0.000039712093,0.0001861719,0.00008778472,0.00016458784,0.00008699774,0.000022107504],"category_scores_gemma":[0.00012796384,0.00015724872,0.00005158722,0.0001403328,0.00019611852,0.00006203304,0.000046420788,0.000142403,0.00007461398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004566473,0.000017792956,0.0057525607,0.00010109496,0.000031974523,6.7132936e-7,0.00071559474,0.000007733937,0.000014476478,0.9932449,0.000009177308,0.000099446705],"study_design_scores_gemma":[0.00027280208,0.00003800628,0.0059021073,0.00004166867,0.000012690945,0.0000083648465,0.0005406633,0.00048489784,0.000044688724,0.9923844,0.00005841574,0.00021132964],"about_ca_topic_score_codex":0.00000624678,"about_ca_topic_score_gemma":0.0000017531002,"teacher_disagreement_score":0.03955982,"about_ca_system_score_codex":0.000020917874,"about_ca_system_score_gemma":0.000005055017,"threshold_uncertainty_score":0.6412417},"labels":[],"label_agreement":null},{"id":"W2155055408","doi":"10.1016/j.dam.2009.08.003","title":"The Ordered Gradual Covering Location Problem on a Network","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Facility location problem; Mathematical optimization","score_opus":0.01718248977922636,"score_gpt":0.22400857162844606,"score_spread":0.2068260818492197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155055408","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038163926,0.00014295337,0.12099929,0.013409249,0.0007447232,0.003373024,0.0000023629652,0.00095650414,0.822208],"genre_scores_gemma":[0.99370253,0.0000255712,0.002656245,0.002343998,0.00047767785,0.000094610295,0.000041632982,0.000022765438,0.00063495897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987775,0.0000033030205,0.00035676075,0.00021564023,0.00032809822,0.0003187164],"domain_scores_gemma":[0.99936014,0.00003053027,0.00011929128,0.0004054553,0.00007214578,0.000012447544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042785087,0.00018381292,0.00014708127,0.000049752907,0.0004529808,0.00029490696,0.00028488546,0.000038415863,0.000043455748],"category_scores_gemma":[0.00004207731,0.0001323432,0.000048293277,0.00047368946,0.000034123706,0.00017453003,0.00006994062,0.00010214627,0.00061619794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022191238,0.000072872295,0.000006538309,0.00013429634,0.000018385916,3.382027e-7,0.00010257934,0.01611479,0.00004539335,0.96259534,0.010827726,0.010059537],"study_design_scores_gemma":[0.0010886155,0.000051547286,0.001978633,0.00019601296,0.00014679125,7.3053127e-7,0.0020455974,0.14459245,0.000071816,0.5822236,0.26671252,0.00089171],"about_ca_topic_score_codex":0.000023266952,"about_ca_topic_score_gemma":0.0000626713,"teacher_disagreement_score":0.95553863,"about_ca_system_score_codex":0.000027237582,"about_ca_system_score_gemma":0.000010865776,"threshold_uncertainty_score":0.79201835},"labels":[],"label_agreement":null},{"id":"W2156111468","doi":"10.1016/j.dam.2005.05.003","title":"On the complexity of unfrozen problems","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","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":"University of Alberta","funders":"","keywords":"Monotonic function; Mathematics; Monotone polygon; Property (philosophy); Sequence (biology); Set (abstract data type); Combinatorics; Point (geometry); Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.038389970936973446,"score_gpt":0.2434952825889067,"score_spread":0.20510531165193327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156111468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035113408,0.0000038606213,0.9285735,0.0027215234,0.00002795672,0.00030326957,0.000003512493,0.0000832864,0.06477178],"genre_scores_gemma":[0.78334814,0.0000034535783,0.21628419,0.00026036263,0.000013788821,0.000018602057,0.0000023710681,0.0000059874005,0.00006309571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930674,0.0000102427975,0.00022725364,0.00012838036,0.00021526925,0.000112142465],"domain_scores_gemma":[0.999245,0.00012520957,0.00013989548,0.0004301748,0.000029399107,0.00003031131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018371124,0.00008917031,0.00011788373,0.000036069177,0.000077149525,0.000043542615,0.00036460612,0.000028343917,0.00011983236],"category_scores_gemma":[0.00002077029,0.000058162863,0.000039462895,0.00016383185,0.00014236095,0.00006929346,0.00007723573,0.00007763896,0.00007601652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.275935e-7,0.000034006083,0.0000018681636,0.000016602367,0.0000072500225,5.1291334e-8,0.0010572196,0.0019019751,0.00048927683,0.99158347,0.0002892657,0.0046182186],"study_design_scores_gemma":[0.00031208765,0.000032531712,0.00023155376,0.000041683605,0.000010544083,0.0000043065875,0.000236909,0.44349197,0.0066019674,0.54797214,0.00086712185,0.00019716899],"about_ca_topic_score_codex":0.0000011930346,"about_ca_topic_score_gemma":0.0000058900473,"teacher_disagreement_score":0.77983683,"about_ca_system_score_codex":0.000016881051,"about_ca_system_score_gemma":0.000017620174,"threshold_uncertainty_score":0.23718128},"labels":[],"label_agreement":null},{"id":"W2157761435","doi":"10.1016/j.dam.2005.02.033","title":"Advances on sorting by reversals","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":109,"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":"Sorting; Sequence (biology); Mathematics; Time complexity; Computational complexity theory; Genome; Combinatorics; Computational problem; Algorithm; Discrete mathematics; Theoretical computer science; Computer science; Gene; Biology; Genetics","score_opus":0.005108295393556165,"score_gpt":0.22816705948609153,"score_spread":0.22305876409253536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157761435","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4867094,0.0013885499,0.071311206,0.00024446737,0.00016545113,0.0011518227,0.000088421846,0.00013178895,0.4388089],"genre_scores_gemma":[0.94645214,0.00019693241,0.049516406,0.00020819851,0.00034315986,0.000107479435,0.00050260505,0.000082423365,0.0025906775],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990702,0.0000062722615,0.00024107537,0.00026001935,0.0001775651,0.00024485093],"domain_scores_gemma":[0.9994756,0.000013334588,0.00013682191,0.0003166501,0.00001925207,0.0000383379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012241626,0.00016762898,0.0001507616,0.000022747417,0.00006614352,0.000025730613,0.00015918068,0.00007917015,0.000024396939],"category_scores_gemma":[0.000016011718,0.000150402,0.000058402213,0.000059489987,0.000042029693,0.000002356275,0.00005851937,0.00005733739,0.00006621376],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014481339,0.000112914335,0.000049035876,0.0000954446,0.000026006475,0.0000010673313,0.000049784947,0.0001296401,0.9776293,0.008649105,0.010224755,0.0030184535],"study_design_scores_gemma":[0.0011471479,0.00021505934,0.00006226824,0.000048903486,0.000062554725,0.000005606801,0.00062736,0.00035576063,0.8534718,0.023497557,0.11971723,0.0007887046],"about_ca_topic_score_codex":0.000002261447,"about_ca_topic_score_gemma":0.0000023477314,"teacher_disagreement_score":0.45974272,"about_ca_system_score_codex":0.000010821525,"about_ca_system_score_gemma":0.000009087755,"threshold_uncertainty_score":0.6133216},"labels":[],"label_agreement":null},{"id":"W2158898837","doi":"10.1016/j.dam.2006.07.018","title":"Graph coloring in the estimation of sparse derivative matrices: Instances and applications","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada; Norges Forskningsråd","keywords":"Mathematics; Graph coloring; Graph; Combinatorics; Partition (number theory); Intersection (aeronautics); Derivative (finance); Discrete mathematics; Algorithm","score_opus":0.08157609739785825,"score_gpt":0.37058067989692284,"score_spread":0.2890045824990646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158898837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3193139,0.00017030809,0.6667663,0.000100297635,0.000022203745,0.00049833674,0.000008716459,0.00002365966,0.013096278],"genre_scores_gemma":[0.88844544,0.000023962828,0.1113811,0.00003429882,0.000019252917,0.00007199496,0.0000034262505,0.0000064088895,0.000014099292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825335,0.00002505309,0.0006821543,0.00022039509,0.0006207698,0.00019826568],"domain_scores_gemma":[0.9965389,0.0025598619,0.00036664933,0.00041090354,0.00008281303,0.00004088155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00394904,0.0001093885,0.00023545962,0.00029314635,0.00016229744,0.00008914273,0.00041262462,0.00005344138,0.000008190863],"category_scores_gemma":[0.0005169943,0.0000695119,0.000042358,0.0015865138,0.0001956813,0.00011722907,0.000052845437,0.00011991196,0.00001730943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016313039,0.00014006658,0.0006853297,0.000055163557,0.000018241153,9.33213e-7,0.009903337,0.0036444305,0.0006051722,0.968258,0.00004495956,0.016628003],"study_design_scores_gemma":[0.0004304367,0.000028600743,0.006226002,0.000058315803,0.00005292488,0.000007743879,0.03631516,0.014600449,0.001960698,0.93951136,0.0006022948,0.00020600342],"about_ca_topic_score_codex":0.000010038621,"about_ca_topic_score_gemma":0.000039286002,"teacher_disagreement_score":0.56913155,"about_ca_system_score_codex":0.000013065895,"about_ca_system_score_gemma":0.000025139288,"threshold_uncertainty_score":0.28346133},"labels":[],"label_agreement":null},{"id":"W2159986814","doi":"10.1016/s0166-218x(99)00228-0","title":"Asymptotically optimal erasure-resilient codes for large disk arrays","year":2000,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":33,"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":"Erasure; Set (abstract data type); Reliability (semiconductor); Mathematics; Erasure code; Asymptotically optimal algorithm; Combinatorial design; Discrete mathematics; Computer science; Algorithm; Theoretical computer science; Decoding methods; Power (physics)","score_opus":0.012609322674955221,"score_gpt":0.2590491422078882,"score_spread":0.246439819532933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159986814","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006015046,0.00005027807,0.98481584,0.00032496182,0.000052893738,0.00076889346,0.00013738283,0.00095806766,0.006876667],"genre_scores_gemma":[0.15072426,0.000028336699,0.84849703,0.00015122863,0.00003559679,0.0002616187,0.00003872824,0.00003522797,0.00022794786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790925,0.000008735515,0.0004454157,0.00057895837,0.00039539437,0.00066225627],"domain_scores_gemma":[0.99800146,0.00028127574,0.00013148159,0.0014235177,0.00005248247,0.00010981167],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031661234,0.0003126086,0.00040233193,0.00007370698,0.00023064428,0.0001738032,0.0015963906,0.00013942756,0.00006481917],"category_scores_gemma":[0.00011030519,0.00026490272,0.00010867201,0.00028054006,0.000117839256,0.000319982,0.0003439101,0.0001915723,0.0001899964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013982004,0.00015732943,0.000001922858,0.000081997285,0.000028683153,0.0000042415627,0.000564088,0.0010363159,0.0018169017,0.98504996,0.0008029517,0.01044165],"study_design_scores_gemma":[0.0018734133,0.00025820223,0.00004256598,0.00009505995,0.00007786235,0.000027462713,0.00083630125,0.28273037,0.025585538,0.66112965,0.02603408,0.0013094965],"about_ca_topic_score_codex":5.473928e-7,"about_ca_topic_score_gemma":0.0000022207503,"teacher_disagreement_score":0.32392028,"about_ca_system_score_codex":0.00005315533,"about_ca_system_score_gemma":0.000036252924,"threshold_uncertainty_score":0.99998033},"labels":[],"label_agreement":null},{"id":"W2162995463","doi":"10.1016/j.dam.2008.06.021","title":"On the choice of explicit stabilizing terms in column generation","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Kronos (Canada)","funders":"","keywords":"Column generation; Mathematical optimization; Mathematics; Term (time); Quadratic equation; Flexibility (engineering); Limit (mathematics); Scheduling (production processes); Column (typography); Crew scheduling; Augmented Lagrangian method; Computer science","score_opus":0.13741534245869144,"score_gpt":0.3559697696159796,"score_spread":0.21855442715728815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162995463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6783593,0.000017041286,0.2956317,0.00024788463,0.000048626003,0.0019672986,0.000021932017,0.00010173143,0.023604488],"genre_scores_gemma":[0.7851156,0.000042595726,0.21389765,0.00008962114,0.0000641353,0.00033592305,0.000015543743,0.000076558514,0.00036239286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816644,0.0000425934,0.00062920403,0.0002523435,0.0006081505,0.00030125203],"domain_scores_gemma":[0.99726135,0.0016590796,0.00027088352,0.0006708602,0.000082000544,0.00005582211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044966245,0.0001995318,0.0003538345,0.00013336822,0.00015616031,0.000021011192,0.00033217802,0.000087324595,0.00016169046],"category_scores_gemma":[0.0009625753,0.00014585201,0.000063407955,0.0004465153,0.00012984026,0.000084604326,0.00009932942,0.0002565381,0.000025107825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020112115,0.0004564234,0.00008636881,0.00026013926,0.00003271992,0.000005404337,0.006065526,0.004042412,0.01753077,0.9699774,0.0010822384,0.00044052902],"study_design_scores_gemma":[0.0023697217,0.00017710438,0.00022914463,0.0002661823,0.000041850664,0.000017170612,0.0038463117,0.3397158,0.08376182,0.5684635,0.00026540784,0.00084594556],"about_ca_topic_score_codex":0.000005270149,"about_ca_topic_score_gemma":0.000021986976,"teacher_disagreement_score":0.40151384,"about_ca_system_score_codex":0.00008851462,"about_ca_system_score_gemma":0.000040916308,"threshold_uncertainty_score":0.5947673},"labels":[],"label_agreement":null},{"id":"W2163543752","doi":"10.1016/s0166-218x(02)00411-0","title":"Homomorphisms of conjunctive normal forms","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algebraic Geometry and Number Theory","field":"Mathematics","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Homomorphism; Conjunctive normal form; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics","score_opus":0.020420718113105005,"score_gpt":0.25980433961635,"score_spread":0.23938362150324502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163543752","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38040346,0.000041990574,0.11054058,0.000017915827,0.000110064364,0.00066059775,0.00003077026,0.00012929851,0.50806534],"genre_scores_gemma":[0.9250067,0.000006605567,0.07408465,0.000049757862,0.000024692605,0.000062014784,0.000009763825,0.000059350004,0.00069645816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982244,0.00003096981,0.0006723929,0.00025460246,0.00041321592,0.0004044556],"domain_scores_gemma":[0.99803364,0.0006749056,0.0004277821,0.0006585312,0.000085796346,0.000119314805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079866283,0.00030469938,0.0006088247,0.00011411293,0.00010806862,0.000018667684,0.00028527982,0.00015399998,0.0007492629],"category_scores_gemma":[0.00037509642,0.00024512003,0.00017256427,0.00034068225,0.00023928744,0.000103974075,0.0000742975,0.0002100836,0.00012256573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025558209,0.00023742656,0.000019043055,0.00037972638,0.00011119974,0.0000029505356,0.0015732651,0.000002534222,0.002112464,0.9950896,0.0002759764,0.00017026145],"study_design_scores_gemma":[0.00070464687,0.000058562226,0.000014560109,0.00004524986,0.00011381866,0.000026389238,0.0038171415,0.000029057517,0.08150668,0.9129624,0.0004314424,0.0002900552],"about_ca_topic_score_codex":8.135234e-7,"about_ca_topic_score_gemma":7.061989e-7,"teacher_disagreement_score":0.5446032,"about_ca_system_score_codex":0.00003026582,"about_ca_system_score_gemma":0.0000473004,"threshold_uncertainty_score":0.9995704},"labels":[],"label_agreement":null},{"id":"W2169434358","doi":"10.1016/j.dam.2003.08.012","title":"A note on tolerance graph recognition","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Combinatorics; Graph; Discrete mathematics","score_opus":0.026813482032105828,"score_gpt":0.2904599598666646,"score_spread":0.2636464778345588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169434358","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015991691,0.000014902492,0.9554524,0.00032795238,0.00007433441,0.0004245362,0.0000073691085,0.00028037702,0.027426466],"genre_scores_gemma":[0.44186726,0.000019901769,0.55746466,0.00038528253,0.000045128785,0.00013465993,0.000008304415,0.000029579167,0.000045238547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984306,0.000013914556,0.00027321704,0.00040720915,0.00047703576,0.00039798598],"domain_scores_gemma":[0.9987257,0.00015435048,0.00011423142,0.00083338394,0.000053916145,0.00011837838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002944778,0.00020115411,0.00021405514,0.00016085547,0.00015675263,0.00010950666,0.00078365323,0.00006944923,0.000011886786],"category_scores_gemma":[0.00004876577,0.00017539176,0.000084813044,0.0006003293,0.00009742412,0.0002188277,0.0001520309,0.00024304802,0.00061966456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001585358,0.00011707912,3.8427402e-7,0.000053625175,0.00000865282,0.000009681271,0.0012206547,0.0008683726,0.0055544395,0.97617847,0.000024505352,0.015948309],"study_design_scores_gemma":[0.00057849684,0.000073351424,0.000012520786,0.00007603941,0.0000042946435,0.000008960203,0.00006766287,0.0015024085,0.031641897,0.9656588,0.0001372318,0.00023836168],"about_ca_topic_score_codex":0.000001208867,"about_ca_topic_score_gemma":0.000001928836,"teacher_disagreement_score":0.42587554,"about_ca_system_score_codex":0.0000558146,"about_ca_system_score_gemma":0.000036771762,"threshold_uncertainty_score":0.7964741},"labels":[],"label_agreement":null},{"id":"W2169640500","doi":"10.1016/j.dam.2011.03.014","title":"Incoherent majorities: The McGarvey problem in judgement aggregation","year":2011,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Judgement; Mathematics; Mathematical optimization; Combinatorics; Algorithm; Epistemology","score_opus":0.05584404545129463,"score_gpt":0.21617917966632802,"score_spread":0.1603351342150334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169640500","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24535504,0.00027178842,0.029479139,0.00014681202,0.00029973517,0.0017045429,0.000052344498,0.00011086491,0.7225797],"genre_scores_gemma":[0.9918002,0.000018412942,0.006895035,0.00007322434,0.000046416855,0.0002569542,0.000008698826,0.000027970542,0.00087310385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987107,0.00001495638,0.0007362115,0.00023441332,0.000051068513,0.00025265664],"domain_scores_gemma":[0.99908906,0.00006752079,0.00038779745,0.00040742784,0.000012153031,0.00003600903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013053622,0.00015594072,0.00030529467,0.000097355696,0.00008442858,0.00004753648,0.0003054908,0.00006949518,0.00028271385],"category_scores_gemma":[0.000030833362,0.00012716792,0.00005983112,0.00017765469,0.00006255497,0.00007368407,0.00007453592,0.00013792579,0.0005951404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072555154,0.00008899395,0.001041264,0.00014773005,0.000022179085,6.5640205e-7,0.011029609,0.000013441029,0.000014699005,0.9872559,0.00009128913,0.0002870096],"study_design_scores_gemma":[0.00045085803,0.000033517994,0.0015285172,0.00008970641,0.000008122249,0.000002107164,0.0031810831,0.0008678172,0.0004165009,0.99135625,0.001812444,0.000253089],"about_ca_topic_score_codex":0.00009778754,"about_ca_topic_score_gemma":0.000036720754,"teacher_disagreement_score":0.7464451,"about_ca_system_score_codex":0.000063183084,"about_ca_system_score_gemma":0.0000072954067,"threshold_uncertainty_score":0.7649524},"labels":[],"label_agreement":null},{"id":"W2169976284","doi":"10.1016/j.dam.2009.06.024","title":"On a disparity between relative cliquewidth and relative NLC-width","year":2009,"lang":"en","type":"article","venue":"Discrete Applied 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":"University of Waterloo","funders":"Engineering and Physical Sciences Research Council","keywords":"Mathematics; Combinatorics; Bounded function; Time complexity; Clique; Treewidth; Graph; Upper and lower bounds; Measure (data warehouse); Chordal graph; Discrete mathematics; Pathwidth; Computer science; Line graph","score_opus":0.02478072388979999,"score_gpt":0.3071723440611731,"score_spread":0.2823916201713731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169976284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020922614,0.00004250023,0.93009907,0.00070691167,0.000020689502,0.0006472589,0.000013203212,0.00022443118,0.047323298],"genre_scores_gemma":[0.7474549,0.00001666503,0.2520363,0.00020061922,0.000028096574,0.000032029166,0.000007095795,0.000019727746,0.00020459505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997908,0.00007010514,0.00039964612,0.00059813657,0.000523888,0.00050020905],"domain_scores_gemma":[0.99742043,0.0011963709,0.00021574019,0.00088296155,0.000058195175,0.00022631531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065013,0.00030915372,0.00043573783,0.00016408015,0.00026018362,0.00013614644,0.0007267659,0.00013555963,0.0000073427664],"category_scores_gemma":[0.0001783802,0.00025274418,0.000079304606,0.00053353736,0.00020896851,0.0005436557,0.00029064048,0.0005657119,0.00007738233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016330257,0.000065490196,0.00005140121,0.00002381774,0.00003264616,0.000005682501,0.0020168633,0.000014238819,0.00018982033,0.9885637,0.000050989278,0.0089690285],"study_design_scores_gemma":[0.0004245402,0.00024390071,0.0019873604,0.000060783,0.000018737144,0.0000033391784,0.00007193293,0.0033093942,0.00085022795,0.9926433,0.00008626159,0.00030024946],"about_ca_topic_score_codex":9.69882e-7,"about_ca_topic_score_gemma":8.6321165e-7,"teacher_disagreement_score":0.7265323,"about_ca_system_score_codex":0.00006430442,"about_ca_system_score_gemma":0.00003332141,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W2183793754","doi":"10.1016/j.dam.2016.02.005","title":"Greedy flipping of pancakes and burnt pancakes","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Stack (abstract data type); Greedy algorithm; Combinatorics; Conjecture; Algorithm; Computer science","score_opus":0.008942931205573162,"score_gpt":0.21994627724948979,"score_spread":0.21100334604391663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183793754","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9512573,0.0004977591,0.042526018,0.00017670034,0.00003873419,0.0003439372,0.00003843488,0.000018625455,0.00510253],"genre_scores_gemma":[0.9756016,0.00033346016,0.02351234,0.000026710062,0.00010960305,0.000034094108,0.000016384869,0.000030101244,0.00033571283],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991781,0.000006676368,0.00024604754,0.00022595646,0.00014167419,0.00020152419],"domain_scores_gemma":[0.9994126,0.000020966594,0.00013340573,0.0003362519,0.000037835878,0.000058956808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013727334,0.00015311815,0.00020487489,0.00004500248,0.0000359033,0.000011073797,0.00013551356,0.000083137034,0.000016264985],"category_scores_gemma":[0.000029933542,0.00010364188,0.000050427596,0.000060928833,0.000122057434,0.0000027846509,0.00012503746,0.000028745742,0.000009701138],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001040709,0.000029736804,0.00025083136,0.00013831524,0.000064065,5.265652e-7,0.00018976786,0.000001258575,0.9828201,0.0060961484,0.000077216515,0.010321637],"study_design_scores_gemma":[0.0022627618,0.0003198281,0.0033013506,0.00023343404,0.0001290937,0.000024414761,0.0013753249,0.00012043193,0.9603147,0.020639086,0.010488092,0.0007915116],"about_ca_topic_score_codex":0.0000012591554,"about_ca_topic_score_gemma":0.0000018854242,"teacher_disagreement_score":0.024344333,"about_ca_system_score_codex":0.000007923989,"about_ca_system_score_gemma":0.000022116692,"threshold_uncertainty_score":0.42263934},"labels":[],"label_agreement":null},{"id":"W2185242172","doi":"10.1016/j.dam.2015.10.035","title":"A survey on flows in graphs and matroids","year":2015,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Mathematics; Combinatorics; Bottleneck; Minimax; Flow (mathematics); Graph; Discrete mathematics; Mathematical economics; Computer science","score_opus":0.04795131266788904,"score_gpt":0.30756618463993707,"score_spread":0.259614871972048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2185242172","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56143546,0.00014343615,0.41243714,0.00020913073,0.0001062736,0.00093201257,0.000020916912,0.00028491375,0.024430728],"genre_scores_gemma":[0.870008,0.000013593075,0.12971121,0.000085430744,0.0000073936058,0.00006076848,0.0000070208657,0.000024197743,0.000082368875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985943,0.00005703568,0.00025521198,0.00034137993,0.00040718497,0.00034487608],"domain_scores_gemma":[0.9986976,0.0003437686,0.00006363253,0.00067015155,0.000042788197,0.000182057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013218427,0.00016841761,0.00024765823,0.0002189032,0.000044041168,0.000105009734,0.0006206115,0.000057311157,0.0000024930127],"category_scores_gemma":[0.00013986173,0.00014078374,0.000026358855,0.0006138673,0.00008077767,0.00014075592,0.0003192153,0.00019760446,0.00006367597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023159984,0.000072149414,0.00032187757,0.000030319203,0.0000072768235,0.000009078159,0.0016083088,0.00011448273,0.00033133238,0.9947523,0.00018411172,0.0025456054],"study_design_scores_gemma":[0.0007101513,0.00009084872,0.0021007047,0.000027597984,0.0000019659028,0.000004748882,0.00024438626,0.031463116,0.00049961143,0.96454906,0.000068636524,0.0002391746],"about_ca_topic_score_codex":0.000011936513,"about_ca_topic_score_gemma":0.000054490825,"teacher_disagreement_score":0.30857256,"about_ca_system_score_codex":0.000031859945,"about_ca_system_score_gemma":0.00003621306,"threshold_uncertainty_score":0.5740994},"labels":[],"label_agreement":null},{"id":"W2203109677","doi":"10.1016/j.dam.2015.11.005","title":"A multiobjective optimization algorithm for the weighted LCS","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","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":"McGill University","funders":"Departamento Administrativo de Ciencia, Tecnología e Innovación (COLCIENCIAS)","keywords":"Longest common subsequence problem; Set (abstract data type); Algorithm; Similarity (geometry); Sequence (biology); Mathematics; Task (project management); Bounded function; Computation; Computer science; Subsequence; Artificial intelligence","score_opus":0.025563864346921917,"score_gpt":0.2652240079121981,"score_spread":0.23966014356527615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203109677","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019591023,0.000067311965,0.99659485,0.00018919546,0.00019172988,0.0007737221,0.000028061784,0.00015960124,0.0019759238],"genre_scores_gemma":[0.0015091919,0.000010705072,0.99785197,0.00011749108,0.0001099018,0.0002515001,0.000040129307,0.000018697707,0.000090405585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998943,0.000011011354,0.00023503689,0.00027430942,0.00031150147,0.00022519565],"domain_scores_gemma":[0.99867153,0.00026935976,0.0001507085,0.00066549896,0.00014608547,0.000096810116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378282,0.00015931594,0.00017174003,0.00004226321,0.00020316427,0.00019255292,0.00076087425,0.00006255304,0.00000442742],"category_scores_gemma":[0.000036782876,0.000098249424,0.000054075055,0.00023355833,0.000044712036,0.00025614578,0.00031081281,0.00008701758,0.00002241244],"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.000021177335,0.0003011281,9.884433e-7,0.00006329181,0.00012878834,0.0000032013927,0.01097836,0.02086437,0.00015863676,0.5249125,0.009313594,0.43325397],"study_design_scores_gemma":[0.00060072105,0.0000323518,0.0000021328258,0.000011531242,0.000020060224,0.0000044591834,0.0006268573,0.96978337,0.000546529,0.026112394,0.0021092203,0.00015035066],"about_ca_topic_score_codex":0.00000671365,"about_ca_topic_score_gemma":7.5014094e-7,"teacher_disagreement_score":0.948919,"about_ca_system_score_codex":0.000038929917,"about_ca_system_score_gemma":0.00005883141,"threshold_uncertainty_score":0.40064952},"labels":[],"label_agreement":null},{"id":"W2203142848","doi":"10.1016/s0166-218x(02)00176-2","title":"Erratum to “Comparison of column generation models for channel assignment in cellular networks”","year":2002,"lang":"en","type":"erratum","venue":"Discrete Applied Mathematics","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Université de Montréal; Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"","keywords":"Mathematics; Channel (broadcasting); Integer programming; Algorithm; Combinatorics; Computer science; Telecommunications","score_opus":0.030497037066046565,"score_gpt":0.24677255715757537,"score_spread":0.2162755200915288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2203142848","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030723575,0.0010100335,0.98183924,0.000014862272,0.003048659,0.0022664135,0.00006285019,0.00015768356,0.01156953],"genre_scores_gemma":[0.37964547,0.0021077017,0.5817222,0.00010048911,0.0048939814,0.006711025,0.008159737,0.001566058,0.015093339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975246,0.000011485304,0.0011241474,0.00041738024,0.00038254386,0.0005398444],"domain_scores_gemma":[0.99883133,0.00006907357,0.0003440832,0.00057055283,0.000071765826,0.00011320751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017745346,0.00054286636,0.0010812304,0.00023810707,0.00005975087,0.00004804521,0.00032088594,0.0006407548,0.000012894208],"category_scores_gemma":[0.000013141129,0.00062378694,0.00012220797,0.00040134208,0.000026237218,0.00009443388,0.00007146925,0.00048973435,0.000005587977],"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.0000051390857,0.00006335911,8.734301e-8,0.0006610067,0.000041609546,4.2470268e-7,0.0008761046,0.7477736,0.00036260168,0.0017494417,0.24810642,0.0003602271],"study_design_scores_gemma":[0.00033053898,0.000043314536,1.1965416e-7,0.00034906983,0.000075610405,2.2500586e-7,0.0001882961,0.9919813,0.0009130849,0.0035191681,0.002026259,0.0005729653],"about_ca_topic_score_codex":0.000001358845,"about_ca_topic_score_gemma":0.000026064272,"teacher_disagreement_score":0.40011704,"about_ca_system_score_codex":0.00027084633,"about_ca_system_score_gemma":0.000021124513,"threshold_uncertainty_score":0.99962133},"labels":[],"label_agreement":null},{"id":"W2204215863","doi":"10.1016/j.dam.2015.10.024","title":"Complexity of coloring graphs without paths and cycles","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Complement (music); Characterization (materials science); Induced subgraph; Discrete mathematics; Time complexity; Graph; Vertex (graph theory); Physics","score_opus":0.08204450352929933,"score_gpt":0.32120248056189943,"score_spread":0.2391579770326001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2204215863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31471294,0.00008531097,0.6696805,0.000089923575,0.00004229958,0.00041871867,0.000007804208,0.00014130517,0.014821218],"genre_scores_gemma":[0.67700815,0.0000081676035,0.32291573,0.000013747405,0.000006096698,0.000021858283,0.0000012656287,0.000010907653,0.000014071402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987678,0.000023786219,0.0002831555,0.00025725857,0.00040379172,0.00026419683],"domain_scores_gemma":[0.99887574,0.00013421236,0.00014977815,0.0005850103,0.00008258632,0.0001726536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005694776,0.00014610993,0.0002983146,0.000107248125,0.00006976903,0.000056377216,0.0005959397,0.000043241205,0.0000020707585],"category_scores_gemma":[0.00006425064,0.00012314552,0.000037125712,0.00031279036,0.00044561637,0.00017494251,0.0004926788,0.00012123384,0.000009016016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010352897,0.000039695227,0.0002425128,0.000092402006,0.000014540719,0.0000016758017,0.002208712,0.000020819405,0.0029939667,0.99298555,0.000015552525,0.0013742283],"study_design_scores_gemma":[0.0004077089,0.00005181977,0.00023405756,0.00002740142,0.0000068845843,0.000008234112,0.0008513058,0.012143109,0.008173973,0.9778988,0.00004374151,0.00015296735],"about_ca_topic_score_codex":0.0000031692293,"about_ca_topic_score_gemma":0.000003182751,"teacher_disagreement_score":0.3622952,"about_ca_system_score_codex":0.00001556815,"about_ca_system_score_gemma":0.000033650587,"threshold_uncertainty_score":0.5021729},"labels":[],"label_agreement":null},{"id":"W2209962516","doi":"10.1016/j.dam.2015.11.014","title":"A strong connectivity property of the generalized exchanged hypercube","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Mathematics; Combinatorics; Connected component; Hypercube graph; Component (thermodynamics); Graph; Property (philosophy); Discrete mathematics; Line graph; Graph power","score_opus":0.05036968775814813,"score_gpt":0.25133788844885824,"score_spread":0.2009682006907101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2209962516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098564774,0.00005176646,0.84872895,0.00045892334,0.00069219514,0.00087695697,0.000005485116,0.00014282638,0.050478134],"genre_scores_gemma":[0.97746533,0.0000015443524,0.021730674,0.00009359959,0.000089276,0.00007060224,9.926976e-7,0.0000142074405,0.0005337531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880683,0.000061556675,0.00033398892,0.00022228115,0.00036134635,0.0002139843],"domain_scores_gemma":[0.9987316,0.00006628694,0.000220812,0.00078955025,0.00011293917,0.0000787743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061878416,0.00014785507,0.0002978707,0.000033025175,0.000086056396,0.0000717452,0.0007332843,0.00006606465,0.000008145222],"category_scores_gemma":[0.00005294264,0.00007406515,0.0000979229,0.00025525037,0.000059878697,0.00011516326,0.0003012674,0.00011345463,0.000016659005],"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.000013204061,0.00012447099,0.00004864751,0.00012828747,0.00005931916,0.0000012189794,0.00854446,0.0007148641,0.0063311257,0.97813225,0.004176968,0.0017251862],"study_design_scores_gemma":[0.0027944904,0.00019157224,0.00015391504,0.00025429006,0.00007405871,0.00008946158,0.0043003135,0.869152,0.027680129,0.08446174,0.009977531,0.0008705017],"about_ca_topic_score_codex":0.00003738472,"about_ca_topic_score_gemma":0.000025053008,"teacher_disagreement_score":0.8936705,"about_ca_system_score_codex":0.000044135257,"about_ca_system_score_gemma":0.00006150882,"threshold_uncertainty_score":0.30202892},"labels":[],"label_agreement":null},{"id":"W2217916065","doi":"10.1016/j.dam.2015.09.018","title":"Similarity based deduplication with small data chunks","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cloud Data Security Solutions","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":"IBM (Canada)","funders":"","keywords":"Computer science; Data deduplication; Backup; Hash function; Scalability; Petabyte; Extension (predicate logic); Data mining; Theoretical computer science; Database; Big data; Programming language","score_opus":0.12396997888523115,"score_gpt":0.2851796968870112,"score_spread":0.16120971800178008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217916065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023041207,0.000022072734,0.98825395,0.0012393476,0.000041529613,0.00045281154,0.00012464156,0.00031845126,0.007243062],"genre_scores_gemma":[0.1092449,0.0000014827604,0.88959444,0.00047384837,0.000043888016,0.00006235255,0.00053911994,0.000021939957,0.00001805686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984372,0.000017435254,0.0002769362,0.0005491788,0.0004204144,0.00029882262],"domain_scores_gemma":[0.9955572,0.00013232577,0.00016614574,0.0038264245,0.0001000813,0.00021780509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005881866,0.00019271104,0.00021278072,0.00006208374,0.00011588446,0.00021497798,0.0025989995,0.00007828462,0.0000055878572],"category_scores_gemma":[0.00011023991,0.00016276314,0.000022056032,0.00043303904,0.00008911369,0.00030597646,0.0010009932,0.00017647786,0.00011687565],"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.000013949454,0.00042113752,0.000050235387,0.00013200378,0.000039347007,0.000006472431,0.0019398985,0.00036320215,0.00039336385,0.9828408,0.010786801,0.0030128271],"study_design_scores_gemma":[0.0011060841,0.000066092565,0.00013212972,0.000045310633,0.000069044916,0.000020041474,0.00035821178,0.91949254,0.0012539787,0.057877578,0.019018944,0.0005600657],"about_ca_topic_score_codex":0.000020718948,"about_ca_topic_score_gemma":0.00009972831,"teacher_disagreement_score":0.9249632,"about_ca_system_score_codex":0.000057122994,"about_ca_system_score_gemma":0.00022464847,"threshold_uncertainty_score":0.66372883},"labels":[],"label_agreement":null},{"id":"W2244935559","doi":"10.1016/j.dam.2016.03.010","title":"Initial non-repetitive complexity of infinite words","year":2016,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fibonacci number; Repetition (rhetorical device); Word (group theory); Function (biology); Mathematics; Word length; Combinatorics; Computer science; Linguistics; Natural language processing; Biology; Philosophy; Geometry","score_opus":0.03674040037245721,"score_gpt":0.2879595770724118,"score_spread":0.25121917669995464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244935559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01346757,0.00003791741,0.8876546,0.00019222041,0.0003914557,0.000629734,0.00022073869,0.0002523006,0.097153485],"genre_scores_gemma":[0.7653641,0.000023120117,0.23400384,0.000117355565,0.0001902252,0.00012815544,0.00004257485,0.000050461265,0.00008015193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99742377,0.00003562442,0.0008596467,0.0006727853,0.00058116735,0.0004269862],"domain_scores_gemma":[0.99648976,0.0003841762,0.00089225074,0.0019848119,0.00011934388,0.00012963466],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056547107,0.0004893671,0.00090377306,0.0001869444,0.000083662184,0.00014454998,0.0021927045,0.00031157004,0.000079619436],"category_scores_gemma":[0.000053017502,0.0003800172,0.00025851303,0.00019889079,0.0005049448,0.00012887591,0.003577229,0.0004500206,0.00011292368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000966723,0.00010832798,0.0000029370067,0.0006814717,0.00009998699,0.0000075277876,0.0041004047,0.0000139763415,0.0018298256,0.9888238,0.00018474204,0.0041373363],"study_design_scores_gemma":[0.00042213235,0.000032457498,0.00007774681,0.000741495,0.000045082397,0.0000060566617,0.00027952687,0.011188162,0.015776241,0.9707334,0.00015066931,0.00054702995],"about_ca_topic_score_codex":0.000008078678,"about_ca_topic_score_gemma":0.000002024823,"teacher_disagreement_score":0.75189656,"about_ca_system_score_codex":0.000053895517,"about_ca_system_score_gemma":0.00016907736,"threshold_uncertainty_score":0.9998652},"labels":[],"label_agreement":null},{"id":"W2245479836","doi":"10.1016/j.dam.2016.06.025","title":"A sharp lower bound on the number of non-equivalent colorings of graphs of order <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si8.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi></mml:math> and maximum degree <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si11.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>n</mml:mi><mml:mo>−</mml:mo><mml:mn>3</mml:mn></mml:math>","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fédération Wallonie-Bruxelles; Polytechnique Montréal","keywords":"Combinatorics; Mathematics; Partition (number theory); Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.02050798474540309,"score_gpt":0.24456167879940435,"score_spread":0.22405369405400127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2245479836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98088443,0.0007725614,0.0049556023,0.00068474066,0.0017464348,0.0004016066,0.0010301035,0.0003593266,0.009165189],"genre_scores_gemma":[0.9757752,0.001366746,0.018732691,0.0011054294,0.00044877484,0.0011568072,0.00039906113,0.000784878,0.00023040682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9857366,0.00028761366,0.004029134,0.002868734,0.0041221953,0.0029556989],"domain_scores_gemma":[0.9862037,0.0028796606,0.0047182697,0.0044699786,0.00055353536,0.0011748688],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts"],"category_scores_codex":[0.003613842,0.0019683705,0.0014117176,0.0006125427,0.0017851411,0.0012434559,0.0036520283,0.0023040993,0.0005285735],"category_scores_gemma":[0.0011789949,0.0021163202,0.0022326354,0.0018137656,0.0030909611,0.001413494,0.003834478,0.0019120986,0.0015870039],"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.0015692388,0.0014476478,0.000021291145,0.003418881,0.0020059342,0.00036394,0.003946798,0.00087181805,0.011319164,0.9705694,0.0032078065,0.0012580972],"study_design_scores_gemma":[0.004642693,0.0024167474,0.00007301786,0.0050482145,0.0023532142,0.00084416673,0.0021524217,0.85553694,0.097672895,0.02511257,0.0016658045,0.0024813223],"about_ca_topic_score_codex":0.0006856855,"about_ca_topic_score_gemma":0.0002404936,"teacher_disagreement_score":0.9454568,"about_ca_system_score_codex":0.000053745294,"about_ca_system_score_gemma":0.0013387508,"threshold_uncertainty_score":0.99979335},"labels":[],"label_agreement":null},{"id":"W2252453087","doi":"10.1016/j.dam.2017.07.001","title":"Almost all regular graphs are normal","year":2017,"lang":"en","type":"preprint","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Combinatorics; Mathematics; Conjecture; Vertex (graph theory); Degree (music); Bounded function; Graph; Discrete mathematics; Clique; Independent set; Cover (algebra); Vertex cover; Physics","score_opus":0.04600697440737298,"score_gpt":0.31025328435300903,"score_spread":0.264246309945636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252453087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49989012,0.0013257551,0.025562828,0.00086839363,0.004523886,0.007211038,0.0015441912,0.0021042682,0.45696953],"genre_scores_gemma":[0.72267085,0.0007843266,0.270199,0.00044643352,0.0009884251,0.00075101457,0.00041169737,0.0007227928,0.0030254303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99559623,0.000059692273,0.0012628112,0.001073561,0.0010611002,0.00094660575],"domain_scores_gemma":[0.9917622,0.0004155943,0.0023781017,0.0049617128,0.00017070712,0.00031165007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010270021,0.001206867,0.0017790938,0.0002100453,0.0008510437,0.0004259893,0.0023704306,0.0011659553,0.00020280776],"category_scores_gemma":[0.00039611483,0.0010068283,0.0008163725,0.000093340976,0.00059137505,0.00010587767,0.0036918956,0.0016532635,0.00005647151],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000374283,0.0001545146,0.00005026805,0.0038197122,0.00069922337,0.000049848648,0.003673367,0.000022351043,0.00015201134,0.98087573,0.009991035,0.00047449034],"study_design_scores_gemma":[0.00050572783,0.000020049207,0.000117850745,0.0006808117,0.0007298403,0.00002724592,0.0004475006,0.00032701672,0.0011462925,0.991457,0.0033237573,0.0012169231],"about_ca_topic_score_codex":0.000013923049,"about_ca_topic_score_gemma":0.00002024846,"teacher_disagreement_score":0.4539441,"about_ca_system_score_codex":0.0000843271,"about_ca_system_score_gemma":0.00008779506,"threshold_uncertainty_score":0.9992382},"labels":[],"label_agreement":null},{"id":"W2275118037","doi":"10.1016/j.dam.2015.09.022","title":"Global cycle properties in locally connected, locally traceable and locally hamiltonian graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Mathematics; Combinatorics; Pancyclic graph; Neighbourhood (mathematics); Hamiltonian path; Conjecture; Connectivity; Discrete mathematics; Graph; Induced subgraph; Vertex connectivity; Vertex (graph theory); Chordal graph; 1-planar graph; Mathematical analysis","score_opus":0.01562679022518824,"score_gpt":0.24948473352771053,"score_spread":0.2338579433025223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2275118037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13841172,0.0002401346,0.85071236,0.00062628125,0.000051609113,0.00092025154,0.000015827714,0.0002947841,0.008727038],"genre_scores_gemma":[0.91463023,0.00008123328,0.084794305,0.0001514562,0.00001426728,0.00013839538,0.0000012937949,0.000035426852,0.00015339746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718434,0.0000603529,0.0005906678,0.00072227966,0.00060689705,0.00083544326],"domain_scores_gemma":[0.9982666,0.0002334235,0.00015154401,0.0009725956,0.00011223437,0.0002636231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006493808,0.0003743781,0.00047414083,0.00017611096,0.00015468129,0.00020673123,0.001199341,0.00015095946,0.000015751168],"category_scores_gemma":[0.00012638034,0.0002490875,0.000073583375,0.0008243204,0.0005583077,0.0004974466,0.00058824435,0.00018111894,0.000072283045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007195977,0.00017302297,0.0003064824,0.00018176893,0.000033850432,0.00003606977,0.00083958945,0.00024442456,0.008020451,0.95966315,0.00003639897,0.030392833],"study_design_scores_gemma":[0.0021585044,0.0001817617,0.000792704,0.00041292576,0.00001259806,0.00006190265,0.0004102748,0.027729804,0.0041125976,0.96320635,0.00022774233,0.0006928126],"about_ca_topic_score_codex":0.0000139619015,"about_ca_topic_score_gemma":0.00013172218,"teacher_disagreement_score":0.77621853,"about_ca_system_score_codex":0.00011234259,"about_ca_system_score_gemma":0.00013647077,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W2279987266","doi":"10.1016/j.dam.2016.04.031","title":"Proximity, remoteness and distance eigenvalues of a graph","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Spectral radius; Distance matrix; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Vertex (graph theory); Graph; Connectivity; Resistance distance; Upper and lower bounds; Discrete mathematics; Graph power; Line graph; Mathematical analysis; Physics","score_opus":0.028530359253895236,"score_gpt":0.2831999804923835,"score_spread":0.25466962123848824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2279987266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5136207,0.000074764925,0.4689388,0.00028808092,0.000026642649,0.00091737875,0.00008204825,0.00016858708,0.015883021],"genre_scores_gemma":[0.90887195,0.000060688257,0.090655625,0.000016329857,0.00002011538,0.00010184425,0.0000024086526,0.000039007886,0.00023201416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878234,0.000018981444,0.00046486896,0.00026752122,0.00023296235,0.00023332151],"domain_scores_gemma":[0.9983507,0.0005738607,0.0002966931,0.00063606305,0.000058344154,0.00008438371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004072666,0.00020815717,0.00038224028,0.000073339266,0.00010444857,0.000017059161,0.0002518003,0.000083932544,0.000031804568],"category_scores_gemma":[0.00012293199,0.00013201039,0.000084169296,0.00020872733,0.0003584144,0.00008600146,0.00010699796,0.00006452538,0.00001015236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014867428,0.00010994198,0.000045657594,0.00042199882,0.000036579746,4.5701952e-7,0.00067908084,1.2637473e-7,0.028891042,0.9671736,0.00008829619,0.0025383693],"study_design_scores_gemma":[0.0003642237,0.000018461727,0.00008561414,0.00016475713,0.00007166714,0.0000058850123,0.00038342713,0.000031733303,0.029333774,0.96915656,0.00018942087,0.00019445048],"about_ca_topic_score_codex":8.852378e-7,"about_ca_topic_score_gemma":0.0000033911035,"teacher_disagreement_score":0.3952513,"about_ca_system_score_codex":0.000010743558,"about_ca_system_score_gemma":0.000015003716,"threshold_uncertainty_score":0.53832275},"labels":[],"label_agreement":null},{"id":"W2294401501","doi":"10.1016/j.dam.2015.12.015","title":"Influence of the normalization constraint on the integral simplex using decomposition","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Normalization (sociology); Simplex; Linear programming; Simplex algorithm; Mathematical optimization; Polytope; Solution set; Algorithm; Combinatorics; Set (abstract data type); Computer science","score_opus":0.049102594228262575,"score_gpt":0.35655257004164476,"score_spread":0.3074499758133822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294401501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40296125,0.0000018726525,0.59327734,0.0005244971,0.000020979298,0.0007972487,0.000033729175,0.00004731847,0.0023357582],"genre_scores_gemma":[0.88719785,0.00000739502,0.11247535,0.00013336731,0.000027130718,0.000048856306,0.0000028213324,0.000041002353,0.00006624506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984355,0.00006027129,0.0005112248,0.00018374395,0.00055314845,0.00025612128],"domain_scores_gemma":[0.99746746,0.0012176308,0.00040654652,0.0006585406,0.00019009184,0.000059752867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004294686,0.0001889248,0.0002275331,0.0000645296,0.00020146591,0.000028026561,0.00044335716,0.00007571489,0.0000966114],"category_scores_gemma":[0.0010613042,0.000083805004,0.00008533313,0.0003288822,0.0003980959,0.00010159056,0.0001585093,0.0001462775,0.000015084796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016999675,0.00008094027,0.000017978737,0.00009735517,0.000032317515,3.8639925e-7,0.000720948,0.01018661,0.036807008,0.9509712,0.000104376384,0.00096389884],"study_design_scores_gemma":[0.0008794573,0.00005239988,0.000098494755,0.0007012727,0.00007768376,0.000018549508,0.001378201,0.07234287,0.17265205,0.7512771,0.00014191023,0.00038004058],"about_ca_topic_score_codex":0.0000020530513,"about_ca_topic_score_gemma":0.000002338538,"teacher_disagreement_score":0.48423657,"about_ca_system_score_codex":0.000102235485,"about_ca_system_score_gemma":0.00007431827,"threshold_uncertainty_score":0.3417469},"labels":[],"label_agreement":null},{"id":"W2298045254","doi":"10.1016/j.dam.2016.02.009","title":"Strict chordal and strict split digraphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Undirected graph; Combinatorics; Interval graph; Similarity (geometry); Discrete mathematics; Graph; Computer science; Artificial intelligence","score_opus":0.015583501838773802,"score_gpt":0.2628296687805626,"score_spread":0.24724616694178878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2298045254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046839673,0.00010463589,0.93937874,0.00029878982,0.000046328594,0.00043727027,0.000015934173,0.000242685,0.012635955],"genre_scores_gemma":[0.77833694,0.00014493048,0.22081992,0.00006448967,0.000044624925,0.00008764231,0.0000019191523,0.00003588683,0.00046365638],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818677,0.00003919476,0.00032136013,0.00048638863,0.00044901183,0.0005172946],"domain_scores_gemma":[0.99779767,0.0008630416,0.00012739637,0.0009519129,0.000048839524,0.00021112208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065632653,0.00023819499,0.0002751443,0.0001997452,0.00014861402,0.00014970206,0.00094355835,0.000074166775,0.000026117848],"category_scores_gemma":[0.00013875331,0.0001508467,0.00006805689,0.00056970754,0.00019909811,0.0003350884,0.0005509493,0.00013743545,0.00009155964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013538211,0.00003905948,0.00007195922,0.00004440685,0.000022878454,0.000005662077,0.0003408143,0.0000013166182,0.007142778,0.9509981,0.00010836089,0.041211113],"study_design_scores_gemma":[0.00094676646,0.000096437965,0.0009135532,0.00006208639,0.000015267087,0.000022199396,0.00020736607,0.0017631329,0.008393377,0.9856152,0.001475041,0.0004895892],"about_ca_topic_score_codex":0.0000011912795,"about_ca_topic_score_gemma":0.0000010258976,"teacher_disagreement_score":0.7314972,"about_ca_system_score_codex":0.00002968051,"about_ca_system_score_gemma":0.00003057009,"threshold_uncertainty_score":0.615135},"labels":[],"label_agreement":null},{"id":"W2300052872","doi":"10.1016/j.dam.2015.10.014","title":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si26.gif\" display=\"inline\" overflow=\"scroll\"><mml:mfrac><mml:mrow><mml:mn>5</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:mfrac></mml:math>-approximation for subcubic 2EC using circulations and obliged edges","year":2015,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Algorithm","score_opus":0.03999557587375012,"score_gpt":0.26736532694127957,"score_spread":0.22736975106752944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2300052872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6127259,0.001615266,0.17378624,0.00097102235,0.003124857,0.0003294948,0.0009796077,0.00059619045,0.20587143],"genre_scores_gemma":[0.90780705,0.00042307735,0.08582134,0.00081223977,0.0016403733,0.0012878227,0.0014231397,0.0005760729,0.0002089039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990785,0.00024991579,0.002229644,0.0019730262,0.002527883,0.0022345253],"domain_scores_gemma":[0.99144715,0.0019454167,0.0023884824,0.0028227333,0.0003132895,0.0010829302],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002556256,0.0010888196,0.000594616,0.0006099414,0.002079588,0.002445141,0.0023728856,0.0016599493,0.017472675],"category_scores_gemma":[0.0012564673,0.0017898818,0.001356117,0.001529603,0.0015287123,0.0018660994,0.0023282936,0.0013501907,0.00074605265],"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.00043953286,0.00047167455,0.000005493358,0.002261304,0.0009917385,0.00020112912,0.006973052,0.00257481,0.0017065695,0.94853526,0.03183788,0.004001572],"study_design_scores_gemma":[0.0019135053,0.00067937066,0.000044737884,0.0011137455,0.0012142847,0.0005885199,0.0029430138,0.74811107,0.23667036,0.003066763,0.0021133493,0.0015412866],"about_ca_topic_score_codex":0.00035522185,"about_ca_topic_score_gemma":0.00035876542,"teacher_disagreement_score":0.9454685,"about_ca_system_score_codex":0.000038133483,"about_ca_system_score_gemma":0.0013785273,"threshold_uncertainty_score":0.9996361},"labels":[],"label_agreement":null},{"id":"W2383797602","doi":"10.1016/j.dam.2016.04.021","title":"Trees with large <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>m</mml:mi></mml:math>-eternal domination number","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation; Pacific Institute for the Mathematical Sciences","keywords":"Guard (computer science); Vertex (graph theory); Combinatorics; Mathematics; Graph; Discrete mathematics; Computer science","score_opus":0.014173069210246202,"score_gpt":0.2604181717843639,"score_spread":0.2462451025741177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2383797602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68436813,0.000026668824,0.3094191,0.00018635868,0.00013079637,0.00013065554,0.000056326204,0.00018246422,0.005499493],"genre_scores_gemma":[0.92393816,0.000060383158,0.074816994,0.00017922254,0.00020068734,0.00034540574,0.0000394895,0.00012609828,0.00029356574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644136,0.000054398715,0.0006280778,0.00074559456,0.0012232403,0.000907334],"domain_scores_gemma":[0.9969856,0.00067535735,0.0005421483,0.0014277991,0.000095156676,0.00027392447],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009033305,0.00042019103,0.0003075544,0.00013014053,0.00043753328,0.00036860033,0.0013336965,0.00027599355,0.00006211671],"category_scores_gemma":[0.00016795831,0.0003474931,0.00025548926,0.00042755436,0.00035465628,0.00078690675,0.00082113873,0.00037381405,0.0012711819],"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.00015915431,0.00017207938,0.000014980953,0.00020008543,0.00013492822,0.00007400547,0.001192271,0.000076198194,0.004689147,0.9908137,0.00013521888,0.0023382865],"study_design_scores_gemma":[0.0023509283,0.00033731834,0.00008877698,0.00054229714,0.00012679749,0.00024603415,0.0006037862,0.88508534,0.028896833,0.07954836,0.0013694235,0.0008040815],"about_ca_topic_score_codex":0.000010880327,"about_ca_topic_score_gemma":0.00004699517,"teacher_disagreement_score":0.91126525,"about_ca_system_score_codex":0.00003093573,"about_ca_system_score_gemma":0.00015678322,"threshold_uncertainty_score":0.9998977},"labels":[],"label_agreement":null},{"id":"W2406653127","doi":"10.1016/j.dam.2016.04.025","title":"A computational substantiation of the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si7.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>d</mml:mi></mml:math>-step approach to the number of distinct squares problem","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Cover (algebra); String (physics); Mathematics; Ternary operation; Combinatorics; Algorithm; Discrete mathematics; Computer science","score_opus":0.015257785665206249,"score_gpt":0.2403468883504535,"score_spread":0.22508910268524726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406653127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49053454,0.00001889614,0.5064001,0.00020974506,0.000109643035,0.0001552959,0.000121867146,0.00004867282,0.0024012637],"genre_scores_gemma":[0.84501994,0.000008211472,0.15449515,0.00010359488,0.0000889582,0.00015262506,0.00006514915,0.000038942107,0.000027437452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767184,0.000042525582,0.00064754445,0.00041409375,0.0008933383,0.0003306291],"domain_scores_gemma":[0.99762887,0.0004480367,0.0006827911,0.0010591721,0.000086807144,0.00009432595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054839364,0.00023871765,0.00021792075,0.000041517247,0.00030206115,0.00014297504,0.0011923023,0.00014688083,0.00001178863],"category_scores_gemma":[0.00008468312,0.00015268021,0.00020217904,0.00030667338,0.00019985074,0.00028223026,0.00089195947,0.00016443207,0.0001227887],"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.000034322813,0.00015629512,0.00001395241,0.00026751822,0.00006616217,0.0000015690601,0.0016897375,0.0013762275,0.00060349994,0.9937534,0.00044231245,0.0015950487],"study_design_scores_gemma":[0.00041748385,0.000053754447,0.00022956048,0.0002600166,0.00006535514,0.000030005891,0.00030139566,0.9842518,0.0024025394,0.011369158,0.00041603128,0.00020292809],"about_ca_topic_score_codex":0.000038716258,"about_ca_topic_score_gemma":0.000012026903,"teacher_disagreement_score":0.9828755,"about_ca_system_score_codex":0.000012495385,"about_ca_system_score_gemma":0.00013530125,"threshold_uncertainty_score":0.6226118},"labels":[],"label_agreement":null},{"id":"W2419591848","doi":"10.1016/j.dam.2016.05.003","title":"The New Periodicity Lemma revisited","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","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":"McMaster University","funders":"","keywords":"Mathematics; Lemma (botany); Factorization; String (physics); Neighbourhood (mathematics); Combinatorics; Algorithm; Mathematical analysis","score_opus":0.010581352350266988,"score_gpt":0.2258826769507843,"score_spread":0.2153013246005173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2419591848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040912926,0.00015655775,0.97542685,0.0029447586,0.00009237328,0.0002488274,0.0000037294571,0.00033645742,0.01669912],"genre_scores_gemma":[0.72647256,0.00028713635,0.26724908,0.0011137732,0.00037007598,0.000076048535,0.0000036561469,0.00006408475,0.0043636146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878424,0.000016929604,0.0002959443,0.0002749838,0.00029406187,0.00033382117],"domain_scores_gemma":[0.9981428,0.00044317704,0.00014744457,0.0011215612,0.000024947913,0.00012010943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044271993,0.00016949937,0.00018954603,0.000028977038,0.0002774978,0.00026747145,0.001275034,0.000050970757,0.00003626261],"category_scores_gemma":[0.00007362431,0.00007853208,0.00007790368,0.00019964522,0.00010364617,0.00016257628,0.00034924364,0.00007386643,0.0003791545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023189973,0.0000107636215,0.0000025678505,0.000012377,0.000012555343,0.0000015066855,0.00049848045,2.6860224e-7,0.0075631374,0.9282322,0.006442045,0.05722177],"study_design_scores_gemma":[0.0006175931,0.00003239123,0.000115460796,0.00011924016,0.000018668454,0.000021337917,0.00022211847,0.003997016,0.012724681,0.9137366,0.06798955,0.00040534258],"about_ca_topic_score_codex":0.0000018250844,"about_ca_topic_score_gemma":0.0000011535288,"teacher_disagreement_score":0.72238123,"about_ca_system_score_codex":0.000026924501,"about_ca_system_score_gemma":0.000047605747,"threshold_uncertainty_score":0.48733902},"labels":[],"label_agreement":null},{"id":"W2429536804","doi":"10.1016/j.dam.2016.05.018","title":"On color-critical (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>,co-<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si4.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Graph; Chromatic scale; Combinatorics; Mathematics; Discrete mathematics; Algorithm; Physics","score_opus":0.0199158217559506,"score_gpt":0.263607790125686,"score_spread":0.24369196836973542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429536804","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4239704,0.0020865067,0.009316193,0.0018590841,0.005380781,0.00022316087,0.0021306186,0.0010143663,0.55401886],"genre_scores_gemma":[0.9579021,0.003448196,0.01680094,0.0038402914,0.004353821,0.005745206,0.0035586138,0.0032784983,0.0010723843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9676669,0.0014566183,0.006285709,0.0063414085,0.009469656,0.008779664],"domain_scores_gemma":[0.969679,0.009070802,0.006016241,0.010076816,0.0007162466,0.0044409223],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.0070654666,0.003470756,0.0014248937,0.0021511842,0.0051570614,0.005244015,0.0105829295,0.007023012,0.4917266],"category_scores_gemma":[0.007457853,0.0061960765,0.0060644154,0.0044917692,0.007832006,0.004870803,0.009459377,0.005950128,0.009799812],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041513257,0.0011984995,0.000012072763,0.003478708,0.0033648307,0.003717985,0.0034127277,0.0019929917,0.0065045026,0.6755232,0.29405573,0.0025874097],"study_design_scores_gemma":[0.005902575,0.004368342,0.00007452228,0.0042059715,0.0034645072,0.0035099515,0.0036570453,0.14932172,0.8117243,0.002310123,0.0061174827,0.005343458],"about_ca_topic_score_codex":0.0014544751,"about_ca_topic_score_gemma":0.002481148,"teacher_disagreement_score":0.8052198,"about_ca_system_score_codex":0.00008912011,"about_ca_system_score_gemma":0.004952572,"threshold_uncertainty_score":0.9985519},"labels":[],"label_agreement":null},{"id":"W2467648358","doi":"10.1016/j.dam.2016.05.023","title":"Graph multi-coloring for a job scheduling application","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal; Université de Montréal; Transport Canada","funders":"","keywords":"Fractional coloring; Combinatorics; Mathematics; Vertex (graph theory); Graph coloring; Colored; Greedy coloring; List coloring; Complete coloring; Edge coloring; Neighbourhood (mathematics); Integer programming; Graph; Discrete mathematics; Graph power; Algorithm; Line graph","score_opus":0.131738151946533,"score_gpt":0.3866086343133353,"score_spread":0.2548704823668023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467648358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061414007,0.000041305375,0.9350226,0.0005593383,0.00014043605,0.00067417906,0.00003376076,0.00017811233,0.0019362883],"genre_scores_gemma":[0.561452,0.0000062172517,0.43747234,0.00004730522,0.00009022215,0.00039272863,0.0000026808166,0.00002688481,0.00050962274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975175,0.00001811151,0.00077387184,0.00056268123,0.0006741271,0.0004537095],"domain_scores_gemma":[0.9961846,0.0021539626,0.00036480807,0.0008963744,0.0002495274,0.00015074668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024623838,0.0002101998,0.0003713353,0.0002605821,0.000363409,0.00017143798,0.00069452345,0.000119097385,0.000037134283],"category_scores_gemma":[0.002208347,0.0001270118,0.00021078705,0.00061586994,0.0001221357,0.00016166693,0.00010954395,0.00008926365,0.00056627364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043935626,0.00021393674,0.0004980716,0.000063368556,0.00008672447,4.9658706e-7,0.0012313311,0.0009940466,0.11593556,0.84042436,0.00042999507,0.04007818],"study_design_scores_gemma":[0.0024839484,0.00004821503,0.0007529712,0.00011033155,0.00013088887,0.000006559266,0.0018859747,0.07674291,0.015223366,0.89640665,0.005532903,0.0006752678],"about_ca_topic_score_codex":0.0000030211418,"about_ca_topic_score_gemma":0.000008540007,"teacher_disagreement_score":0.50003797,"about_ca_system_score_codex":0.000040790892,"about_ca_system_score_gemma":0.00005186037,"threshold_uncertainty_score":0.72784907},"labels":[],"label_agreement":null},{"id":"W2468582779","doi":"10.1016/j.dam.2008.11.008","title":"Corrigendum to “Variable space search for graph coloring” [Discrete Appl. Math. 156 (2008) 2551–2560]","year":2008,"lang":"en","type":"erratum","venue":"Discrete Applied 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":"Mathematics; Graph; Combinatorics; Space (punctuation); Graph coloring; Discrete mathematics; Computer science","score_opus":0.12092423409665076,"score_gpt":0.36123069238706884,"score_spread":0.24030645829041808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2468582779","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041079154,0.0009325843,0.75576586,0.0013036195,0.026689867,0.005717229,0.0026171657,0.0007397472,0.20582315],"genre_scores_gemma":[0.0011687967,0.00033970727,0.44814143,0.0005327658,0.0028046994,0.0020001652,0.0011408604,0.00049416156,0.54337746],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98871005,0.00009031255,0.0024100642,0.0023376138,0.004180655,0.0022713032],"domain_scores_gemma":[0.9910916,0.001956219,0.0011523992,0.0036056128,0.0011906365,0.0010035223],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0053371363,0.0013142818,0.0025112128,0.001508222,0.0015370888,0.0010770926,0.003606358,0.0013378704,0.00041625416],"category_scores_gemma":[0.0027879986,0.0010895903,0.0008875322,0.0035753527,0.0004634278,0.00021938716,0.00092688703,0.0018080358,0.0032321014],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074190284,0.00015473357,0.000003848651,0.000275925,0.00020979831,0.000009766768,0.001677743,0.0009395234,0.00023618276,0.17774709,0.81839955,0.00027165076],"study_design_scores_gemma":[0.00092560635,0.00020219268,0.000012004468,0.0003640534,0.00039608835,0.000050011902,0.0031790277,0.016785877,0.0005766098,0.08820568,0.8876293,0.001673567],"about_ca_topic_score_codex":0.000093353,"about_ca_topic_score_gemma":0.000038976694,"teacher_disagreement_score":0.33755428,"about_ca_system_score_codex":0.0002587116,"about_ca_system_score_gemma":0.0013137987,"threshold_uncertainty_score":0.99996084},"labels":[],"label_agreement":null},{"id":"W2470126219","doi":"10.1016/j.dam.2016.05.030","title":"A heuristic for cumulative vehicle routing using column generation","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Column generation; Mathematical optimization; Vehicle routing problem; Rounding; Linear programming; Heuristic; Cover (algebra); Routing (electronic design automation); Scalability; Linear programming relaxation; Mathematics; Set (abstract data type); Randomized rounding; Relaxation (psychology); Computer science; Engineering","score_opus":0.050046411098905806,"score_gpt":0.2985779523229441,"score_spread":0.24853154122403828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2470126219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106619164,0.000012405782,0.8908612,0.00002129233,0.000103149025,0.00050763367,0.00002683394,0.0003127911,0.0015355244],"genre_scores_gemma":[0.5329017,0.0000028399813,0.4667883,0.000013711333,0.0001175262,0.000054940738,0.000007949715,0.000064982145,0.000048021495],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989295,0.000015609932,0.000402602,0.0001958335,0.00015857999,0.0002978596],"domain_scores_gemma":[0.999162,0.00034454337,0.00010809012,0.00025527013,0.00006480097,0.000065287764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003975483,0.00018487468,0.00024276033,0.00005639889,0.00013467569,0.000053912074,0.00011387184,0.00008997892,0.000023268283],"category_scores_gemma":[0.00018161153,0.00015350331,0.000058961024,0.00014850587,0.000034671542,0.00009535432,0.000032084,0.000057650097,0.000015766642],"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.000010514008,0.0000353389,0.000037704773,0.00031510208,0.000101325175,9.0461515e-7,0.0022848805,0.32231402,0.60076565,0.06577017,0.00027526918,0.008089109],"study_design_scores_gemma":[0.0005292565,0.00001047864,0.000010171087,0.00005899744,0.00004642616,0.0000018979806,0.00014462946,0.96534663,0.029284988,0.0042657964,0.00006348604,0.00023722324],"about_ca_topic_score_codex":0.0000010426653,"about_ca_topic_score_gemma":0.000001239398,"teacher_disagreement_score":0.6430326,"about_ca_system_score_codex":0.00012089479,"about_ca_system_score_gemma":0.000017057733,"threshold_uncertainty_score":0.62596834},"labels":[],"label_agreement":null},{"id":"W2472646614","doi":"10.1016/j.dam.2016.05.031","title":"Rectilinear path problems in restricted memory setup","year":2016,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Path (computing); Algorithm; Mathematical optimization; Combinatorics; Arithmetic; Computer science; Programming language","score_opus":0.015692835533974978,"score_gpt":0.23396249652365553,"score_spread":0.21826966098968054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2472646614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042243052,0.000032152948,0.9473625,0.0004192774,0.00011906613,0.0003866086,0.0000045852707,0.00015844278,0.009274332],"genre_scores_gemma":[0.74667054,0.00003068845,0.2523812,0.000117888616,0.00008577262,0.0001061922,0.000011182508,0.000017793194,0.0005786994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882126,0.000020434956,0.00034237816,0.00030525046,0.00028604173,0.000224624],"domain_scores_gemma":[0.9991458,0.00020721526,0.00011770766,0.00041749966,0.00004718144,0.00006456596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002687004,0.0001364808,0.00016738061,0.00015655244,0.000055536762,0.00006130608,0.00037827372,0.00006172286,0.000017994409],"category_scores_gemma":[0.0000693595,0.00009453569,0.000036189558,0.0006185571,0.000025211548,0.00019835457,0.0001363148,0.00007615563,0.000102185695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015484016,0.00041541818,0.000078428086,0.000236056,0.000038496808,0.0000168987,0.0042885444,0.0038292562,0.11721509,0.72800994,0.0023411273,0.14351526],"study_design_scores_gemma":[0.004312374,0.00024192309,0.0032785663,0.00051063043,0.00003047515,0.000056841644,0.00037766816,0.26203072,0.05369951,0.66652626,0.0074187187,0.0015163166],"about_ca_topic_score_codex":0.0000028130432,"about_ca_topic_score_gemma":0.000004851458,"teacher_disagreement_score":0.70442754,"about_ca_system_score_codex":0.00004796994,"about_ca_system_score_gemma":0.000060075497,"threshold_uncertainty_score":0.38550535},"labels":[],"label_agreement":null},{"id":"W2473908394","doi":"10.1016/j.dam.2016.05.029","title":"An efficient lattice reduction using reuse technique blockwisely on NTRU","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Cryptography and Data Security","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":"Toronto Metropolitan University","funders":"","keywords":"NTRU; Lattice reduction; Mathematics; Reuse; Lattice (music); Reduction (mathematics); Algorithm; Mathematical optimization; Theoretical computer science; Computer science; Statistics; Cryptography; Geometry","score_opus":0.020177397056009887,"score_gpt":0.26982890482061617,"score_spread":0.2496515077646063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473908394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11592777,0.0000067749893,0.8815681,0.00014992425,0.000095590476,0.0004340012,0.000020209369,0.00032305915,0.0014745744],"genre_scores_gemma":[0.5002042,0.0000048716865,0.49964085,0.000035175053,0.000053581305,0.000039913222,0.000003449885,0.000015581867,0.0000023719408],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852556,0.000028157066,0.00030562427,0.0004732384,0.00035670193,0.00031070333],"domain_scores_gemma":[0.99755424,0.0000955925,0.000169686,0.002000653,0.000046875593,0.00013292658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004502028,0.00020884491,0.00019970068,0.0001552714,0.00018147656,0.000114723916,0.0011186646,0.00010224598,0.000012651607],"category_scores_gemma":[0.000040871833,0.00014460737,0.000068954054,0.00040566514,0.00009255125,0.00022154607,0.00024947285,0.000118927404,0.0000419493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011900942,0.00024191891,0.0000018200585,0.000031829946,0.000010685479,0.0000027622225,0.0009072581,0.00013522133,0.1551238,0.8418904,0.00008473008,0.0015576767],"study_design_scores_gemma":[0.0009714976,0.00027710147,0.00007052292,0.00038065464,0.00007430834,0.00010883551,0.00040839668,0.06640412,0.38698396,0.54224056,0.001027104,0.0010529656],"about_ca_topic_score_codex":0.0000028853285,"about_ca_topic_score_gemma":6.821322e-7,"teacher_disagreement_score":0.38427642,"about_ca_system_score_codex":0.000047831418,"about_ca_system_score_gemma":0.000031442793,"threshold_uncertainty_score":0.58969176},"labels":[],"label_agreement":null},{"id":"W2476908243","doi":"10.1016/j.dam.2016.07.002","title":"Uniquely forced perfect matching and unique 3-edge-coloring","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"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 Science Foundation of Zhejiang Province; National Science Foundation of Sri Lanka; Simons Foundation; National Natural Science Foundation of China; National Sanitarium Association; National Science Foundation","keywords":"Mathematics; Combinatorics; Matching (statistics); Edge coloring; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Graph; Computer science; Statistics","score_opus":0.018810681003194614,"score_gpt":0.27401836684245623,"score_spread":0.2552076858392616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2476908243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13917416,0.000025277226,0.8487498,0.00027798346,0.00003408696,0.0004014133,0.0000027194662,0.00027039603,0.011064167],"genre_scores_gemma":[0.73197633,0.000044368902,0.26741913,0.00006278518,0.000017143791,0.00009879361,7.143804e-7,0.000033838023,0.0003469123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984401,0.000039997372,0.0002939863,0.00043619814,0.00030861137,0.0004811412],"domain_scores_gemma":[0.99824,0.0006553745,0.000119952776,0.0007708117,0.00004807225,0.00016580427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006934596,0.0002300258,0.00027594864,0.00014322472,0.00019748218,0.0001368995,0.0007885421,0.00007935995,0.000012552076],"category_scores_gemma":[0.00007256638,0.00015290108,0.00005579376,0.00028392175,0.00015215867,0.00040282856,0.00064254843,0.00016657589,0.0000468284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007402845,0.000013863613,0.000012023695,0.00007691445,0.000014580077,0.000005072845,0.0012018088,0.0000065154973,0.07746394,0.91056645,0.000010775515,0.010620648],"study_design_scores_gemma":[0.0004077221,0.000047510806,0.00005013438,0.0001052684,0.0000065863096,0.00002139525,0.00020241085,0.0015548962,0.04394953,0.95318645,0.00018742417,0.00028065048],"about_ca_topic_score_codex":0.0000017486623,"about_ca_topic_score_gemma":0.0000020409054,"teacher_disagreement_score":0.59280217,"about_ca_system_score_codex":0.000054296095,"about_ca_system_score_gemma":0.000036799287,"threshold_uncertainty_score":0.6235125},"labels":[],"label_agreement":null},{"id":"W2477185620","doi":"10.1016/j.dam.2016.07.020","title":"Safe set problem on graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Set (abstract data type); Discrete mathematics; Computer science; Programming language","score_opus":0.025103304140731954,"score_gpt":0.287618367183075,"score_spread":0.262515063042343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477185620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045986674,0.000011752051,0.8974883,0.0008018031,0.000050738425,0.0005542265,0.000014102708,0.00030302684,0.09617736],"genre_scores_gemma":[0.4636917,0.00003296427,0.5342586,0.0002802553,0.00003754508,0.00023852417,0.000003524663,0.00005484701,0.0014020433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981388,0.00002625019,0.00031140438,0.0004583287,0.0005553082,0.0005098942],"domain_scores_gemma":[0.99799746,0.0004480612,0.00012802733,0.0012195915,0.0000491121,0.00015775427],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004668721,0.0002266621,0.00024159288,0.00016972159,0.00013371721,0.00008586968,0.0012715339,0.000068669106,0.00005134862],"category_scores_gemma":[0.000047620204,0.00013580271,0.00008735161,0.00044883147,0.0001479548,0.00021352341,0.00035409862,0.00013854424,0.0008408703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009899179,0.000047149788,0.000004750535,0.00004036024,0.000016139316,0.0000045831816,0.00043862738,0.0000071516524,0.01008903,0.973525,0.000501572,0.015315772],"study_design_scores_gemma":[0.0004161124,0.00007422186,0.00001559471,0.00007091151,0.0000038985986,0.00000604357,0.000060511597,0.00043072883,0.015443428,0.9811777,0.002056037,0.00024484083],"about_ca_topic_score_codex":3.4904355e-7,"about_ca_topic_score_gemma":7.1438654e-7,"teacher_disagreement_score":0.45909303,"about_ca_system_score_codex":0.000039997878,"about_ca_system_score_gemma":0.00003070141,"threshold_uncertainty_score":0.9999371},"labels":[],"label_agreement":null},{"id":"W2478779766","doi":"10.1016/j.dam.2017.02.009","title":"Graphs with integer matching polynomial zeros","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":8,"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":"Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; Mount Allison University; Iran National Science Foundation; National Research Foundation; European Research Council; National Science Foundation","keywords":"Mathematics; Combinatorics; Matching (statistics); Discrete mathematics; 3-dimensional matching; Indifference graph; Integral graph; Chordal graph; Integer (computer science); Pathwidth; Graph; Line graph; Bipartite graph; Voltage graph; Computer science","score_opus":0.03134065194744486,"score_gpt":0.30155869251625317,"score_spread":0.2702180405688083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2478779766","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76177394,0.000011377838,0.0924602,0.0004481905,0.000097916636,0.0012440282,0.000051565836,0.0004041247,0.14350866],"genre_scores_gemma":[0.8910044,0.0000049524187,0.10790801,0.00006858047,0.0000740385,0.000248891,0.000010832879,0.0000889505,0.00059137825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984266,0.000013494925,0.00043714754,0.00037510679,0.0003268931,0.00042076447],"domain_scores_gemma":[0.99712604,0.0002795551,0.00055669225,0.0018385332,0.000051689993,0.00014748173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004231134,0.0003552029,0.0004624708,0.000086815824,0.0010389116,0.0003245966,0.0009070519,0.00012573857,0.0001011755],"category_scores_gemma":[0.00007814147,0.00026498025,0.00013994491,0.00009281097,0.00036990407,0.0001855718,0.00020652394,0.00030982573,0.00012328624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000326166,0.00014204164,0.000028878398,0.00015547597,0.000084096835,0.0000035631801,0.001657678,0.000002853605,0.005776608,0.9907922,0.00089558086,0.00042840498],"study_design_scores_gemma":[0.00063500815,0.00002835812,0.00008966835,0.00010423791,0.00013806157,0.000019474663,0.00137978,0.00008421278,0.0069921967,0.98953927,0.00058579433,0.00040392426],"about_ca_topic_score_codex":0.000009342534,"about_ca_topic_score_gemma":0.000015988517,"teacher_disagreement_score":0.14291728,"about_ca_system_score_codex":0.000022076136,"about_ca_system_score_gemma":0.00003056436,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null},{"id":"W2482026737","doi":"10.1016/j.dam.2017.08.003","title":"The geometric–arithmetic index and the chromatic number of connected graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Chromatic scale; Combinatorics; Graph; Upper and lower bounds; Discrete mathematics; Clique number; Critical graph; Arithmetic; Graph power; Line graph","score_opus":0.011429767381227902,"score_gpt":0.2472710161311256,"score_spread":0.2358412487498977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482026737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65192574,0.0009331258,0.28956583,0.0044593257,0.00052512786,0.0021307277,0.000009952702,0.00032662725,0.05012356],"genre_scores_gemma":[0.9758853,0.00008207788,0.023828063,0.00006796829,0.0000035097812,0.000048354377,6.260127e-7,0.0000119945225,0.00007212963],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.000029129458,0.00041517723,0.00022161365,0.00038623964,0.00024854462],"domain_scores_gemma":[0.9967668,0.00093727536,0.0005257571,0.001618995,0.00008607985,0.00006510905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010190811,0.0001633264,0.0003116147,0.00006414316,0.0009288097,0.00048734774,0.0013785247,0.00005929696,0.000004278334],"category_scores_gemma":[0.00036217595,0.000080524245,0.0000794062,0.00030429527,0.00086563046,0.000104727595,0.000530484,0.00014435161,0.000017667284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006239552,0.000024317775,0.000083300336,0.00006651018,0.00004840275,6.3606046e-7,0.00074499624,0.00000451163,0.00017544725,0.9966695,0.0001154462,0.0020607298],"study_design_scores_gemma":[0.001285777,0.000012037609,0.0007247236,0.000048107722,0.00003986773,0.000017384162,0.00021072397,0.03669981,0.00082122406,0.9599439,0.00005613642,0.00014031418],"about_ca_topic_score_codex":0.000028424583,"about_ca_topic_score_gemma":0.0000041757194,"teacher_disagreement_score":0.32395956,"about_ca_system_score_codex":0.0000048128254,"about_ca_system_score_gemma":0.000022720862,"threshold_uncertainty_score":0.7143747},"labels":[],"label_agreement":null},{"id":"W2482477387","doi":"10.1016/j.dam.2016.06.019","title":"A deterministic version of the game of zombies and survivors on graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Memorial University of Newfoundland; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.013771039968413844,"score_gpt":0.25651936903229,"score_spread":0.24274832906387617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2482477387","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80112714,0.000022692033,0.19340862,0.00015356748,0.000060756243,0.0003991529,0.000018864219,0.00003803386,0.0047711753],"genre_scores_gemma":[0.98838186,0.000019469837,0.011499304,0.000012716985,0.0000026794255,0.000011328035,1.6924928e-7,0.000009136121,0.00006332769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905235,0.000028004502,0.00023273127,0.0001802639,0.0003419656,0.00016469786],"domain_scores_gemma":[0.99837625,0.00065947074,0.0001788454,0.00070309144,0.000040179722,0.000042148222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027787348,0.000107128755,0.00019754545,0.000085329775,0.00004602242,0.000011950963,0.0006550118,0.00003541987,0.0000048833763],"category_scores_gemma":[0.0001026102,0.00005452574,0.000057631816,0.00025571583,0.00037565923,0.00006454496,0.00035068084,0.00005647157,0.0000060720613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017112896,0.000036935522,0.00008276435,0.00012054781,0.0000114913055,4.8574685e-7,0.0008149909,0.0000036060246,0.036247265,0.95851094,0.000008528479,0.004145306],"study_design_scores_gemma":[0.00042704958,0.00011146662,0.0007887189,0.00018969068,0.00001028796,0.0000030863973,0.00019262059,0.0008916763,0.08433152,0.91289485,0.000040829906,0.000118221134],"about_ca_topic_score_codex":0.000001232238,"about_ca_topic_score_gemma":0.0000018375948,"teacher_disagreement_score":0.18725473,"about_ca_system_score_codex":0.000008196496,"about_ca_system_score_gemma":0.000016900263,"threshold_uncertainty_score":0.22234951},"labels":[],"label_agreement":null},{"id":"W2483506508","doi":"10.1016/j.dam.2016.06.015","title":"Minimum multiple originator broadcast graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Broadcasting (networking); Graph; Mathematics; Computer science; Set (abstract data type); Combinatorics; Computer network; Programming language","score_opus":0.013605648335715044,"score_gpt":0.22810287778523688,"score_spread":0.21449722944952185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483506508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01704684,0.000029023879,0.9582462,0.00029407835,0.0005644969,0.00031194376,0.0000062542113,0.00029332464,0.023207882],"genre_scores_gemma":[0.95318747,0.00001121469,0.045467492,0.000116745716,0.00010678145,0.00008057351,0.0000012517174,0.00002298898,0.0010054696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863696,0.00001557416,0.00037539235,0.00034807954,0.0002769325,0.0003470625],"domain_scores_gemma":[0.99867386,0.0002544698,0.00016408892,0.00074195355,0.000050282546,0.00011537545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002564135,0.00019605875,0.00025580838,0.000085714106,0.000116896255,0.00012811054,0.0006858633,0.00008411978,0.0000433931],"category_scores_gemma":[0.00003012535,0.000119574026,0.00010649911,0.00023288312,0.00005326046,0.00020337358,0.00015764998,0.00007122542,0.00042797954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038564403,0.000044167315,0.000038272294,0.000038094666,0.00002690591,0.0000038959533,0.0007509717,0.000004616872,0.008605977,0.97852224,0.0033646394,0.008596342],"study_design_scores_gemma":[0.0053369193,0.00030243193,0.00019122568,0.000739548,0.000065256005,0.00019269557,0.0014721596,0.15614396,0.041974872,0.5958465,0.19513428,0.002600168],"about_ca_topic_score_codex":0.0000033721258,"about_ca_topic_score_gemma":0.000003384607,"teacher_disagreement_score":0.93614066,"about_ca_system_score_codex":0.000036586138,"about_ca_system_score_gemma":0.000018402521,"threshold_uncertainty_score":0.5500954},"labels":[],"label_agreement":null},{"id":"W2483716866","doi":"10.1016/j.dam.2016.06.030","title":"Well-covered triangulations: Part IV","year":2016,"lang":"en","type":"article","venue":"Discrete Applied 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":"Dalhousie University; Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Plane (geometry); Triangulation; Graph; Simple (philosophy); Pitteway triangulation; Geometry; Delaunay triangulation","score_opus":0.02604900886195653,"score_gpt":0.2851178197495272,"score_spread":0.25906881088757067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483716866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030423957,0.000030156627,0.94913214,0.00064642366,0.0000923686,0.00045439892,0.000010433368,0.00026726854,0.04632439],"genre_scores_gemma":[0.4746641,0.00007312631,0.5187254,0.00026335433,0.00018957657,0.0003513274,0.000008785002,0.000075535485,0.005648837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831337,0.000028825047,0.00037631174,0.00038878218,0.00046313822,0.0004295491],"domain_scores_gemma":[0.99790454,0.0005433693,0.00015040563,0.0012085645,0.000057158893,0.00013594],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047805344,0.00018792556,0.00024150302,0.00012303598,0.00014132907,0.00010290653,0.0010099087,0.000068863745,0.00017228546],"category_scores_gemma":[0.00012785869,0.000121179815,0.00009005832,0.00042317255,0.00012375148,0.00034173598,0.0003256963,0.000091929905,0.0010580905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009173422,0.000043502947,0.0000057179154,0.000023528097,0.000019517618,0.0000029962866,0.00027279626,0.000012559336,0.006615264,0.9828424,0.00079848943,0.009354054],"study_design_scores_gemma":[0.0008676313,0.00002992137,0.000033936278,0.00005622957,0.000008417117,0.000006673276,0.00009191265,0.0031801146,0.009749697,0.97422475,0.011466079,0.0002846232],"about_ca_topic_score_codex":3.845145e-7,"about_ca_topic_score_gemma":8.396884e-7,"teacher_disagreement_score":0.4716217,"about_ca_system_score_codex":0.00004547493,"about_ca_system_score_gemma":0.000042241147,"threshold_uncertainty_score":0.9997197},"labels":[],"label_agreement":null},{"id":"W2490114670","doi":"10.1016/j.dam.2017.04.027","title":"The complexity of tropical graph homomorphisms","year":2017,"lang":"en","type":"article","venue":"Discrete Applied 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":"Simon Fraser University","funders":"","keywords":"Homomorphism; Mathematics; Combinatorics; Graph homomorphism; Conjecture; Discrete mathematics; Constraint satisfaction problem; Vertex (graph theory); Graph; Decision problem; Line graph; Graph power; Algorithm","score_opus":0.06269867441457949,"score_gpt":0.31791921410978163,"score_spread":0.25522053969520214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490114670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013282317,0.000045438,0.956657,0.00092523964,0.0000960001,0.00039845752,0.000008243276,0.0000793472,0.028507985],"genre_scores_gemma":[0.8273069,0.000025548981,0.17247929,0.000019103347,0.000021460395,0.000039859962,9.175402e-7,0.000013054111,0.00009385504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985731,0.000024443738,0.00032597524,0.00024402441,0.0004814214,0.00035098926],"domain_scores_gemma":[0.9967044,0.00028571236,0.00033837397,0.0025032572,0.00007421875,0.00009404831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000400352,0.00014588852,0.00025631176,0.00004403205,0.00096035487,0.00027905413,0.0033779743,0.00004775319,0.000006828826],"category_scores_gemma":[0.00014531355,0.00009322778,0.00010811496,0.00011738169,0.0020986628,0.00017160889,0.000884106,0.00019355152,0.00003300547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008272797,0.000038211936,0.000027467315,0.000030455514,0.000019446854,0.0000020539553,0.00023179645,0.000003656033,0.001338993,0.99535155,0.000053534433,0.0028945378],"study_design_scores_gemma":[0.00025036064,0.00002871584,0.0014433796,0.000013576817,0.00000561781,0.000004449627,0.00010173688,0.0038976846,0.0065990402,0.98729414,0.00024559288,0.00011570001],"about_ca_topic_score_codex":0.000002273095,"about_ca_topic_score_gemma":0.00000553124,"teacher_disagreement_score":0.8140246,"about_ca_system_score_codex":0.000012618868,"about_ca_system_score_gemma":0.000028025786,"threshold_uncertainty_score":0.773261},"labels":[],"label_agreement":null},{"id":"W2492614083","doi":"10.1016/j.dam.2017.11.012","title":"Infection in hypergraphs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Regina","keywords":"Hypergraph; Combinatorics; Bipartite graph; Mathematics; Discrete mathematics; Interval (graph theory); Graph","score_opus":0.02514417235462804,"score_gpt":0.26820127831009205,"score_spread":0.243057105955464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492614083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27058274,0.00059174607,0.58256656,0.0009856622,0.0025011806,0.0021274558,0.000019990195,0.001384481,0.1392402],"genre_scores_gemma":[0.786214,0.00026068452,0.21300101,0.000095214345,0.000019236228,0.00021714062,0.000024089068,0.000039047234,0.00012957248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981484,0.000017165772,0.0005019712,0.00063403184,0.0003608217,0.00033765114],"domain_scores_gemma":[0.99717045,0.000059042344,0.00047100603,0.0021527843,0.000055250977,0.00009143933],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054465275,0.00033749256,0.00048544732,0.0003205342,0.00015416116,0.00045069272,0.0012342116,0.00032922064,0.000004999509],"category_scores_gemma":[0.000051400497,0.00030582864,0.00014917323,0.00016270738,0.000084718995,0.000113763024,0.0015999329,0.00062195223,0.0000842948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018779699,0.00012943792,0.00018448915,0.0004818385,0.000031769858,0.000008973939,0.0011983361,0.0011128893,0.0005661869,0.9928899,0.00038394527,0.0030103768],"study_design_scores_gemma":[0.00026607735,0.000011205458,0.00035015636,0.00030042083,0.00001809876,0.0000044696435,0.000011990256,0.03167182,0.0006889812,0.9661063,0.00017871357,0.0003917859],"about_ca_topic_score_codex":0.00011129505,"about_ca_topic_score_gemma":0.0000392386,"teacher_disagreement_score":0.51563126,"about_ca_system_score_codex":0.00003581397,"about_ca_system_score_gemma":0.00008667411,"threshold_uncertainty_score":0.9999394},"labels":[],"label_agreement":null},{"id":"W2503340257","doi":"10.1016/j.dam.2016.12.012","title":"Dominating and irredundant broadcasts in graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bounded function; Graph; Function (biology); Discrete mathematics","score_opus":0.023517136945559337,"score_gpt":0.310361409231844,"score_spread":0.2868442722862847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503340257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44361895,0.00013749364,0.5092815,0.0004580157,0.00010331643,0.000768094,0.0000045804695,0.00014681266,0.04548124],"genre_scores_gemma":[0.791067,0.00002638787,0.20875634,0.000020450772,0.000009056362,0.00004212616,5.5865723e-7,0.000013872769,0.00006421102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987301,0.0000150005635,0.00025857214,0.0003498271,0.00027823617,0.0003682242],"domain_scores_gemma":[0.99835783,0.00018420344,0.00018835996,0.0011457454,0.000025516667,0.00009835419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061067584,0.00015761337,0.00023705988,0.00014248784,0.00035140268,0.00043873704,0.0012043418,0.000050217637,0.0000037405428],"category_scores_gemma":[0.00014767428,0.00013707917,0.00003490787,0.00013365364,0.00024405489,0.00039250858,0.0008544439,0.00019530304,0.0000179023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042656216,0.000030904834,0.00015196133,0.000071371076,0.0000061385085,0.000015506295,0.002095043,0.000006239021,0.0046669515,0.9628189,0.000008020093,0.03012467],"study_design_scores_gemma":[0.0005796033,0.000020414038,0.0019304282,0.00008833549,0.0000031179682,0.0000167658,0.00043687498,0.01916036,0.0030901409,0.97439593,0.000048602444,0.00022939811],"about_ca_topic_score_codex":0.0000054704815,"about_ca_topic_score_gemma":0.000010302127,"teacher_disagreement_score":0.34744805,"about_ca_system_score_codex":0.00001828798,"about_ca_system_score_gemma":0.000019536563,"threshold_uncertainty_score":0.5589926},"labels":[],"label_agreement":null},{"id":"W2504721752","doi":"10.1016/j.dam.2016.07.006","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si5.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>V</mml:mi></mml:math>-Order: New combinatorial properties &amp; a simple comparison algorithm","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scroll; Order (exchange); Simple (philosophy); Combinatorics; Discrete mathematics; Algorithm; Archaeology; Geography","score_opus":0.022767750903617785,"score_gpt":0.2517314755832914,"score_spread":0.2289637246796736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504721752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.447674,0.00017297566,0.5489865,0.00028158643,0.00088211766,0.00019874607,0.00010660525,0.0003097202,0.0013877547],"genre_scores_gemma":[0.6225443,0.00015108108,0.37481606,0.0003444695,0.0011049028,0.0003256388,0.00027200815,0.00020153413,0.00024000191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621964,0.00004379183,0.0009312519,0.00084582914,0.0011255569,0.0008339453],"domain_scores_gemma":[0.9967373,0.00035873533,0.0006788579,0.0017634658,0.00009273112,0.0003688914],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005243531,0.0005179705,0.0004665526,0.00010219448,0.00056324975,0.0006141387,0.0015720017,0.00039682488,0.000045349156],"category_scores_gemma":[0.00017560704,0.0004296851,0.00027649105,0.00035249602,0.00025654328,0.00073973654,0.0016209546,0.000394847,0.0012345202],"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.000065825465,0.00024670982,0.0000016829755,0.00019110223,0.000114127826,0.000020039837,0.0018282161,0.00009457956,0.0022450618,0.977667,0.0032320241,0.014293638],"study_design_scores_gemma":[0.0014001589,0.00021254347,0.000005732711,0.0003633979,0.00010910954,0.0000547773,0.0003578391,0.95681405,0.009321575,0.014918702,0.015829176,0.0006129484],"about_ca_topic_score_codex":0.00014460174,"about_ca_topic_score_gemma":0.000033242803,"teacher_disagreement_score":0.9627483,"about_ca_system_score_codex":0.000029109244,"about_ca_system_score_gemma":0.0003423627,"threshold_uncertainty_score":0.9998155},"labels":[],"label_agreement":null},{"id":"W2507911378","doi":"10.1016/j.dam.2016.10.008","title":"Graph connectivity and universal rigidity of bar frameworks","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Constructive; Rigidity (electromagnetism); Vertex (graph theory); Graph; Connectivity; Discrete mathematics; Constructive proof; Computer science","score_opus":0.005330721372478191,"score_gpt":0.188715591078188,"score_spread":0.1833848697057098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507911378","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5686014,0.000023500856,0.42785987,0.000023610068,0.000024578649,0.000071806826,0.000012935429,0.00006225588,0.0033200271],"genre_scores_gemma":[0.98084664,0.000079935824,0.019026864,0.000004284318,0.0000141855135,0.000002677753,0.0000025330996,0.000011403845,0.000011485528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960995,0.000003056251,0.00013351688,0.00008265573,0.00008128171,0.000089529596],"domain_scores_gemma":[0.99967664,0.00009171214,0.00004184157,0.00013699131,0.00001782611,0.000034975597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000049273294,0.00009048225,0.00017536244,0.000036542984,0.000023721133,0.0000081872,0.000054541826,0.00009194241,0.00006963958],"category_scores_gemma":[0.0000141453065,0.000057762976,0.000035484692,0.00008586806,0.000055523047,0.00005145449,0.00002073701,0.00006181289,0.0000032057671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022512528,0.000039906765,0.0007574754,0.00060510176,0.00039684694,0.000001781012,0.001664711,0.0131760845,0.12248511,0.84139633,0.00044031598,0.019013798],"study_design_scores_gemma":[0.0022325444,0.00007290728,0.0097849555,0.00035068995,0.00053370214,0.000009247821,0.0015960961,0.26655707,0.13015965,0.5871142,0.00030841053,0.0012805006],"about_ca_topic_score_codex":0.0000017254406,"about_ca_topic_score_gemma":0.0000017539121,"teacher_disagreement_score":0.4122452,"about_ca_system_score_codex":0.000011520293,"about_ca_system_score_gemma":0.0000022304523,"threshold_uncertainty_score":0.23555058},"labels":[],"label_agreement":null},{"id":"W2521729967","doi":"10.1016/j.dam.2016.09.008","title":"On semidefinite least squares and minimal unsatisfiability","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Conjunctive normal form; Satisfiability; Semidefinite programming; Semidefinite embedding; Positive-definite matrix; Quadratically constrained quadratic program; Combinatorics; Connection (principal bundle); Explained sum of squares; Discrete mathematics; Mathematical optimization; Quadratic programming","score_opus":0.03465292663337363,"score_gpt":0.3217420098769667,"score_spread":0.28708908324359306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521729967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16644917,0.00003290306,0.7914923,0.0009255947,0.00006857916,0.0014598699,0.00019645455,0.0004589757,0.038916156],"genre_scores_gemma":[0.42285362,0.00006113527,0.5749473,0.000103499966,0.000068132846,0.00020524791,0.000009105074,0.00012786989,0.0016240797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99790823,0.000038541326,0.0005344847,0.0004736475,0.00058808544,0.00045699682],"domain_scores_gemma":[0.99600536,0.002768749,0.00020316895,0.0007259503,0.00009847377,0.00019829985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004913098,0.00031710963,0.0004282265,0.00012853503,0.00015214103,0.000058702793,0.00024491697,0.00012968018,0.0005390171],"category_scores_gemma":[0.0013197146,0.00020686178,0.00006771484,0.00020721057,0.0003143426,0.00012292633,0.00018318217,0.00017433622,0.00016021737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006630986,0.00018969733,0.00004769754,0.00033667742,0.000042523152,0.000004243373,0.0007404341,0.000027807151,0.003666181,0.9826235,0.00090696703,0.011347916],"study_design_scores_gemma":[0.0012804787,0.00011460238,0.00012957201,0.0001822424,0.000033281034,0.0000108082795,0.00055697496,0.002485753,0.0037996522,0.99062806,0.000338218,0.0004403328],"about_ca_topic_score_codex":9.285572e-7,"about_ca_topic_score_gemma":0.0000025893498,"teacher_disagreement_score":0.25640443,"about_ca_system_score_codex":0.000081110695,"about_ca_system_score_gemma":0.000036550737,"threshold_uncertainty_score":0.84355783},"labels":[],"label_agreement":null},{"id":"W2521901064","doi":"10.1016/j.dam.2017.05.018","title":"Addressing graph products and distance-regular graphs","year":2017,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Redeemer University; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Combinatorics; Hamming graph; Tuple; Mathematics; Graph; Discrete mathematics; Hamming distance; Hamming code; Algorithm","score_opus":0.09198053675506222,"score_gpt":0.3373618848032605,"score_spread":0.24538134804819828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2521901064","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6112973,0.0039824583,0.19995366,0.002823671,0.0013336675,0.014886084,0.0016280812,0.0026850915,0.16140994],"genre_scores_gemma":[0.7718594,0.00033280172,0.22495408,0.00005154464,0.00023506337,0.001353466,0.00022039945,0.0002658797,0.00072735443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968668,0.000043402622,0.00086735754,0.0010885323,0.00054423657,0.00058965833],"domain_scores_gemma":[0.99466014,0.0003484149,0.0013093675,0.0033171342,0.00015289876,0.00021204342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008870071,0.00082226796,0.0011483396,0.00022009312,0.0008549818,0.0005306139,0.0011159793,0.0005077894,0.000024862917],"category_scores_gemma":[0.00031728603,0.0007353064,0.00026095027,0.00017707655,0.00080184627,0.00010868626,0.0011222726,0.00092695776,0.000019682402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015037772,0.00018315094,0.000009771077,0.0043102126,0.0001949932,0.0000050415188,0.0017751916,0.0000047838157,0.0017253831,0.9893027,0.0014959468,0.0009778109],"study_design_scores_gemma":[0.00035655574,0.000010995178,0.0000329256,0.0008897156,0.00048888306,0.00001216227,0.00052162685,0.00016266566,0.0034355565,0.99220693,0.0010637677,0.0008182147],"about_ca_topic_score_codex":0.0000039508504,"about_ca_topic_score_gemma":0.000007814204,"teacher_disagreement_score":0.16068259,"about_ca_system_score_codex":0.00003374072,"about_ca_system_score_gemma":0.00008813252,"threshold_uncertainty_score":0.9995098},"labels":[],"label_agreement":null},{"id":"W2527744876","doi":"10.1016/j.dam.2016.09.009","title":"Compositional inverses and complete mappings over finite fields","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bijection, injection and surjection; Mathematics; Permutation (music); TRACE (psycholinguistics); Class (philosophy); Linear subspace; Combinatorics; Discrete mathematics; Inverse; Kernel (algebra); Trace class; Bijection; Algebra over a field; Pure mathematics; Hilbert space; Computer science","score_opus":0.01648350929686105,"score_gpt":0.21993622258225462,"score_spread":0.20345271328539358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527744876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0404136,0.000015249136,0.9461066,0.00085090793,0.000059199967,0.00012844743,0.000016394473,0.0001457477,0.012263864],"genre_scores_gemma":[0.9018766,0.0000210592,0.09717045,0.0007899705,0.000037668244,0.000022390128,0.0000029142336,0.00000982233,0.00006912569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919116,0.000011931629,0.00018361314,0.0002371243,0.0001841873,0.00019199318],"domain_scores_gemma":[0.9990288,0.00043740176,0.00008173409,0.00035404167,0.000020076035,0.00007791549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001540433,0.00013820309,0.00016063696,0.00007540205,0.00012722607,0.000091851536,0.00036044003,0.000051565778,0.00006727171],"category_scores_gemma":[0.00001404258,0.00009569667,0.000055173976,0.00013825207,0.00012964674,0.00015723956,0.00025792734,0.00006350755,0.00004936941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005213785,0.000022489507,0.000030104242,0.00003532384,0.00002017787,0.000001941545,0.0006328585,0.0000014625153,0.011004044,0.9852607,0.00039925933,0.0025863713],"study_design_scores_gemma":[0.0006335001,0.000049386384,0.0005008788,0.00010285768,0.000016378672,0.000013319184,0.00007881921,0.0034488726,0.0021378587,0.9868592,0.005834106,0.0003248191],"about_ca_topic_score_codex":0.0000010302011,"about_ca_topic_score_gemma":0.0000010006324,"teacher_disagreement_score":0.861463,"about_ca_system_score_codex":0.000008109467,"about_ca_system_score_gemma":0.00000975028,"threshold_uncertainty_score":0.3902397},"labels":[],"label_agreement":null},{"id":"W2532807735","doi":"10.1016/j.dam.2016.09.029","title":"Efficient broadcast trees for weighted vertices","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Vertex (graph theory); Broadcasting (networking); Dissemination; Mathematics; Node (physics); Binary logarithm; Computer science; Set (abstract data type); Time complexity; Combinatorics; Theoretical computer science; Computer network; Graph","score_opus":0.015630578426276638,"score_gpt":0.2396631979087195,"score_spread":0.22403261948244288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532807735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013763213,0.00003308187,0.97638994,0.00045150414,0.00034547885,0.000436633,0.0000072039684,0.00018041233,0.008392542],"genre_scores_gemma":[0.911438,0.000004058163,0.08743119,0.00010712639,0.00015641548,0.00018347573,0.0000014233551,0.00002016284,0.0006581424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988449,0.000010345739,0.00034151293,0.00029402343,0.00020975227,0.00029944172],"domain_scores_gemma":[0.9988914,0.00031462454,0.00014577116,0.00050959445,0.00006262857,0.00007599034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026819462,0.00015687266,0.00022480467,0.00005983035,0.00012620326,0.00011685238,0.00051443477,0.00006237877,0.000020378122],"category_scores_gemma":[0.000020558693,0.00009074739,0.00009838128,0.00013942733,0.000036886828,0.000061613806,0.00010250038,0.000035344216,0.00010938698],"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.000009863758,0.000065109714,0.0000024941335,0.00006131113,0.000032714033,8.091232e-7,0.0011791607,0.000117028634,0.008522505,0.97026235,0.0018746001,0.01787207],"study_design_scores_gemma":[0.0015919451,0.00014200235,0.000023887196,0.0002569694,0.0000341568,0.000012768599,0.00045101694,0.88316464,0.013984837,0.08218071,0.01757122,0.0005858602],"about_ca_topic_score_codex":0.0000013429952,"about_ca_topic_score_gemma":0.0000029434511,"teacher_disagreement_score":0.8976748,"about_ca_system_score_codex":0.000034065895,"about_ca_system_score_gemma":0.000016892358,"threshold_uncertainty_score":0.3700571},"labels":[],"label_agreement":null},{"id":"W2532956696","doi":"10.1016/j.dam.2016.09.036","title":"Bannai et al. method proves the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>d</mml:mi></mml:math>-step conjecture for strings","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Combinatorial Mathematics","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Conjecture; String (physics); Combinatorics; Mathematics; Set (abstract data type); Algorithm; Discrete mathematics; Computer science; Mathematical physics","score_opus":0.022937252906778414,"score_gpt":0.2922605338167914,"score_spread":0.269323280910013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532956696","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5244422,0.00013405764,0.4643327,0.0023588848,0.0009146816,0.0012284069,0.00038427347,0.00062856585,0.005576261],"genre_scores_gemma":[0.4259436,0.00017766842,0.5663554,0.0020467266,0.00073664234,0.0030751128,0.0001306134,0.0008569694,0.00067727204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950204,0.000099763456,0.0014997195,0.000949815,0.0012589757,0.0011713419],"domain_scores_gemma":[0.9905358,0.0052349702,0.0015984832,0.0021605913,0.00016527534,0.00030486405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002004256,0.00088215905,0.0008004693,0.0001256061,0.00063313456,0.00036023586,0.0013501074,0.00064328127,0.00005081224],"category_scores_gemma":[0.0021451402,0.0006746238,0.0007151246,0.00033049798,0.00042868056,0.00043501062,0.00082019763,0.0007087041,0.00036077833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018774215,0.00030398613,4.6004251e-7,0.0015522843,0.00045700202,0.00001983061,0.0024675166,0.000065449196,0.0053485343,0.98418605,0.0042815153,0.0011296369],"study_design_scores_gemma":[0.0026074422,0.00044774348,0.0000015882038,0.0009994699,0.0008234075,0.00014884208,0.0020199132,0.29592192,0.0336096,0.6480073,0.014312169,0.0011006634],"about_ca_topic_score_codex":0.000011423066,"about_ca_topic_score_gemma":0.000023233466,"teacher_disagreement_score":0.33617878,"about_ca_system_score_codex":0.00005852001,"about_ca_system_score_gemma":0.0003005835,"threshold_uncertainty_score":0.9995705},"labels":[],"label_agreement":null},{"id":"W2557089399","doi":"10.1016/j.dam.2016.10.019","title":"Colorful edge decomposition of graphs: Some polynomial cases","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Neighbourhood (mathematics); Graph; Degree (music); Bound graph; Discrete mathematics; Graph power; Line graph","score_opus":0.014900855999108661,"score_gpt":0.25000016638817546,"score_spread":0.23509931038906678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2557089399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.737573,0.00017433136,0.25528985,0.0007572913,0.0003665465,0.0005317153,0.000032406988,0.0003848233,0.0048899828],"genre_scores_gemma":[0.9042463,0.000021464166,0.09552723,0.00010144317,0.00000979409,0.000027348819,0.0000028147288,0.000013798485,0.000049811042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987964,0.000014198107,0.00040999762,0.00027118094,0.00025879956,0.0002493954],"domain_scores_gemma":[0.9987773,0.00026378487,0.00022796326,0.000578199,0.000058522062,0.00009423352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022922507,0.00016144456,0.00026409488,0.00013746669,0.00008459991,0.000039381703,0.00046569153,0.00007238436,0.000013722288],"category_scores_gemma":[0.0000279506,0.00010584543,0.000095263975,0.00022025655,0.00012571408,0.0001984988,0.00017358141,0.000050699487,0.00007623122],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008355015,0.000090079375,0.000010714275,0.000052129526,0.000020185513,0.000003573349,0.00030183882,0.0000046243854,0.14862524,0.8477394,0.0010033865,0.0021404512],"study_design_scores_gemma":[0.0010600904,0.00015857536,0.000060895876,0.00017285222,0.000036863454,0.000037797927,0.000086347754,0.0014726594,0.20102425,0.7953102,0.00022453416,0.0003549325],"about_ca_topic_score_codex":0.000005280614,"about_ca_topic_score_gemma":0.000001256839,"teacher_disagreement_score":0.16667324,"about_ca_system_score_codex":0.000015821262,"about_ca_system_score_gemma":0.00003321296,"threshold_uncertainty_score":0.43162513},"labels":[],"label_agreement":null},{"id":"W2559029563","doi":"10.1016/j.dam.2017.01.022","title":"Restraints permitting the largest number of colourings","year":2017,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Bipartite graph; Mathematics; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.029000003550814873,"score_gpt":0.3319107348315454,"score_spread":0.3029107312807305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559029563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42523158,0.000016788335,0.34549627,0.001328494,0.00013537928,0.0008561473,0.000011896265,0.0001618793,0.22676158],"genre_scores_gemma":[0.8690699,0.0000065367226,0.1304899,0.000034221954,0.00002862044,0.000038835504,6.430011e-7,0.000016786005,0.00031460682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867266,0.00002049764,0.00029274978,0.0002488099,0.00042648893,0.00033876047],"domain_scores_gemma":[0.997194,0.00032800567,0.00039013676,0.0019493153,0.000070494745,0.00006804686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009033854,0.00013972954,0.00021707187,0.000029048319,0.0006044641,0.00023323277,0.0027695464,0.0000519042,0.000023964603],"category_scores_gemma":[0.00029510248,0.000094230636,0.00007553487,0.00010226133,0.00041186015,0.00022425472,0.000940987,0.00021795482,0.00008426281],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034241132,0.00003287883,0.00028338522,0.00006533226,0.00001695824,0.000004316351,0.0013920704,0.0000057204848,0.002483009,0.9926791,0.00004977492,0.0029840001],"study_design_scores_gemma":[0.00045795,0.000020545194,0.002822079,0.000085322026,0.000014424425,0.00003101904,0.0007363034,0.008476504,0.017673194,0.96887505,0.00053653616,0.0002710656],"about_ca_topic_score_codex":0.0000048885854,"about_ca_topic_score_gemma":0.0000022928805,"teacher_disagreement_score":0.4438383,"about_ca_system_score_codex":0.000014019834,"about_ca_system_score_gemma":0.000029225312,"threshold_uncertainty_score":0.51465523},"labels":[],"label_agreement":null},{"id":"W2560135924","doi":"10.1016/j.dam.2016.11.021","title":"Using congruence relations to extract knowledge from concept lattices","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Rough Sets and Fuzzy Logic","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":"Université du Québec en Outaouais","funders":"","keywords":"Congruence (geometry); Mathematics; Lattice (music); Formal concept analysis; Congruence lattice problem; Computation; Lattice Miner; Exponential function; Algebra over a field; Theoretical computer science; Pure mathematics; Algorithm; Computer science; Distributive lattice; Geometry","score_opus":0.049119216225336604,"score_gpt":0.30244205029278964,"score_spread":0.25332283406745304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560135924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013138151,0.0000962046,0.9507264,0.00044732765,0.00016044661,0.0002918917,0.000029045725,0.00016575435,0.03494479],"genre_scores_gemma":[0.5155179,0.000003600305,0.48414296,0.00010167688,0.000060622388,0.000017716631,0.000002132701,0.000012689774,0.00014070021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875426,0.000016298402,0.00033184147,0.00038315047,0.00021301078,0.00030143347],"domain_scores_gemma":[0.9984519,0.00048101964,0.00014517475,0.0007163,0.000050897503,0.000154709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013755783,0.00018440929,0.00023665345,0.000059621718,0.00015732518,0.00015236434,0.00078710704,0.000076108445,0.000090721245],"category_scores_gemma":[0.00005929353,0.00011882838,0.000055074037,0.0002591355,0.000076327495,0.00030288973,0.00028575,0.00007555558,0.0006613278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003863961,0.000120194585,0.000054191212,0.000019481264,0.00004201888,0.000007081953,0.009637952,0.00019261487,0.023254009,0.9329754,0.0011151696,0.032577988],"study_design_scores_gemma":[0.001843845,0.00014475915,0.0011329012,0.0006585858,0.00014350773,0.000021113501,0.0016283843,0.16589546,0.017032988,0.7904108,0.01904117,0.0020464687],"about_ca_topic_score_codex":0.000013235641,"about_ca_topic_score_gemma":0.0000081744865,"teacher_disagreement_score":0.5023798,"about_ca_system_score_codex":0.000051788313,"about_ca_system_score_gemma":0.0000546527,"threshold_uncertainty_score":0.8500251},"labels":[],"label_agreement":null},{"id":"W2560469491","doi":"10.1016/j.dam.2016.10.028","title":"On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","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":"Western University; Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Bipartite graph; Graph; Neighbourhood (mathematics); Discrete mathematics; Bound graph; Natural number; Graph power; Line graph","score_opus":0.032713960018532925,"score_gpt":0.2527626002009583,"score_spread":0.22004864018242537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560469491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78842705,0.000023314358,0.18463281,0.0012182238,0.00023341518,0.00074929115,0.000035802157,0.00019693335,0.024483174],"genre_scores_gemma":[0.9276338,0.0000065980576,0.07221446,0.00007432953,0.0000026245657,0.000023614006,0.0000012490641,0.000013649311,0.000029634231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984996,0.000027132604,0.0004964408,0.00026408702,0.00046458573,0.00024819357],"domain_scores_gemma":[0.99791473,0.00070355216,0.00040705316,0.00080611394,0.00010465654,0.000063915606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005414267,0.00017512379,0.00032437834,0.000051680792,0.000103221966,0.00002982593,0.0007864214,0.000052664855,0.000027470898],"category_scores_gemma":[0.00015768659,0.00009260185,0.00011159147,0.00030352152,0.00033583876,0.000058299145,0.00024655907,0.0000977249,0.000031529922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006575251,0.000098109944,0.000030179082,0.00007256889,0.000027333008,5.8475126e-7,0.0007012995,0.000003942231,0.013236673,0.9845723,0.00023807025,0.0010123699],"study_design_scores_gemma":[0.0004342738,0.000039148043,0.00012437934,0.0002458635,0.00001615886,0.0000025457045,0.00010172586,0.0032818217,0.028715225,0.96686554,0.000030073346,0.00014325227],"about_ca_topic_score_codex":0.0000130349545,"about_ca_topic_score_gemma":0.0000012405211,"teacher_disagreement_score":0.1392068,"about_ca_system_score_codex":0.000016413449,"about_ca_system_score_gemma":0.000025451829,"threshold_uncertainty_score":0.37761936},"labels":[],"label_agreement":null},{"id":"W2578469740","doi":"10.1016/j.dam.2016.12.020","title":"Comparing the metric and strong dimensions of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Combinatorics; Metric dimension; Mathematics; Vertex (graph theory); Distance; Discrete mathematics; Graph; Shortest path problem; Pathwidth; Line graph","score_opus":0.03617348319051178,"score_gpt":0.26470515853816484,"score_spread":0.22853167534765306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2578469740","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71874493,0.0006014488,0.24545039,0.0008020976,0.0002533315,0.00067571516,0.0000046511773,0.00019403514,0.033273403],"genre_scores_gemma":[0.925342,0.000031036696,0.07455487,0.000025005154,0.0000019313254,0.0000105503,5.4246715e-7,0.0000072164057,0.000026838825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912816,0.00000930128,0.0002535776,0.0001963101,0.00023463268,0.00017799014],"domain_scores_gemma":[0.9982569,0.00015620026,0.00029900967,0.0011861091,0.000040749066,0.00006103151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040727964,0.00011681322,0.000226142,0.00008527402,0.00054149923,0.00019142726,0.0008396552,0.000033703123,0.000001225364],"category_scores_gemma":[0.000056934783,0.00006493889,0.00004892989,0.0001506723,0.00022048621,0.00011378739,0.00059312466,0.00010361473,0.0000054675174],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.809277e-7,0.000023756036,0.00035008971,0.000034338816,0.00002087552,4.3531543e-7,0.00057748886,0.000044630626,0.0016622973,0.99649894,0.000069280504,0.0007171119],"study_design_scores_gemma":[0.000566759,0.000033642817,0.0033625741,0.000084586085,0.00006379073,0.000009055709,0.0004165045,0.094146065,0.005491257,0.89547825,0.00010062966,0.00024691405],"about_ca_topic_score_codex":0.000017759043,"about_ca_topic_score_gemma":0.000003585312,"teacher_disagreement_score":0.20659707,"about_ca_system_score_codex":0.0000032527705,"about_ca_system_score_gemma":0.000011645732,"threshold_uncertainty_score":0.4164829},"labels":[],"label_agreement":null},{"id":"W2585451022","doi":"10.1016/j.dam.2016.08.016","title":"Characterizations of (<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" display=\"inline\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>5</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2016,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Graph; Induced subgraph; Algorithm; Discrete mathematics","score_opus":0.019238483340077613,"score_gpt":0.2523574263767693,"score_spread":0.23311894303669167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585451022","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44472525,0.0034762586,0.007671399,0.0020020227,0.00830768,0.00030462389,0.004280753,0.0014489769,0.52778304],"genre_scores_gemma":[0.93907034,0.007320685,0.015786948,0.004661042,0.00707408,0.0089998245,0.010082063,0.005477249,0.0015277485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9545386,0.0022834204,0.009774056,0.008854216,0.012652464,0.011897236],"domain_scores_gemma":[0.9583513,0.0089552915,0.011763962,0.0135365445,0.0011967296,0.006196177],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.009604784,0.0051839035,0.0020972276,0.0035273777,0.0075633256,0.0075277165,0.014389951,0.010694209,0.63472295],"category_scores_gemma":[0.008682413,0.00980366,0.00957345,0.007348282,0.010064878,0.008196932,0.013685564,0.008366873,0.010359456],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056710006,0.0017125801,0.000028106337,0.005207442,0.0063468837,0.00459818,0.0049007363,0.0035526431,0.011041787,0.60014683,0.35370788,0.0030859627],"study_design_scores_gemma":[0.008012619,0.0049968516,0.0001609187,0.0058920295,0.0063194106,0.005413761,0.0051003215,0.14240089,0.80239666,0.00090219703,0.010667611,0.0077367155],"about_ca_topic_score_codex":0.0035822017,"about_ca_topic_score_gemma":0.005484938,"teacher_disagreement_score":0.7913549,"about_ca_system_score_codex":0.00012767881,"about_ca_system_score_gemma":0.008348068,"threshold_uncertainty_score":0.9996679},"labels":[],"label_agreement":null},{"id":"W2588377248","doi":"10.1016/j.dam.2017.01.012","title":"Deterministic distributed construction of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml3\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>-dominating sets in time <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml4\" display=\"inline\" overflow=\"scroll\" altimg=\"si3.gif\"><mml:mi>T</mml:mi></mml:math>","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Mathematics; Dominating set; Combinatorics; Upper and lower bounds; Hypergraph; Disjoint sets; Graph; Discrete mathematics; Binary logarithm; Vertex (graph theory)","score_opus":0.018549315522038323,"score_gpt":0.25460526733583627,"score_spread":0.23605595181379796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588377248","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9640515,0.00023835427,0.028009929,0.00032875454,0.0016750536,0.0004152705,0.0013347571,0.0005719802,0.0033743938],"genre_scores_gemma":[0.93262976,0.00027981363,0.06312395,0.0004378524,0.0008356522,0.0008524445,0.0012873787,0.00046821253,0.00008493427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98872626,0.0002292698,0.0032273913,0.0024104558,0.002915464,0.0024911377],"domain_scores_gemma":[0.98834133,0.00196818,0.003993796,0.0045524356,0.00026906357,0.0008752209],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0025698864,0.0016577485,0.0013644375,0.0005413708,0.0024267535,0.0020918958,0.0044311048,0.0016419487,0.00009525734],"category_scores_gemma":[0.0014863195,0.002015822,0.0014307203,0.001090084,0.0021359173,0.0018603329,0.003860033,0.001961352,0.0013420595],"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.00045954162,0.00072097796,0.000022643799,0.0018564196,0.000657707,0.00060087733,0.0023985254,0.0011322107,0.0031589053,0.98491246,0.00042458964,0.003655142],"study_design_scores_gemma":[0.0027702209,0.00070026744,0.0001492334,0.0017532476,0.000746514,0.0009802862,0.0011868502,0.9667006,0.011347246,0.011066401,0.00088776596,0.001711353],"about_ca_topic_score_codex":0.00034475783,"about_ca_topic_score_gemma":0.00025308135,"teacher_disagreement_score":0.9738461,"about_ca_system_score_codex":0.000098532764,"about_ca_system_score_gemma":0.00093062595,"threshold_uncertainty_score":0.9996541},"labels":[],"label_agreement":null},{"id":"W2589794168","doi":"10.1016/j.dam.2017.01.025","title":"Proximity, remoteness and girth in graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics; Girth (graph theory); Vertex (graph theory); Upper and lower bounds; Graph; Discrete mathematics","score_opus":0.02733397661248872,"score_gpt":0.30344173437951144,"score_spread":0.27610775776702273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589794168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2476076,0.00007441408,0.7107049,0.0006178477,0.00007816522,0.000912865,0.0000040585674,0.00016128096,0.039838865],"genre_scores_gemma":[0.8419137,0.000037068858,0.15785716,0.000032803735,0.000009755605,0.000039931067,8.191703e-7,0.000016302894,0.00009242695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987274,0.000016193517,0.00023134353,0.0003735134,0.00029887125,0.00035269116],"domain_scores_gemma":[0.998109,0.00010793065,0.00015856986,0.0014928994,0.000030744668,0.00010085409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005779436,0.00015969921,0.00024353013,0.00013375169,0.00030264497,0.0003414848,0.001482877,0.00006235171,0.0000028705324],"category_scores_gemma":[0.00010482388,0.00013548379,0.00003368582,0.00015247778,0.00025880316,0.0004923914,0.0009878115,0.00019287186,0.000016369724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053816607,0.000035646804,0.00028781177,0.0000972232,0.000006032301,0.000012587572,0.00079377467,0.0000054036927,0.0015511971,0.9810502,0.0000061933843,0.016148534],"study_design_scores_gemma":[0.0004115589,0.000017034476,0.0026704266,0.000044000783,0.0000026572382,0.000010035132,0.000134025,0.011968017,0.0023867153,0.98210716,0.000055528635,0.0001928465],"about_ca_topic_score_codex":0.0000059473073,"about_ca_topic_score_gemma":0.000019042633,"teacher_disagreement_score":0.5943061,"about_ca_system_score_codex":0.0000150499945,"about_ca_system_score_gemma":0.000023475992,"threshold_uncertainty_score":0.55248684},"labels":[],"label_agreement":null},{"id":"W2591998382","doi":"10.1016/j.dam.2017.02.001","title":"Non-edge orientation and vertex ordering characterizations of some classes of bigraphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied 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":"University of Victoria","funders":"","keywords":"Combinatorics; Bipartite graph; Interval graph; Chordal graph; Mathematics; Permutation graph; Vertex (graph theory); Complete bipartite graph; Discrete mathematics; Indifference graph; Directed acyclic graph; Pathwidth; Graph; Line graph; 1-planar graph","score_opus":0.022062988815600343,"score_gpt":0.30128016225120774,"score_spread":0.27921717343560737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591998382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4463173,0.000017142454,0.5509936,0.000053299747,0.00005233332,0.00026950872,0.000010443128,0.000026905922,0.0022594605],"genre_scores_gemma":[0.92669433,0.00005196886,0.073159024,0.000006962684,0.000008378153,0.0000237645,0.000004436738,0.000011286981,0.00003984493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999135,0.000006116493,0.000278394,0.00019897868,0.0002233105,0.00015819634],"domain_scores_gemma":[0.9985763,0.00010274474,0.00035470998,0.00083589175,0.00007843814,0.00005193298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018838355,0.000104863175,0.00022586968,0.00012789833,0.00020599959,0.000080580015,0.0006497525,0.000038894304,0.0000030709734],"category_scores_gemma":[0.00007122513,0.00009459517,0.000035190227,0.0001514036,0.00023934711,0.0004783288,0.00034051033,0.0000671257,0.0000027494384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036675676,0.000042596024,0.00025506885,0.00025549482,0.000018978495,5.268668e-7,0.0015597655,0.000012098265,0.1412757,0.8539083,0.0000030538204,0.0026647663],"study_design_scores_gemma":[0.00080456695,0.000090226145,0.012619787,0.00017040099,0.00002773067,0.000003828723,0.00059966865,0.032286063,0.18881725,0.76423633,0.000043413987,0.0003007494],"about_ca_topic_score_codex":0.0000018152173,"about_ca_topic_score_gemma":9.945253e-7,"teacher_disagreement_score":0.48037705,"about_ca_system_score_codex":0.0000058067703,"about_ca_system_score_gemma":0.000025682868,"threshold_uncertainty_score":0.38574788},"labels":[],"label_agreement":null},{"id":"W2604377131","doi":"10.1016/j.dam.2017.03.003","title":"The fast search number of a Cartesian product of graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cartesian product; Mathematics; Product (mathematics); Combinatorics; Discrete mathematics; Geometry","score_opus":0.024039843949368953,"score_gpt":0.30076120095634834,"score_spread":0.27672135700697936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604377131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026846772,0.000046245426,0.7373934,0.001929124,0.00014761307,0.0013704179,0.00001469753,0.00009663146,0.23215511],"genre_scores_gemma":[0.8456891,0.00003523953,0.15385677,0.000010046134,0.000011103689,0.000026025433,0.0000013494382,0.000010856129,0.00035947183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887586,0.00001771003,0.000301252,0.00017659258,0.0004115159,0.00021706325],"domain_scores_gemma":[0.9979648,0.000095199925,0.00026002584,0.0014847008,0.00013837135,0.000056911605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917148,0.00009598327,0.00018869112,0.000030650182,0.00033662224,0.00016972396,0.0015049453,0.00002748495,0.000011131936],"category_scores_gemma":[0.000064575106,0.0000624426,0.00006136839,0.00012749515,0.00029584672,0.000133257,0.0003836667,0.000097243515,0.00001929037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026694004,0.000049337923,0.00013705298,0.00013431575,0.000022961354,4.1915285e-7,0.0026117892,0.00006677309,0.0017731172,0.98933655,0.00012714538,0.0057378956],"study_design_scores_gemma":[0.0018492738,0.00014207717,0.0027967058,0.00028685643,0.00005426872,0.000026982654,0.0029683714,0.26277164,0.11400181,0.6128572,0.0014181226,0.00082665344],"about_ca_topic_score_codex":0.000010161323,"about_ca_topic_score_gemma":0.0000045667907,"teacher_disagreement_score":0.81884235,"about_ca_system_score_codex":0.000005975503,"about_ca_system_score_gemma":0.000057065998,"threshold_uncertainty_score":0.2796588},"labels":[],"label_agreement":null},{"id":"W2604989626","doi":"10.1016/j.dam.2017.02.016","title":"On well-covered pentagonalizations of the plane","year":2017,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Planar graph; Mathematics; Pentagon; Combinatorics; Planar straight-line graph; Planar; Outerplanar graph; Bounded function; Cardinality (data modeling); Plane (geometry); Graph; Simple (philosophy); Polyhedral graph; Discrete mathematics; Graph power; 1-planar graph; Geometry; Line graph; Pathwidth; Computer science; Mathematical analysis","score_opus":0.009028486833592104,"score_gpt":0.21081293991815991,"score_spread":0.2017844530845678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604989626","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39542037,0.00002351875,0.008326211,0.000039398594,0.00041716426,0.0004977261,0.0000786196,0.00011356239,0.5950834],"genre_scores_gemma":[0.9993302,0.0000042202632,0.00028784215,0.000011372231,0.000022728795,0.000022281372,0.0000065010195,0.000022436197,0.00029236713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994825,0.0000047221793,0.00018801288,0.00006983481,0.00014739539,0.00010749793],"domain_scores_gemma":[0.9990747,0.00005548952,0.000107328044,0.00072898756,0.000008720604,0.000024759256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008920236,0.00010401631,0.00014857446,0.000019644407,0.0001757401,0.000036691952,0.0003980332,0.00004422581,0.00007745803],"category_scores_gemma":[0.000018482258,0.00007131663,0.000061625105,0.000033743534,0.00006847591,0.000028914947,0.00004066932,0.00007049575,0.000065742664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040551786,0.000022272738,0.00003325186,0.000222052,0.00004357924,3.205156e-7,0.0005483035,0.0019836675,0.0075107864,0.9884542,0.0011337551,0.000043739838],"study_design_scores_gemma":[0.00151044,0.000045197183,0.0026910873,0.00062297203,0.00019455052,0.0000142231265,0.0017784683,0.020718109,0.17616598,0.7895175,0.0059545846,0.00078683416],"about_ca_topic_score_codex":0.0000014549778,"about_ca_topic_score_gemma":0.0000029662729,"teacher_disagreement_score":0.60390985,"about_ca_system_score_codex":0.000008344041,"about_ca_system_score_gemma":0.00000431731,"threshold_uncertainty_score":0.29082078},"labels":[],"label_agreement":null},{"id":"W2606500388","doi":"10.1016/j.dam.2018.01.007","title":"Minimal obstructions to 2-polar cographs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Cograph; Combinatorics; Mathematics; Induced subgraph; Partition (number theory); Disjoint sets; Split graph; Multipartite; Induced path; Discrete mathematics; Graph; Polar; Chordal graph; 1-planar graph; Longest path problem","score_opus":0.020745311594055366,"score_gpt":0.2972813654376966,"score_spread":0.27653605384364127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606500388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02868704,0.000013204009,0.93553543,0.00027527977,0.00014814473,0.00045120736,0.000011782261,0.00029606334,0.034581825],"genre_scores_gemma":[0.3592488,0.0000023197374,0.64017236,0.00018027684,0.000092054135,0.000083583676,0.0000025085264,0.000024221523,0.00019388908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983171,0.000017101227,0.00029695348,0.00042766661,0.0004369903,0.00050416146],"domain_scores_gemma":[0.99829096,0.0001490952,0.00008082982,0.0011100078,0.000119978984,0.00024915233],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030268668,0.00019222626,0.00021541401,0.00025033526,0.0003010142,0.00015851653,0.001250939,0.00006180131,0.0000564339],"category_scores_gemma":[0.00007453508,0.00017196457,0.00007852257,0.0011514752,0.0002561034,0.00019792015,0.00051861856,0.00015630365,0.0008283085],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076686965,0.00004116081,0.000012315333,0.000021981466,0.000020321717,0.0000022759498,0.001985961,0.0000057529232,0.01319063,0.9799115,0.0005647304,0.0042357156],"study_design_scores_gemma":[0.00038519382,0.00022785044,0.00021781988,0.000033531862,0.000016340382,0.000031274576,0.0009839466,0.004873071,0.033611935,0.9490152,0.010060542,0.00054328877],"about_ca_topic_score_codex":0.0000016611162,"about_ca_topic_score_gemma":0.000005124196,"teacher_disagreement_score":0.33056173,"about_ca_system_score_codex":0.000025718966,"about_ca_system_score_gemma":0.000032502703,"threshold_uncertainty_score":0.99994963},"labels":[],"label_agreement":null},{"id":"W2607431919","doi":"10.1016/j.dam.2017.03.004","title":"The game of Cops and Robber on circulant graphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Mathematics; Circulant graph; Combinatorics; Wreath product; Discrete mathematics; Graph; Product (mathematics); Line graph; Voltage graph; Geometry","score_opus":0.02411534211884052,"score_gpt":0.29690292364961196,"score_spread":0.27278758153077143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607431919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2536088,0.0002813627,0.6327103,0.0015512881,0.00024056784,0.0016033521,0.000019929063,0.00017962603,0.10980479],"genre_scores_gemma":[0.9774568,0.000076757366,0.022260407,0.0000313955,0.000010121978,0.00003599166,5.8085254e-7,0.000013787811,0.0001141264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989269,0.000015749141,0.00021539001,0.00022932231,0.0003513561,0.0002613271],"domain_scores_gemma":[0.9976033,0.00038504173,0.00023653923,0.0016601281,0.0000418866,0.00007310509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051766104,0.00012767718,0.0001905402,0.000046300484,0.00044056727,0.00023729813,0.0013943169,0.000038460395,0.0000022725728],"category_scores_gemma":[0.00010981931,0.000079156365,0.000050194332,0.00007678616,0.00044848074,0.000112657646,0.00047400594,0.00014077894,0.00001647277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000721586,0.00002141642,0.000019656387,0.000039006358,0.000018108616,0.0000020215607,0.00052105676,0.000012223499,0.0020719157,0.9915822,0.00003512908,0.005670014],"study_design_scores_gemma":[0.00026657278,0.000040387276,0.00052842824,0.000036479123,0.000006113338,0.000006007222,0.00016060474,0.006039282,0.0056433794,0.9868481,0.0002998038,0.00012484839],"about_ca_topic_score_codex":0.0000015314191,"about_ca_topic_score_gemma":0.0000018279205,"teacher_disagreement_score":0.72384804,"about_ca_system_score_codex":0.000008109783,"about_ca_system_score_gemma":0.000016693692,"threshold_uncertainty_score":0.33885318},"labels":[],"label_agreement":null},{"id":"W2613720717","doi":"10.1016/j.dam.2018.09.037","title":"Solving the clique cover problem on (bull, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e19\" altimg=\"si5.gif\"><mml:msub><mml:mrow><mml:mi>C</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>)-free graphs","year":2018,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Cover (algebra); Mathematics; Graph; Clique; Discrete mathematics","score_opus":0.019581381596273616,"score_gpt":0.25814978523491006,"score_spread":0.23856840363863643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613720717","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2824058,0.0007591122,0.025748037,0.001133607,0.0019896247,0.00019007207,0.0005017297,0.00041867854,0.68685335],"genre_scores_gemma":[0.96590877,0.0008870228,0.025659943,0.0021085038,0.0016092669,0.0018682913,0.0006019443,0.0009089314,0.00044735346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.987937,0.00045075626,0.0022624792,0.0023299556,0.003737278,0.003282538],"domain_scores_gemma":[0.98785335,0.003108617,0.002425989,0.0051883752,0.00026816851,0.0011554748],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0036652966,0.0011999944,0.0005128109,0.0006163855,0.0024768023,0.00232477,0.0054983315,0.0019424452,0.1441864],"category_scores_gemma":[0.0016950202,0.0018464322,0.0016872276,0.0019147843,0.0032486382,0.0015854478,0.0047884746,0.0024066227,0.0035922593],"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.0009978634,0.00037856455,0.00000388859,0.0015497471,0.0010794887,0.0004797307,0.0048939744,0.0012002976,0.0030689882,0.8291553,0.15581916,0.0013729584],"study_design_scores_gemma":[0.002030916,0.0017819713,0.00002767612,0.0016381288,0.0008583856,0.0006674497,0.0024685417,0.18026134,0.7962552,0.008858795,0.0032500224,0.0019016152],"about_ca_topic_score_codex":0.00032791658,"about_ca_topic_score_gemma":0.00060046505,"teacher_disagreement_score":0.8202965,"about_ca_system_score_codex":0.000028116026,"about_ca_system_score_gemma":0.0014296544,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W2624967399","doi":"10.1016/j.dam.2017.05.010","title":"Preface: CALDAM 2015","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"National Identity and Symbolism","field":"Social Sciences","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.03651210176049618,"score_gpt":0.3672406795216968,"score_spread":0.3307285777612006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624967399","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04394085,0.00003817379,0.0025924174,0.003110886,0.00028805455,0.0003830829,0.000016356275,0.000100027944,0.9495301],"genre_scores_gemma":[0.9760651,0.00006381786,0.0103463745,0.00009931211,0.00036262764,0.00003642117,0.0000074352724,0.00001589767,0.013002988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897027,0.0000121968615,0.00016461365,0.00013752477,0.0004913839,0.00022401649],"domain_scores_gemma":[0.99917823,0.000071024995,0.00017004348,0.00041717108,0.000059845734,0.00010369046],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00057241105,0.00008451835,0.00014687372,0.000030724284,0.0015355555,0.00042403728,0.0005973675,0.00009250138,0.0002784596],"category_scores_gemma":[0.00030484135,0.00007958488,0.00005285362,0.000038553248,0.00030810633,0.0002215011,0.000104294064,0.00009731938,0.000511059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015085393,0.000032061496,0.000049344086,0.000020376483,0.000011409165,0.0000010904067,0.0060344953,0.0000015943415,0.00019814138,0.9882447,0.004880871,0.00052442274],"study_design_scores_gemma":[0.00043059717,0.0000075258326,0.0023745552,0.000036112306,0.00004702609,7.427298e-7,0.0069389082,0.00016476843,0.00057202665,0.8490952,0.1399796,0.00035289567],"about_ca_topic_score_codex":0.00031584615,"about_ca_topic_score_gemma":0.0006541797,"teacher_disagreement_score":0.9365272,"about_ca_system_score_codex":0.000039307248,"about_ca_system_score_gemma":0.00007915807,"threshold_uncertainty_score":0.9997643},"labels":[],"label_agreement":null},{"id":"W2744937545","doi":"10.1016/j.dam.2017.11.035","title":"The shape of node reliability","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Node (physics); Reliability (semiconductor); Combinatorics; Algorithm","score_opus":0.027183261341957456,"score_gpt":0.30308262914630385,"score_spread":0.2758993678043464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744937545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75935477,0.000032821383,0.03853162,0.00067384716,0.0001221839,0.0013162513,0.000047939775,0.0002622714,0.19965829],"genre_scores_gemma":[0.9136354,0.000010883684,0.0857674,0.000048370905,0.00008440534,0.00014217204,0.0000037328318,0.000036842204,0.00027081007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863285,0.000024294543,0.0005749855,0.00021836424,0.0002764092,0.00027310385],"domain_scores_gemma":[0.9970465,0.0012515881,0.00031733952,0.0011822706,0.00013774891,0.00006455911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009589143,0.00017830248,0.0002774127,0.000030871826,0.000382139,0.000030718697,0.0005341574,0.00008253119,0.00013328693],"category_scores_gemma":[0.00035134642,0.00011378622,0.00011925808,0.00027281194,0.00073491986,0.00003589102,0.00013014623,0.00013468678,0.000111354886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001561409,0.00011170126,0.000010690561,0.00011712681,0.000026535545,7.9845414e-8,0.0010488423,4.938396e-7,0.00446328,0.9921846,0.0012257909,0.000795285],"study_design_scores_gemma":[0.00016544422,0.00002513804,0.000046188157,0.00002499031,0.000057848287,0.0000018798135,0.00092598714,0.0008980876,0.017659891,0.977169,0.0028892977,0.00013629702],"about_ca_topic_score_codex":0.0000012400158,"about_ca_topic_score_gemma":0.0000045359093,"teacher_disagreement_score":0.19938748,"about_ca_system_score_codex":0.000014633051,"about_ca_system_score_gemma":0.000024783718,"threshold_uncertainty_score":0.46400675},"labels":[],"label_agreement":null},{"id":"W2766426016","doi":"10.1016/j.dam.2018.12.028","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e556\" altimg=\"si21.gif\"><mml:mi>k</mml:mi></mml:math>-foldability of words","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","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":"Queen's University","funders":"","keywords":"Bijection; Catalan number; Combinatorics; Mathematics; Word (group theory); Tree (set theory); Alphabet; Complement (music); Discrete mathematics; Geometry","score_opus":0.012423472672947664,"score_gpt":0.2340378134522046,"score_spread":0.22161434077925693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766426016","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95338553,0.00011567776,0.036295075,0.00013462959,0.00047283832,0.00019640104,0.00008346993,0.000301445,0.009014954],"genre_scores_gemma":[0.9548674,0.000048205027,0.044097107,0.00034934795,0.00018387717,0.00016139194,0.000078131045,0.00011185837,0.00010263095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963285,0.00005037498,0.0009991678,0.0008388265,0.0010115148,0.00077165617],"domain_scores_gemma":[0.9958637,0.0006674611,0.0008047648,0.0023607793,0.0000630604,0.0002402593],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011913177,0.0004798533,0.00049776444,0.0001159418,0.0002483558,0.00031206702,0.0017074696,0.000414679,0.000077164426],"category_scores_gemma":[0.00015786375,0.00048835005,0.0004406373,0.00045727252,0.00031747983,0.0005073951,0.001201069,0.00044616914,0.0012321679],"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.00005720351,0.00024072097,0.000011292133,0.000827904,0.0001405042,0.000020843157,0.0023900475,0.00024822462,0.0049556135,0.98946136,0.00021384044,0.0014324521],"study_design_scores_gemma":[0.000711935,0.0001979685,0.00007372657,0.00029868446,0.00012299663,0.00005624315,0.0009915951,0.9489603,0.014506568,0.03275109,0.0007810267,0.00054785487],"about_ca_topic_score_codex":0.000044519773,"about_ca_topic_score_gemma":0.000013486911,"teacher_disagreement_score":0.9567103,"about_ca_system_score_codex":0.00002495982,"about_ca_system_score_gemma":0.00020912403,"threshold_uncertainty_score":0.9997568},"labels":[],"label_agreement":null},{"id":"W2770344522","doi":"10.1016/j.dam.2017.10.027","title":"Perfect Roman domination in trees","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg; National Research Foundation","keywords":"Mathematics; Combinatorics; Domination analysis; Vertex (graph theory); Minimum weight; Graph; Upper and lower bounds; Dominating set; Function (biology)","score_opus":0.023091819163926455,"score_gpt":0.31078932494871553,"score_spread":0.2876975057847891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770344522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15351537,0.000026374404,0.7312426,0.00044646778,0.00008122484,0.00059571693,0.0000025945853,0.00014171553,0.113947965],"genre_scores_gemma":[0.88329047,0.000008167898,0.11636824,0.000017147002,0.00002037441,0.00007108615,0.000001709187,0.000014280833,0.00020854303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988264,0.000018385283,0.00022732372,0.00030006893,0.00032106639,0.0003067947],"domain_scores_gemma":[0.99816185,0.00015114671,0.00016881333,0.0014258344,0.000026821908,0.00006553726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059947494,0.000140356,0.00020534432,0.00013931066,0.00028302157,0.00033773575,0.0016922875,0.00005397837,0.000012370182],"category_scores_gemma":[0.00014330841,0.000121007135,0.000048941336,0.00012898259,0.00012746587,0.00044650142,0.00048378212,0.00015738913,0.00008809675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005172726,0.000049795042,0.000088045585,0.00003470149,0.000005472595,0.000008194838,0.0012363415,0.000031822037,0.005276302,0.9809622,0.000028112689,0.01227381],"study_design_scores_gemma":[0.00076768966,0.000039752787,0.005085276,0.00005198002,0.0000045797647,0.000006160631,0.00025511728,0.049957898,0.010067374,0.93325114,0.00022427367,0.00028877935],"about_ca_topic_score_codex":0.000004390759,"about_ca_topic_score_gemma":0.00003387964,"teacher_disagreement_score":0.7297751,"about_ca_system_score_codex":0.000039701343,"about_ca_system_score_gemma":0.000020915106,"threshold_uncertainty_score":0.4934528},"labels":[],"label_agreement":null},{"id":"W2770811529","doi":"10.1016/j.dam.2018.01.004","title":"On (distance) Laplacian energy and (distance) signless Laplacian energy of graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"National Research Foundation of Korea; Sungkyunkwan University","keywords":"Combinatorics; Mathematics; Laplacian matrix; Distance matrix; Laplace operator; Resistance distance; Adjacency matrix; Algebraic connectivity; Discrete mathematics; Simple graph; Graph energy; Graph; Line graph; Voltage graph; Graph power; Mathematical analysis","score_opus":0.016012359617211754,"score_gpt":0.26088804628445683,"score_spread":0.24487568666724507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2770811529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12721685,0.00016445968,0.6155179,0.00019034663,0.00015853153,0.00068837666,0.00029138432,0.00038402213,0.25538814],"genre_scores_gemma":[0.98055875,0.00005026516,0.018149896,0.0002060839,0.00007807809,0.00015205987,0.000034379722,0.00009010198,0.00068037654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99784195,0.000042000436,0.0007392626,0.0004994178,0.0004197853,0.00045757284],"domain_scores_gemma":[0.9975666,0.0006527377,0.00048822426,0.0009895721,0.00011650073,0.00018636939],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035554447,0.0004352214,0.00066373404,0.0001923779,0.0003057038,0.00005265412,0.00043384888,0.00019879054,0.00012674238],"category_scores_gemma":[0.00006642852,0.00038463264,0.00014959418,0.00049846485,0.000713517,0.00007519576,0.00010536085,0.0001310676,0.000014089117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008167547,0.00027514834,0.0000065129425,0.00024043092,0.0000845992,0.0000018381425,0.0012903347,0.0000011894579,0.0038780386,0.9912632,0.0015563065,0.0013207213],"study_design_scores_gemma":[0.000553327,0.00011596095,0.000007679342,0.0001449626,0.00010273231,0.000005570254,0.0010031199,0.0003569768,0.023454158,0.9683719,0.0054706736,0.0004129048],"about_ca_topic_score_codex":0.000008678711,"about_ca_topic_score_gemma":0.00015862002,"teacher_disagreement_score":0.85334194,"about_ca_system_score_codex":0.000029002995,"about_ca_system_score_gemma":0.0000311015,"threshold_uncertainty_score":0.9998606},"labels":[],"label_agreement":null},{"id":"W2773532448","doi":"10.1016/j.dam.2017.11.005","title":"Linear-time fitting of a <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml13\" display=\"inline\" overflow=\"scroll\" altimg=\"si13.gif\"><mml:mi>k</mml:mi></mml:math>-step function","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Constant (computer programming); Combinatorics; Function (biology); Center (category theory); Line (geometry); Histogram; Algorithm; Discrete mathematics; Image (mathematics); Computer science; Geometry; Artificial intelligence","score_opus":0.017573208455983765,"score_gpt":0.2479937533277372,"score_spread":0.23042054487175345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2773532448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70838135,0.000045266646,0.28517112,0.00017539377,0.00040752912,0.00010978429,0.000034631048,0.00012715168,0.005547757],"genre_scores_gemma":[0.8835984,0.000028618826,0.115174875,0.0002082382,0.00046801154,0.00011826196,0.00015011636,0.00006206234,0.00019142826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750453,0.000027570231,0.0007079857,0.00053964707,0.0007863342,0.0004339064],"domain_scores_gemma":[0.99717855,0.00033932942,0.0009779971,0.001247667,0.00010100694,0.000155472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076182134,0.00030246982,0.00027620426,0.000113881244,0.0006964401,0.0004440115,0.0009176075,0.0002636206,0.000026604539],"category_scores_gemma":[0.0002524262,0.00033426515,0.00025921967,0.0002170371,0.00015940145,0.00056467287,0.0007083222,0.00028055304,0.00066512136],"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.000056727957,0.0001273029,0.0000018588257,0.0003102765,0.00011606879,0.000013293688,0.0007009865,0.0031142621,0.005560912,0.98530257,0.00030383552,0.0043919166],"study_design_scores_gemma":[0.0005868429,0.00017421722,0.000053072163,0.00016085479,0.00011528572,0.0000403406,0.00014402404,0.9823748,0.009099202,0.005931821,0.0010181455,0.00030141385],"about_ca_topic_score_codex":0.000025856927,"about_ca_topic_score_gemma":0.000011361427,"teacher_disagreement_score":0.9793707,"about_ca_system_score_codex":0.0000142676745,"about_ca_system_score_gemma":0.000173995,"threshold_uncertainty_score":0.99991095},"labels":[],"label_agreement":null},{"id":"W2782559833","doi":"10.1016/j.dam.2017.12.025","title":"On the b-chromatic number of cartesian products","year":2018,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Cartesian product; Chromatic scale; Mathematics; Combinatorics; Cartesian coordinate system; Product (mathematics); Upper and lower bounds; Degree (music); Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.021711555029133123,"score_gpt":0.29433126071343874,"score_spread":0.2726197056843056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782559833","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18356602,0.000012134441,0.63813615,0.0014077817,0.00012849557,0.0012091807,0.000005975831,0.00020707984,0.1753272],"genre_scores_gemma":[0.8602204,0.0000013832537,0.13933599,0.00012181224,0.000046035682,0.00005862448,8.8354165e-7,0.00001995183,0.00019493255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998556,0.000035516157,0.0002974441,0.0002867936,0.00051046145,0.00031375972],"domain_scores_gemma":[0.9976494,0.00049869897,0.0001666484,0.0015075703,0.00012025152,0.000057476827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057601515,0.00016034415,0.00021738563,0.000054238622,0.00015355115,0.000058418915,0.0012519093,0.000039271374,0.000073437965],"category_scores_gemma":[0.00021246356,0.00009819052,0.000049049246,0.0006215053,0.00039169154,0.00009732889,0.000271313,0.00013987058,0.0005490964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043386995,0.000058407204,0.0000029487376,0.00008223393,0.00001749858,9.136132e-7,0.0021372053,0.000002542986,0.0056984914,0.99086064,0.00045579573,0.0006789829],"study_design_scores_gemma":[0.00013985844,0.00006268867,0.000025124555,0.00005257087,0.0000070878564,0.000008756366,0.00026169955,0.004597573,0.06947578,0.925082,0.00014562227,0.00014123226],"about_ca_topic_score_codex":8.4458236e-7,"about_ca_topic_score_gemma":7.1202913e-7,"teacher_disagreement_score":0.67665434,"about_ca_system_score_codex":0.000017977918,"about_ca_system_score_gemma":0.00004080419,"threshold_uncertainty_score":0.7057707},"labels":[],"label_agreement":null},{"id":"W2791683803","doi":"10.1016/j.dam.2017.12.036","title":"Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights","year":2018,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The Scarborough Hospital; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia y Tecnología","keywords":"Minimax; Mathematics; Least absolute deviations; Vertex (graph theory); Regret; Absolute deviation; Mathematical optimization; Node (physics); Standard deviation; Time complexity; Linear programming; Mean absolute percentage error; Algorithm; Combinatorics; Graph; Statistics; Mean squared error","score_opus":0.04704270467833662,"score_gpt":0.24371655133889816,"score_spread":0.19667384666056154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791683803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008771099,0.000014251389,0.9059093,0.0032353995,0.00043368523,0.0043275524,0.000025984955,0.0003780583,0.07690465],"genre_scores_gemma":[0.92696226,0.000014943256,0.06670516,0.0024377909,0.001601026,0.0006109204,0.00045919916,0.000090526184,0.0011182021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859786,0.0000040651385,0.0004475846,0.00034477684,0.0002766603,0.00032904357],"domain_scores_gemma":[0.9989075,0.0000786177,0.0002250946,0.0005591694,0.00021205007,0.000017576773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059171533,0.00024490565,0.00021417873,0.00007313569,0.00053719454,0.00017124032,0.0003410243,0.000059991686,0.000054401695],"category_scores_gemma":[0.0000385538,0.00015166479,0.000067082125,0.00031495644,0.00014325485,0.00018869963,0.00010682064,0.00010712044,0.00016612606],"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.00072036736,0.00026081063,0.000006254608,0.00072008517,0.00020556945,2.9141788e-7,0.0008003899,0.01404119,0.000069584356,0.96332145,0.015770111,0.0040838863],"study_design_scores_gemma":[0.001104451,0.00005105437,0.00024528216,0.000060131435,0.00013862237,1.4500411e-7,0.00050809135,0.96467066,0.000046160912,0.0115056215,0.021395678,0.0002740838],"about_ca_topic_score_codex":0.00010415311,"about_ca_topic_score_gemma":0.0010631208,"teacher_disagreement_score":0.95181584,"about_ca_system_score_codex":0.000032373675,"about_ca_system_score_gemma":0.00001088827,"threshold_uncertainty_score":0.6184711},"labels":[],"label_agreement":null},{"id":"W2792096534","doi":"10.1016/j.dam.2018.02.001","title":"Preface: Linear optimization","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.046832346095364685,"score_gpt":0.36373938567326275,"score_spread":0.31690703957789806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792096534","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010132514,0.000009522468,0.928781,0.00011434619,0.00008260155,0.0007827883,0.000015810558,0.00040257897,0.068798125],"genre_scores_gemma":[0.010258445,0.000024412151,0.9869781,0.00008565366,0.00030919397,0.00012130611,0.000035928846,0.0001277189,0.0020592334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978715,0.000023952363,0.0005680092,0.0003963606,0.00064864475,0.00049150316],"domain_scores_gemma":[0.998141,0.00031491346,0.0002517364,0.000798289,0.0003237585,0.00017033455],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041090068,0.0002927679,0.0003661168,0.00015297993,0.0002663353,0.00006823826,0.00041504332,0.00015666947,0.0011900928],"category_scores_gemma":[0.00053802325,0.00025973743,0.000075382275,0.00054440723,0.00027682507,0.00016941575,0.00020959665,0.0002237321,0.00043748788],"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.00009492024,0.0006729903,0.00000967933,0.000694736,0.00018857233,0.000007859842,0.0055312067,0.03769835,0.0025170788,0.9418918,0.006337228,0.0043556048],"study_design_scores_gemma":[0.0009458733,0.000102291226,0.0000023352752,0.000064470114,0.000058893824,0.000012337156,0.0008986226,0.7904082,0.010707992,0.19415791,0.0020929775,0.0005481099],"about_ca_topic_score_codex":7.609165e-7,"about_ca_topic_score_gemma":0.0000018235572,"teacher_disagreement_score":0.75270987,"about_ca_system_score_codex":0.00007865971,"about_ca_system_score_gemma":0.00005871398,"threshold_uncertainty_score":0.99998546},"labels":[],"label_agreement":null},{"id":"W2795589868","doi":"10.1016/j.dam.2018.03.033","title":"Optimal odd gossiping","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Nantes; Université Nice Sophia Antipolis","keywords":"Gossip; Computer science; Node (physics); Pairwise comparison; Conjecture; Computer network; Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Artificial intelligence; Psychology","score_opus":0.014437536862694585,"score_gpt":0.251516784337339,"score_spread":0.2370792474746444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795589868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009982435,0.000027378022,0.9069628,0.00012025408,0.00020062995,0.00019455758,0.0000074846193,0.000253353,0.08225112],"genre_scores_gemma":[0.6616728,0.0000021126584,0.33766824,0.00013774128,0.00019985376,0.000034866178,0.0000049413375,0.00001581384,0.00026367366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986697,0.000007499423,0.0003343759,0.00033179412,0.00029873656,0.0003579289],"domain_scores_gemma":[0.99885696,0.0000430138,0.00014544849,0.00078029884,0.00006931714,0.00010496828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002474968,0.00017710004,0.00024163506,0.000043363212,0.00018732165,0.00025382158,0.0008746537,0.00007003667,0.000027233089],"category_scores_gemma":[0.000016644603,0.00014930236,0.00006119508,0.00031227854,0.00009865155,0.00019176053,0.00024136066,0.00009804553,0.0006119172],"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.0000026205869,0.000052544245,0.0000054055754,0.0000725129,0.000023188399,0.0000049269615,0.0024885647,0.000044629076,0.0034246622,0.98598254,0.002817555,0.005080836],"study_design_scores_gemma":[0.0020447462,0.0002827395,0.00038600113,0.00044518,0.000055736713,0.00012289501,0.0020278017,0.7757985,0.035544906,0.078302726,0.102823466,0.00216532],"about_ca_topic_score_codex":0.0000025728768,"about_ca_topic_score_gemma":0.0000012515313,"teacher_disagreement_score":0.90767986,"about_ca_system_score_codex":0.000024907695,"about_ca_system_score_gemma":0.000031600903,"threshold_uncertainty_score":0.78651613},"labels":[],"label_agreement":null},{"id":"W2796591137","doi":"10.1016/j.dam.2018.03.046","title":"Homothetic polygons and beyond: Maximal cliques in intersection graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Homothetic transformation; Chordal graph; Discrete mathematics; Regular polygon; Intersection graph; Indifference graph; Intersection (aeronautics); Polytope; Convex hull; Graph; Line graph","score_opus":0.010098689884852805,"score_gpt":0.24614905667964182,"score_spread":0.23605036679478902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796591137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27246383,0.000028006629,0.7139434,0.00023444762,0.00011708473,0.00017304099,0.0000015998288,0.000084019055,0.012954526],"genre_scores_gemma":[0.85018456,0.000007896591,0.14955287,0.00014161503,0.000041620566,0.00002047098,0.0000041024846,0.000007028266,0.000039828945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992299,0.000013026074,0.00022355262,0.00023332899,0.00014358001,0.00015658539],"domain_scores_gemma":[0.9995759,0.000055487268,0.000071663344,0.00021451572,0.000033857465,0.00004855058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021457262,0.0001093645,0.00012883951,0.00020868608,0.00008508657,0.00010438354,0.00018483338,0.000045149558,0.0000098582095],"category_scores_gemma":[0.000014246504,0.00010159185,0.000026827687,0.00036261306,0.00007610042,0.00016730274,0.00012115834,0.00007522807,0.000024355482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058503188,0.000058054702,0.000023910554,0.000028230848,0.000007673242,0.0000013051732,0.0037103633,0.00002079651,0.0048438935,0.9751841,0.00010019836,0.016015647],"study_design_scores_gemma":[0.000474878,0.0001884189,0.0011538225,0.000035713314,0.0000117443315,0.00004314077,0.00056026265,0.12612787,0.013853258,0.85684973,0.00039360928,0.000307569],"about_ca_topic_score_codex":0.0000047028675,"about_ca_topic_score_gemma":0.000024316982,"teacher_disagreement_score":0.57772076,"about_ca_system_score_codex":0.000020283747,"about_ca_system_score_gemma":0.000019804922,"threshold_uncertainty_score":0.41427955},"labels":[],"label_agreement":null},{"id":"W2805891430","doi":"10.1016/j.dam.2018.04.022","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml16\" display=\"inline\" overflow=\"scroll\" altimg=\"si16.gif\"><mml:mi>k</mml:mi></mml:math>-broadcast domination and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml17\" display=\"inline\" overflow=\"scroll\" altimg=\"si16.gif\"><mml:mi>k</mml:mi></mml:math>-multipacking","year":2018,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg; National Research Foundation","keywords":"Mathematics; Vertex (graph theory); Graph; Algorithm; Discrete mathematics; Database; Combinatorics; Computer science","score_opus":0.01952157953672921,"score_gpt":0.2670571021251731,"score_spread":0.24753552258844388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805891430","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93494797,0.0006934279,0.05369272,0.0004772132,0.0015958551,0.0005838045,0.0006002668,0.00092676544,0.006481985],"genre_scores_gemma":[0.93150514,0.000832884,0.061347473,0.001014436,0.0017660323,0.0014953751,0.00087741995,0.0008802452,0.0002809664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9858026,0.00034054698,0.0030815084,0.0032806303,0.0039890874,0.0035056535],"domain_scores_gemma":[0.9879557,0.0024990004,0.002908169,0.0047930195,0.0004622311,0.0013818803],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0036962023,0.0020452575,0.0013249808,0.00081003946,0.0027946713,0.0024784328,0.004171164,0.0019672008,0.00013199565],"category_scores_gemma":[0.0015112562,0.0023937721,0.001394615,0.0018585307,0.0024927643,0.0029156876,0.0045247423,0.0024279638,0.003350054],"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.0009547799,0.0007216685,0.000009547642,0.0017591319,0.0008925638,0.0005305905,0.005978162,0.0014844129,0.010073037,0.9724701,0.0009317746,0.0041942233],"study_design_scores_gemma":[0.0031878592,0.0011001929,0.000043364398,0.0013183269,0.0006907051,0.0008415023,0.0024892394,0.9499254,0.021995964,0.012264389,0.0040545273,0.0020885095],"about_ca_topic_score_codex":0.00028938352,"about_ca_topic_score_gemma":0.00023386638,"teacher_disagreement_score":0.96020573,"about_ca_system_score_codex":0.0001298513,"about_ca_system_score_gemma":0.0009609576,"threshold_uncertainty_score":0.99987346},"labels":[],"label_agreement":null},{"id":"W2806001487","doi":"10.1016/j.dam.2019.07.023","title":"How long does it take for all users in a social network to choose their communities?","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"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":"Ministerul Cercetării şi Inovării; Ontario Ministry of Research, Innovation and Science; Université Côte d’Azur; Columbia University","keywords":"Combinatorics; Cardinality (data modeling); Partition (number theory); Mathematics; Upper and lower bounds; Omega; Discrete mathematics; Graph; Convergence (economics); Time complexity; Computer science; Physics","score_opus":0.09479917451953324,"score_gpt":0.359663279146061,"score_spread":0.26486410462652776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806001487","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.864311,0.000012749299,0.10005675,0.009235334,0.00016850635,0.003293421,0.0001687726,0.00009894079,0.02265454],"genre_scores_gemma":[0.98144805,0.0000028350703,0.012495353,0.0013668649,0.00014969206,0.00054189214,0.0000336154,0.000037337224,0.0039243405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998215,0.00005618303,0.0005320808,0.00029687563,0.0004489378,0.00045091173],"domain_scores_gemma":[0.9966505,0.0020104514,0.00026441348,0.00088900054,0.000084790816,0.00010085414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020556126,0.00022632786,0.0004820337,0.0001208081,0.00022776879,0.00040725796,0.0011706738,0.000108557375,0.00012491326],"category_scores_gemma":[0.00012595663,0.00014617329,0.00014132094,0.0005315677,0.00009125049,0.0001353293,0.00025060875,0.00018424289,0.00023905688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010004791,0.00015294095,0.0003299728,0.00008279357,0.00005075559,4.9355054e-7,0.044481363,0.0008274362,0.0011682741,0.93207854,0.015328411,0.0053989724],"study_design_scores_gemma":[0.0006030546,0.000029237961,0.00045535175,0.000042178694,0.000020140847,0.0000010017603,0.07622705,0.0021720836,0.00045222774,0.8700688,0.049591016,0.0003378594],"about_ca_topic_score_codex":0.0000036438473,"about_ca_topic_score_gemma":0.000204247,"teacher_disagreement_score":0.11713708,"about_ca_system_score_codex":0.000034136265,"about_ca_system_score_gemma":0.000026377304,"threshold_uncertainty_score":0.5960773},"labels":[],"label_agreement":null},{"id":"W2808957893","doi":"10.1016/j.dam.2018.05.041","title":"Chronological rectangle digraphs which are two-terminal series–parallel","year":2018,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rectangle; Generalization; Interval (graph theory); Mathematics; Class (philosophy); Combinatorics; Terminal (telecommunication); Series (stratigraphy); Characterization (materials science); Time complexity; Discrete mathematics; Polynomial; Computer science; Artificial intelligence","score_opus":0.02441270266182032,"score_gpt":0.2966772765144264,"score_spread":0.27226457385260605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808957893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040234238,0.000056260138,0.8903457,0.0005139722,0.00015861916,0.0006355986,0.0000106240195,0.0005809689,0.067464024],"genre_scores_gemma":[0.56883824,0.00001681217,0.43027437,0.00012510557,0.00015977898,0.00014140163,0.000006169301,0.000034015007,0.00040410587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975892,0.00004725685,0.00041668277,0.00065669167,0.0005480713,0.0007421333],"domain_scores_gemma":[0.99782383,0.00017610703,0.00022881721,0.0013755334,0.00018737037,0.00020832784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004762721,0.000322896,0.00040868166,0.00015945025,0.0003555194,0.00021954523,0.0017493061,0.00012586829,0.00009666409],"category_scores_gemma":[0.000114222865,0.00025990128,0.00009768658,0.0010146518,0.00049872877,0.00040250216,0.00077787746,0.0003351461,0.0006680343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004835563,0.00012606346,0.00004402304,0.00006897151,0.000033629756,0.000030335712,0.0012038192,0.000019854602,0.004241602,0.9909855,0.00045667737,0.0027411764],"study_design_scores_gemma":[0.0009226758,0.00039582796,0.00027830116,0.00007741067,0.000019346067,0.00017026541,0.00076479494,0.012434365,0.0096001355,0.9720245,0.00259763,0.0007147673],"about_ca_topic_score_codex":0.0000012742411,"about_ca_topic_score_gemma":0.000026905427,"teacher_disagreement_score":0.52860403,"about_ca_system_score_codex":0.000053124804,"about_ca_system_score_gemma":0.000058367365,"threshold_uncertainty_score":0.99998534},"labels":[],"label_agreement":null},{"id":"W2884749003","doi":"10.1016/j.dam.2018.06.018","title":"A polynomial recognition of unit forms using graph-based strategies","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algebraic structures and combinatorial models","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Instituto Federal Goiás; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Unit (ring theory); Combinatorics; Graph; Polynomial; Algebraic number; Representation (politics); Exponential function; Discrete mathematics","score_opus":0.06318427701457477,"score_gpt":0.31391956759203893,"score_spread":0.25073529057746413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884749003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8805577,0.000008504414,0.10499601,0.000012010257,0.00018059593,0.00047773446,0.000025001089,0.00010355689,0.01363886],"genre_scores_gemma":[0.90820587,0.000001287907,0.09149026,0.000026389818,0.00017339499,0.00002389564,0.000014918911,0.000053792137,0.000010185874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984797,0.000018848077,0.000588746,0.0002322801,0.00036297142,0.00031745434],"domain_scores_gemma":[0.9986131,0.00023630421,0.0004455212,0.00047405844,0.00015274281,0.00007823024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028127714,0.00027190204,0.00045528953,0.00013490523,0.00014447646,0.000059665184,0.00026409485,0.00016897613,0.00014445571],"category_scores_gemma":[0.0000709919,0.00022184012,0.0001439593,0.0002907397,0.0002696934,0.00012005175,0.00006660089,0.0001336814,0.000011137495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116516465,0.00015385123,0.000007439812,0.00059137313,0.000104217695,0.0000010697975,0.0018738069,0.00002775075,0.011507919,0.9846995,0.0001836441,0.00073291],"study_design_scores_gemma":[0.0007900931,0.000108361826,0.0000062944146,0.00011471581,0.00014034109,0.0000036583776,0.0023387503,0.003452685,0.033042107,0.95969373,0.000028990275,0.00028025173],"about_ca_topic_score_codex":0.000016756017,"about_ca_topic_score_gemma":0.000010881962,"teacher_disagreement_score":0.027648143,"about_ca_system_score_codex":0.000027888267,"about_ca_system_score_gemma":0.00012422526,"threshold_uncertainty_score":0.90463775},"labels":[],"label_agreement":null},{"id":"W2884836385","doi":"10.1016/j.dam.2018.01.018","title":"The robot crawler graph process","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Ryerson University","keywords":"Web crawler; Crawling; Robot; Graph; Mathematics; Random walk; Combinatorics; Theoretical computer science; Discrete mathematics; Computer science; Artificial intelligence; Statistics; World Wide Web","score_opus":0.017971986492906464,"score_gpt":0.2813735515502793,"score_spread":0.26340156505737283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884836385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035189884,0.00001620186,0.92158777,0.00085184904,0.00009382692,0.00032189657,7.3594083e-7,0.00018757946,0.07658823],"genre_scores_gemma":[0.48626566,0.000051520845,0.51089,0.0007346367,0.00017494756,0.00021718167,0.0000046457803,0.000041444582,0.0016199423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998838,0.000012614203,0.00023941991,0.00022769705,0.00036145933,0.00032079086],"domain_scores_gemma":[0.99890614,0.00010762641,0.00009958738,0.0006639849,0.00013380773,0.000088855966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037716283,0.00012655901,0.00011754174,0.00004308759,0.00047734525,0.00036401855,0.001074929,0.000043435248,0.000029035693],"category_scores_gemma":[0.000035730747,0.0000779185,0.000040510713,0.00042985313,0.00020022328,0.00015238865,0.00019530667,0.00010443366,0.00027927393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023717548,0.00003890136,0.0000034700352,0.000035879137,0.000016361477,5.397862e-7,0.0031917547,0.00018938362,0.00045241194,0.99074405,0.0013289038,0.003995944],"study_design_scores_gemma":[0.00044096148,0.00008446961,0.000043395765,0.00003428124,0.000011010673,0.000008486059,0.00078782823,0.28720504,0.006954497,0.6973007,0.006735259,0.00039412812],"about_ca_topic_score_codex":7.1019826e-7,"about_ca_topic_score_gemma":0.0000038185303,"teacher_disagreement_score":0.48591378,"about_ca_system_score_codex":0.000009949917,"about_ca_system_score_gemma":0.000043581367,"threshold_uncertainty_score":0.3671402},"labels":[],"label_agreement":null},{"id":"W2887504965","doi":"10.1016/j.dam.2019.05.003","title":"Sub-trees of a random tree","year":2019,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Tree (set theory); Random tree; Mathematics; Family tree; Random graph; Discrete mathematics; Computer science; Graph; Artificial intelligence","score_opus":0.03488773138987568,"score_gpt":0.30110365016078877,"score_spread":0.2662159187709131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887504965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0099300435,0.0001810048,0.9563835,0.000049596198,0.0003571326,0.0019087538,0.00043850523,0.00017840473,0.030573059],"genre_scores_gemma":[0.60116625,0.00010423588,0.39752957,0.000041729898,0.00015402166,0.00036493645,0.00011275095,0.00021638846,0.0003100955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99650013,0.000025114468,0.0014289768,0.00065201876,0.00087174744,0.000521983],"domain_scores_gemma":[0.9944799,0.0024532496,0.0011967598,0.0015043005,0.00020833267,0.00015746545],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005864222,0.00070288155,0.0019763943,0.00016384937,0.00005724236,0.00007123198,0.0008825797,0.0005726357,0.00011622287],"category_scores_gemma":[0.0012222962,0.0005836543,0.0003910137,0.00018155642,0.00013554358,0.00003025801,0.0009952564,0.0007189145,0.00009596453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012283874,0.00030183722,0.0000012862556,0.009491917,0.00030021195,0.000005353686,0.0013162063,0.00010290845,0.002012891,0.98340136,0.00129187,0.0016513264],"study_design_scores_gemma":[0.0014149845,0.000067414134,0.0000034401462,0.00087588176,0.00063988357,0.0000059000963,0.00059888035,0.022430316,0.005380912,0.9679183,0.000048935628,0.0006151833],"about_ca_topic_score_codex":0.000004291708,"about_ca_topic_score_gemma":0.000010592679,"teacher_disagreement_score":0.59123623,"about_ca_system_score_codex":0.000060242968,"about_ca_system_score_gemma":0.00020464498,"threshold_uncertainty_score":0.9996615},"labels":[],"label_agreement":null},{"id":"W2887687022","doi":"10.1016/j.dam.2018.07.003","title":"Revisiting Lagrangian relaxation for network design","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Lagrangian relaxation; Fixed charge; Network planning and design; Lagrangian; Mathematics; Mathematical optimization; Relaxation (psychology); Facility location problem; Applied mathematics; Computer science","score_opus":0.03915713170181672,"score_gpt":0.252625939597089,"score_spread":0.21346880789527228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887687022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019605225,0.000017858492,0.93067485,0.0007010264,0.0002617816,0.0010822262,0.0000016571668,0.00022566038,0.065074414],"genre_scores_gemma":[0.6261381,0.00001286006,0.3617135,0.0032738708,0.0067659453,0.00050460955,0.00019049339,0.00010301399,0.0012976379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888986,0.0000035045418,0.00037354967,0.00023775843,0.00019076517,0.00030454877],"domain_scores_gemma":[0.9993357,0.0000467144,0.00016069572,0.00030424556,0.00014031975,0.000012320177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00084240345,0.00016167929,0.00017780584,0.00007648022,0.00033361025,0.00016141344,0.0002004912,0.000052087038,0.00025898207],"category_scores_gemma":[0.00012414536,0.00014904645,0.00006897523,0.000345538,0.000047360656,0.00024637496,0.000082186816,0.00004829475,0.0008177648],"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.000035901052,0.000034089066,0.000021926882,0.0007933323,0.000040899864,1.9694752e-7,0.00025336252,0.0025105726,0.00032587544,0.96339446,0.021267656,0.011321732],"study_design_scores_gemma":[0.0009960335,0.0000258052,0.00033888157,0.00019089748,0.00027959986,4.3375408e-7,0.0014910239,0.5318898,0.00027159892,0.23865199,0.22508918,0.0007747879],"about_ca_topic_score_codex":0.000015805685,"about_ca_topic_score_gemma":0.000016920178,"teacher_disagreement_score":0.7247425,"about_ca_system_score_codex":0.00001997984,"about_ca_system_score_gemma":0.0000068775835,"threshold_uncertainty_score":0.99996024},"labels":[],"label_agreement":null},{"id":"W2889763467","doi":"10.1016/j.dam.2018.08.003","title":"Preface: Seventh Workshop on Graph Classes, Optimization, and Width Parameters, Aussois, France, October 2015","year":2018,"lang":"en","type":"article","venue":"Discrete Applied 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 Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.018023949806797272,"score_gpt":0.2931661814805807,"score_spread":0.27514223167378343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889763467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007328633,0.00013369978,0.9849943,0.0003197219,0.000119378696,0.000712212,0.000010838391,0.00024507547,0.006136152],"genre_scores_gemma":[0.106461704,0.00018690129,0.892058,0.0003692457,0.00007117637,0.00013162264,0.000015271367,0.000059763883,0.0006463005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977048,0.00004823657,0.00040476554,0.0006625918,0.0006107026,0.00056887255],"domain_scores_gemma":[0.9978493,0.0003712189,0.00021078944,0.0012235089,0.00011817826,0.0002270034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048786905,0.00033390682,0.00035291948,0.00021545526,0.0002897838,0.00026029625,0.0009162269,0.0001363352,0.000038117058],"category_scores_gemma":[0.00008819428,0.0002787817,0.000065991015,0.00085766806,0.00043521187,0.00033961012,0.00041127592,0.0002868662,0.00009502567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039462426,0.00020682119,0.00007740189,0.00012291152,0.00009294836,0.000005647858,0.0018107962,0.006433767,0.00033036649,0.98176956,0.0025988985,0.0065114116],"study_design_scores_gemma":[0.0014181387,0.00029443347,0.0001900001,0.0002605795,0.000043795535,0.00002126916,0.00037386027,0.17767768,0.0040992405,0.8093883,0.0051719705,0.0010607325],"about_ca_topic_score_codex":0.0000010086222,"about_ca_topic_score_gemma":0.000002344428,"teacher_disagreement_score":0.17238127,"about_ca_system_score_codex":0.00003074741,"about_ca_system_score_gemma":0.00003672538,"threshold_uncertainty_score":0.99996644},"labels":[],"label_agreement":null},{"id":"W2894815576","doi":"10.1016/j.dam.2020.10.015","title":"Average connectivity of minimally 2-connected graphs and average edge-connectivity of minimally 2-edge-connected graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Bipartite graph; Lambda; Connectivity; Graph; Disjoint sets; Order (exchange); Discrete mathematics; Physics","score_opus":0.020272338775375483,"score_gpt":0.24080262769294664,"score_spread":0.22053028891757115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894815576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6804181,0.00032551278,0.30604184,0.0002619373,0.001100391,0.0025250548,0.00030692486,0.00057486916,0.008445391],"genre_scores_gemma":[0.9713809,0.00012404493,0.027626282,0.00013795645,0.00012942577,0.00028868846,0.00009765576,0.00014999874,0.00006503058],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924014,0.00040296855,0.0027627416,0.002275734,0.0011615815,0.0009955728],"domain_scores_gemma":[0.9906841,0.0022713682,0.0031176435,0.0026764206,0.0007675575,0.00048291945],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0016657496,0.0014643314,0.0034322233,0.0007345339,0.00028744762,0.00038022766,0.0024869496,0.0010847131,0.000065344306],"category_scores_gemma":[0.00067841436,0.0014255596,0.000937885,0.0012935903,0.0005544913,0.00038161423,0.0029123102,0.0015101427,0.000018858984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039205438,0.0010532081,0.000396918,0.0088212965,0.001816022,0.000079001155,0.018110175,0.0016527579,0.06987817,0.89442855,0.0011110457,0.0022608144],"study_design_scores_gemma":[0.0051408806,0.0012205167,0.0035525789,0.0028287398,0.0006499427,0.00015972994,0.0018132825,0.3100803,0.074194424,0.59586316,0.0002552603,0.0042411895],"about_ca_topic_score_codex":0.00014086593,"about_ca_topic_score_gemma":0.0001227782,"teacher_disagreement_score":0.30842754,"about_ca_system_score_codex":0.00012355203,"about_ca_system_score_gemma":0.0003987651,"threshold_uncertainty_score":0.99981064},"labels":[],"label_agreement":null},{"id":"W2897482847","doi":"10.1016/j.dam.2018.08.021","title":"Broadcast domination and multipacking in strongly chordal graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Thompson Rivers University","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Chordal graph; Mathematics; Combinatorics; Interval graph; Graph; Tree (set theory); Treewidth; Discrete mathematics; Pathwidth; 1-planar graph; Line graph","score_opus":0.01801869487767191,"score_gpt":0.29331524957768434,"score_spread":0.27529655470001246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897482847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2511789,0.000034427052,0.739744,0.00006821921,0.000047952268,0.00041078567,0.0000025385552,0.00009333411,0.008419868],"genre_scores_gemma":[0.75130874,0.000009236363,0.24856524,0.000015806947,0.000023583249,0.000036277073,0.0000017205427,0.000013651681,0.00002574783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987076,0.000023832261,0.00026460455,0.0003482255,0.00029966398,0.0003560838],"domain_scores_gemma":[0.99910796,0.00017975981,0.0000966985,0.00047664667,0.000054993987,0.00008392969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005206107,0.00015494978,0.00019022907,0.0002373866,0.00011931308,0.00013253084,0.00049711973,0.00005699207,0.000008239263],"category_scores_gemma":[0.000063509055,0.00013983125,0.000027972392,0.00051470473,0.00023875899,0.00030506865,0.00032346736,0.00016127003,0.00002971841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012030718,0.000045861987,0.000116375704,0.000046482673,0.0000074228624,0.0000033884335,0.004043173,0.00002023451,0.00814656,0.961542,0.000011094969,0.026005378],"study_design_scores_gemma":[0.0014582943,0.00012300871,0.001518465,0.000084755804,0.000007103371,0.000017358325,0.0013114312,0.16896322,0.012661133,0.81317174,0.00023760175,0.00044586332],"about_ca_topic_score_codex":0.0000032350017,"about_ca_topic_score_gemma":0.000014283931,"teacher_disagreement_score":0.5001298,"about_ca_system_score_codex":0.000029748991,"about_ca_system_score_gemma":0.000017155397,"threshold_uncertainty_score":0.5702153},"labels":[],"label_agreement":null},{"id":"W2897824369","doi":"10.1016/j.dam.2018.08.026","title":"A comparison of integer programming models for the partial directed weighted improper coloring problem","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Vehicle Routing Optimization Methods","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":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Knapsack problem; Vertex (graph theory); Integer programming; Integer (computer science); Upper and lower bounds; Discrete mathematics; Function (biology); Graph; Mathematical optimization; Computer science","score_opus":0.04151401789022738,"score_gpt":0.31289705484824093,"score_spread":0.2713830369580136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897824369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012757728,0.00004553766,0.9822264,0.000019981158,0.00014074669,0.0013306293,0.000008116832,0.0005060192,0.0029648833],"genre_scores_gemma":[0.49574792,0.0000026924554,0.5037665,0.000003896087,0.00006854611,0.0003229059,0.000006445837,0.00005279136,0.000028287193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875337,0.000013919739,0.0005591281,0.00016694181,0.00019347577,0.00031317762],"domain_scores_gemma":[0.9990195,0.00029841298,0.00015286217,0.0003304331,0.00015017993,0.000048612426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047310823,0.00019612833,0.00036051043,0.000049993698,0.00013694385,0.00005159518,0.00024735616,0.00009433174,0.000015475413],"category_scores_gemma":[0.0000426516,0.00013721059,0.00007183009,0.00027441198,0.000120146906,0.00006862789,0.00006275452,0.00013884726,0.000005172695],"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.0002312275,0.00037833303,0.000096694515,0.0036579343,0.0010235625,3.9060558e-7,0.066983484,0.5595915,0.095837176,0.18491654,0.001356211,0.08592697],"study_design_scores_gemma":[0.00032916767,0.000038997052,0.00000216492,0.000058343787,0.000089055255,6.001686e-7,0.0008004858,0.92663336,0.068907775,0.002398967,0.00057510455,0.00016595106],"about_ca_topic_score_codex":0.0000023768666,"about_ca_topic_score_gemma":0.0000027495782,"teacher_disagreement_score":0.4829902,"about_ca_system_score_codex":0.00003350941,"about_ca_system_score_gemma":0.000016899437,"threshold_uncertainty_score":0.5595285},"labels":[],"label_agreement":null},{"id":"W2898301962","doi":"10.1016/j.dam.2018.08.027","title":"Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constant (computer programming); Planar; Decomposition; Combinatorics; Approximation algorithm; Factor (programming language); Algorithm; Planar graph; Discrete mathematics; Graph; Computer science","score_opus":0.019614152468066852,"score_gpt":0.3005821580958938,"score_spread":0.2809680056278269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898301962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009071812,0.000014146882,0.98662364,0.000053513482,0.000057713474,0.00096741604,0.00012330858,0.00014993682,0.0029385125],"genre_scores_gemma":[0.063102454,0.0000037731184,0.93658036,0.00004046672,0.000049007685,0.00009127975,0.000049957587,0.00003061552,0.00005208622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983829,0.000025001988,0.00046380496,0.00035402967,0.00041176134,0.00036246743],"domain_scores_gemma":[0.99838066,0.00034231268,0.00028587054,0.0006762905,0.00021565937,0.00009919979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003893465,0.0002043798,0.0003443106,0.00013975886,0.00021048052,0.000079591795,0.0006875357,0.00009243034,0.000030003092],"category_scores_gemma":[0.00003577163,0.00018335317,0.000107387496,0.00043128867,0.0003877114,0.0002648901,0.000111837115,0.00010526923,0.00009341032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034792887,0.00012798236,0.0000022292134,0.00018907191,0.000058535083,6.878046e-7,0.0016839025,0.000013500532,0.064370565,0.8997318,0.00015290939,0.03363402],"study_design_scores_gemma":[0.0005728091,0.00016487054,0.0000073836845,0.000040240087,0.000012481841,0.0000061291676,0.000058144673,0.37499434,0.0649355,0.5588729,0.00013141993,0.00020382754],"about_ca_topic_score_codex":8.328031e-7,"about_ca_topic_score_gemma":4.441341e-7,"teacher_disagreement_score":0.37498084,"about_ca_system_score_codex":0.000026752632,"about_ca_system_score_gemma":0.000051272567,"threshold_uncertainty_score":0.7476925},"labels":[],"label_agreement":null},{"id":"W2898493570","doi":"10.1016/j.dam.2018.09.015","title":"A new construction of broadcast graphs","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Wheel graph; Discrete mathematics; Upper and lower bounds; Connectivity; Graph power; Line graph","score_opus":0.01227734323439428,"score_gpt":0.23292662629017105,"score_spread":0.22064928305577677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898493570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00625764,0.000014149276,0.93867856,0.000048131824,0.00041501503,0.00014900701,0.0000010946943,0.000086613116,0.054349788],"genre_scores_gemma":[0.5663538,0.000003524708,0.43323997,0.00003895613,0.00015468623,0.000007448867,9.632151e-7,0.000008977382,0.00019168791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991335,0.0000082861925,0.00033222037,0.00018050587,0.0001892855,0.00015617139],"domain_scores_gemma":[0.9991765,0.00004096986,0.00019968057,0.000445459,0.00007356277,0.00006383639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015551287,0.00010562246,0.00019770215,0.00007514656,0.00006671435,0.00005890939,0.00035966182,0.00005682812,0.000053072472],"category_scores_gemma":[0.000008127525,0.00008799268,0.00006390063,0.0002954271,0.00008017605,0.000101798934,0.000089342786,0.000057683395,0.00006955439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026395348,0.000010949908,0.000006295983,0.000030570383,0.00001728438,2.782566e-7,0.0016505575,0.000004464436,0.0020282646,0.98128295,0.001555185,0.013410589],"study_design_scores_gemma":[0.0009812615,0.0002856263,0.000055592533,0.00021622232,0.000037838843,0.000153657,0.0018623901,0.09144967,0.043920077,0.85032254,0.0101441275,0.00057096215],"about_ca_topic_score_codex":0.000013133685,"about_ca_topic_score_gemma":0.0000043496907,"teacher_disagreement_score":0.56009614,"about_ca_system_score_codex":0.000010755676,"about_ca_system_score_gemma":0.000030323994,"threshold_uncertainty_score":0.35882372},"labels":[],"label_agreement":null},{"id":"W2898577175","doi":"10.1016/j.dam.2018.09.012","title":"Vector partitions, multi-dimensional Faà di Bruno formulae and generating algorithms","year":2018,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":8,"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":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Consiliul National al Cercetarii Stiintifice; Ontario Ministry of Research, Innovation and Science","keywords":"Mathematics; Bell polynomials; Extension (predicate logic); Variable (mathematics); Combinatorics; Algorithm; Discrete mathematics; Algebra over a field; Pure mathematics; Computer science","score_opus":0.04312138479624926,"score_gpt":0.3191415773274588,"score_spread":0.2760201925312095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898577175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34366345,0.00013934728,0.64730525,0.00016936932,0.0006895226,0.001974802,0.00007611674,0.000816539,0.0051656277],"genre_scores_gemma":[0.27545762,0.000010437911,0.7233066,0.000100677964,0.0004656212,0.00020325067,0.000023769737,0.00014732461,0.0002847345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971681,0.000032311324,0.00096159725,0.00056055153,0.00060898537,0.0006684275],"domain_scores_gemma":[0.99743396,0.000748864,0.0004889759,0.0008474758,0.00022318265,0.00025752792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050632266,0.00054044597,0.0007224472,0.00011506128,0.0005538058,0.00013509873,0.00033323737,0.00021951899,0.00009985422],"category_scores_gemma":[0.00058735104,0.00047559288,0.00012128108,0.00028341226,0.0003467723,0.00021208618,0.00036550392,0.00029990074,0.00014181176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019448053,0.0004706228,0.0000123129375,0.0005743755,0.00012826447,0.000008103367,0.003078228,0.000020421629,0.022961631,0.9705115,0.000922003,0.0012930833],"study_design_scores_gemma":[0.0017334139,0.000150225,0.000027417644,0.00022460049,0.00019109745,0.000056559813,0.0008990515,0.06616721,0.019075532,0.91015965,0.0004569521,0.00085830997],"about_ca_topic_score_codex":0.0000031967018,"about_ca_topic_score_gemma":0.000012742188,"teacher_disagreement_score":0.076001346,"about_ca_system_score_codex":0.0000886455,"about_ca_system_score_gemma":0.000059847527,"threshold_uncertainty_score":0.99976957},"labels":[],"label_agreement":null},{"id":"W2908576804","doi":"10.1016/j.dam.2018.12.012","title":"On directed covering and domination problems","year":2019,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Directed acyclic graph; Directed graph; Mathematics; Edge cover; Vertex cover; Vertex (graph theory); Feedback arc set; Time complexity; Maximal independent set; Feedback vertex set; Discrete mathematics; Graph; Pathwidth; Line graph","score_opus":0.011021755888656545,"score_gpt":0.25314728609802806,"score_spread":0.2421255302093715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908576804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30046758,0.000022159898,0.6557286,0.00009155247,0.000060552586,0.0008501338,0.0000024526828,0.00031789823,0.042459093],"genre_scores_gemma":[0.89357936,0.00001129947,0.10593204,0.00004792015,0.000008261377,0.000055847864,0.0000029275573,0.000018589359,0.00034374793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903584,0.000012381856,0.00016210783,0.0002809906,0.000290676,0.00021799559],"domain_scores_gemma":[0.99906826,0.0002843828,0.00007929046,0.0004801292,0.000028938015,0.00005899377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027269174,0.00012249514,0.00015927825,0.000096579744,0.00006154977,0.00010696677,0.0003471426,0.000040125862,0.000014318309],"category_scores_gemma":[0.000036953694,0.00010218623,0.00002269121,0.00024957815,0.00003820525,0.00017167143,0.00020780561,0.0001195825,0.00013882291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005910094,0.00002616501,0.000010359066,0.000115052986,0.000008185109,6.9316127e-7,0.0010950378,0.0002695076,0.015075193,0.97987145,0.000016673323,0.0035057592],"study_design_scores_gemma":[0.0005741209,0.00007840692,0.000121872254,0.00007447782,0.000003755953,0.0000048609445,0.00011116642,0.13733003,0.00882548,0.85245854,0.00018437686,0.00023290825],"about_ca_topic_score_codex":3.9904128e-7,"about_ca_topic_score_gemma":4.6102173e-7,"teacher_disagreement_score":0.5931118,"about_ca_system_score_codex":0.000023763938,"about_ca_system_score_gemma":0.000010099554,"threshold_uncertainty_score":0.41670337},"labels":[],"label_agreement":null},{"id":"W2910417048","doi":"10.1016/j.dam.2018.12.006","title":"Matrix representation of consensus and dissent stabilities in the graph model for conflict resolution","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Dissent; Matrix representation; Conflict resolution; Graph; Algebraic graph theory; Representation (politics); Matrix (chemical analysis); Algebraic number; Mathematics; Stability (learning theory); Computer science; Mathematical optimization; Theoretical computer science; Political science; Machine learning; Law","score_opus":0.025398503436354213,"score_gpt":0.3150983086430453,"score_spread":0.2896998052066911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910417048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9489568,0.000016593629,0.046313044,0.00013022397,0.000018430648,0.0008617134,0.00010790259,0.0000057894067,0.0035895351],"genre_scores_gemma":[0.99405384,0.0000043216055,0.005726135,0.000009035007,0.000012645496,0.00007657118,0.00003190699,0.000007493599,0.00007803017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994305,0.000009871936,0.00024580472,0.00010948135,0.00010080094,0.00010354565],"domain_scores_gemma":[0.9994169,0.00023668459,0.0001261831,0.0001757804,0.000030350138,0.000014124634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001823973,0.00007478738,0.0001641502,0.000025083253,0.000039114846,0.000021472732,0.000072308976,0.00002400617,0.000005881248],"category_scores_gemma":[0.0000058781557,0.000056436616,0.000047331065,0.00006790581,0.00007985047,0.000022171444,0.000020807303,0.0000484609,8.816398e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013923712,0.00003586584,0.00093998207,0.00010883237,0.000011748933,1.5068645e-8,0.008361661,0.0038487795,0.0009455393,0.9856375,0.00002176448,0.00007441546],"study_design_scores_gemma":[0.0005037437,0.000019382189,0.0004946883,0.000027891001,0.000019024168,1.3155177e-7,0.027537031,0.5637796,0.0002593625,0.4072328,0.000019833,0.00010651676],"about_ca_topic_score_codex":0.00004334657,"about_ca_topic_score_gemma":0.000003751801,"teacher_disagreement_score":0.57840466,"about_ca_system_score_codex":0.0000056516983,"about_ca_system_score_gemma":0.000014826168,"threshold_uncertainty_score":0.23014185},"labels":[],"label_agreement":null},{"id":"W2911847656","doi":"10.1016/j.dam.2020.01.032","title":"Eternal domination on prisms of graphs","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Université de Montréal; Dawson College; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Combinatorics; Conjecture; Mathematics; Vertex (graph theory); Graph; Domination analysis; Guard (computer science); Dominating set; Clique; Discrete mathematics; Computer science","score_opus":0.03574876745790401,"score_gpt":0.30939730151531986,"score_spread":0.27364853405741585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911847656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010179969,0.000029614475,0.96918297,0.00032146336,0.00015739356,0.00092606863,0.000030673295,0.00017992129,0.018991949],"genre_scores_gemma":[0.57151794,0.00003413929,0.42805755,0.00008008674,0.00003999439,0.00015212696,0.000025322148,0.000044416876,0.000048440594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973523,0.000044670454,0.00063409907,0.0006716799,0.0009713674,0.00032587055],"domain_scores_gemma":[0.99729204,0.0003363048,0.00063296047,0.0014876205,0.00010847249,0.00014259279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049699686,0.00035999937,0.00059240137,0.0002766502,0.00006432313,0.000121111625,0.0023026378,0.00021339029,0.000012585344],"category_scores_gemma":[0.000102308135,0.0003196316,0.00022774257,0.00038215372,0.00015269131,0.00008688442,0.0019708236,0.0007832527,0.000060719754],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024274259,0.000089199595,0.0000022675372,0.0006930405,0.00005942546,0.000006408474,0.0018300028,0.0004661593,0.005212545,0.9870651,0.000079234866,0.0044723395],"study_design_scores_gemma":[0.00027841754,0.00007448332,0.0000315671,0.00018331682,0.000018302242,0.0000019619783,0.00007874012,0.027212802,0.029663846,0.94212484,0.000043943088,0.00028778642],"about_ca_topic_score_codex":0.0000013135831,"about_ca_topic_score_gemma":3.6514157e-7,"teacher_disagreement_score":0.56133795,"about_ca_system_score_codex":0.00004761656,"about_ca_system_score_gemma":0.000082590755,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W2913385138","doi":"10.1016/j.dam.2019.01.003","title":"Approximation algorithms for the fault-tolerant facility location problem with penalties","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Randomized rounding; Facility location problem; Rounding; Approximation algorithm; Mathematics; Greedy algorithm; Fault tolerance; Algorithm; Mathematical optimization; Computer science; Distributed computing","score_opus":0.024554381372637497,"score_gpt":0.23148110160295862,"score_spread":0.20692672023032113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913385138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035240036,0.000044833236,0.9288247,0.0019538756,0.00020912258,0.0058336277,0.000019295816,0.00027578117,0.027598716],"genre_scores_gemma":[0.97505206,0.000007648712,0.0213663,0.00062937575,0.00016752032,0.0012058993,0.00031554367,0.000034208533,0.0012214574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868745,0.0000031051297,0.00038195399,0.0002977796,0.0003764326,0.00025326406],"domain_scores_gemma":[0.9990633,0.000053201893,0.00016657083,0.0004912957,0.00021503693,0.00001055559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005624466,0.00021510341,0.00021302277,0.00007614598,0.00023908739,0.0002300188,0.00028907787,0.000046053665,0.00017857087],"category_scores_gemma":[0.00002313587,0.00013437077,0.000058958594,0.0003281552,0.000058837126,0.0003926283,0.00008377728,0.00008403547,0.0006125982],"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.00017548334,0.00034983834,0.00021558978,0.009137548,0.00022324357,2.1673716e-7,0.0023213273,0.06040456,0.00044137615,0.9000805,0.0030094024,0.02364092],"study_design_scores_gemma":[0.001211115,0.000025295374,0.0005564299,0.00008054525,0.00019762221,5.685633e-7,0.009025404,0.9312057,0.00016612733,0.021083226,0.035950456,0.0004975258],"about_ca_topic_score_codex":0.000094332325,"about_ca_topic_score_gemma":0.000072753006,"teacher_disagreement_score":0.939812,"about_ca_system_score_codex":0.000031082476,"about_ca_system_score_gemma":0.000017079015,"threshold_uncertainty_score":0.7873915},"labels":[],"label_agreement":null},{"id":"W2914186449","doi":"10.1016/j.dam.2016.01.034","title":"Odd gossiping","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gossip; Asynchronous communication; Upper and lower bounds; Computer science; Pairwise comparison; Node (physics); Conjecture; Computer network; Theoretical computer science; Mathematics; Combinatorics; Physics","score_opus":0.00998681482184194,"score_gpt":0.23207651812410954,"score_spread":0.2220897033022676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914186449","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52806973,0.0002910874,0.36680603,0.0005049313,0.00018855264,0.0007780023,0.00004363665,0.00011209956,0.10320591],"genre_scores_gemma":[0.95188546,0.00011174,0.044994842,0.00011391216,0.00026345009,0.000079665166,0.000032533764,0.000059009875,0.0024593952],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991574,0.0000056985295,0.00018969794,0.00024750314,0.00014443365,0.0002552382],"domain_scores_gemma":[0.99937576,0.000013837326,0.000078304314,0.00043676203,0.000025451476,0.00006987427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013077259,0.00015068913,0.00013367974,0.00002775186,0.000051845393,0.000020107525,0.00020235403,0.000084801344,0.000077392935],"category_scores_gemma":[0.000028444767,0.000100557765,0.00006428985,0.000053080938,0.00006190246,0.0000020826894,0.0001295764,0.000031481057,0.00021195818],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007219146,0.000029381234,0.000041865576,0.00003670621,0.000045261175,8.288816e-7,0.00008100894,0.0000015503401,0.9842048,0.007723627,0.00093035813,0.0068973694],"study_design_scores_gemma":[0.0021757588,0.00017242396,0.000475926,0.00010349982,0.0000831218,0.000021997776,0.00059642736,0.000094605566,0.8912499,0.018853564,0.08520243,0.00097034394],"about_ca_topic_score_codex":4.1669807e-7,"about_ca_topic_score_gemma":0.0000012302208,"teacher_disagreement_score":0.4238157,"about_ca_system_score_codex":0.00001255837,"about_ca_system_score_gemma":0.000018654757,"threshold_uncertainty_score":0.41006267},"labels":[],"label_agreement":null},{"id":"W2917098087","doi":"10.1016/j.dam.2017.09.006","title":"On strong edge-coloring of graphs with maximum degree 4","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China; National Sanitarium Association","keywords":"Mathematics; Degree (music); Edge coloring; Combinatorics; Brooks' theorem; Enhanced Data Rates for GSM Evolution; Graph coloring; Complete coloring; Discrete mathematics; Chordal graph; 1-planar graph; Graph; Artificial intelligence; Computer science; Line graph","score_opus":0.019134441784503974,"score_gpt":0.23147952676751912,"score_spread":0.21234508498301516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917098087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14229353,0.0000236962,0.76049864,0.000007957181,0.0000952742,0.00040894432,0.000009715126,0.00022381393,0.09643841],"genre_scores_gemma":[0.8867959,0.00002477327,0.11300433,0.000003010398,0.000025104371,0.00004872423,0.000008342803,0.00006829755,0.000021562184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920297,0.000001946321,0.00022806264,0.00014288558,0.0001928562,0.00023126602],"domain_scores_gemma":[0.9990114,0.000059842983,0.00017049436,0.00068147655,0.000025584806,0.00005118404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006304039,0.00019438363,0.00026562274,0.000056596426,0.00012988146,0.000040634848,0.00028377798,0.00006357591,0.000013365359],"category_scores_gemma":[0.000014100039,0.00016612427,0.00003600297,0.00006438904,0.00008559403,0.00011008348,0.000045530418,0.00013098634,0.000011223816],"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.000030429559,0.00003597847,0.000058017326,0.0003848326,0.000082783634,0.0000031843094,0.00042427605,0.71217686,0.0016707652,0.27925912,0.00007017522,0.00580359],"study_design_scores_gemma":[0.0029293522,0.00024516266,0.0012845835,0.0010655381,0.00021934228,0.000008954813,0.0010015584,0.7486559,0.057628926,0.1853663,0.00013246648,0.0014619183],"about_ca_topic_score_codex":7.7701486e-7,"about_ca_topic_score_gemma":0.0000054729244,"teacher_disagreement_score":0.7445023,"about_ca_system_score_codex":0.000028197053,"about_ca_system_score_gemma":0.0000062132417,"threshold_uncertainty_score":0.6774351},"labels":[],"label_agreement":null},{"id":"W2921280920","doi":"10.1016/j.dam.2019.02.026","title":"Preface: Tenth International Colloquium on Graphs and Optimization (GO X), 2016","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.006231262015789569,"score_gpt":0.2145865321000022,"score_spread":0.20835527008421262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921280920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02712856,0.00002108421,0.9178327,0.00029848213,0.00045756088,0.0005769201,0.000013255843,0.00020506968,0.05346639],"genre_scores_gemma":[0.49366555,0.000066871246,0.50388205,0.00038350673,0.000036601326,0.00006609131,0.000027132794,0.000031966913,0.001840241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903166,0.000011134499,0.0002015583,0.0003006025,0.00028028173,0.00017478067],"domain_scores_gemma":[0.99928635,0.00008735582,0.00011878991,0.00040801297,0.000034189132,0.00006530148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002078707,0.00015209816,0.00015783371,0.00010884035,0.00007275754,0.00015183807,0.0004979329,0.000056399324,0.000052470536],"category_scores_gemma":[0.000010680937,0.00012234034,0.000043363274,0.00017699401,0.00004493817,0.00019693407,0.00018116682,0.000092017275,0.0001280271],"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.00000864987,0.000070437905,0.000023556682,0.00003612918,0.000030072919,0.0000010155522,0.0006728509,0.004069785,0.00091831526,0.9926239,0.00024836048,0.0012968826],"study_design_scores_gemma":[0.0011905774,0.0001343365,0.0001148855,0.000119316144,0.00002064909,0.000012699405,0.00050417386,0.63046426,0.0035052642,0.36270478,0.00074029417,0.00048874685],"about_ca_topic_score_codex":3.82591e-7,"about_ca_topic_score_gemma":9.499768e-8,"teacher_disagreement_score":0.6299192,"about_ca_system_score_codex":0.0000134491065,"about_ca_system_score_gemma":0.000015066055,"threshold_uncertainty_score":0.49888942},"labels":[],"label_agreement":null},{"id":"W2921560389","doi":"10.1016/j.dam.2020.04.018","title":"The iterated local model for social networks","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences; Ryerson University; U.S. Department of Energy","keywords":"Transitive relation; Mathematics; Iterated function; Sequence (biology); Bounded function; Combinatorics; Computer science; Discrete mathematics","score_opus":0.03387150273590973,"score_gpt":0.29586572179908155,"score_spread":0.26199421906317183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921560389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002781461,0.000036177404,0.9902762,0.00044905217,0.000051374747,0.001245253,0.0001364412,0.00019786795,0.0073294872],"genre_scores_gemma":[0.9257263,0.0000069208822,0.07033768,0.00009276315,0.0012059232,0.0013944522,0.0009279549,0.0001154019,0.00019258725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818957,0.000016980175,0.00065298425,0.0004651594,0.0002389302,0.00043638458],"domain_scores_gemma":[0.9985152,0.00021977608,0.00051070953,0.00057195587,0.00009935534,0.00008298672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025991304,0.00045033402,0.00067836285,0.0000318658,0.0004869012,0.00032236523,0.0007543806,0.0001797025,0.000023816714],"category_scores_gemma":[0.0000036342167,0.00034329246,0.00050666847,0.0001452605,0.00014406507,0.000018882927,0.00084846705,0.0006548822,0.000007672741],"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.000027986207,0.00006607513,0.0000030482688,0.00015087616,0.00061475625,2.1620527e-7,0.0017124204,0.070985794,0.000046415338,0.88867867,0.022710325,0.015003405],"study_design_scores_gemma":[0.000102153674,0.000003180964,6.869952e-7,0.000019894593,0.00014962173,3.140406e-8,0.0002621089,0.59437436,0.000038687343,0.40412524,0.00070045,0.00022360116],"about_ca_topic_score_codex":0.0000054896523,"about_ca_topic_score_gemma":0.0000033319823,"teacher_disagreement_score":0.9254482,"about_ca_system_score_codex":0.000044334716,"about_ca_system_score_gemma":0.00008179577,"threshold_uncertainty_score":0.9999019},"labels":[],"label_agreement":null},{"id":"W2921844982","doi":"10.1016/j.dam.2019.02.032","title":"Zero–one laws for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" overflow=\"scroll\" id=\"d1e19\" altimg=\"si6.gif\"><mml:mi>k</mml:mi></mml:math>-variable first-order logic of sparse random graphs","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"Russian Science Foundation","keywords":"Mathematics; Graph; Order (exchange); Zero (linguistics); Scroll; Algorithm; Discrete mathematics; Combinatorics; Philosophy; Theology","score_opus":0.020487086681146613,"score_gpt":0.2501845265000929,"score_spread":0.22969743981894625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921844982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94112164,0.0001809202,0.040671557,0.000088345,0.00062976254,0.00074076303,0.00039586597,0.00022306344,0.015948096],"genre_scores_gemma":[0.8462014,0.00016453181,0.1515388,0.00034978878,0.00023999633,0.0006384206,0.00025440124,0.00031098907,0.00030166114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958635,0.000052741558,0.0014057109,0.00077001186,0.0009516631,0.00095638976],"domain_scores_gemma":[0.99454594,0.002017389,0.0012504696,0.0017981959,0.00014825579,0.00023976057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013226201,0.0006811741,0.0009111467,0.00017627385,0.00057101686,0.00018198146,0.00095953577,0.0007415591,0.00017813257],"category_scores_gemma":[0.0006227368,0.0006550131,0.00068941835,0.00042959856,0.00045034933,0.00025994636,0.00062515476,0.0005331493,0.00021583392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006724172,0.00035877968,0.000007294895,0.0034716695,0.0006708931,0.000011742861,0.002123512,0.00041988425,0.0026033244,0.9887653,0.00079204136,0.00010311598],"study_design_scores_gemma":[0.0035425613,0.00031697177,0.0000060071607,0.00051740033,0.0008211571,0.000052456304,0.0010130327,0.3519473,0.0049188114,0.63462245,0.0015286796,0.0007131936],"about_ca_topic_score_codex":0.000029750438,"about_ca_topic_score_gemma":0.00002543407,"teacher_disagreement_score":0.3541429,"about_ca_system_score_codex":0.00001952169,"about_ca_system_score_gemma":0.00014920683,"threshold_uncertainty_score":0.9995901},"labels":[],"label_agreement":null},{"id":"W2935647112","doi":"10.1016/j.dam.2019.03.013","title":"Approximation algorithm for squared metric facility location problem with nonuniform capacities","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","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 New Brunswick","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Facility location problem; Metric (unit); Mathematics; 1-center problem; Approximation algorithm; Set (abstract data type); Mathematical optimization; Constant (computer programming); Square (algebra); Algorithm; Computer science; Geometry","score_opus":0.01599581261953016,"score_gpt":0.2121410866716694,"score_spread":0.19614527405213922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935647112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025308726,0.0000141229475,0.92180103,0.00022789488,0.00012626257,0.0035807607,0.00003365064,0.00027060902,0.048636958],"genre_scores_gemma":[0.81928515,0.000005622681,0.17572576,0.0004284644,0.00017989049,0.0013147426,0.0012300024,0.000056589168,0.0017737716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984881,0.00000277756,0.00044849556,0.00034635267,0.00041090455,0.00030333948],"domain_scores_gemma":[0.9990261,0.000031799755,0.00019632599,0.00043858335,0.0002907242,0.00001644543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048569601,0.00025355656,0.00028697605,0.0002698403,0.00015860816,0.00018696731,0.0002271615,0.00006856177,0.00020924618],"category_scores_gemma":[0.000025892494,0.00020734727,0.0000645936,0.00074551936,0.00006102507,0.0006218309,0.000068154164,0.00007954491,0.00067827135],"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.000112660215,0.0006071933,0.00020635148,0.015368862,0.00025251094,3.9319187e-7,0.002568066,0.011397089,0.00043055083,0.87352574,0.0022858796,0.093244724],"study_design_scores_gemma":[0.0022723654,0.00006311993,0.00031888403,0.000115596245,0.0002499657,8.1848304e-7,0.016155234,0.9171282,0.0005409218,0.040677253,0.021526027,0.0009515879],"about_ca_topic_score_codex":0.00009899301,"about_ca_topic_score_gemma":0.000053007312,"teacher_disagreement_score":0.90573114,"about_ca_system_score_codex":0.00006617793,"about_ca_system_score_gemma":0.000020704803,"threshold_uncertainty_score":0.8718032},"labels":[],"label_agreement":null},{"id":"W2941817316","doi":"10.1016/j.dam.2019.04.002","title":"On the computational complexity of closest genome problems","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Genome; Breakpoint; Pairwise comparison; Mathematics; Hamming distance; Combinatorics; Gene rearrangement; Edit distance; Computational biology; Algorithm; Biology; Genetics; Chromosome; Gene","score_opus":0.021683806899107934,"score_gpt":0.2354475112205545,"score_spread":0.21376370432144656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2941817316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95322883,0.000042871136,0.0150966775,0.00017115143,0.000037836533,0.0009401387,0.000062307125,0.000013009764,0.030407175],"genre_scores_gemma":[0.98598164,0.0000073065135,0.013388555,0.000108021086,0.00003151854,0.0000357645,0.0002037274,0.000023570907,0.00021990752],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920976,0.00001152705,0.00022326084,0.00018558503,0.00021837222,0.00015148985],"domain_scores_gemma":[0.9993534,0.000038265724,0.00014324841,0.00039180636,0.000043698175,0.000029575753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017788044,0.00013057452,0.00015801143,0.000022591747,0.000040914507,0.000013796398,0.00024363714,0.00005478032,0.00014328174],"category_scores_gemma":[0.000011465792,0.00009133745,0.000066268585,0.00006661882,0.00012533966,0.0000011313396,0.000100955505,0.000065870016,0.00013671766],"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.000028011042,0.0002278314,0.00007928515,0.00030520486,0.00017045313,2.606311e-7,0.0005475112,0.006888676,0.52307135,0.46820787,0.0003515937,0.00012199438],"study_design_scores_gemma":[0.0044452646,0.0015252794,0.0077709034,0.00017445804,0.00018924529,0.000023241042,0.0027265046,0.020824911,0.12255302,0.82633376,0.011656476,0.001776945],"about_ca_topic_score_codex":0.000001117467,"about_ca_topic_score_gemma":0.0000010597516,"teacher_disagreement_score":0.4005183,"about_ca_system_score_codex":0.000008146706,"about_ca_system_score_gemma":0.000021435351,"threshold_uncertainty_score":0.37246332},"labels":[],"label_agreement":null},{"id":"W2942074353","doi":"10.1016/j.dam.2019.03.006","title":"Querying relational event graphs using colored range searching data structures","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timestamp; Colored; Graph; Relational database; Theoretical computer science; Computer science; Mathematics; Event (particle physics); Range (aeronautics); Data mining","score_opus":0.046040916136761874,"score_gpt":0.2903002288330911,"score_spread":0.24425931269632922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942074353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23109247,0.000040225455,0.76530737,0.000045869343,0.00017306053,0.00041057053,0.000026232128,0.00011719745,0.0027869889],"genre_scores_gemma":[0.61094075,0.0000024385422,0.38888466,0.00005606111,0.000027068047,0.0000061368305,0.000037364218,0.000016260514,0.000029225179],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983818,0.000039362247,0.00032917506,0.0004580666,0.00047190042,0.0003197143],"domain_scores_gemma":[0.9981846,0.00024444293,0.00017944703,0.0012767994,0.00003060936,0.00008409737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007234329,0.00018972132,0.00024356763,0.00012830815,0.00021484813,0.00016221272,0.0013754566,0.0000687102,0.00004466984],"category_scores_gemma":[0.000027981307,0.00016279184,0.00006570975,0.0003335513,0.000058842463,0.0004628628,0.00083005294,0.00022736841,0.000045378623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005293944,0.0000238695,0.000105834726,0.000083217514,0.00003798669,0.000002740424,0.001442469,0.0015216942,0.004129508,0.9916352,0.0000258379,0.0009863254],"study_design_scores_gemma":[0.00032694018,0.00001161336,0.0002853468,0.0000439473,0.000016607022,0.000015319929,0.0003061023,0.42956817,0.00048682364,0.56863475,0.00007982049,0.00022451801],"about_ca_topic_score_codex":0.0000040045143,"about_ca_topic_score_gemma":8.4395253e-7,"teacher_disagreement_score":0.4280465,"about_ca_system_score_codex":0.000023845067,"about_ca_system_score_gemma":0.00005218305,"threshold_uncertainty_score":0.66384584},"labels":[],"label_agreement":null},{"id":"W2944552253","doi":"10.1016/j.dam.2019.03.002","title":"Approximating concept stability using variance reduction techniques","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Rough Sets and Fuzzy Logic","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variance reduction; Stability (learning theory); Computer science; Mathematics; Scalability; Algorithm; Mathematical optimization; Theoretical computer science; Monte Carlo method; Machine learning; Statistics","score_opus":0.026542119107385968,"score_gpt":0.2558799933612464,"score_spread":0.22933787425386043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944552253","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03232822,0.000021513612,0.9318405,0.000062590145,0.0001363511,0.00068632286,0.0000027032827,0.00036951248,0.034552295],"genre_scores_gemma":[0.39358842,0.0000017082687,0.6062887,0.000033371092,0.000040116116,0.000020733498,0.000002816938,0.000011597229,0.000012524807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985715,0.000020015948,0.0004106976,0.00041923008,0.00028562383,0.0002929292],"domain_scores_gemma":[0.9986851,0.000059313134,0.00026419398,0.00089039205,0.000044446326,0.00005652481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046019765,0.0001857689,0.00029017727,0.000042471165,0.0001164855,0.00016638836,0.0005772458,0.000089162815,0.00003243409],"category_scores_gemma":[0.0000194961,0.00015569053,0.00006048585,0.00028384256,0.00006251005,0.0002886541,0.00025128506,0.00015761387,0.000040597453],"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.0000038649628,0.0001176814,0.000016741402,0.00028446555,0.000021029198,0.0000012636809,0.006756703,0.00022169156,0.072061196,0.9057541,0.000045905046,0.014715386],"study_design_scores_gemma":[0.0003668529,0.000081708626,0.0000221086,0.0001269939,0.000025592733,0.00004852446,0.0022757975,0.63237673,0.12005051,0.24347144,0.0004135196,0.0007402216],"about_ca_topic_score_codex":0.0000058679457,"about_ca_topic_score_gemma":7.320621e-8,"teacher_disagreement_score":0.66228265,"about_ca_system_score_codex":0.00006493379,"about_ca_system_score_gemma":0.000038564052,"threshold_uncertainty_score":0.6348876},"labels":[],"label_agreement":null},{"id":"W2947688929","doi":"10.1016/j.dam.2019.05.004","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e1568\" altimg=\"si87.svg\"><mml:mi>α</mml:mi></mml:math>-labellings of lobsters and trees with a perfect matching","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Conjecture; Mathematics; Combinatorics; Injective function; Tree (set theory); Degree (music); Discrete mathematics; Physics","score_opus":0.010839778074132132,"score_gpt":0.21717242276201382,"score_spread":0.20633264468788168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947688929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98140144,0.000106443644,0.01561554,0.00012619531,0.0001524485,0.00013480803,0.000018264898,0.00015864549,0.0022862395],"genre_scores_gemma":[0.9430948,0.00006137962,0.056295183,0.00029842756,0.000020885916,0.00007341834,0.000028954813,0.00007992511,0.000047046928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756736,0.000025032905,0.00057592464,0.00062121276,0.00071243977,0.0004980628],"domain_scores_gemma":[0.99773425,0.00047539014,0.00055183575,0.0010144379,0.000046298515,0.00017779726],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056098046,0.0003603476,0.00033697748,0.0001289659,0.0002404642,0.00026525193,0.0006308529,0.00022005859,0.000007838144],"category_scores_gemma":[0.0000402886,0.00032717668,0.00015892531,0.00028827117,0.00020866195,0.00026053522,0.0003975394,0.00032936153,0.00024721125],"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.000064599735,0.00012123944,0.0000061146243,0.0006317703,0.00011693248,0.000018812036,0.0035614264,0.0012887953,0.007661449,0.98603576,0.000050326486,0.0004427688],"study_design_scores_gemma":[0.0009236067,0.00052171084,0.000011081795,0.000791031,0.00013958095,0.00007918593,0.0008954992,0.9506005,0.0113542,0.0341627,0.00007402332,0.0004468903],"about_ca_topic_score_codex":0.000046575893,"about_ca_topic_score_gemma":0.000014782905,"teacher_disagreement_score":0.95187306,"about_ca_system_score_codex":0.000007910717,"about_ca_system_score_gemma":0.000084252475,"threshold_uncertainty_score":0.99991804},"labels":[],"label_agreement":null},{"id":"W2949906226","doi":"10.1016/j.dam.2014.12.006","title":"The cost of perfection for matchings in graphs","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Combinatorics; Mathematics; Bipartite graph; Matching (statistics); Strong perfect graph theorem; Triangulation; Minimum weight; Cubic graph; Upper and lower bounds; Polygon mesh; Chordal graph; Discrete mathematics; Line graph; 1-planar graph; Graph; Geometry","score_opus":0.015273570900178775,"score_gpt":0.28621066416236846,"score_spread":0.2709370932621897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949906226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015245007,0.000015155137,0.9791078,0.00013929016,0.00004676002,0.00070250675,0.0000018636533,0.00004211942,0.004699522],"genre_scores_gemma":[0.8514362,0.00001580887,0.14812732,0.00003060601,0.00001240684,0.00030024268,0.0000017813378,0.000016579661,0.000059061025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990242,0.000024997778,0.00027954645,0.00018550814,0.00022600008,0.0002597226],"domain_scores_gemma":[0.9982227,0.0010117162,0.00013309247,0.000547861,0.000047065372,0.000037578062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012116588,0.000100419296,0.0001684861,0.000090589245,0.00013948699,0.00005822685,0.0007013032,0.000037455437,0.0000010295535],"category_scores_gemma":[0.00013005888,0.000068676825,0.00006216194,0.00033540264,0.00010874105,0.000099428435,0.00013681984,0.00011005354,0.0000058826286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010678584,0.000024279223,0.000012610178,0.0000799417,0.0000050593508,5.825025e-8,0.0007494303,0.0001120161,0.0035530336,0.98124915,0.000026758176,0.014176993],"study_design_scores_gemma":[0.0002999348,0.00003840577,0.00006839298,0.000020600639,0.0000026714117,0.0000013205636,0.00022658176,0.063009545,0.0064791623,0.9291021,0.00066601933,0.00008525461],"about_ca_topic_score_codex":0.0000019584888,"about_ca_topic_score_gemma":0.000009105135,"teacher_disagreement_score":0.8361912,"about_ca_system_score_codex":0.000017136857,"about_ca_system_score_gemma":0.000012975329,"threshold_uncertainty_score":0.28005597},"labels":[],"label_agreement":null},{"id":"W2950980768","doi":"10.1016/j.dam.2019.10.026","title":"Computational determination of the largest lattice polytope diameter","year":2019,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Combinatorics; Minkowski addition; Convex hull; Mathematics; Lattice (music); Conjecture; Regular polygon; Convex polytope; Hexagonal lattice; Convex body; Geometry; Convex set; Physics; Condensed matter physics","score_opus":0.04420962110808693,"score_gpt":0.31086799554838873,"score_spread":0.2666583744403018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950980768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121427275,0.00021450287,0.821685,0.00047446368,0.00088585826,0.002760987,0.00074408896,0.00018143727,0.051626366],"genre_scores_gemma":[0.701786,0.000021097241,0.2962893,0.00013813004,0.00012559767,0.00012634022,0.000096214666,0.000101045,0.0013162639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973384,0.000045360775,0.0010313467,0.00038872368,0.0008677092,0.00032845535],"domain_scores_gemma":[0.99598503,0.0013409496,0.001301099,0.0010589822,0.00026172612,0.000052189018],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071361184,0.0004253334,0.000813021,0.00020235707,0.0000965924,0.00009467081,0.0008447821,0.00034536936,0.00010324905],"category_scores_gemma":[0.0006356988,0.00029936736,0.00032004158,0.00034529774,0.00013629405,0.00006611697,0.0010873214,0.0005475615,0.000038718386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016607788,0.0003344833,0.0000871881,0.01307677,0.0001743815,0.0000011091503,0.0042822077,0.0007669608,0.00010132553,0.97917366,0.0007809597,0.001204357],"study_design_scores_gemma":[0.00036123995,0.000020241347,0.00012739176,0.0005558834,0.00029006688,0.0000056375675,0.0006669804,0.016354192,0.0013736993,0.9796296,0.00019150862,0.00042357214],"about_ca_topic_score_codex":0.000010249576,"about_ca_topic_score_gemma":0.0000042805905,"teacher_disagreement_score":0.58035874,"about_ca_system_score_codex":0.00006879045,"about_ca_system_score_gemma":0.00017577963,"threshold_uncertainty_score":0.9999458},"labels":[],"label_agreement":null},{"id":"W2954158457","doi":"10.1016/j.dam.2019.06.007","title":"Spectral bounds for graph partitioning with prescribed partition sizes","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"VLSI and FPGA Design Techniques","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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Adjacency matrix; Graph partition; Eigenvalues and eigenvectors; Mathematics; Combinatorics; Graph energy; Strength of a graph; Graph; Adjacency list; Partition (number theory); Spectral graph theory; Undirected graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.008739207267766799,"score_gpt":0.20691535695033877,"score_spread":0.19817614968257197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954158457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.177443,0.00006276128,0.7801807,0.000024728819,0.00007433659,0.0014135736,0.000034445256,0.0012517131,0.03951473],"genre_scores_gemma":[0.90507054,0.000013415544,0.09421213,0.000020164749,0.000051222833,0.00042294466,0.000054310643,0.000061779894,0.00009351305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992131,0.0000027261924,0.00021307745,0.00015189307,0.00013929326,0.00027993493],"domain_scores_gemma":[0.99957055,0.00005895987,0.00004627999,0.00025158373,0.000022238684,0.00005040414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010284564,0.00017705011,0.00022385461,0.000053065363,0.000057589503,0.00007727038,0.000102895276,0.000070393806,0.00006209573],"category_scores_gemma":[0.0000042381407,0.00014936502,0.000059673537,0.00010623445,0.000031996133,0.00010853822,0.000010525752,0.00008895612,0.000038735747],"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.00010165476,0.00015374241,0.000307584,0.0026007353,0.00033717256,0.000003535935,0.004014218,0.008337423,0.23753761,0.73897856,0.0060738386,0.0015539218],"study_design_scores_gemma":[0.0020921421,0.00048776352,0.0002879549,0.00043833477,0.0002535007,0.00001660748,0.0011018735,0.089840226,0.4918954,0.40778068,0.0043836115,0.0014219118],"about_ca_topic_score_codex":8.552911e-7,"about_ca_topic_score_gemma":0.0000033201377,"teacher_disagreement_score":0.7276275,"about_ca_system_score_codex":0.000025652105,"about_ca_system_score_gemma":0.000007783687,"threshold_uncertainty_score":0.6090929},"labels":[],"label_agreement":null},{"id":"W2962698493","doi":"10.1016/j.dam.2017.06.006","title":"A coloring algorithm for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"mml1\" display=\"inline\" overflow=\"scroll\" altimg=\"si1.gif\"><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:math>-free line graphs","year":2017,"lang":"lv","type":"article","venue":"Discrete Applied 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":"Wilfrid Laurier University","funders":"Agence Nationale de la Recherche","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Claw; Algorithm; Discrete mathematics; Graph","score_opus":0.02548238459607097,"score_gpt":0.2721571614832467,"score_spread":0.24667477688717573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962698493","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23331349,0.0018755869,0.09844854,0.001427956,0.004813068,0.00033485665,0.002208869,0.0007858796,0.65679175],"genre_scores_gemma":[0.90442175,0.001605259,0.0824946,0.0011996399,0.0025550486,0.0039294497,0.0015881464,0.0014319976,0.0007741277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9853034,0.00037675913,0.0028981632,0.0030075833,0.004164725,0.004249343],"domain_scores_gemma":[0.9840834,0.0033204376,0.0037122185,0.006683631,0.00037281643,0.0018274627],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.004072189,0.0015347671,0.00074995443,0.00088383444,0.003791586,0.0036310323,0.007379985,0.0026106115,0.12159589],"category_scores_gemma":[0.0028825707,0.0027420868,0.002548548,0.0016731616,0.0032754447,0.0025249897,0.0065784925,0.0025791845,0.0019478434],"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.0012661284,0.00055099843,0.0000039031083,0.002537781,0.0018711686,0.0011001568,0.0031907253,0.001149525,0.0030560624,0.83373976,0.14431588,0.0072179055],"study_design_scores_gemma":[0.0032662377,0.0016805929,0.000023453516,0.0016232352,0.0013237889,0.0008063793,0.0020598276,0.2544069,0.7235786,0.0054349904,0.0035103296,0.0022856807],"about_ca_topic_score_codex":0.00049034134,"about_ca_topic_score_gemma":0.00086285855,"teacher_disagreement_score":0.82830477,"about_ca_system_score_codex":0.000035036213,"about_ca_system_score_gemma":0.0017658789,"threshold_uncertainty_score":0.9997401},"labels":[],"label_agreement":null},{"id":"W2962922713","doi":"10.1016/j.dam.2018.12.017","title":"Quantum fractional revival on graphs","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Waterloo; York University","funders":"Natural Sciences and Engineering Research Council of Canada; Universidade Federal de Minas Gerais; Université de Montréal; Centre de Recherches Mathématiques","keywords":"Mathematics; Vertex (graph theory); Quantum walk; Quantum; Superposition principle; Quantum entanglement; Combinatorics; Discrete mathematics; Quantum algorithm; Quantum mechanics; Graph; Physics; Mathematical analysis","score_opus":0.009901371269682874,"score_gpt":0.23602318192251406,"score_spread":0.22612181065283118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962922713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19606104,0.00003600958,0.7543667,0.00088280736,0.00074238435,0.0005671925,0.00000727263,0.0005339353,0.046802647],"genre_scores_gemma":[0.80174375,0.0000068367412,0.1972567,0.00060123834,0.000111182926,0.000019488882,0.000007851824,0.000030767373,0.00022216544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985366,0.000013593737,0.00027026574,0.00040451885,0.0004680598,0.0003069975],"domain_scores_gemma":[0.99873185,0.0002307526,0.00014876305,0.000773012,0.000027832155,0.0000878142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023375716,0.00021150758,0.00025712166,0.00010212671,0.000118750766,0.00013022729,0.00071101583,0.00006694672,0.000047213678],"category_scores_gemma":[0.000015882413,0.00016570333,0.00011255378,0.00028268935,0.000030679355,0.00007936816,0.00019517819,0.00028386578,0.0008256363],"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.0000035758892,0.00006792751,0.000008132849,0.000059472626,0.000017318172,0.0000028703814,0.0004068401,0.0016955173,0.0009084303,0.9927572,0.00045748998,0.0036152427],"study_design_scores_gemma":[0.00034633777,0.000105135376,0.00018954271,0.000087474335,0.0000074261297,0.000020775331,0.000071455346,0.6287912,0.0007624486,0.36599985,0.0032714,0.00034692048],"about_ca_topic_score_codex":0.000001278595,"about_ca_topic_score_gemma":1.233679e-7,"teacher_disagreement_score":0.6270957,"about_ca_system_score_codex":0.000018088256,"about_ca_system_score_gemma":0.000029710482,"threshold_uncertainty_score":0.9999523},"labels":[],"label_agreement":null},{"id":"W2963191201","doi":"10.1016/j.dam.2017.02.027","title":"End-vertices of LBFS of (AT-free) bigraphs","year":2017,"lang":"en","type":"article","venue":"Discrete Applied 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":"University of Victoria","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.02677701066082994,"score_gpt":0.30300987381633354,"score_spread":0.2762328631555036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963191201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2494672,0.00024080234,0.62059957,0.00035722484,0.00014597327,0.00081126386,0.000059931845,0.00014557678,0.12817246],"genre_scores_gemma":[0.79403704,0.000033715223,0.2056082,0.000011087245,0.000012335385,0.000024503463,0.0000015258026,0.000016794136,0.00025480866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998335,0.000016917289,0.0004499827,0.0002916758,0.00059224543,0.0003141996],"domain_scores_gemma":[0.9954354,0.00028147112,0.0006368825,0.003454752,0.00009714315,0.00009434731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005111265,0.00016872554,0.00038561315,0.00014095451,0.00025182663,0.00006678039,0.0038730402,0.00006467247,0.000036139707],"category_scores_gemma":[0.00023477622,0.0001395066,0.00012286525,0.00017987496,0.00054737565,0.0002733632,0.001836472,0.000112376874,0.000021571921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011220842,0.000077501536,0.00009755932,0.00027955763,0.000039869858,0.000002236642,0.0013031104,0.000013042621,0.05102704,0.9442997,0.00006288441,0.0027862864],"study_design_scores_gemma":[0.00049628416,0.000055935012,0.0004509087,0.00006250469,0.000016469661,0.0000032379971,0.00015639896,0.0031313584,0.23834439,0.75696,0.0001451536,0.000177376],"about_ca_topic_score_codex":0.0000067508863,"about_ca_topic_score_gemma":0.000008283649,"teacher_disagreement_score":0.54456985,"about_ca_system_score_codex":0.00001519607,"about_ca_system_score_gemma":0.00003248976,"threshold_uncertainty_score":0.7197137},"labels":[],"label_agreement":null},{"id":"W2963690545","doi":"10.1016/j.dam.2017.07.016","title":"Burning a graph is hard","year":2017,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Discrete mathematics; Graph; Block graph; Line graph; Pathwidth","score_opus":0.02201358486141114,"score_gpt":0.2857251221677339,"score_spread":0.26371153730632274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963690545","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100599885,0.000019459983,0.42665318,0.00027094662,0.00004499027,0.00040889785,0.000028473387,0.00020504887,0.47176912],"genre_scores_gemma":[0.93512106,0.000002498553,0.06394329,0.000047025966,0.000181926,0.00007190637,0.000017829254,0.00003136581,0.00058308913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904734,0.0000042605056,0.00026149696,0.00023992259,0.00018900933,0.00025797065],"domain_scores_gemma":[0.9983938,0.000034439752,0.00034733376,0.001123249,0.00003093731,0.00007023903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015485096,0.0001904321,0.0003108885,0.000048450336,0.0004930503,0.00028501777,0.0005629898,0.00003266279,0.00068700995],"category_scores_gemma":[0.00000430852,0.0001686765,0.00018223902,0.000058730682,0.000089127985,0.000082899336,0.00023092428,0.00014359315,0.00011455467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004622884,0.00009931232,0.0026669567,0.0000453569,0.00026962213,0.0000012319532,0.0013864631,0.000011432867,0.003679229,0.9694502,0.008903699,0.013481886],"study_design_scores_gemma":[0.0003826698,0.000014175326,0.00091796526,0.00008018902,0.0002133976,6.532417e-7,0.0007290462,0.0057459995,0.012128187,0.9720461,0.0072067175,0.0005349056],"about_ca_topic_score_codex":0.000030724757,"about_ca_topic_score_gemma":0.0000014163189,"teacher_disagreement_score":0.8345212,"about_ca_system_score_codex":0.0000086493565,"about_ca_system_score_gemma":0.000011217003,"threshold_uncertainty_score":0.7522277},"labels":[],"label_agreement":null},{"id":"W2963978854","doi":"10.1016/j.dam.2019.03.016","title":"Polynomial size linear programs for problems in P","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Polytope; Combinatorics; Birkhoff polytope; Disjoint sets; Matching (statistics); Vertex (graph theory); Time complexity; Discrete mathematics; Logarithm; Graph","score_opus":0.021778639285503373,"score_gpt":0.25186257221554487,"score_spread":0.23008393293004148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963978854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052819602,0.000046582634,0.9222224,0.00041641787,0.0004207036,0.0042383196,0.000012371747,0.00039917463,0.019424438],"genre_scores_gemma":[0.26655677,0.0000035535447,0.73258203,0.00009847813,0.000072665614,0.0003443708,0.000009287708,0.000024324263,0.00030850322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986823,0.0000068627364,0.00035039184,0.0003588576,0.00022101721,0.0003805665],"domain_scores_gemma":[0.99895257,0.00023873996,0.00011600067,0.0006013864,0.000028460725,0.000062816085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003187224,0.00017813769,0.0002879711,0.0000677016,0.00005278189,0.00011457247,0.00079921813,0.000076938646,0.0000133129215],"category_scores_gemma":[0.000022756163,0.00015734218,0.00009834616,0.0003386687,0.000044195367,0.00013636032,0.00023273824,0.00013627605,0.000076849006],"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.0000306584,0.0010122311,0.0004102764,0.0016377415,0.000074893855,0.0000034543273,0.009639678,0.00069160236,0.0060600843,0.910799,0.0012621055,0.068378225],"study_design_scores_gemma":[0.003397882,0.0003284614,0.00027764813,0.00025484303,0.000020234225,0.000012491665,0.00061628217,0.6627471,0.0027330872,0.3096931,0.018865015,0.0010538638],"about_ca_topic_score_codex":0.0000051750794,"about_ca_topic_score_gemma":0.00000870622,"teacher_disagreement_score":0.6620555,"about_ca_system_score_codex":0.000024841922,"about_ca_system_score_gemma":0.000036522793,"threshold_uncertainty_score":0.6416228},"labels":[],"label_agreement":null},{"id":"W2964405395","doi":"10.1016/j.dam.2019.07.020","title":"The sandpile group of a polygon flower","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Theoretical and Computational Physics","field":"Physics and Astronomy","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Natural Sciences and Engineering Research Council of Canada; Department of Education, Fujian Province; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Mathematics; Combinatorics; Polygon (computer graphics); Laplacian matrix; Graph; Matrix (chemical analysis); Connectivity; Discrete mathematics; Computer science","score_opus":0.003020529649243452,"score_gpt":0.20218694167688048,"score_spread":0.19916641202763702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964405395","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62374187,0.000021530697,0.08463601,0.00008557249,0.00011389916,0.00042803056,0.000035617715,0.000028926666,0.29090855],"genre_scores_gemma":[0.9969725,5.014661e-7,0.0026862696,0.000017686729,0.000074015625,0.000020608286,0.000015852724,0.000014095281,0.00019848337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993806,0.0000055433306,0.0002011628,0.00010156802,0.00016690473,0.00014423182],"domain_scores_gemma":[0.99939567,0.00021586136,0.00009640262,0.00023684638,0.000022922946,0.0000322692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083980194,0.00009856504,0.00015034885,0.000008855479,0.000061303675,0.000024942869,0.00017530477,0.000016306254,0.00022740112],"category_scores_gemma":[0.0000013870678,0.0000610089,0.000084142324,0.000076580654,0.00007547838,0.000024136232,0.000064043226,0.00007535434,0.00018526221],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011120085,0.00006262022,0.00005259062,0.000020352958,0.000034279892,2.459732e-8,0.00020673877,0.000056531473,0.0027245814,0.9936793,0.00009502155,0.0030568305],"study_design_scores_gemma":[0.00026588747,0.000019368683,0.0001092907,0.000015355277,0.000019643385,1.0651784e-7,0.0008050479,0.0020326292,0.0038959987,0.9920083,0.00072163146,0.000106712374],"about_ca_topic_score_codex":0.000002596189,"about_ca_topic_score_gemma":1.4285445e-7,"teacher_disagreement_score":0.37323064,"about_ca_system_score_codex":0.0000036512645,"about_ca_system_score_gemma":0.000011073689,"threshold_uncertainty_score":0.24898829},"labels":[],"label_agreement":null},{"id":"W2982140946","doi":"10.1016/j.dam.2019.10.007","title":"The Brown–Erdős–Sós conjecture in finite abelian groups","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"European Research Council","keywords":"Mathematics; Combinatorics; Conjecture; Hypergraph; Abelian group; Integer (computer science); Discrete mathematics","score_opus":0.012937321587488256,"score_gpt":0.2558354507947821,"score_spread":0.24289812920729384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982140946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85730004,0.00031948715,0.005276122,0.00066563976,0.0008158239,0.0025880185,0.000048861115,0.0003299403,0.13265605],"genre_scores_gemma":[0.97938156,0.0000649635,0.018595673,0.00032485637,0.00012055922,0.0001047443,0.000013078853,0.00011149936,0.0012830655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976699,0.000048943537,0.0007402988,0.00040211846,0.00049448723,0.0006442599],"domain_scores_gemma":[0.9959613,0.0023097596,0.00031729077,0.0012701871,0.000038788563,0.000102648635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008668833,0.0004191529,0.00056816277,0.00011989441,0.0003388325,0.00011816813,0.0007948112,0.0002474077,0.000199605],"category_scores_gemma":[0.0002440667,0.0002565727,0.00018371546,0.00036817614,0.0002077624,0.000077774406,0.00029689187,0.000554136,0.00014625679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003181731,0.000053232667,0.00017978302,0.00030027577,0.00006167014,0.0000049128935,0.006284919,0.000034269277,0.00047265712,0.9911907,0.0006221738,0.000763589],"study_design_scores_gemma":[0.0008432087,0.000040957744,0.0002221229,0.0000988319,0.00004525089,0.000011097183,0.002129109,0.0011565153,0.00065480085,0.98913336,0.0052524838,0.00041226143],"about_ca_topic_score_codex":0.000003734321,"about_ca_topic_score_gemma":0.000025346379,"teacher_disagreement_score":0.13137299,"about_ca_system_score_codex":0.00005356634,"about_ca_system_score_gemma":0.00003314858,"threshold_uncertainty_score":0.9999887},"labels":[],"label_agreement":null},{"id":"W2988018498","doi":"10.1016/j.dam.2019.10.002","title":"A class of spectral bounds for Max <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e5114\" altimg=\"si111.svg\"><mml:mi>k</mml:mi></mml:math>-Cut","year":2019,"lang":"lv","type":"article","venue":"Discrete Applied 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":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Adjacency matrix; Eigenvalues and eigenvectors; Class (philosophy); Combinatorics; Enhanced Data Rates for GSM Evolution; Adjacency list; Simple (philosophy); Mathematics; Matrix (chemical analysis); Discrete mathematics; Algorithm; Computer science; Artificial intelligence; Graph; Physics","score_opus":0.020254356451401678,"score_gpt":0.27078287879754376,"score_spread":0.2505285223461421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988018498","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88299644,0.0002238763,0.10489367,0.00029001734,0.0006957654,0.0006302254,0.000355468,0.00020986272,0.009704686],"genre_scores_gemma":[0.9057494,0.00016557542,0.091663666,0.00027870495,0.00043867133,0.0006158655,0.00020816711,0.00031500275,0.0005649435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935432,0.000080963546,0.0015449291,0.0013393513,0.0017334757,0.0017580483],"domain_scores_gemma":[0.9938443,0.0013779061,0.0013308765,0.0027878631,0.000177021,0.00048203513],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017245425,0.0008036765,0.00080046395,0.00029557987,0.000564778,0.0006586444,0.0026447207,0.00070266693,0.00007831464],"category_scores_gemma":[0.00029315645,0.0008890329,0.00084755744,0.0008074866,0.00093895855,0.0006885716,0.0015978541,0.0009485243,0.001646679],"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.00038560177,0.00038559255,0.0000041600456,0.0027918539,0.00042541424,0.00005601344,0.0034852508,0.0005567504,0.008786489,0.98178595,0.00027334705,0.0010635455],"study_design_scores_gemma":[0.0013944329,0.00079391757,0.000010398672,0.00055530516,0.00025885072,0.000121178775,0.0016889266,0.87276447,0.018276015,0.10141934,0.001925675,0.00079149846],"about_ca_topic_score_codex":0.000027360687,"about_ca_topic_score_gemma":0.00003788123,"teacher_disagreement_score":0.8803666,"about_ca_system_score_codex":0.000057535166,"about_ca_system_score_gemma":0.0005600361,"threshold_uncertainty_score":0.99935603},"labels":[],"label_agreement":null},{"id":"W2990687474","doi":"10.1016/j.dam.2019.11.005","title":"Complexity of correspondence <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e421\" altimg=\"si177.svg\"><mml:mi>H</mml:mi></mml:math>-colourings","year":2019,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Scalable Vector Graphics; Combinatorics; Algorithm; Discrete mathematics; Computer science; World Wide Web","score_opus":0.02671753300352836,"score_gpt":0.27295696963847255,"score_spread":0.2462394366349442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990687474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90554243,0.00006437732,0.08700949,0.0001367064,0.00028145203,0.00023689761,0.00006548925,0.00020915896,0.006454026],"genre_scores_gemma":[0.9091181,0.000042571282,0.08998042,0.00020993673,0.000092876864,0.00020216644,0.00005180171,0.000105946325,0.0001961496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960538,0.0000655981,0.0008577102,0.000810051,0.0013180277,0.0008947821],"domain_scores_gemma":[0.9959396,0.00087855395,0.00077849935,0.002011102,0.00010877571,0.00028343924],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011992531,0.00042468656,0.00043738904,0.0001874815,0.00033345362,0.00026751694,0.0022865834,0.00031572834,0.00006337569],"category_scores_gemma":[0.00024248629,0.00045633857,0.0003228326,0.00062294526,0.0007545024,0.000538105,0.0017040182,0.00061960326,0.0016412828],"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.0001409868,0.00017101338,0.000008022697,0.0006896768,0.000099894234,0.000042343814,0.0019463479,0.00038625725,0.010121641,0.9857584,0.00010116376,0.0005342535],"study_design_scores_gemma":[0.00064039114,0.00027746137,0.000052474865,0.00027654332,0.00005935234,0.00008829546,0.00075307157,0.873514,0.022481294,0.10082701,0.00055504043,0.00047505053],"about_ca_topic_score_codex":0.000028069939,"about_ca_topic_score_gemma":0.000016371923,"teacher_disagreement_score":0.8849314,"about_ca_system_score_codex":0.000026131673,"about_ca_system_score_gemma":0.00022507895,"threshold_uncertainty_score":0.9997888},"labels":[],"label_agreement":null},{"id":"W2990922105","doi":"10.1016/j.dam.2019.11.011","title":"On the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e20\" altimg=\"si30.svg\"> <mml:msub> <mml:mrow> <mml:mi>P</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>3</mml:mn> </mml:mrow> </mml:msub> </mml:math> -hull number of Hamming graphs","year":2019,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"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":"Centre National de la Recherche Scientifique; Javna Agencija za Raziskovalno Dejavnost RS; Consejo Nacional de Investigaciones Científicas y Técnicas; Providence Health Care","keywords":"Convex hull; Cartesian product; Combinatorics; Mathematics; Vertex (graph theory); Cardinality (data modeling); Graph; Regular polygon; Discrete mathematics; Computer science; Geometry; Database","score_opus":0.01917206347645122,"score_gpt":0.2609959298693984,"score_spread":0.24182386639294717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990922105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5679777,0.00047026586,0.013174028,0.0006458683,0.0015476057,0.0001663774,0.00035445724,0.0002821007,0.41538155],"genre_scores_gemma":[0.97761166,0.0006292308,0.016574582,0.0011780091,0.0007719589,0.0012847948,0.00054268434,0.00082661747,0.00058043754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9878776,0.0004451998,0.0024512324,0.0022555871,0.003909814,0.0030605593],"domain_scores_gemma":[0.987151,0.0040060105,0.0027177809,0.00481196,0.00025080453,0.001062415],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["research_integrity","insufficient_payload"],"category_scores_codex":[0.0035768955,0.0012244266,0.00063411775,0.0005947471,0.0015518549,0.0015381047,0.0047947266,0.001815743,0.10618314],"category_scores_gemma":[0.0013349156,0.0018121424,0.0018666545,0.0020354262,0.00238372,0.0014585817,0.0036635785,0.002392259,0.0051931185],"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.00080672046,0.0004709757,0.000009863808,0.0021963848,0.0011776265,0.00041810112,0.0047181677,0.0013632734,0.0050688866,0.94165295,0.040317863,0.0017991805],"study_design_scores_gemma":[0.001848431,0.0010811848,0.00003123325,0.0017847795,0.0008785373,0.0006713788,0.004084283,0.18674603,0.78921497,0.010133387,0.0016144417,0.0019113299],"about_ca_topic_score_codex":0.0002904137,"about_ca_topic_score_gemma":0.00026147388,"teacher_disagreement_score":0.93151957,"about_ca_system_score_codex":0.000027088838,"about_ca_system_score_gemma":0.001107057,"threshold_uncertainty_score":0.9999093},"labels":[],"label_agreement":null},{"id":"W2997427396","doi":"10.1016/j.dam.2019.12.007","title":"Limited visibility Cops and Robber","year":2019,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; University of Prince Edward Island; Mount Saint Vincent University; Memorial University of Newfoundland; University of Saskatchewan; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotonic function; Visibility; Graph; Simple (philosophy); Variation (astronomy); Discrete mathematics; Combinatorics; Computer science; Theoretical computer science; Geography","score_opus":0.05360467367792884,"score_gpt":0.3479797151712505,"score_spread":0.29437504149332167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997427396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8407299,0.00001866335,0.016748816,0.00029365844,0.000042782314,0.0005751343,0.000018837556,0.00007247041,0.14149973],"genre_scores_gemma":[0.98300475,0.0000036601655,0.013964935,0.00018492297,0.00002154312,0.00003948428,0.0000063558737,0.000015349,0.0027590268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982635,0.000029944391,0.00051048707,0.00044191288,0.00054544245,0.0002087634],"domain_scores_gemma":[0.99726295,0.001249553,0.00019716042,0.0010987429,0.00007960923,0.00011197496],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015855143,0.00015268814,0.00031763193,0.00007534627,0.00010228757,0.00017318164,0.000456744,0.00007593886,0.0008331119],"category_scores_gemma":[0.0002837092,0.00010641386,0.000061502236,0.0004003914,0.00013446578,0.00010489673,0.0002007469,0.00012523509,0.002568255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016388072,0.000088082,0.0006235761,0.000032632848,0.000014100478,3.3251916e-7,0.001542067,0.00003527927,0.011763231,0.98031217,0.0010614016,0.0045107226],"study_design_scores_gemma":[0.00035280982,0.00002325127,0.002137964,0.000011582502,0.000020323887,0.000005198105,0.0032094799,0.0033405302,0.002212789,0.9811082,0.0073569394,0.00022093568],"about_ca_topic_score_codex":0.0000010490935,"about_ca_topic_score_gemma":0.0000015207104,"teacher_disagreement_score":0.14227481,"about_ca_system_score_codex":0.00001150631,"about_ca_system_score_gemma":0.000017077748,"threshold_uncertainty_score":0.99820834},"labels":[],"label_agreement":null},{"id":"W3000821546","doi":"10.5555/1704843.1705075","title":"Typical case complexity of Satisfiability Algorithms and the threshold phenomenon","year":2005,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Satisfiability; Mathematics; Algorithm; Phenomenon; Computational complexity theory; Boolean satisfiability problem; Subject (documents); Theoretical computer science; Computer science","score_opus":0.02678851015357779,"score_gpt":0.2563801699547778,"score_spread":0.2295916598012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000821546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026626147,0.000029340006,0.9604689,0.0012173926,0.000030704392,0.0004117238,0.000007560614,0.00006670132,0.011141559],"genre_scores_gemma":[0.6732351,0.000007244889,0.32663462,0.00007850912,0.000017214175,0.000012825245,0.0000014142847,0.0000039926276,0.000009090746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991837,0.000019653982,0.00031507498,0.00018493501,0.00017125225,0.00012536049],"domain_scores_gemma":[0.99917525,0.00017491473,0.00013215536,0.00042893286,0.000035443885,0.000053316362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004014759,0.00010790833,0.00021068518,0.000029219676,0.00011690285,0.00005878961,0.0001939509,0.00003967436,0.00004683148],"category_scores_gemma":[0.000023098026,0.00007241317,0.000039644725,0.00013451578,0.00051631953,0.000106976884,0.00015373428,0.0000986799,0.0000071426584],"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.000009947344,0.000033017925,0.000021870219,0.000032225482,0.000012114572,0.000001646492,0.0022471375,0.00019775449,0.000051532475,0.9722166,0.000018745523,0.025157416],"study_design_scores_gemma":[0.0012457909,0.000016938084,0.0004549253,0.000009455972,0.000024813817,0.00018863806,0.00055701606,0.7922133,0.00039547202,0.20463213,0.00009982687,0.00016167235],"about_ca_topic_score_codex":0.0000062027734,"about_ca_topic_score_gemma":0.000023679311,"teacher_disagreement_score":0.79201555,"about_ca_system_score_codex":0.00001864964,"about_ca_system_score_gemma":0.000018262934,"threshold_uncertainty_score":0.29529232},"labels":[],"label_agreement":null},{"id":"W3000916183","doi":"10.1016/j.dam.2020.08.007","title":"The threshold dimension of a graph","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto; University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Metric dimension; Vertex (graph theory); Graph; Discrete mathematics; Dimension (graph theory); Bound graph; Graph power; Line graph; Pathwidth","score_opus":0.02559084689143243,"score_gpt":0.24836980972496245,"score_spread":0.22277896283353002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000916183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02804438,0.0026192702,0.91775817,0.006429825,0.0016125096,0.0028112598,0.000045740802,0.001185837,0.039493017],"genre_scores_gemma":[0.74170804,0.0002676574,0.25747636,0.0002727146,0.000018327582,0.00013258238,0.00001963831,0.000050895964,0.000053781096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976571,0.00001974352,0.000755602,0.0005781616,0.0006636039,0.0003257819],"domain_scores_gemma":[0.9969517,0.00024070663,0.00064383924,0.00192165,0.00011280797,0.00012927852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053309987,0.0003548888,0.0005372587,0.000086436885,0.00020902687,0.00020540948,0.001927603,0.00020626589,0.0000023615871],"category_scores_gemma":[0.000045507462,0.00022840165,0.00025437525,0.00035320738,0.00019462222,0.000041384425,0.0027356034,0.0005557553,0.000033701748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000048622323,0.000045242403,0.0000017146524,0.00034357698,0.000070286325,0.0000023267955,0.0014260156,0.0004477459,0.005198816,0.9903957,0.0013901526,0.00067351485],"study_design_scores_gemma":[0.00017187437,0.000027251115,0.000004701018,0.00017081166,0.000046789155,0.0000021860776,0.000112167516,0.043517787,0.006324202,0.94919753,0.00016430223,0.0002603693],"about_ca_topic_score_codex":0.0000051488196,"about_ca_topic_score_gemma":0.0000013826352,"teacher_disagreement_score":0.7136637,"about_ca_system_score_codex":0.000012393229,"about_ca_system_score_gemma":0.00009187449,"threshold_uncertainty_score":0.9313949},"labels":[],"label_agreement":null},{"id":"W3011150841","doi":"10.1016/j.dam.2020.12.022","title":"On broadcasting time in the model of travelling agents","year":2020,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Broadcasting (networking); Computer science; Process (computing); Graph; Range (aeronautics); Distributed computing; Random graph; Message passing; Theoretical computer science; Computer network; Discrete mathematics; Mathematics; Engineering","score_opus":0.12532548711445765,"score_gpt":0.3360071129553111,"score_spread":0.21068162584085345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011150841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008086532,0.000016698017,0.9720941,0.00015666914,0.000051192892,0.0012004911,0.00024538377,0.00006694337,0.018081957],"genre_scores_gemma":[0.5812973,0.0000142760555,0.4179588,0.00023173603,0.00006993775,0.00020138221,0.000051180534,0.00012009635,0.00005534345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99716216,0.000029707557,0.0011051092,0.0005019015,0.00081738434,0.00038372778],"domain_scores_gemma":[0.99611294,0.002300191,0.0006858239,0.0007526379,0.000061281986,0.000087095876],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066731445,0.00048685062,0.000984257,0.000097796736,0.00006408058,0.00006381116,0.00093709235,0.0002949057,0.000045980392],"category_scores_gemma":[0.0013171695,0.0003541064,0.00017664593,0.00020091767,0.00006457787,0.000016588743,0.00041152726,0.00095468905,0.000045057466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034187964,0.00022654327,4.5009703e-8,0.0035418032,0.000054771775,0.000007670381,0.00789524,0.007908278,0.00063958444,0.97880095,0.0003993093,0.00049158547],"study_design_scores_gemma":[0.00016494546,0.000026155712,1.6354359e-7,0.00042062646,0.000096086515,0.0000010949483,0.00037356335,0.47068322,0.00022702548,0.52782595,0.0000010028184,0.0001801828],"about_ca_topic_score_codex":0.000001824078,"about_ca_topic_score_gemma":9.680965e-7,"teacher_disagreement_score":0.5732107,"about_ca_system_score_codex":0.00004602027,"about_ca_system_score_gemma":0.00010008867,"threshold_uncertainty_score":0.9998911},"labels":[],"label_agreement":null},{"id":"W3011227702","doi":"10.1016/j.dam.2020.03.013","title":"Hamiltonian cycles in covering graphs of trees","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Indifference graph; Cartesian product; Pathwidth; Chordal graph; Discrete mathematics; Graph product; Cograph; Modular decomposition; 1-planar graph; Vertex-transitive graph; Graph; Line graph; Voltage graph","score_opus":0.020596625041591966,"score_gpt":0.2312055570515828,"score_spread":0.21060893200999084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011227702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15086055,0.000049144997,0.82289904,0.00033301057,0.00011622929,0.0002906386,0.000003485879,0.000120109915,0.025327787],"genre_scores_gemma":[0.97065836,0.0000065605905,0.029154928,0.00011891572,0.000024519688,0.000015498701,9.3378105e-7,0.000009351776,0.0000109204875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991118,0.000010306919,0.00036918448,0.00018554577,0.0001672086,0.0001559639],"domain_scores_gemma":[0.9994715,0.00006532846,0.00013228324,0.00025976673,0.000016464477,0.00005468702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013902945,0.000106433945,0.0002554278,0.000056242534,0.000027019638,0.00004777918,0.00042035864,0.000043827535,0.000006951698],"category_scores_gemma":[0.000013552857,0.0000923216,0.000060549304,0.0003109605,0.000025665393,0.00009446118,0.00011991292,0.0000824942,0.000014511946],"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.000004720344,0.000033658278,0.00017338754,0.00016795457,0.000016999442,0.0000039882734,0.008986185,0.0018443828,0.0075462344,0.9796449,0.00019381309,0.0013837873],"study_design_scores_gemma":[0.0010502486,0.00013441234,0.0015315437,0.00029244623,0.000014890687,0.000011003318,0.0033778755,0.8829337,0.015249011,0.093731225,0.0010849731,0.000588667],"about_ca_topic_score_codex":0.0000087925,"about_ca_topic_score_gemma":0.000029407232,"teacher_disagreement_score":0.88591367,"about_ca_system_score_codex":0.000010490207,"about_ca_system_score_gemma":0.000011600701,"threshold_uncertainty_score":0.37647656},"labels":[],"label_agreement":null},{"id":"W3015766876","doi":"10.1016/j.dam.2020.03.034","title":"Algorithmic enumeration of surrounding polygons","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Computational Geometry and Mesh Generation","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":"McGill University","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Kayamori Foundation of Informational Science Advancement","keywords":"Enumeration; Mathematics; Combinatorics; Simple polygon; Polygon (computer graphics); Vertex (graph theory); Point in polygon; General position; Point (geometry); Euclidean space; Simple (philosophy); Quadratic equation; Set (abstract data type); Euclidean geometry; Plane (geometry); Time complexity; Monotone polygon; Computer science; Geometry; Graph","score_opus":0.024213076665276362,"score_gpt":0.24634424093120358,"score_spread":0.22213116426592722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015766876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011013726,0.000029726343,0.984013,0.0005918376,0.000066886794,0.00017148003,0.000004003666,0.00007996668,0.0040293247],"genre_scores_gemma":[0.6665328,0.0000033859685,0.33319485,0.00015327205,0.00006881834,0.00001022748,0.0000138420655,0.0000059635304,0.00001682265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915856,0.000009910643,0.0002779428,0.00018454174,0.0002524919,0.00011655515],"domain_scores_gemma":[0.999468,0.00008645094,0.0001399274,0.00018808697,0.000047457685,0.00007002854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013520663,0.00009565604,0.00015417242,0.00005451708,0.00006771231,0.00006314232,0.0002891207,0.000033148874,0.000014061451],"category_scores_gemma":[0.000036499823,0.00009208816,0.000045192344,0.00041279037,0.000018229232,0.00017328178,0.0000971889,0.00006144864,0.000035203455],"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.0000026527484,0.000036272,0.000004803048,0.00008966989,0.000018463306,8.64557e-7,0.0031275868,0.0023628452,0.063874245,0.91979,0.00022839519,0.010464198],"study_design_scores_gemma":[0.00038778302,0.00006810898,0.00008163148,0.000019039555,0.000019742361,0.000005668545,0.00027146479,0.8725595,0.08308503,0.042418037,0.0008346664,0.00024935603],"about_ca_topic_score_codex":0.000001055125,"about_ca_topic_score_gemma":2.7423866e-7,"teacher_disagreement_score":0.87737197,"about_ca_system_score_codex":0.000011970251,"about_ca_system_score_gemma":0.00004106745,"threshold_uncertainty_score":0.3755246},"labels":[],"label_agreement":null},{"id":"W3017097095","doi":"10.1016/j.dam.2020.04.001","title":"Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada","year":2020,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Graph; Property (philosophy); Enhanced Data Rates for GSM Evolution; Computer science; Artificial intelligence","score_opus":0.020516455690896142,"score_gpt":0.24476587544284775,"score_spread":0.22424941975195162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017097095","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00442855,0.000110655295,0.9862281,0.00087356113,0.000065911954,0.0005657248,0.00001568862,0.00013174878,0.0075800237],"genre_scores_gemma":[0.18339437,0.00007796288,0.814631,0.0014847914,0.000033141383,0.00009087748,0.000023953118,0.000046775804,0.00021715045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980782,0.000024507433,0.00034690055,0.0005381036,0.0005669364,0.00044533948],"domain_scores_gemma":[0.9984545,0.00034664446,0.00014801194,0.0006587384,0.00005250286,0.00033959342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015775244,0.0002806007,0.00032879485,0.00003704705,0.00018225807,0.0001442751,0.0008105954,0.00007430456,0.00007641701],"category_scores_gemma":[0.00006293987,0.00024223933,0.000048399514,0.00033308193,0.000090233734,0.0002739862,0.00030991176,0.0002605426,0.000005058846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039827457,0.000055697255,0.000059751183,0.00010971275,0.00007725515,0.000019588055,0.0035296488,0.017813297,0.00006492694,0.97086334,0.0032605815,0.0041063433],"study_design_scores_gemma":[0.0021347336,0.00038486626,0.00028078427,0.00020592802,0.00008093918,0.000023075485,0.002951569,0.57205445,0.001829404,0.41141382,0.0066854344,0.001955024],"about_ca_topic_score_codex":0.02658291,"about_ca_topic_score_gemma":0.3761815,"teacher_disagreement_score":0.55944955,"about_ca_system_score_codex":0.00021541386,"about_ca_system_score_gemma":0.0002676394,"threshold_uncertainty_score":0.9878233},"labels":[],"label_agreement":null},{"id":"W3018965338","doi":"10.1016/j.dam.2021.09.021","title":"Flexibility of planar graphs—Sharpening the tools to get lists of size four","year":2021,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Planar graph; List coloring; Vertex (graph theory); Mathematics; Graph; Mathematical proof; Discrete mathematics; Computer science; Graph power; Line graph; Geometry","score_opus":0.06250255365461961,"score_gpt":0.32508935840767045,"score_spread":0.26258680475305085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018965338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13639383,0.00012808369,0.85515463,0.00031790236,0.00015610502,0.0018269505,0.00014988316,0.00011185299,0.0057607396],"genre_scores_gemma":[0.5135759,0.000022273929,0.48600277,0.00006914054,0.000022986802,0.00019317106,0.000020488094,0.00003595551,0.00005731323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963423,0.00012798113,0.0010755953,0.00084134354,0.0011115154,0.0005012668],"domain_scores_gemma":[0.99283385,0.0022159836,0.0007424091,0.0037300999,0.00031487553,0.00016277531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018690475,0.0004221529,0.000988959,0.00015909808,0.00011254042,0.00022644311,0.0038943836,0.00021679551,0.00003702783],"category_scores_gemma":[0.0009218094,0.00031790495,0.00036025656,0.00077409926,0.00028655617,0.00014312023,0.003907067,0.0007566905,0.000008828846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045229495,0.00016276537,0.000024885714,0.0024327235,0.00021030603,0.000013295457,0.01025439,0.0029760322,0.014224983,0.9650747,0.00012299395,0.0044576926],"study_design_scores_gemma":[0.0002610274,0.000057755635,0.00026358478,0.000557576,0.000049910872,0.000008921018,0.0013066891,0.006350959,0.032017007,0.9585683,0.00007548759,0.00048278354],"about_ca_topic_score_codex":0.000012489377,"about_ca_topic_score_gemma":0.000012813765,"teacher_disagreement_score":0.37718207,"about_ca_system_score_codex":0.000050585986,"about_ca_system_score_gemma":0.00022436827,"threshold_uncertainty_score":0.9999273},"labels":[],"label_agreement":null},{"id":"W3019550124","doi":"10.1016/j.dam.2020.04.004","title":"Matroid optimization problems with monotone monomials in the objective","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Matroid; Mathematics; Submodular set function; Monomial; Polytope; Rank (graph theory); Combinatorics; Monomial basis; Polynomial; Polyhedron; Monotonic function; Monotone polygon; Discrete mathematics","score_opus":0.022588330717927436,"score_gpt":0.22246510055214663,"score_spread":0.1998767698342192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019550124","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002763418,0.00002074757,0.98662025,0.0015952105,0.000015986827,0.00078726077,0.0000036502495,0.00010956325,0.008083922],"genre_scores_gemma":[0.37176716,0.000012392337,0.62723917,0.00071696454,0.000040452673,0.00019593662,0.0000063814036,0.000016011592,0.0000055109267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989146,0.000025424051,0.00027113795,0.0002997778,0.00027047028,0.00021856948],"domain_scores_gemma":[0.99923277,0.0001302463,0.00013599407,0.00042252225,0.000025450156,0.00005302276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023822593,0.0001671156,0.00022416312,0.000049698705,0.00010150647,0.00019138426,0.000872037,0.00004009457,0.00000779646],"category_scores_gemma":[0.000015337391,0.00010869675,0.000039611026,0.0006161566,0.00006490845,0.00018698897,0.00015455522,0.0001687044,0.00001796647],"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.000018354063,0.00014783753,0.000018848232,0.00014644311,0.000035022284,0.000008837542,0.03921639,0.14128838,0.00036680186,0.8169257,0.00015443207,0.0016729303],"study_design_scores_gemma":[0.00054690416,0.00011237521,0.0000610075,0.000030875482,0.00001426192,0.000009655164,0.0019043023,0.9280029,0.0007591643,0.068166636,0.00012683622,0.00026509556],"about_ca_topic_score_codex":0.0000057565853,"about_ca_topic_score_gemma":0.000004542331,"teacher_disagreement_score":0.7867145,"about_ca_system_score_codex":0.000018117638,"about_ca_system_score_gemma":0.000029522827,"threshold_uncertainty_score":0.4432525},"labels":[],"label_agreement":null},{"id":"W3021544669","doi":"10.1016/j.dam.2020.04.031","title":"Preface: CALDAM 2016","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Metric (unit); Approximation algorithm; Combinatorics; Applied mathematics","score_opus":0.027686436379464836,"score_gpt":0.2527815976058852,"score_spread":0.22509516122642037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021544669","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016933389,0.000019546942,0.93073714,0.003037908,0.00003053283,0.0003074489,0.0000031363775,0.0003048858,0.06539009],"genre_scores_gemma":[0.09706451,0.00003807729,0.89970154,0.002371877,0.000071066184,0.00006463364,0.000009503927,0.0000287393,0.00065007346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998961,0.000010074443,0.00023226692,0.0002625955,0.0002939854,0.0002401263],"domain_scores_gemma":[0.9992465,0.000050734965,0.000075572294,0.00038845043,0.00003598312,0.00020279843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012498959,0.00012598227,0.00016572358,0.000027203354,0.00008027288,0.00015367354,0.0007126851,0.000047622543,0.00008900461],"category_scores_gemma":[0.000034771438,0.00010208149,0.000043089556,0.00027793171,0.000034944824,0.00016108909,0.00029634614,0.000119211465,0.0006921513],"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.0000026173873,0.000048392903,0.0000025623012,0.00013288108,0.000017885235,0.000003204656,0.0054130866,0.0011578467,0.003117233,0.9762374,0.010317427,0.003549465],"study_design_scores_gemma":[0.0006842636,0.00007562986,0.000012501726,0.000030297057,0.000010903528,0.0000036476536,0.00032451432,0.926555,0.004902042,0.043898,0.02306128,0.0004419369],"about_ca_topic_score_codex":6.5926184e-7,"about_ca_topic_score_gemma":1.8642588e-7,"teacher_disagreement_score":0.9323394,"about_ca_system_score_codex":0.000011499676,"about_ca_system_score_gemma":0.000048967264,"threshold_uncertainty_score":0.88964355},"labels":[],"label_agreement":null},{"id":"W3033173111","doi":"10.1016/j.dam.2023.02.017","title":"A note on the connected game coloring number","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; List coloring; Degeneracy (biology); Fractional coloring; Complete coloring; Discrete mathematics; Graph coloring; Graph; Game tree; Edge coloring; Greedy coloring; Bounded function; Graph power; Sequential game; Game theory; Line graph; Mathematical economics","score_opus":0.03692038711881336,"score_gpt":0.3151873344760995,"score_spread":0.27826694735728613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033173111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1362916,0.00000523129,0.7497714,0.0027045736,0.00019270524,0.0012767991,0.000011790763,0.0015178315,0.10822808],"genre_scores_gemma":[0.9630505,0.000011659325,0.035448603,0.00034266664,0.000051564493,0.0003136529,0.000005321373,0.000044206834,0.0007318703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833095,0.0000369929,0.00024811906,0.00034240546,0.0005394732,0.0005020733],"domain_scores_gemma":[0.9970459,0.001633083,0.000097679316,0.0010862552,0.00004721872,0.00008990492],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006988159,0.0001850765,0.00020408245,0.000092245464,0.0002090499,0.00015933448,0.0012715327,0.000057308822,0.00005611215],"category_scores_gemma":[0.00022279953,0.00012229588,0.00007246829,0.0012852208,0.00012261054,0.00010343446,0.00051599223,0.00028373857,0.0030517257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071372597,0.000022018063,0.0000030114365,0.000028111166,0.000014847489,0.000010132998,0.0018634276,0.00017102581,0.0036380084,0.9927033,0.00050833466,0.0010306204],"study_design_scores_gemma":[0.0002999472,0.000031017153,0.000076787066,0.000044595876,0.0000061887004,0.0000072882503,0.00053462357,0.07841515,0.011515899,0.9068706,0.0019334989,0.0002643869],"about_ca_topic_score_codex":7.450696e-7,"about_ca_topic_score_gemma":0.0000010544079,"teacher_disagreement_score":0.82675886,"about_ca_system_score_codex":0.000035298177,"about_ca_system_score_gemma":0.000030318617,"threshold_uncertainty_score":0.99772453},"labels":[],"label_agreement":null},{"id":"W3034503485","doi":"10.1016/j.dam.2020.05.005","title":"A short note on the existence of infinite sequences of <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e92\" altimg=\"si14.svg\"><mml:mi>γ</mml:mi></mml:math>-graphs of graphs","year":2020,"lang":"lv","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Graph; Discrete mathematics; Sequence (biology)","score_opus":0.03701922180791595,"score_gpt":0.2808667488443835,"score_spread":0.24384752703646756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034503485","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96795654,0.0002739847,0.02593564,0.00037849334,0.00018112303,0.00035179133,0.00030550762,0.000093622206,0.004523271],"genre_scores_gemma":[0.9640478,0.00038946257,0.034755424,0.00032866417,0.000077508295,0.00022284893,0.000045281096,0.00011848525,0.000014562657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942058,0.0001445072,0.0017186076,0.00094974204,0.0020584718,0.0009228757],"domain_scores_gemma":[0.99369043,0.0020796398,0.0015304083,0.0021308814,0.00021345292,0.0003551929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015883787,0.00063064933,0.0007452563,0.00025031884,0.0003828242,0.00018999756,0.0029521643,0.00043035744,0.000028643737],"category_scores_gemma":[0.00058936665,0.00057294883,0.00071457966,0.0015554854,0.0021640223,0.00039651236,0.0014314258,0.00089884404,0.00017220719],"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.00026504396,0.0002498994,0.000008876495,0.0021009918,0.00029368748,0.000048858692,0.008055741,0.0008581005,0.021335382,0.9655567,0.000034714696,0.0011920123],"study_design_scores_gemma":[0.0004928381,0.00095151964,0.000028300416,0.0010960955,0.00026590656,0.000038939183,0.0032536872,0.78653324,0.087764375,0.11889682,0.000104595805,0.00057365495],"about_ca_topic_score_codex":0.000036913923,"about_ca_topic_score_gemma":0.000015965417,"teacher_disagreement_score":0.8466599,"about_ca_system_score_codex":0.000013808813,"about_ca_system_score_gemma":0.00035684198,"threshold_uncertainty_score":0.9996722},"labels":[],"label_agreement":null},{"id":"W3042574210","doi":"10.1016/j.dam.2020.04.027","title":"Optimal online and offline algorithms for robot-assisted restoration of barrier coverage","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Competitive analysis; Algorithm; Online algorithm; Trajectory; Mobile robot; Position (finance); Upper and lower bounds; Computer science; Mathematics; Artificial intelligence","score_opus":0.03960009337925794,"score_gpt":0.2735784604253882,"score_spread":0.23397836704613026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042574210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008995021,0.00005470398,0.9887501,0.0005988619,0.00006696906,0.0008502569,0.00030001957,0.00011214017,0.00027190236],"genre_scores_gemma":[0.5189889,0.0000055663313,0.48053756,0.00014048234,0.00007318631,0.00006492707,0.00013962194,0.000020012645,0.000029758576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985454,0.000016773949,0.0005704291,0.0003494089,0.00029883688,0.00021915487],"domain_scores_gemma":[0.9988146,0.00016639181,0.00034849747,0.00040610073,0.000109680186,0.0001547445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021332977,0.00019892177,0.00042961648,0.0000436304,0.00006789475,0.00009837054,0.0004421658,0.00008632639,0.0000038006074],"category_scores_gemma":[0.00012419777,0.00017955837,0.00007744277,0.00021578807,0.000046375226,0.00017812796,0.00015883162,0.00008621487,0.0000050538574],"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.00026097475,0.00085493363,0.000042938802,0.0031572902,0.00054251775,0.000018972982,0.0115781985,0.014978024,0.37397888,0.5407706,0.0025936267,0.05122306],"study_design_scores_gemma":[0.0018458194,0.00014490166,0.00016022261,0.000042936008,0.000054554635,0.0000045076613,0.00028369558,0.9890636,0.0056727026,0.001483062,0.000984448,0.00025951394],"about_ca_topic_score_codex":0.0000026334424,"about_ca_topic_score_gemma":0.0000014843084,"teacher_disagreement_score":0.9740856,"about_ca_system_score_codex":0.000023303128,"about_ca_system_score_gemma":0.00004761604,"threshold_uncertainty_score":0.7322178},"labels":[],"label_agreement":null},{"id":"W3043877875","doi":"10.1016/j.dam.2020.07.010","title":"2-limited broadcast domination in subcubic graphs","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Johannesburg","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Domination analysis; Graph; Induced subgraph; Connectivity; Discrete mathematics","score_opus":0.02702497115867646,"score_gpt":0.2769321981802712,"score_spread":0.24990722702159474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043877875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049738586,0.00005939004,0.9340894,0.0012283982,0.00004096305,0.00067364506,0.0000048011666,0.00027172847,0.013893066],"genre_scores_gemma":[0.834309,0.000020719373,0.16517949,0.00032789097,0.00001938268,0.00008149439,0.000008816286,0.000025514351,0.000027729762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834085,0.00003336405,0.00037768393,0.0004202476,0.00043964767,0.000388222],"domain_scores_gemma":[0.99891055,0.0002224016,0.0001206041,0.0005428968,0.000045514087,0.00015803162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003436535,0.00019028233,0.0002692232,0.00020066576,0.00007148917,0.00011324615,0.0010058951,0.00006946182,0.000020266154],"category_scores_gemma":[0.000113955044,0.00017594063,0.00006701036,0.0014450521,0.00008490154,0.00028524332,0.00033745408,0.00025549522,0.00015382963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017375862,0.000056570643,0.000030192445,0.000097416414,0.000009106227,0.000013558406,0.003944255,0.00015734999,0.013436161,0.9727857,0.000076959026,0.0093753375],"study_design_scores_gemma":[0.0013241506,0.00009612587,0.00025754547,0.000043896816,0.000008754431,0.000007832917,0.0009305929,0.16476098,0.014666903,0.81680405,0.00060314743,0.00049602246],"about_ca_topic_score_codex":0.0000011945529,"about_ca_topic_score_gemma":0.0000017626969,"teacher_disagreement_score":0.7845704,"about_ca_system_score_codex":0.00003286282,"about_ca_system_score_gemma":0.000028243176,"threshold_uncertainty_score":0.71746504},"labels":[],"label_agreement":null},{"id":"W3093127399","doi":"10.1016/j.dam.2020.09.022","title":"Eulerian orientations and vertex-connectivity","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"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":"University of Waterloo","keywords":"Eulerian path; Combinatorics; Mathematics; Bipartite graph; Vertex (graph theory); 1-planar graph; Discrete mathematics; Line graph; Indifference graph; Modular decomposition; Orientation (vector space); Pathwidth; Graph; Geometry","score_opus":0.019939516798493075,"score_gpt":0.23010295599416297,"score_spread":0.2101634391956699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093127399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02244738,0.00001691202,0.9545291,0.0010817678,0.00016336261,0.00022409245,0.00000304391,0.00017576331,0.021358546],"genre_scores_gemma":[0.9616227,0.000004086956,0.037671678,0.0005555439,0.00006555578,0.0000322642,0.0000022378772,0.000010622081,0.000035316752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992155,0.000013321315,0.00021075286,0.00026050163,0.00014087852,0.00015908295],"domain_scores_gemma":[0.9994144,0.00010254036,0.00008298376,0.00024994576,0.000026984104,0.00012319135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012064217,0.00011599526,0.00018151711,0.000024370802,0.00013133675,0.00017251994,0.00025131062,0.000043183598,0.00001829534],"category_scores_gemma":[0.000031324143,0.00010086717,0.00003577301,0.00020812689,0.000029239442,0.00016568271,0.00013964585,0.00008779359,0.000065307286],"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.0000020895468,0.000016074144,0.0000124256585,0.000052451793,0.000016469814,0.000001886955,0.0060214605,0.00006528525,0.0014684206,0.9897125,0.00084951177,0.0017814348],"study_design_scores_gemma":[0.0010139844,0.0001562798,0.00028700047,0.00005773488,0.000034696444,0.000041713232,0.003435821,0.8694136,0.0035422551,0.11262966,0.008701214,0.0006859957],"about_ca_topic_score_codex":0.000003170341,"about_ca_topic_score_gemma":0.000003671907,"teacher_disagreement_score":0.9391753,"about_ca_system_score_codex":0.000011293545,"about_ca_system_score_gemma":0.00001438592,"threshold_uncertainty_score":0.41132438},"labels":[],"label_agreement":null},{"id":"W3104490375","doi":"10.1016/j.dam.2020.09.028","title":"A geometric lower bound on the extension complexity of polytopes based on the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e1733\" altimg=\"si5.svg\"> <mml:mi>f</mml:mi> </mml:math> -vector","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds Wetenschappelijk Onderzoek; Fédération Wallonie-Bruxelles; Fonds De La Recherche Scientifique - FNRS; European Resuscitation Council; European Research Council; Institut national de la recherche scientifique","keywords":"Polytope; Mathematics; Combinatorics; Extension (predicate logic); Rank (graph theory); Affine transformation; Monotone polygon; Generalization; Polyhedral combinatorics; Upper and lower bounds; Matrix (chemical analysis); Polytope model; Discrete mathematics; Computer science; Geometry; Regular polygon","score_opus":0.02682975593205257,"score_gpt":0.22447548181883936,"score_spread":0.1976457258867868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104490375","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98692065,0.0000872634,0.005326861,0.00045425797,0.00027030535,0.00024800017,0.00014067897,0.00021044546,0.006341507],"genre_scores_gemma":[0.9976217,0.000023031494,0.0010281929,0.0007154429,0.00019259426,0.00020414684,0.00006426432,0.00013762362,0.0000130079525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977254,0.00005732526,0.00064782036,0.00037969544,0.0007180812,0.0004716413],"domain_scores_gemma":[0.99742204,0.0010175153,0.00034476767,0.0010230043,0.000036250374,0.00015640284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007001785,0.0004008722,0.0003515952,0.00010633846,0.00035254174,0.00016360174,0.0006443008,0.00023899681,0.00007382333],"category_scores_gemma":[0.0002566189,0.00030041518,0.00034770402,0.0005967619,0.00033617966,0.00008601746,0.00016863384,0.0004889502,0.000511398],"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.0001315206,0.00011953405,8.660009e-7,0.00066732295,0.00015177972,0.00001726436,0.0011014469,0.002712287,0.00634195,0.9881603,0.0004945671,0.00010112105],"study_design_scores_gemma":[0.00038454522,0.0002478465,0.000033716155,0.00033648245,0.00015729261,0.000014011026,0.0014210417,0.97329134,0.017777085,0.0052764877,0.0007154864,0.0003446825],"about_ca_topic_score_codex":0.000016604747,"about_ca_topic_score_gemma":0.00000804002,"teacher_disagreement_score":0.9828839,"about_ca_system_score_codex":0.000014588695,"about_ca_system_score_gemma":0.000045025776,"threshold_uncertainty_score":0.9999448},"labels":[],"label_agreement":null},{"id":"W3117130048","doi":"10.1016/j.dam.2021.07.018","title":"A note on connected greedy edge colouring","year":2021,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Fonds De La Recherche Scientifique - FNRS; Fonds National de la Recherche Luxembourg; Agence Nationale de la Recherche","keywords":"Combinatorics; Mathematics; Edge coloring; Bipartite graph; Chromatic scale; Graph; Greedy algorithm; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Algorithm; Line graph; Graph power; Artificial intelligence","score_opus":0.02276349048740975,"score_gpt":0.25534694529312396,"score_spread":0.2325834548057142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117130048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14810917,0.000319874,0.80337167,0.0010978447,0.0017684086,0.0016822862,0.0000346311,0.0017103149,0.041905787],"genre_scores_gemma":[0.5827524,0.00003597126,0.41614118,0.0005426798,0.000034119123,0.00019425854,0.00007299815,0.00006830584,0.00015808518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708104,0.00003813647,0.0006861698,0.0010269036,0.0006557058,0.0005120479],"domain_scores_gemma":[0.99667805,0.0003022194,0.0004722004,0.0021854118,0.000164307,0.00019779835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045856446,0.0005371682,0.00074480346,0.00021443577,0.00019191082,0.0006015793,0.0014415662,0.0004038179,0.00002432501],"category_scores_gemma":[0.00010289619,0.00049050606,0.00023734431,0.00038794626,0.000082673156,0.00006757324,0.0023069142,0.000884022,0.00013803678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007882989,0.0002986931,0.0000017821018,0.0009047156,0.00012359906,0.000061730156,0.0051196283,0.003539773,0.0075984583,0.97990555,0.0007923594,0.001645803],"study_design_scores_gemma":[0.001114495,0.00010136679,0.000037121725,0.0016977227,0.00014166816,0.000028961449,0.00044207796,0.23257369,0.021633686,0.740295,0.00029905545,0.0016351702],"about_ca_topic_score_codex":0.000012023148,"about_ca_topic_score_gemma":0.0000063891653,"teacher_disagreement_score":0.4346432,"about_ca_system_score_codex":0.00006726915,"about_ca_system_score_gemma":0.00019714091,"threshold_uncertainty_score":0.99975467},"labels":[],"label_agreement":null},{"id":"W312445613","doi":"10.1016/j.dam.2005.05.004","title":"The resolution complexity of random graph k-colorability","year":2005,"lang":"en","type":"article","venue":"Discrete Applied 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":"Simon Fraser University; University of Alberta","funders":"","keywords":"Combinatorics; Mathematics; Mathematical proof; Upper and lower bounds; Discrete mathematics; Random graph; Graph; Exponential function","score_opus":0.03941499046506563,"score_gpt":0.3009212942072034,"score_spread":0.2615063037421378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W312445613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01610676,0.00010482287,0.9690558,0.0008490546,0.000039298353,0.00065880123,0.0000063519333,0.000118489676,0.013060621],"genre_scores_gemma":[0.7141351,0.000026834723,0.2856564,0.00002888898,0.000024119692,0.000070315335,0.0000021193428,0.000010515253,0.00004570196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983244,0.00007226803,0.00047409357,0.00027013416,0.0005010048,0.00035809152],"domain_scores_gemma":[0.997604,0.000773826,0.00021778994,0.0012226877,0.00010331728,0.00007837446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016304188,0.00014633163,0.00026592525,0.000062758525,0.00032973502,0.000070338654,0.0012652477,0.00005115693,0.000008451779],"category_scores_gemma":[0.00015129814,0.000096525815,0.00011850156,0.00048031125,0.000830609,0.00017675776,0.000380397,0.00018822793,0.00003222345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047594192,0.00006944863,0.0000052610785,0.00003976205,0.00001696081,2.0360972e-7,0.0006619921,0.00028945343,0.0022595495,0.9910005,0.00008913181,0.005520143],"study_design_scores_gemma":[0.0006265769,0.00002696225,0.00011982786,0.000010288492,0.000006711996,0.0000023864402,0.00018320298,0.04455197,0.00865703,0.9449202,0.00077384117,0.000121022655],"about_ca_topic_score_codex":0.0000021257172,"about_ca_topic_score_gemma":0.000015647549,"teacher_disagreement_score":0.6980283,"about_ca_system_score_codex":0.000040176903,"about_ca_system_score_gemma":0.00003425008,"threshold_uncertainty_score":0.39362085},"labels":[],"label_agreement":null},{"id":"W3127781635","doi":"10.1016/j.dam.2021.01.014","title":"A relation between proximity and the third largest distance eigenvalue of a graph","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; University of Regina","funders":"","keywords":"Mathematics; Distance matrix; Combinatorics; Resistance distance; Distance-regular graph; Graph; Connectivity; Butterfly graph; Vertex (graph theory); Graph power; Eigenvalues and eigenvectors; Regular graph; Discrete mathematics; Line graph; Voltage graph","score_opus":0.026710223647579544,"score_gpt":0.2760365620352981,"score_spread":0.24932633838771853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127781635","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6740976,0.00032677132,0.2811926,0.0008330348,0.000042552518,0.0018166526,0.00012344263,0.00016329708,0.041404042],"genre_scores_gemma":[0.9416486,0.00005184929,0.05779273,0.000033857305,0.000032964508,0.00019001347,0.000027565118,0.000030036801,0.00019235296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986581,0.00006800782,0.0005525119,0.00025055505,0.00027338456,0.00019739053],"domain_scores_gemma":[0.9974749,0.0013049463,0.00036840868,0.0007055997,0.00008678798,0.000059365804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008830101,0.00018917359,0.00045532137,0.000038098122,0.00022536425,0.00003690111,0.00020723046,0.0001012222,0.000018321778],"category_scores_gemma":[0.0002849122,0.00013068944,0.00012805198,0.00038158774,0.00041032897,0.000069201604,0.00011573954,0.00020859677,0.000006504047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017964785,0.00008779246,0.00027758355,0.00037480253,0.00007102171,5.6667164e-7,0.0023364723,0.0000016807413,0.0008267848,0.9957805,0.00008787826,0.00013689502],"study_design_scores_gemma":[0.00077705085,0.000007069657,0.00071299064,0.000071466515,0.00023727263,0.0000053950967,0.0010959804,0.00018102994,0.004681041,0.99189216,0.00018717247,0.00015139839],"about_ca_topic_score_codex":0.0000018725715,"about_ca_topic_score_gemma":0.000007745568,"teacher_disagreement_score":0.26755103,"about_ca_system_score_codex":0.000009958227,"about_ca_system_score_gemma":0.000030551168,"threshold_uncertainty_score":0.53293604},"labels":[],"label_agreement":null},{"id":"W3128778098","doi":"10.1016/j.dam.2023.04.006","title":"The iterated local transitivity model for hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vancouver Island University; University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transitive relation; Hypergraph; Iterated function; Mathematics; Order (exchange); Combinatorics; Homomorphism; Generative model; Generative grammar; Discrete mathematics; Computer science; Artificial intelligence","score_opus":0.01794489169670177,"score_gpt":0.27184067483851926,"score_spread":0.2538957831418175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128778098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014199462,0.000006369778,0.97797513,0.00016992334,0.000013651401,0.000486727,0.00005953656,0.00024157172,0.0068476023],"genre_scores_gemma":[0.98541147,0.0000037869731,0.013489055,0.000023273866,0.00007474261,0.00044520936,0.00013473674,0.000036016572,0.00038173114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.000008299708,0.00026299903,0.00019035011,0.00014913833,0.00031476017],"domain_scores_gemma":[0.9991913,0.00027114127,0.00008370119,0.00036238777,0.00004342594,0.000048030855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030384885,0.0001650864,0.00022907695,0.000045167635,0.0003205419,0.000082789404,0.00022432118,0.00003113255,0.0000127368785],"category_scores_gemma":[0.0000024470419,0.000116045936,0.00018981841,0.00034712398,0.00008896064,0.000032329932,0.000049728333,0.00009479287,0.000023160386],"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.000015303805,0.00005133946,0.00001363161,0.00003324969,0.00014924345,2.0419348e-7,0.00085520087,0.007861891,0.0019348202,0.965477,0.0047737667,0.01883435],"study_design_scores_gemma":[0.00012186595,0.0000048583647,0.0000047407284,0.000006998313,0.000049002832,6.799882e-8,0.00039069314,0.6710926,0.0011143577,0.3265459,0.0005599312,0.0001089525],"about_ca_topic_score_codex":0.000003859764,"about_ca_topic_score_gemma":0.000006831024,"teacher_disagreement_score":0.97121197,"about_ca_system_score_codex":0.000009810217,"about_ca_system_score_gemma":0.000019527613,"threshold_uncertainty_score":0.47322157},"labels":[],"label_agreement":null},{"id":"W3132155589","doi":"10.1016/j.dam.2022.11.016","title":"On the foundations and extremal structure of the holographic entropy cone","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Black Holes and Theoretical Physics","field":"Physics and Astronomy","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Japan Society for the Promotion of Science; University of California, Santa Barbara; National Science Foundation","keywords":"Mathematics; Mathematical proof; Graph; Entropy (arrow of time); Holography; Light cone; Discrete mathematics; Combinatorics; Geometry","score_opus":0.007261936745808826,"score_gpt":0.21444343627857437,"score_spread":0.20718149953276555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132155589","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757662,0.000006382392,0.0055211843,0.00047068973,0.000046968966,0.00038264543,0.0001893894,0.000009681971,0.017606903],"genre_scores_gemma":[0.99946535,3.9566206e-7,0.00031684374,0.000094925315,0.00003259052,0.000029579573,0.000016245318,0.000013492099,0.000030605883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994116,0.00002500647,0.00014951412,0.00011216668,0.0001815352,0.00012022177],"domain_scores_gemma":[0.99930525,0.00020085524,0.00012349352,0.0003354722,0.0000126993,0.000022230504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007032591,0.00010263613,0.00013221057,0.000013177063,0.00033577255,0.000022319162,0.00022088058,0.00001275242,0.00058930094],"category_scores_gemma":[0.0000037846726,0.000055569868,0.000073074094,0.0001522828,0.0002628591,0.000011393799,0.00020024719,0.00021757437,0.0000020860052],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051325974,0.000056263903,0.00008624106,0.00000976866,0.00003780808,3.6043808e-8,0.00045343628,0.000055821456,0.0022982317,0.9967473,0.00010603786,0.00014392645],"study_design_scores_gemma":[0.0001680005,0.000018587356,0.00014567688,0.0000051122784,0.00004403116,3.968289e-7,0.001758297,0.000387371,0.0018813959,0.9953891,0.000132721,0.0000693287],"about_ca_topic_score_codex":0.0000023194561,"about_ca_topic_score_gemma":2.3921976e-7,"teacher_disagreement_score":0.023699166,"about_ca_system_score_codex":0.0000046969103,"about_ca_system_score_gemma":0.000012102224,"threshold_uncertainty_score":0.64524317},"labels":[],"label_agreement":null},{"id":"W3133770809","doi":"10.1016/j.dam.2021.02.026","title":"Cops and an Insightful Robber","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Mathematics; Upper and lower bounds; Graph; Hypercube; Combinatorics; Simple (philosophy); Computer science; Discrete mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.02153216830304185,"score_gpt":0.2727909043294377,"score_spread":0.25125873602639587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133770809","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003953872,0.000053002994,0.94004685,0.0004264749,0.000040174404,0.00015234473,0.0000014807904,0.00014243144,0.055183373],"genre_scores_gemma":[0.14283273,0.00005903767,0.85582924,0.0005696559,0.000030907464,0.000026194273,0.000017155342,0.000017303531,0.0006177697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991604,0.000017112234,0.00017600777,0.0002603423,0.00020519021,0.0001809246],"domain_scores_gemma":[0.9992147,0.000051265157,0.00004738665,0.0004903291,0.000065355,0.00013093076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014471405,0.00010306663,0.00014314058,0.000035563247,0.00009815302,0.00026756758,0.0002614906,0.000046065146,0.00005688977],"category_scores_gemma":[0.00001941751,0.000089609624,0.000019656793,0.00022449456,0.000039566825,0.0002379289,0.00024537,0.00008834776,0.000045442695],"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":[6.055011e-7,0.00006202223,0.000006844959,0.000040972733,0.00000886445,0.000008062472,0.0026499778,0.0001532684,0.0026385162,0.9911728,0.0002408925,0.0030171755],"study_design_scores_gemma":[0.0010307522,0.00007128287,0.00013399638,0.000049389197,0.00001968942,0.00006830323,0.0013289716,0.6498864,0.014885682,0.32316747,0.008710269,0.000647736],"about_ca_topic_score_codex":7.9096526e-7,"about_ca_topic_score_gemma":0.000004017465,"teacher_disagreement_score":0.66800535,"about_ca_system_score_codex":0.000008941595,"about_ca_system_score_gemma":0.000048131937,"threshold_uncertainty_score":0.36541745},"labels":[],"label_agreement":null},{"id":"W3157723870","doi":"10.1016/j.dam.2022.08.011","title":"Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Chordal graph; Fractional coloring; Greedy coloring; Graph coloring; Complete coloring; Discrete mathematics; Conjecture; List coloring; Edge coloring; Graph; Graph power; Line graph","score_opus":0.021172280236653487,"score_gpt":0.24166617480234112,"score_spread":0.22049389456568763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157723870","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9710233,0.00013654643,0.02445349,0.00061116973,0.00008451399,0.0012423473,0.000011779063,0.000022687494,0.0024141395],"genre_scores_gemma":[0.9884887,0.000015093655,0.010895697,0.00013103834,0.0000014412049,0.00041392236,8.607587e-7,0.000008112738,0.00004512982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901813,0.000018848841,0.0003218507,0.00016088028,0.00031887577,0.00016140546],"domain_scores_gemma":[0.9990644,0.00028312812,0.00018429532,0.000415302,0.000035099165,0.000017760414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958861,0.000101756734,0.00019584163,0.00004775705,0.00019197377,0.000037971266,0.0006035569,0.00002106106,0.000005746054],"category_scores_gemma":[0.00001752368,0.00005602111,0.00006290573,0.00032425192,0.00015733474,0.000042943982,0.0003180457,0.000105783576,5.838007e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003902073,0.00021219172,0.00007410273,0.00031495318,0.00003648929,9.675151e-7,0.017987538,0.0010739445,0.0056004077,0.9742235,0.00024834165,0.00018856408],"study_design_scores_gemma":[0.0020342187,0.00049660093,0.00027245807,0.0001277243,0.00009697683,0.000033166292,0.011833354,0.0789812,0.009364127,0.8949592,0.0013872233,0.0004137654],"about_ca_topic_score_codex":0.000016119533,"about_ca_topic_score_gemma":0.0000025239597,"teacher_disagreement_score":0.07926429,"about_ca_system_score_codex":0.000008417898,"about_ca_system_score_gemma":0.000028334363,"threshold_uncertainty_score":0.22844745},"labels":[],"label_agreement":null},{"id":"W3172838083","doi":"10.1016/j.dam.2022.07.019","title":"Transverse rigidity is prestress stability","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Alfred P. Sloan Foundation","keywords":"Rigidity (electromagnetism); Transverse plane; Mathematics; Structural rigidity; Geometry; Structural engineering; Engineering","score_opus":0.012563025453384322,"score_gpt":0.1972422386297764,"score_spread":0.18467921317639208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172838083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91806155,0.00007826496,0.049488146,0.00007106741,0.00015480194,0.00045503108,0.00023613864,0.00043408177,0.031020919],"genre_scores_gemma":[0.9906148,0.000011574356,0.009131113,0.000025726158,0.000021895512,0.000072797535,0.00005642266,0.000023356894,0.000042339565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925214,0.0000068578483,0.00021737479,0.00013661294,0.00023510183,0.00015190276],"domain_scores_gemma":[0.99960864,0.00002688923,0.000035414258,0.00027350555,0.000011220719,0.0000443136],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008254482,0.00012573121,0.0001771427,0.00003086396,0.0001365871,0.000023699122,0.00015607516,0.000026075542,0.0021378836],"category_scores_gemma":[0.0000029948092,0.000114464594,0.00007705082,0.00018174402,0.000022219028,0.00004269706,0.00004003401,0.00012932079,0.000012345188],"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.00002888503,0.00015293703,0.00015482857,0.00091636274,0.00033307515,0.000005047543,0.01634302,0.91245574,0.019956267,0.03914467,0.006560661,0.003948535],"study_design_scores_gemma":[0.00044930947,0.000019489436,0.00019407661,0.000005760291,0.00015775002,0.0000036029376,0.003121027,0.9540359,0.024294196,0.013846999,0.003391942,0.00047997604],"about_ca_topic_score_codex":0.0000041139288,"about_ca_topic_score_gemma":0.0000026749638,"teacher_disagreement_score":0.072553225,"about_ca_system_score_codex":0.000053941385,"about_ca_system_score_gemma":0.0000056102263,"threshold_uncertainty_score":0.9987743},"labels":[],"label_agreement":null},{"id":"W3175250543","doi":"10.1016/j.dam.2023.02.003","title":"A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec à Montréal","keywords":"Knapsack problem; Mathematics; Mathematical optimization; Change-making problem; Continuous knapsack problem; Quadratic programming; Heuristic; Algorithm; Cutting stock problem; Dynamic programming; Binary number; Constraint (computer-aided design); Function (biology); Integer programming; Optimization problem","score_opus":0.0124201419681223,"score_gpt":0.24365277073564792,"score_spread":0.23123262876752562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175250543","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021915596,0.00009841338,0.9920965,0.0002583586,0.00014593508,0.0018566392,0.000030366895,0.0014285834,0.0038660907],"genre_scores_gemma":[0.033509467,0.00019691601,0.96202993,0.00005909833,0.00009249839,0.0021753302,0.00022072149,0.00024270528,0.0014733288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988853,0.000005217135,0.00032337604,0.0001781087,0.00019911322,0.00040888268],"domain_scores_gemma":[0.9991967,0.00028336435,0.000070698596,0.0003492411,0.00003547817,0.000064498745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030559197,0.00022837799,0.00022729317,0.00008218716,0.00018183468,0.00015436152,0.00024118634,0.000089937486,0.000020200732],"category_scores_gemma":[0.000018020732,0.00016899014,0.000086915476,0.0005446077,0.000046622652,0.00005354624,0.000044166245,0.00014670189,0.00016191883],"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.000008555828,0.000110884335,0.00000532903,0.0042188973,0.00058284553,0.000004713152,0.018000431,0.5459022,0.0017637394,0.103594154,0.011303778,0.31450447],"study_design_scores_gemma":[0.00029636614,0.000016394228,0.0000030335761,0.000064255146,0.000058758196,0.0000027989709,0.0011457806,0.9814823,0.00017946967,0.0068548825,0.00965368,0.00024228009],"about_ca_topic_score_codex":9.601517e-7,"about_ca_topic_score_gemma":0.0000060034617,"teacher_disagreement_score":0.4355801,"about_ca_system_score_codex":0.00003402369,"about_ca_system_score_gemma":0.000016140484,"threshold_uncertainty_score":0.6891218},"labels":[],"label_agreement":null},{"id":"W3181069867","doi":"10.1016/j.dam.2023.06.016","title":"Constant delay lattice train schedules","year":2023,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Constant (computer programming); Upper and lower bounds; Mathematics; Lattice (music); Discrete mathematics; Physics; Mathematical analysis; Computer science","score_opus":0.03125633795150887,"score_gpt":0.256603659692624,"score_spread":0.22534732174111513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3181069867","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018377133,0.00012368178,0.97339886,0.000033865737,0.00046255565,0.00054358365,0.00021304212,0.0020107534,0.021375969],"genre_scores_gemma":[0.29846448,0.0004568624,0.6995908,0.000025486816,0.00016854114,0.0002575867,0.0005281433,0.0002871111,0.00022099419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985012,0.0000067284873,0.0005095143,0.00034667304,0.0002584449,0.00037744342],"domain_scores_gemma":[0.9988619,0.00020771213,0.00013858793,0.0006558513,0.000034899094,0.00010104898],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018763653,0.00044584015,0.00050279795,0.00012682329,0.00007379479,0.00010187236,0.00032510512,0.00035360534,0.000027528973],"category_scores_gemma":[0.00006529142,0.00044241757,0.00010187532,0.00009890773,0.00009199849,0.0000305319,0.00025213129,0.00064562226,0.00017476815],"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.0000025568131,0.000016799211,3.543571e-7,0.001421512,0.00010251973,0.000009433781,0.00050352106,0.83045197,0.00010150849,0.16672117,0.00024064009,0.0004280347],"study_design_scores_gemma":[0.00025002463,0.000007703005,0.000005113814,0.00027873376,0.00016692407,0.0000036785448,0.0006290378,0.5038321,0.0020187516,0.49162984,0.00041278318,0.0007653177],"about_ca_topic_score_codex":0.0000020172934,"about_ca_topic_score_gemma":0.0000046822925,"teacher_disagreement_score":0.32661986,"about_ca_system_score_codex":0.00008875213,"about_ca_system_score_gemma":0.00002953536,"threshold_uncertainty_score":0.99980277},"labels":[],"label_agreement":null},{"id":"W3183334394","doi":"10.1016/j.dam.2023.05.031","title":"2-limited broadcast domination on grid graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Cartesian product; Upper and lower bounds; Grid; Combinatorics; Domination analysis; Path (computing); Duality (order theory); Product (mathematics); Chordal graph; Discrete mathematics; Graph; Computer science","score_opus":0.027219764993651266,"score_gpt":0.29709562731315275,"score_spread":0.2698758623195015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183334394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06887625,0.00002473432,0.85493,0.0010092327,0.00044520298,0.0013633393,0.0000325656,0.002129624,0.07118905],"genre_scores_gemma":[0.8021551,0.0001061187,0.19509508,0.00041093654,0.00014700115,0.0004990167,0.00011535386,0.00011874641,0.0013526916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804515,0.000030471938,0.00031362902,0.00044266164,0.00067213917,0.0004959793],"domain_scores_gemma":[0.99819744,0.0004739289,0.0001266657,0.0010111821,0.00006444341,0.00012633401],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202481,0.00021675993,0.00023392813,0.0004764916,0.00020467001,0.0001517818,0.0010347224,0.00007592715,0.000017705423],"category_scores_gemma":[0.00010469263,0.00018661983,0.00009346644,0.0019319281,0.00010207568,0.00020680846,0.00035377388,0.00022322893,0.0012257497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010848767,0.000053107568,0.0000028350826,0.00005616866,0.000016430888,0.000011311598,0.0010102199,0.00023781095,0.005561821,0.9770859,0.0010902379,0.014863336],"study_design_scores_gemma":[0.0005799414,0.0000838191,0.00016561519,0.00004623976,0.000007944154,0.0000065267163,0.0004173527,0.051976517,0.012843575,0.93188286,0.0016346722,0.00035493722],"about_ca_topic_score_codex":5.801484e-7,"about_ca_topic_score_gemma":5.35101e-7,"teacher_disagreement_score":0.7332788,"about_ca_system_score_codex":0.000036842077,"about_ca_system_score_gemma":0.0000220489,"threshold_uncertainty_score":0.9995519},"labels":[],"label_agreement":null},{"id":"W3196808644","doi":"10.1016/j.dam.2023.05.030","title":"A linear-time algorithm for semitotal domination in strongly chordal graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied 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":"Carleton University","funders":"","keywords":"Chordal graph; Mathematics; Dominating set; Combinatorics; Time complexity; Vertex (graph theory); Maximal independent set; Bipartite graph; Interval graph; Discrete mathematics; Graph; 1-planar graph","score_opus":0.01700210038948882,"score_gpt":0.29841595928583475,"score_spread":0.28141385889634596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196808644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016250929,0.00000962647,0.9803703,0.00012399472,0.00006687929,0.0010416735,0.000034079836,0.00033058441,0.0017719539],"genre_scores_gemma":[0.038248476,0.000010916655,0.96026313,0.000019205429,0.00006607373,0.00070791563,0.00007383922,0.000052426032,0.00055802043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981925,0.000022932258,0.00037387857,0.0004249125,0.00043178018,0.00055402605],"domain_scores_gemma":[0.99862957,0.0005250821,0.00011299453,0.00056990125,0.000066518725,0.00009591995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008788413,0.00019984205,0.0002854009,0.00040051466,0.00011291747,0.000090164685,0.0007947833,0.00008783279,0.0000078471485],"category_scores_gemma":[0.00008445254,0.00018702776,0.00010151492,0.001344676,0.00008158692,0.00025256773,0.00030841984,0.00018227201,0.00018126768],"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.000019221661,0.00013585998,0.000007053762,0.00014696881,0.00003472666,0.000013590628,0.0022714536,0.0010810804,0.010716279,0.8994156,0.00038000752,0.08577812],"study_design_scores_gemma":[0.0006528036,0.000042954784,0.000034674904,0.000020657735,0.0000039566594,0.0000027588728,0.00020626602,0.66323346,0.0026375125,0.3328745,0.00010959524,0.0001808296],"about_ca_topic_score_codex":0.0000010254721,"about_ca_topic_score_gemma":0.0000015284162,"teacher_disagreement_score":0.6621524,"about_ca_system_score_codex":0.000047741094,"about_ca_system_score_gemma":0.00004165284,"threshold_uncertainty_score":0.76267713},"labels":[],"label_agreement":null},{"id":"W3203748658","doi":"10.1016/j.dam.2021.09.019","title":"Minimum values of the second largest <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e165\" altimg=\"si16.svg\"> <mml:mi>Q</mml:mi> </mml:math> -eigenvalue","year":2021,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","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":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Combinatorics; Mathematics; Adjacency matrix; Eigenvalues and eigenvectors; Laplacian matrix; Graph; Diagonal matrix; Laplace operator; Diagonal; Discrete mathematics; Geometry; Mathematical analysis; Physics","score_opus":0.021612144143040853,"score_gpt":0.2616916501359515,"score_spread":0.24007950599291067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203748658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9807152,0.00014686145,0.0029977523,0.0002480804,0.00025142025,0.00025873128,0.00040780733,0.00016136498,0.014812757],"genre_scores_gemma":[0.9702614,0.00007403125,0.027383022,0.00035049644,0.0002576583,0.00051784393,0.00020981408,0.00021924227,0.0007264948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966635,0.00008570624,0.0011332176,0.000633583,0.00081178796,0.00067217083],"domain_scores_gemma":[0.995599,0.00111234,0.0009583792,0.0020100744,0.00011236391,0.00020787574],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093038724,0.0004972365,0.00049491395,0.000082402,0.00061234785,0.00017645353,0.0009593192,0.00046940282,0.00019362473],"category_scores_gemma":[0.0004019776,0.00046745903,0.0006145582,0.0004973287,0.00050357496,0.00017215533,0.00068187027,0.0005536756,0.00046495613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003562458,0.00043638257,0.000003557318,0.0013979226,0.00032149098,0.000020829155,0.0029771517,0.000056308927,0.013403337,0.9803649,0.0008801594,0.00010231326],"study_design_scores_gemma":[0.0009868067,0.00010908711,0.000024844494,0.00057331595,0.0009286751,0.0001829437,0.0065352484,0.19802299,0.13467,0.65328103,0.0038749475,0.00081007846],"about_ca_topic_score_codex":0.000009822013,"about_ca_topic_score_gemma":0.00004771731,"teacher_disagreement_score":0.32708386,"about_ca_system_score_codex":0.000016651546,"about_ca_system_score_gemma":0.00023686365,"threshold_uncertainty_score":0.99977773},"labels":[],"label_agreement":null},{"id":"W3217052763","doi":"10.1016/j.dam.2022.07.023","title":"A counter-example to the probabilistic universal graph conjecture via randomized communication complexity","year":2022,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Sleep Foundation; National Science Foundation","keywords":"Mathematics; Conjecture; Combinatorics; Discrete mathematics; Bounded function; Probabilistic logic; Randomized algorithm; Graph; Regular graph; Graph power; Line graph","score_opus":0.025755645183202655,"score_gpt":0.23955181027054392,"score_spread":0.21379616508734128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217052763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031158281,0.0000618524,0.98597103,0.0029426962,0.00015472049,0.0020390109,0.000046166453,0.00025062857,0.00541805],"genre_scores_gemma":[0.70653933,0.0000087699755,0.2912214,0.0011561902,0.000036691516,0.00085359754,0.00007439734,0.00002981385,0.00007980134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997977,0.00025567217,0.0004430253,0.00038935806,0.0006030775,0.00033186306],"domain_scores_gemma":[0.99700385,0.0009260742,0.0001834272,0.0017269525,0.00006220374,0.000097460266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015207011,0.0002438327,0.000496775,0.000120695135,0.0011542119,0.00019901569,0.002705313,0.000035633737,0.00012910066],"category_scores_gemma":[0.000048203194,0.00018186944,0.00019202984,0.00083804515,0.0003929048,0.000098702556,0.0017937062,0.00041096582,0.000028685417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023225344,0.000112213704,4.1720054e-7,0.000034463028,0.000053572418,0.0000016779974,0.008321955,0.0025418873,0.000059798997,0.98715097,0.0008764834,0.0006143237],"study_design_scores_gemma":[0.0069430233,0.000045807836,0.0000068864542,0.000012009468,0.000044124445,0.00002664836,0.0009919397,0.22305621,0.00003690333,0.76295906,0.0056055165,0.00027188272],"about_ca_topic_score_codex":0.00015162608,"about_ca_topic_score_gemma":0.00007301435,"teacher_disagreement_score":0.7034235,"about_ca_system_score_codex":0.00009343415,"about_ca_system_score_gemma":0.0000543102,"threshold_uncertainty_score":0.88773817},"labels":[],"label_agreement":null},{"id":"W4205455326","doi":"10.1016/j.dam.2016.01.016","title":"On <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" display=\"inline\" overflow=\"scroll\"><mml:mi>r</mml:mi></mml:math>-dynamic coloring of graphs","year":2016,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Combinatorics; Mathematics; Bipartite graph; List coloring; Edge coloring; Vertex (graph theory); Complete coloring; Graph; Greedy coloring; Graph power; Line graph","score_opus":0.01528063017840748,"score_gpt":0.24052918085165914,"score_spread":0.22524855067325167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205455326","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8958418,0.000059770733,0.09947769,0.00023346345,0.00019725673,0.000078438505,0.00011329783,0.00015003467,0.0038482652],"genre_scores_gemma":[0.9732142,0.00015131859,0.026009783,0.00021766871,0.000065653345,0.00012445849,0.000055394714,0.000048023354,0.000113478614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711496,0.00002883195,0.00073564344,0.0006613052,0.00084725406,0.00061200187],"domain_scores_gemma":[0.99689585,0.00086156116,0.00061227963,0.0013681384,0.000050859067,0.0002113317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005980934,0.00034179806,0.0003821322,0.0002469187,0.0002652602,0.00018296654,0.001381883,0.00028372277,0.000053610922],"category_scores_gemma":[0.00031237793,0.00027470003,0.0004091332,0.00090040156,0.00029789208,0.0003267478,0.0008837703,0.00025682422,0.0006877681],"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.000042120297,0.00018227943,0.000003788208,0.0001740791,0.00019222403,0.000032954675,0.00031282607,0.00015782534,0.0022502763,0.99341995,0.00016061471,0.0030710734],"study_design_scores_gemma":[0.0008021671,0.00040775497,0.000083874205,0.00027425928,0.00025022487,0.000036610647,0.0003037939,0.91885173,0.008149752,0.069672644,0.0006292791,0.000537899],"about_ca_topic_score_codex":0.000035138164,"about_ca_topic_score_gemma":0.000021707483,"teacher_disagreement_score":0.9237473,"about_ca_system_score_codex":0.000017835162,"about_ca_system_score_gemma":0.000076985794,"threshold_uncertainty_score":0.9999705},"labels":[],"label_agreement":null},{"id":"W4205627441","doi":"10.1016/j.dam.2009.09.012","title":"Foreword","year":2009,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Humanities; Philosophy","score_opus":0.015994472038311922,"score_gpt":0.26560121466508013,"score_spread":0.2496067426267682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205627441","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15885541,0.000061837214,0.06776788,0.0003751834,0.00007463364,0.001210283,0.000114827206,0.001444435,0.7700955],"genre_scores_gemma":[0.88295335,0.000002396948,0.115902476,0.00033022894,0.00008996965,0.000037232352,0.000034820132,0.00008512882,0.0005643861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847674,0.0000057856473,0.0003787508,0.00026839046,0.0004121281,0.0004581722],"domain_scores_gemma":[0.99890727,0.00006143183,0.00016716149,0.00069315074,0.00003254033,0.00013843564],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002480276,0.00026291105,0.0003250767,0.00009472125,0.00009922882,0.000048056958,0.00034980185,0.00009117413,0.00021444005],"category_scores_gemma":[0.00004120315,0.00022439078,0.00009807594,0.00032482992,0.00006274416,0.00008608619,0.00004569229,0.00016280897,0.0068295035],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019744954,0.00016322249,0.0000042769193,0.000041380652,0.00002304104,0.000004858137,0.0012341304,0.000024712204,0.040925585,0.94497275,0.0086085815,0.003977694],"study_design_scores_gemma":[0.0012879573,0.000114143826,0.00066797243,0.00007267253,0.00014292423,0.000028681761,0.0013522805,0.007172459,0.026953774,0.9527024,0.008558106,0.00094665046],"about_ca_topic_score_codex":6.0545494e-7,"about_ca_topic_score_gemma":0.000001383067,"teacher_disagreement_score":0.76953113,"about_ca_system_score_codex":0.000051859173,"about_ca_system_score_gemma":0.000019852645,"threshold_uncertainty_score":0.9939438},"labels":[],"label_agreement":null},{"id":"W4205695444","doi":"10.1016/j.dam.2014.11.011","title":"Foreword","year":2014,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science","score_opus":0.013196728023190588,"score_gpt":0.24618204541103408,"score_spread":0.2329853173878435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205695444","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10364209,0.0000131961715,0.2565571,0.00009196802,0.00009028034,0.00068222394,0.00006172365,0.00090802775,0.6379534],"genre_scores_gemma":[0.86941475,9.290311e-7,0.12936978,0.00015624858,0.00013176865,0.00010649026,0.00003419614,0.00016660766,0.0006192161],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985048,0.000012370135,0.00036687354,0.0002769816,0.00040413873,0.00043484347],"domain_scores_gemma":[0.99867123,0.00017266105,0.0001834988,0.00079828466,0.000034103166,0.00014019766],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048573414,0.0002535995,0.00033736302,0.0000848991,0.00010455142,0.000045890873,0.00036700667,0.000089826644,0.00024919873],"category_scores_gemma":[0.000106266525,0.00021382631,0.000090469235,0.00024405187,0.000105504965,0.000065431355,0.00011819164,0.00015149574,0.012536257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000100210455,0.000070888455,0.000015065665,0.00011823221,0.00002787363,5.8399826e-7,0.000835068,0.000030183097,0.016730832,0.97472703,0.0054702745,0.0019639286],"study_design_scores_gemma":[0.0017850638,0.000080422906,0.00030750074,0.000095065414,0.00019907829,0.000020498672,0.0013309813,0.057305243,0.027374934,0.85570604,0.05457217,0.001222981],"about_ca_topic_score_codex":0.0000015839156,"about_ca_topic_score_gemma":0.000004529588,"teacher_disagreement_score":0.7657727,"about_ca_system_score_codex":0.00003769778,"about_ca_system_score_gemma":0.00001302369,"threshold_uncertainty_score":0.9882326},"labels":[],"label_agreement":null},{"id":"W4205716054","doi":"10.1016/j.dam.2009.08.002","title":"On well-covered triangulations: Part III","year":2010,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Planar graph; Graph; Triangulation; Degree (music); Discrete mathematics; Geometry","score_opus":0.01805474444878341,"score_gpt":0.2866769156131945,"score_spread":0.2686221711644111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205716054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022548905,0.0000058672586,0.8360876,0.00039148383,0.00030960114,0.0007537405,0.00000839925,0.0003482888,0.13954616],"genre_scores_gemma":[0.67648625,0.000007103285,0.32089406,0.00030410598,0.00013845687,0.00021738722,0.000016399457,0.000049060138,0.0018871533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983419,0.000017841141,0.000348302,0.00039055222,0.0005103473,0.00039104983],"domain_scores_gemma":[0.9977059,0.00055852585,0.00014571658,0.0013957742,0.000050874685,0.00014320291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049148005,0.0002009084,0.00024194493,0.00014572458,0.00019810158,0.00016114001,0.001044754,0.00009663949,0.00019993367],"category_scores_gemma":[0.00014118651,0.0001680242,0.00008852206,0.0004542264,0.00011329627,0.00019893733,0.00024262634,0.00039340733,0.00069163425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013752636,0.00008077099,0.0000011116837,0.000018308385,0.000013747486,0.0000028970178,0.000398762,0.00007511251,0.0056137918,0.99106765,0.00078882463,0.0019253009],"study_design_scores_gemma":[0.0007348259,0.000038758826,0.000018799812,0.000016903115,0.0000067667916,0.0000047146345,0.00009147038,0.011279664,0.00996228,0.9731648,0.0044265883,0.00025441786],"about_ca_topic_score_codex":9.865151e-7,"about_ca_topic_score_gemma":0.000002106132,"teacher_disagreement_score":0.65393734,"about_ca_system_score_codex":0.000017760414,"about_ca_system_score_gemma":0.000040721363,"threshold_uncertainty_score":0.88897896},"labels":[],"label_agreement":null},{"id":"W4206498668","doi":"10.1016/j.dam.2006.03.006","title":"Existence of directedwhist tournaments with the three person property <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mn>3</mml:mn><mml:mtext>PDWh</mml:mtext><mml:mo stretchy=\"false\">(</mml:mo><mml:mi>v</mml:mi><mml:mo stretchy=\"false\">)</mml:mo></mml:math>","year":2006,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada; University Research Committee, Emory University; Zhejiang University; Mount Saint Vincent University","keywords":"Tournament; Property (philosophy); Mathematics; Scroll; Combinatorics; Discrete mathematics; Theology; Philosophy","score_opus":0.01529304542828501,"score_gpt":0.2129425662549024,"score_spread":0.1976495208266174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206498668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9499151,0.0018302829,0.0030695102,0.00030277827,0.001213091,0.00041642596,0.0007998628,0.0005775821,0.04187537],"genre_scores_gemma":[0.98911023,0.00047812535,0.005395279,0.00032330368,0.0011960233,0.0015374743,0.0006060933,0.0010279141,0.00032556124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9890665,0.00031295125,0.0027088055,0.0020279265,0.003137596,0.0027462223],"domain_scores_gemma":[0.9919835,0.001203374,0.0027170028,0.0029270593,0.00028656572,0.00088249665],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0023512815,0.0017349067,0.0010684395,0.0004532728,0.001821552,0.0014507849,0.0028527083,0.0020076176,0.0014326185],"category_scores_gemma":[0.00043287608,0.0019821425,0.001682984,0.0014216487,0.00182554,0.0010386129,0.0011572175,0.0021630137,0.0013288272],"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.0009742389,0.0006379083,0.000019176172,0.003982175,0.0022917127,0.00039527038,0.0068599847,0.0036907338,0.0066880044,0.9628653,0.009574021,0.002021487],"study_design_scores_gemma":[0.00626684,0.0030988576,0.00011269473,0.007966918,0.005895595,0.0019408688,0.02670099,0.4507464,0.43510473,0.0506067,0.0055332566,0.0060261744],"about_ca_topic_score_codex":0.0012820084,"about_ca_topic_score_gemma":0.00106331,"teacher_disagreement_score":0.91225857,"about_ca_system_score_codex":0.00008098734,"about_ca_system_score_gemma":0.0006609989,"threshold_uncertainty_score":0.9995858},"labels":[],"label_agreement":null},{"id":"W4206613355","doi":"10.1016/j.dam.2013.09.001","title":"Editorial","year":2013,"lang":"es","type":"editorial","venue":"Discrete Applied Mathematics","topic":"","field":"","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":"HEC Montréal","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.008854978724175006,"score_gpt":0.25707933940345173,"score_spread":0.24822436067927672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206613355","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000863344,0.00011568258,0.00088404893,0.000027329363,0.8936259,0.004113818,0.0032850849,0.0010146666,0.0968471],"genre_scores_gemma":[0.0001287918,0.00024914384,0.022911018,0.000018527477,0.9658504,0.0017702666,0.0042917095,0.0022420087,0.002538119],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.98431045,0.00011717476,0.0032156068,0.0022931339,0.0074189273,0.0026447345],"domain_scores_gemma":[0.9869125,0.003260546,0.0034124583,0.004154973,0.0012427437,0.0010167637],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.0018173789,0.0032332991,0.003906274,0.00065888837,0.000629549,0.0020370986,0.0034170519,0.006041635,0.002502059],"category_scores_gemma":[0.0021604935,0.0030191017,0.0009637325,0.0009673787,0.0009377345,0.0004444513,0.0015186765,0.0045363465,0.18128453],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001417105,0.0006080777,3.5174887e-7,0.003425572,0.0008537724,0.00000606773,0.0016769433,0.000014243473,0.0054405653,0.04830762,0.93932813,0.00019695933],"study_design_scores_gemma":[0.0027346162,0.00015038763,5.6291844e-7,0.00088549475,0.0016909476,0.0000030319493,0.0009749266,0.00036940246,0.0006273609,0.029027876,0.9603966,0.0031387957],"about_ca_topic_score_codex":0.00008931398,"about_ca_topic_score_gemma":0.000007851708,"teacher_disagreement_score":0.17878248,"about_ca_system_score_codex":0.0010140957,"about_ca_system_score_gemma":0.00123292,"threshold_uncertainty_score":0.9989989},"labels":[],"label_agreement":null},{"id":"W4206830864","doi":"10.1016/j.dam.2021.07.005","title":"Parameterized algorithms for the Happy Set problem","year":2021,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Parameterized complexity; Mathematics; Undirected graph; Vertex (graph theory); Graph; Discrete mathematics","score_opus":0.05288598446721245,"score_gpt":0.32754774320663876,"score_spread":0.27466175873942633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206830864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036253108,0.00011479088,0.9936067,0.0009842819,0.00007641497,0.0009927159,0.00002565861,0.00015784436,0.003679088],"genre_scores_gemma":[0.014346829,0.00003466541,0.98382145,0.00025108538,0.00005042721,0.00083854585,0.000015510115,0.000035392473,0.0006060645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983016,0.000030156576,0.0003405641,0.00043467322,0.00041015644,0.0004828232],"domain_scores_gemma":[0.9968223,0.0015506699,0.00013051722,0.0012687328,0.0001325357,0.000095266965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704067,0.00020204778,0.00028064832,0.00004508817,0.00029449473,0.00029502186,0.0012295449,0.00006402904,0.000021983202],"category_scores_gemma":[0.0001494776,0.00013564524,0.00014084883,0.0005020332,0.00013189006,0.0001481494,0.0005055388,0.00018441115,0.000050813476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009540919,0.00004854636,5.537194e-7,0.00011958738,0.000060534534,0.000005646991,0.0013037552,0.000110878056,0.007601416,0.97625744,0.00044827757,0.014033844],"study_design_scores_gemma":[0.00054057856,0.00003424276,0.0000036339095,0.000028023758,0.000022866103,0.0000244003,0.0006898662,0.11990751,0.020048503,0.8518598,0.0065889,0.00025165593],"about_ca_topic_score_codex":5.7924774e-7,"about_ca_topic_score_gemma":0.0000012880283,"teacher_disagreement_score":0.1243976,"about_ca_system_score_codex":0.000024148903,"about_ca_system_score_gemma":0.00008323777,"threshold_uncertainty_score":0.55314523},"labels":[],"label_agreement":null},{"id":"W4210439484","doi":"10.1016/j.dam.2010.12.024","title":"Generalization of matching extensions in graphs (III)","year":2011,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Matching (statistics); Generalization; Discrete mathematics; Graph","score_opus":0.03876667402242115,"score_gpt":0.28391648846985723,"score_spread":0.24514981444743608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210439484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08475755,0.00001692891,0.9017179,0.00001970243,0.00003205693,0.0002752874,0.0000015745676,0.00006953145,0.013109489],"genre_scores_gemma":[0.61454976,0.000014830394,0.38534272,0.000022457887,0.0000031500035,0.000027754068,0.0000019752667,0.000011932413,0.000025421466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998815,0.00002326795,0.0003886578,0.00023797272,0.00027833646,0.00025673982],"domain_scores_gemma":[0.99899447,0.00008692181,0.00015032508,0.00065651565,0.00005128248,0.000060501665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037961162,0.00012569729,0.00022586776,0.00025180497,0.00005208516,0.000019150608,0.0006600441,0.000050327726,0.000020173826],"category_scores_gemma":[0.000022268896,0.000110066176,0.00005143298,0.0006803033,0.00008151759,0.00019350243,0.00026402483,0.00011739425,0.000013370869],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005257461,0.000073881565,0.000033185792,0.00004747436,0.000006545998,0.000003455918,0.006323712,0.00013336791,0.012592337,0.9800597,0.000010890849,0.00071018055],"study_design_scores_gemma":[0.00024559506,0.000016717211,0.00029123694,0.000038062615,0.0000038086146,0.00000292713,0.00050021335,0.008021047,0.017772635,0.97297007,0.0000065150175,0.0001311444],"about_ca_topic_score_codex":0.000019132653,"about_ca_topic_score_gemma":0.0000071617173,"teacher_disagreement_score":0.5297922,"about_ca_system_score_codex":0.000013832315,"about_ca_system_score_gemma":0.000020692705,"threshold_uncertainty_score":0.44883686},"labels":[],"label_agreement":null},{"id":"W4211110225","doi":"10.1016/s0166-218x(03)00256-7","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"","field":"","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.01846363858054398,"score_gpt":0.2565264408918479,"score_spread":0.23806280231130392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211110225","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07160234,0.000053189215,0.027260466,0.000021133306,0.00006482184,0.00072239246,0.00003099075,0.0005375673,0.8997071],"genre_scores_gemma":[0.8287881,0.000003741724,0.1693914,0.000072906434,0.000027782595,0.00013254627,0.000016175341,0.00018315397,0.0013841892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984968,0.000018006775,0.0003518177,0.0002889437,0.00040261296,0.00044184036],"domain_scores_gemma":[0.9988223,0.000100190024,0.00016343281,0.00074130326,0.000034074572,0.0001387006],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040838995,0.00026023688,0.00029714746,0.00006990851,0.000105310544,0.00006203857,0.00025188146,0.000086396074,0.00061190006],"category_scores_gemma":[0.00012411007,0.00022588739,0.00007767631,0.00031400615,0.00009184874,0.00007128763,0.00004841881,0.00015566505,0.012463361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005250489,0.000118501164,0.000014666242,0.00009722382,0.000037051377,0.0000022540908,0.0012921696,0.000048633447,0.043845866,0.95109993,0.0033381335,0.0001002953],"study_design_scores_gemma":[0.0024438393,0.00006111741,0.000110767935,0.00009331429,0.00026979265,0.000069547204,0.0060273176,0.0016287345,0.24867427,0.6238521,0.11505062,0.0017186286],"about_ca_topic_score_codex":8.0068037e-7,"about_ca_topic_score_gemma":0.0000017333124,"teacher_disagreement_score":0.89832294,"about_ca_system_score_codex":0.000057097623,"about_ca_system_score_gemma":0.00003760999,"threshold_uncertainty_score":0.98830557},"labels":[],"label_agreement":null},{"id":"W4211213739","doi":"10.1016/s0166-218x(01)00262-1","title":"Preface","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"","field":"","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.030873271597423174,"score_gpt":0.2447407681946556,"score_spread":0.21386749659723242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211213739","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062672354,0.00012073877,0.009740636,0.00012020896,0.000060832976,0.00079684856,0.000057209556,0.0009359347,0.92549527],"genre_scores_gemma":[0.91410685,0.000012981711,0.0817957,0.00010886214,0.00008583378,0.00013845631,0.00001667421,0.00020285696,0.0035318045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846345,0.000008541828,0.00035785255,0.00028907877,0.0004433341,0.00043772336],"domain_scores_gemma":[0.9988125,0.000088761735,0.00016584611,0.00076554983,0.000028946506,0.00013839382],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018337459,0.00025970463,0.00029738774,0.000077538236,0.00010717952,0.00006964395,0.0003557646,0.00008676279,0.0022890444],"category_scores_gemma":[0.000046568584,0.00022579158,0.00008173157,0.00030822924,0.00010156497,0.00008749442,0.000109125256,0.00016527371,0.041358452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140047505,0.0006373315,0.00002652575,0.00038477525,0.00014008787,0.000012606324,0.010610417,0.00014622541,0.09691087,0.8135323,0.074828334,0.002756542],"study_design_scores_gemma":[0.0077674054,0.00025236217,0.000391233,0.00039182266,0.00092059263,0.00019240352,0.010885119,0.19692083,0.14447767,0.40795472,0.22396906,0.0058767684],"about_ca_topic_score_codex":0.0000010483312,"about_ca_topic_score_gemma":0.0000015214354,"teacher_disagreement_score":0.92196345,"about_ca_system_score_codex":0.00005314159,"about_ca_system_score_gemma":0.0000050135345,"threshold_uncertainty_score":0.998623},"labels":[],"label_agreement":null},{"id":"W4211242391","doi":"10.1016/s0166-218x(03)00362-7","title":"Preface","year":2003,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"","field":"","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.01846363858054398,"score_gpt":0.2565264408918479,"score_spread":0.23806280231130392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211242391","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07160234,0.000053189215,0.027260466,0.000021133306,0.00006482184,0.00072239246,0.00003099075,0.0005375673,0.8997071],"genre_scores_gemma":[0.8287881,0.000003741724,0.1693914,0.000072906434,0.000027782595,0.00013254627,0.000016175341,0.00018315397,0.0013841892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984968,0.000018006775,0.0003518177,0.0002889437,0.00040261296,0.00044184036],"domain_scores_gemma":[0.9988223,0.000100190024,0.00016343281,0.00074130326,0.000034074572,0.0001387006],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040838995,0.00026023688,0.00029714746,0.00006990851,0.000105310544,0.00006203857,0.00025188146,0.000086396074,0.00061190006],"category_scores_gemma":[0.00012411007,0.00022588739,0.00007767631,0.00031400615,0.00009184874,0.00007128763,0.00004841881,0.00015566505,0.012463361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005250489,0.000118501164,0.000014666242,0.00009722382,0.000037051377,0.0000022540908,0.0012921696,0.000048633447,0.043845866,0.95109993,0.0033381335,0.0001002953],"study_design_scores_gemma":[0.0024438393,0.00006111741,0.000110767935,0.00009331429,0.00026979265,0.000069547204,0.0060273176,0.0016287345,0.24867427,0.6238521,0.11505062,0.0017186286],"about_ca_topic_score_codex":8.0068037e-7,"about_ca_topic_score_gemma":0.0000017333124,"teacher_disagreement_score":0.89832294,"about_ca_system_score_codex":0.000057097623,"about_ca_system_score_gemma":0.00003760999,"threshold_uncertainty_score":0.98830557},"labels":[],"label_agreement":null},{"id":"W4211249288","doi":"10.1016/s0166-218x(00)00305-x","title":"Preface","year":2001,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"","field":"","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":"HEC Montréal","funders":"","keywords":"Mathematics","score_opus":0.021558775775008043,"score_gpt":0.2674508714365444,"score_spread":0.24589209566153636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4211249288","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23007303,0.000047144116,0.028325712,0.00009766121,0.000057848833,0.0007635894,0.00003277365,0.0008694007,0.73973286],"genre_scores_gemma":[0.91655666,0.00001664208,0.080296375,0.00011823079,0.000109970184,0.00014855932,0.00003973591,0.0002127288,0.0025011136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984271,0.000008568437,0.0003641424,0.00029389575,0.00043942608,0.0004668541],"domain_scores_gemma":[0.99880433,0.00008724513,0.00016778058,0.0007594922,0.000036210768,0.00014491104],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002723392,0.0002624772,0.00030295795,0.00008293381,0.00010780489,0.00006959366,0.0003650815,0.00008769546,0.00066237256],"category_scores_gemma":[0.000045032033,0.00022692511,0.00008005897,0.0003894985,0.00009587073,0.00009182349,0.0001210208,0.00015780103,0.01720791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068093585,0.0004410365,0.00015280824,0.00022027052,0.00012763949,0.000029356772,0.0046117455,0.00020881435,0.13261044,0.84484935,0.014538771,0.0021416605],"study_design_scores_gemma":[0.0053621437,0.00016066064,0.001287581,0.00026609199,0.0005954615,0.00035486656,0.010676579,0.020747479,0.07193828,0.61887014,0.26602918,0.0037115165],"about_ca_topic_score_codex":0.0000027359995,"about_ca_topic_score_gemma":0.0000050404906,"teacher_disagreement_score":0.73723173,"about_ca_system_score_codex":0.00006082653,"about_ca_system_score_gemma":0.000022599328,"threshold_uncertainty_score":0.9835573},"labels":[],"label_agreement":null},{"id":"W4225363091","doi":"10.1016/j.dam.2021.11.001","title":"Dichotomizing k-vertex-critical H-free graphs for H of order four","year":2022,"lang":"lv","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Vertex (graph theory); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Graph","score_opus":0.03854525185925415,"score_gpt":0.31333448810442494,"score_spread":0.27478923624517076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225363091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065471763,0.000387946,0.98210645,0.0008487016,0.000502661,0.002396966,0.000504302,0.00015050784,0.0065552755],"genre_scores_gemma":[0.44998783,0.000037775975,0.5479093,0.00018245369,0.000049916867,0.0012722411,0.00002577541,0.00014006747,0.00039463892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9951059,0.0001370948,0.0011193296,0.00090556516,0.0015712199,0.0011608388],"domain_scores_gemma":[0.9931883,0.0032477826,0.00043746512,0.0025056787,0.0003371748,0.00028359846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020097948,0.0004933622,0.0009172022,0.00042275304,0.0008871845,0.00016549518,0.0038143073,0.00012442518,0.00022757765],"category_scores_gemma":[0.0011970359,0.0005051419,0.00039595022,0.0017329081,0.00063805777,0.00025409632,0.0034381275,0.0007165867,0.00002223408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015460273,0.00039927135,0.000008358187,0.0013587113,0.0001290063,0.0000108874565,0.00312086,0.00040222748,0.0058399495,0.9850735,0.000914972,0.0025876593],"study_design_scores_gemma":[0.0016597986,0.00032643598,0.0000076052975,0.00008891341,0.00010163993,0.00003142822,0.0023968252,0.0850696,0.0025264802,0.9062728,0.0009956739,0.0005228043],"about_ca_topic_score_codex":0.000004497024,"about_ca_topic_score_gemma":0.000002762347,"teacher_disagreement_score":0.44344065,"about_ca_system_score_codex":0.000111718466,"about_ca_system_score_gemma":0.00024877168,"threshold_uncertainty_score":0.99974},"labels":[],"label_agreement":null},{"id":"W4225639641","doi":"10.1016/j.dam.2023.04.019","title":"Factorization and pseudofactorization of weighted graphs","year":2023,"lang":"en","type":"preprint","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Army Research Office; National Institute of Environmental Health Sciences; National Institute of General Medical Sciences; Natural Sciences and Engineering Research Council of Canada; Google; Office of Naval Research; Alfred P. Sloan Foundation","keywords":"Combinatorics; Cartesian product; Mathematics; Factorization; Graph product; Discrete mathematics; Chordal graph; Embedding; Graph; 1-planar graph; Computer science; Algorithm","score_opus":0.016483838906898047,"score_gpt":0.2178819892981109,"score_spread":0.20139815039121284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225639641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47616526,0.00023095663,0.5110335,0.000009969571,0.0014145502,0.0013995217,0.00034429674,0.0013881068,0.0080138715],"genre_scores_gemma":[0.9957522,0.00022744664,0.0034053968,0.0000014825868,0.0000460636,0.00009222741,0.0003271685,0.00010685621,0.000041165295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882865,0.00001205895,0.0005296442,0.0002267013,0.00022858602,0.0001743606],"domain_scores_gemma":[0.99919814,0.00008620016,0.00019826551,0.00041716278,0.00004055244,0.000059668764],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00016573834,0.00030190175,0.00047625936,0.00020561421,0.000036661204,0.000042942956,0.00017590428,0.0003217369,0.000011860958],"category_scores_gemma":[0.000012937356,0.00028883238,0.00008094599,0.00022764147,0.00005167027,0.000037316513,0.00012480923,0.00023494552,0.000012528461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009533487,0.000045423578,0.00026574783,0.013601292,0.00047238497,0.0000018307633,0.0076703383,0.0061570858,0.03995734,0.9308737,0.0002900996,0.0006552366],"study_design_scores_gemma":[0.00030996962,0.000016884414,0.00047273355,0.0006047305,0.00020262317,0.0000019313943,0.00095915445,0.051352084,0.019066356,0.92623955,0.000095488875,0.00067848794],"about_ca_topic_score_codex":0.0000031058446,"about_ca_topic_score_gemma":0.0000017237475,"teacher_disagreement_score":0.5195869,"about_ca_system_score_codex":0.000019744697,"about_ca_system_score_gemma":0.000010408316,"threshold_uncertainty_score":0.99995637},"labels":[],"label_agreement":null},{"id":"W4226056692","doi":"10.1016/j.dam.2023.10.012","title":"Graph clustering with Boltzmann machines","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Solver; Maximization; Mathematics; Heuristic; Mathematical optimization; Graph; Heuristics; Algorithm; Computer science; Discrete mathematics; Statistics","score_opus":0.01215023620294657,"score_gpt":0.25582615627109767,"score_spread":0.24367592006815111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226056692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13576694,0.000011307933,0.7082011,0.0001234796,0.00003099996,0.00055108237,0.000026532243,0.0010131435,0.15427539],"genre_scores_gemma":[0.95794725,0.0000025801478,0.041114006,0.000022388127,0.00014292006,0.00015187092,0.00011391573,0.000054338623,0.00045073562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990468,0.000005869546,0.00023567058,0.00022175026,0.00020095806,0.00028897112],"domain_scores_gemma":[0.99931926,0.000061021397,0.00011654842,0.00042171794,0.000022124772,0.00005931711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001320204,0.00020155279,0.00027981517,0.00011965654,0.00012678867,0.000069845846,0.00022487472,0.000023003135,0.00017288931],"category_scores_gemma":[0.0000010470347,0.00015421156,0.00009342818,0.00056864443,0.00004842855,0.000044710767,0.00014790887,0.000112167065,0.00012287087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003517176,0.000207284,0.00425382,0.0002907227,0.0007652526,0.0000104879655,0.0029425572,0.004494664,0.0051646987,0.9421296,0.0118984515,0.027807267],"study_design_scores_gemma":[0.0010058295,0.000078130666,0.0011825605,0.00020712189,0.00042155618,0.000003974596,0.0032152003,0.22570306,0.0041196886,0.7582082,0.0044682357,0.0013864405],"about_ca_topic_score_codex":0.000018643646,"about_ca_topic_score_gemma":0.0000111269355,"teacher_disagreement_score":0.82218033,"about_ca_system_score_codex":0.000007407852,"about_ca_system_score_gemma":0.000009013013,"threshold_uncertainty_score":0.6288565},"labels":[],"label_agreement":null},{"id":"W4226086949","doi":"10.1016/j.dam.2023.02.005","title":"Isometric Hamming embeddings of weighted graphs","year":2023,"lang":"en","type":"preprint","venue":"Discrete Applied Mathematics","topic":"Advanced Computing and Algorithms","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Institute for Collaborative Biotechnologies; Division of Chemical, Bioengineering, Environmental, and Transport Systems; National Institute of Environmental Health Sciences; National Institute of General Medical Sciences; Army Research Office; Alfred P. Sloan Foundation; Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; Google; National Science Foundation; National Institutes of Health; United States-Israel Binational Science Foundation","keywords":"Hamming graph; Combinatorics; Mathematics; Discrete mathematics; Vertex (graph theory); Embedding; Hamming distance; Hamming code; Graph; Computer science; Algorithm","score_opus":0.04113380763223667,"score_gpt":0.3341166078747166,"score_spread":0.2929828002424799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226086949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16228597,0.00063015893,0.65057635,0.00073074136,0.0030608065,0.0032630498,0.00020996107,0.0029028351,0.17634013],"genre_scores_gemma":[0.51837987,0.00053350086,0.47764996,0.000038679347,0.00048601988,0.00014501465,0.00008903297,0.00017092,0.0025069797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975055,0.000032730113,0.0006726169,0.00047397983,0.0008072626,0.00050791353],"domain_scores_gemma":[0.9978061,0.0005961834,0.00076933426,0.00056265696,0.0001305191,0.00013525962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009049572,0.00031267406,0.0006881631,0.0005074832,0.00033231193,0.00009416825,0.00078931235,0.00034400396,0.000029539791],"category_scores_gemma":[0.00026891715,0.0003065177,0.00024407674,0.0012904664,0.00030900762,0.000038423503,0.0006734236,0.000529004,0.00006525481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007350005,0.00015398677,0.000037200738,0.0015105257,0.00023010347,0.000008737375,0.045304555,0.0009030209,0.00034855507,0.9320084,0.00080646557,0.018681102],"study_design_scores_gemma":[0.00021321255,0.00001560438,0.00002670075,0.0005096832,0.000118859265,4.3454057e-7,0.012879914,0.006679901,0.00064919674,0.9767928,0.0015471993,0.00056646037],"about_ca_topic_score_codex":0.00014758097,"about_ca_topic_score_gemma":0.000017328843,"teacher_disagreement_score":0.3560939,"about_ca_system_score_codex":0.000081518534,"about_ca_system_score_gemma":0.00014772214,"threshold_uncertainty_score":0.99993867},"labels":[],"label_agreement":null},{"id":"W4281251691","doi":"10.1016/j.dam.2022.04.014","title":"Critical independent sets of König–Egerváry graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Xi’an Jiaotong University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Thompson Rivers University","keywords":"Mathematics; Combinatorics; Independence number; Independent set; Vertex (graph theory); Discrete mathematics; Graph; Simple graph; Bipartite graph","score_opus":0.02301127744059721,"score_gpt":0.3104668868562302,"score_spread":0.287455609415633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281251691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047287576,0.00014601464,0.921687,0.0004248551,0.00021504286,0.00070643646,0.00005911136,0.0002640039,0.029209936],"genre_scores_gemma":[0.8509997,0.000005345584,0.14861454,0.00009710121,0.000007874986,0.00018379724,0.000005956195,0.000025549498,0.000060104354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99744546,0.00007115012,0.0004571733,0.00040053471,0.0011223683,0.0005033264],"domain_scores_gemma":[0.9980113,0.0005405456,0.00014225693,0.0010767513,0.00007644686,0.00015270525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000958622,0.00018397611,0.0003232755,0.0002339535,0.0002814996,0.00005871033,0.001683512,0.000044307744,0.00015720182],"category_scores_gemma":[0.000113137794,0.00017692156,0.00012653353,0.0007474142,0.00020845108,0.00017875545,0.001629613,0.00041158462,0.000028822069],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001120379,0.00017763325,0.0000134826605,0.00012168344,0.000021247602,0.00001519129,0.0015435504,0.00017821431,0.0063595963,0.9898654,0.0001383808,0.0015543943],"study_design_scores_gemma":[0.00028440764,0.00009085676,0.00004345479,0.000010658845,0.000010320002,0.000030366567,0.0011363383,0.009105276,0.00667951,0.9821465,0.00023881043,0.00022348229],"about_ca_topic_score_codex":0.0000015121218,"about_ca_topic_score_gemma":6.453569e-7,"teacher_disagreement_score":0.8037121,"about_ca_system_score_codex":0.000052522802,"about_ca_system_score_gemma":0.0000743812,"threshold_uncertainty_score":0.72146523},"labels":[],"label_agreement":null},{"id":"W4291794536","doi":"10.1016/j.dam.2022.08.005","title":"Irredundance graphs","year":2022,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Research Foundation","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Disjoint sets; Graph; Discrete mathematics","score_opus":0.019515790046845772,"score_gpt":0.2775828868383306,"score_spread":0.2580670967914848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291794536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008200168,0.000100919555,0.9363103,0.00034912984,0.00015643763,0.0004979983,0.000015216152,0.000413801,0.05395603],"genre_scores_gemma":[0.6415294,0.000009480255,0.3568306,0.0002988301,0.000019280964,0.000521581,0.000008663126,0.00003867776,0.00074349024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981578,0.00003561105,0.00026819145,0.00039657162,0.00070652005,0.00043529473],"domain_scores_gemma":[0.9984787,0.00017319378,0.00012416272,0.0010897289,0.000027636432,0.00010657019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054153695,0.00016497834,0.00020455672,0.00015843661,0.0005119652,0.000100398014,0.0018822233,0.000022264012,0.00012455205],"category_scores_gemma":[0.000023190321,0.00016000512,0.00008586678,0.0009259729,0.00010218376,0.00016963312,0.0013331679,0.000326589,0.000091357884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004853469,0.00006860342,0.0000046345363,0.00002706766,0.000012593112,0.000008458071,0.0011153601,0.00035033637,0.0030723654,0.9915575,0.00043734623,0.0033408871],"study_design_scores_gemma":[0.0002386763,0.00004380646,0.000016498292,0.0000036935467,0.000003854169,0.000024910309,0.00060537993,0.011695864,0.0017502845,0.9799333,0.0054483893,0.00023531825],"about_ca_topic_score_codex":8.202442e-7,"about_ca_topic_score_gemma":4.189257e-7,"teacher_disagreement_score":0.6333292,"about_ca_system_score_codex":0.00005515905,"about_ca_system_score_gemma":0.00004444241,"threshold_uncertainty_score":0.6524819},"labels":[],"label_agreement":null},{"id":"W4320477987","doi":"10.1016/j.dam.2023.01.031","title":"The speed and threshold of the biased perfect matching and Hamilton cycle games","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","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":"Université de Montréal; Dawson College; McGill University","funders":"","keywords":"Mathematics; Infinity; Matching (statistics); Combinatorics; Constant (computer programming); Hamiltonian path; Mathematical economics; Discrete mathematics; Computer science; Statistics; Mathematical analysis; Graph","score_opus":0.024694619992312365,"score_gpt":0.2227033323834754,"score_spread":0.19800871239116302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320477987","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98373187,0.00029206986,0.00027877244,0.00016389854,0.00009573509,0.00029830422,0.000029583402,0.000041665844,0.015068093],"genre_scores_gemma":[0.99912333,0.00012307373,0.00017051425,0.000028897515,0.00002957526,0.000012806154,0.0000019646777,0.000023207294,0.00048660982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915797,0.000010416481,0.00040754254,0.00018174229,0.00004920693,0.00019312084],"domain_scores_gemma":[0.9989526,0.000339157,0.00029008335,0.00037923877,0.000007077683,0.00003180395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011868268,0.00012122993,0.00028196914,0.00004941907,0.0002421312,0.00008465165,0.00019992405,0.000051913557,0.0000066674806],"category_scores_gemma":[0.00006198148,0.00007824539,0.000057251087,0.00018251283,0.00016252843,0.000036323778,0.00011187968,0.00010229205,0.000038664544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006224248,0.00001012911,0.0010376283,0.00020212973,0.000033601496,2.6591223e-7,0.0054631867,0.00008292614,0.0011309965,0.99181247,0.000048183523,0.00017228314],"study_design_scores_gemma":[0.0004110963,0.000020508085,0.0049249395,0.00009976835,0.000018285093,0.0000053540048,0.0040796814,0.010104312,0.0013789145,0.9781643,0.0005895507,0.00020327087],"about_ca_topic_score_codex":0.000013897987,"about_ca_topic_score_gemma":0.0000048739116,"teacher_disagreement_score":0.015391474,"about_ca_system_score_codex":0.000008407367,"about_ca_system_score_gemma":0.000003979552,"threshold_uncertainty_score":0.31907547},"labels":[],"label_agreement":null},{"id":"W4327905048","doi":"10.1016/j.dam.2023.03.019","title":"Separable and equatable hypergraphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Technion-Israel Institute of Technology; Israel Science Foundation; University of Toronto","keywords":"Matroid; Hypergraph; Separable space; Mathematics; Combinatorics; Class (philosophy); Discrete mathematics; Monotone polygon; Function (biology); Binary number; Multipartite; Computer science; Arithmetic","score_opus":0.025312144205700066,"score_gpt":0.29147204455506776,"score_spread":0.2661599003493677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327905048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036764685,0.00014167248,0.89478314,0.00038094074,0.00008470814,0.000571208,0.00000965427,0.0011137463,0.066150226],"genre_scores_gemma":[0.5552253,0.0002724549,0.4409416,0.000189345,0.000045337092,0.0002680663,0.000018254977,0.00007119298,0.002968413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985873,0.0000138685655,0.00021053453,0.0003579217,0.0003491555,0.00048123003],"domain_scores_gemma":[0.99873966,0.00029236425,0.000060801714,0.000745985,0.000029264458,0.00013193155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005383246,0.0001556825,0.00021147661,0.00020403626,0.00019371758,0.00015883922,0.00067350216,0.000050351053,0.000013262532],"category_scores_gemma":[0.00004656948,0.00013414769,0.000040157312,0.0011566249,0.00010879008,0.00024853012,0.00058139354,0.0001375799,0.00041469352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002384822,0.000015857804,0.000012981677,0.00007846822,0.000013597963,0.000007320964,0.000630876,0.000087868335,0.006535828,0.9890392,0.0005691749,0.0030064317],"study_design_scores_gemma":[0.00023570163,0.000021030603,0.000041399915,0.00001706462,0.000005254797,0.000008877454,0.00032025875,0.058983378,0.0042533013,0.93414897,0.0017523722,0.00021240851],"about_ca_topic_score_codex":0.0000015059958,"about_ca_topic_score_gemma":8.807313e-7,"teacher_disagreement_score":0.51846063,"about_ca_system_score_codex":0.000011325072,"about_ca_system_score_gemma":0.000021726291,"threshold_uncertainty_score":0.5470384},"labels":[],"label_agreement":null},{"id":"W4365456027","doi":"10.1016/j.dam.2023.03.002","title":"Broadcast graphs using new dimensional broadcast schemes for Knödel graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Hypercube; Graph; Upper and lower bounds; Discrete mathematics","score_opus":0.04483337236795438,"score_gpt":0.28415459781928093,"score_spread":0.23932122545132656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365456027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029230453,0.00009560772,0.96615374,0.00018679127,0.00080993044,0.00077269797,0.00001681054,0.0005519272,0.0021820564],"genre_scores_gemma":[0.46339682,0.000028977842,0.5331378,0.0004489829,0.0004834629,0.00021684889,0.00007012714,0.00013120972,0.002085789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790883,0.000015347689,0.0005733808,0.0005125643,0.00042704152,0.0005628378],"domain_scores_gemma":[0.9985534,0.0002456668,0.00024257711,0.0006744315,0.000097796175,0.00018616252],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044046974,0.00030204965,0.00040862706,0.00026591425,0.00033817644,0.00026964617,0.000657662,0.00013138259,0.000019148054],"category_scores_gemma":[0.000029319726,0.00026255535,0.00025202258,0.0009203614,0.00005518824,0.00022615405,0.0002837884,0.00014441855,0.0001143823],"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.00001038563,0.0000415464,0.0000073360525,0.00014655384,0.00007909182,0.0000043025743,0.0013264851,0.0017400807,0.0058918926,0.9705197,0.0127979545,0.0074346517],"study_design_scores_gemma":[0.0007092685,0.000048695474,0.000007906916,0.00013584577,0.000031611835,0.000039623865,0.00044934606,0.7554195,0.0015213396,0.22943147,0.01173792,0.00046750993],"about_ca_topic_score_codex":0.000016220054,"about_ca_topic_score_gemma":0.000003156516,"teacher_disagreement_score":0.7536794,"about_ca_system_score_codex":0.000033781453,"about_ca_system_score_gemma":0.0000803552,"threshold_uncertainty_score":0.99998266},"labels":[],"label_agreement":null},{"id":"W4379622149","doi":"10.1016/j.dam.2023.05.022","title":"A local search approximation algorithm for the multiway cut problem","year":2023,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Approximation algorithm; Combinatorics; Heuristic; Set (abstract data type); Local search (optimization); Algorithm; Graph; Discrete mathematics; Mathematical optimization; Computer science","score_opus":0.03813232295211413,"score_gpt":0.28438786931293325,"score_spread":0.24625554636081912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379622149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000112284295,0.000020417629,0.9952919,0.00070845097,0.00011239939,0.0013388355,0.000023028637,0.0004881166,0.0019045585],"genre_scores_gemma":[0.015559929,0.000020450749,0.9830853,0.000107906875,0.00008997795,0.0007781769,0.000034796212,0.000030858508,0.00029261282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834347,0.000016045806,0.000331482,0.00036809416,0.00047580036,0.00046508413],"domain_scores_gemma":[0.9982992,0.00070804934,0.00009496497,0.00074397685,0.00007882526,0.00007498652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008521766,0.00019494085,0.00021524409,0.00011984033,0.00045311882,0.00024596154,0.0011744251,0.00007175804,0.0000069965495],"category_scores_gemma":[0.00001771779,0.00013533908,0.00012677044,0.00087575463,0.0001606239,0.00015227626,0.0004594677,0.00018017477,0.00014720488],"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.00000183211,0.00005144584,2.484416e-7,0.00014106753,0.00003634566,0.000001297718,0.0032467295,0.000989661,0.00015455557,0.6295724,0.00088899146,0.36491546],"study_design_scores_gemma":[0.00029032555,0.00002403485,0.000008170553,0.000019315748,0.000012003324,0.0000046271048,0.0009388628,0.8100781,0.0014301279,0.18563093,0.0014038035,0.00015971225],"about_ca_topic_score_codex":0.0000059654917,"about_ca_topic_score_gemma":0.0000033843576,"teacher_disagreement_score":0.8090884,"about_ca_system_score_codex":0.00002958213,"about_ca_system_score_gemma":0.000044819404,"threshold_uncertainty_score":0.55189675},"labels":[],"label_agreement":null},{"id":"W4380928971","doi":"10.1016/j.dam.2023.06.003","title":"The localization game on oriented graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Random graph; Discrete mathematics; Upper and lower bounds; Extension (predicate logic); Graph; Computer science","score_opus":0.014268984376270022,"score_gpt":0.2398075032930202,"score_spread":0.22553851891675017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380928971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022393975,0.000054495988,0.95143884,0.0017002848,0.0006076487,0.00069378765,0.000004627701,0.0019090994,0.021197233],"genre_scores_gemma":[0.97275275,0.0001231163,0.025292713,0.00078728027,0.000014012443,0.00016373495,0.000031802596,0.000047600977,0.0007869957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987636,0.000014780077,0.00026734456,0.00025787612,0.00040080404,0.00029560013],"domain_scores_gemma":[0.9987866,0.0002366336,0.00010829705,0.00074814534,0.000050800933,0.000069511705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044153913,0.00013738133,0.0001236165,0.000106687825,0.0003260988,0.00015103401,0.0005118051,0.000048900994,0.000002605295],"category_scores_gemma":[0.00005234766,0.00008624818,0.000055940145,0.0011524844,0.00007553095,0.00005512512,0.00015966303,0.000098505116,0.0005105064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020889709,0.000020910047,0.000002697723,0.000016042803,0.000010173138,0.0000014748209,0.0007393588,0.00094714045,0.00046041404,0.9931171,0.0029694692,0.0017131084],"study_design_scores_gemma":[0.0002019286,0.000029685743,0.000015811162,0.000027195285,0.000006297473,0.0000014235178,0.00020411168,0.21361843,0.0016852985,0.78024995,0.0038229346,0.00013691037],"about_ca_topic_score_codex":0.0000013049358,"about_ca_topic_score_gemma":0.0000010222568,"teacher_disagreement_score":0.95035875,"about_ca_system_score_codex":0.000009763814,"about_ca_system_score_gemma":0.000016578319,"threshold_uncertainty_score":0.6561697},"labels":[],"label_agreement":null},{"id":"W4381929460","doi":"10.1016/j.dam.2023.05.024","title":"Minimum consistent subset of simple graph classes","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Machine Learning and Data Classification","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":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Undirected graph; Graph; Feedback vertex set; Discrete mathematics; Simple graph; Planar graph","score_opus":0.028685704390450494,"score_gpt":0.28005047055770643,"score_spread":0.25136476616725595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381929460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10552139,0.00004195568,0.8542376,0.001220851,0.00016452481,0.0005327741,0.00007783114,0.0009675203,0.03723551],"genre_scores_gemma":[0.93775076,0.00003026733,0.061750386,0.00006434433,0.00001976511,0.000040351515,0.00016958965,0.00001615232,0.00015837909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885905,0.000017940623,0.0003510853,0.0002562325,0.00030017726,0.00021551203],"domain_scores_gemma":[0.99859446,0.00026531643,0.00021893173,0.0008160963,0.000042137184,0.00006303172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003475127,0.00012727838,0.0002230226,0.0001387688,0.00007738185,0.00006444344,0.0005937053,0.000051385396,0.000013473165],"category_scores_gemma":[0.000081746024,0.0001081802,0.00006685757,0.00064508495,0.0000673712,0.00008777756,0.00021808519,0.00009331186,0.00017536314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030832161,0.000063428044,0.00017442046,0.00025091114,0.000028185063,0.000002402842,0.0012320961,0.000102317885,0.010846289,0.97682446,0.0065814583,0.0038909498],"study_design_scores_gemma":[0.0014332876,0.00017783581,0.009879305,0.00012791253,0.00010790895,0.000019863686,0.0038317316,0.38892066,0.019398384,0.55053467,0.024465954,0.0011025089],"about_ca_topic_score_codex":0.000005100226,"about_ca_topic_score_gemma":0.0000031185887,"teacher_disagreement_score":0.8322294,"about_ca_system_score_codex":0.000008454122,"about_ca_system_score_gemma":0.000031012467,"threshold_uncertainty_score":0.44114605},"labels":[],"label_agreement":null},{"id":"W4385071507","doi":"10.1016/j.dam.2023.07.008","title":"The palindromization map","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Suffix; Combinatorics; Rank (graph theory); Automaton; Context (archaeology); Deterministic automaton; Discrete mathematics; Algorithm; Theoretical computer science; Finite-state machine; Computer science; Linguistics; Geography","score_opus":0.011529498334838609,"score_gpt":0.23470012158322162,"score_spread":0.22317062324838302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385071507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005758523,0.00004963656,0.9752835,0.0019036777,0.0003567389,0.00035233903,0.0000037107404,0.0011841946,0.015107663],"genre_scores_gemma":[0.81396395,0.0001707027,0.18072581,0.00067768863,0.00027124642,0.00033390865,0.00006245867,0.00009049252,0.0037037183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909544,0.000011662793,0.00021148632,0.00018023494,0.0002450804,0.00025608097],"domain_scores_gemma":[0.9988438,0.0003208014,0.00009042997,0.0006835898,0.000017849452,0.000043553522],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051640364,0.00010622262,0.00010812721,0.000041087398,0.00028625302,0.000244459,0.0008334945,0.00003953619,0.0000062311683],"category_scores_gemma":[0.000029102604,0.0000673613,0.000044389442,0.00040655016,0.000046554364,0.00009201408,0.00028282305,0.00006956602,0.00084526936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.041025e-7,0.000007529141,0.0000010941147,0.000021201884,0.000008788828,0.0000020290822,0.0007904887,0.0000617391,0.00065452256,0.9867932,0.0044031553,0.0072555235],"study_design_scores_gemma":[0.00017062326,0.000008638517,0.000060278642,0.000016419255,0.000006576959,0.0000036866954,0.00058342936,0.2718906,0.0018438906,0.7170663,0.008182676,0.00016687851],"about_ca_topic_score_codex":5.8533027e-7,"about_ca_topic_score_gemma":6.8544495e-7,"teacher_disagreement_score":0.8082054,"about_ca_system_score_codex":0.000011194216,"about_ca_system_score_gemma":0.000015425789,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W4386397972","doi":"10.1016/j.dam.2023.08.015","title":"The iterative independent model","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","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":"Queen's University","funders":"","keywords":"Mathematics; Vertex (graph theory); Combinatorics; Bounded function; Random graph; Cluster analysis; Discrete mathematics; Graph","score_opus":0.017420651430295933,"score_gpt":0.2782653337915683,"score_spread":0.2608446823612724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386397972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045464836,0.000015845402,0.7174606,0.00032767098,0.000038497103,0.000663151,0.000033780158,0.0005110295,0.2354846],"genre_scores_gemma":[0.9882806,0.000005516225,0.009683943,0.00002365449,0.00009696902,0.00023078414,0.000052078365,0.000028829143,0.0015976392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990614,0.00000841518,0.0002565064,0.00017049312,0.0002350393,0.0002681538],"domain_scores_gemma":[0.99922264,0.00015375651,0.000113898386,0.00043381858,0.000030639654,0.000045270026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002525744,0.00014900464,0.00017815812,0.000043387223,0.0002967788,0.00012551375,0.000301414,0.000023245879,0.000056152654],"category_scores_gemma":[0.0000029294567,0.00009866597,0.00010659628,0.00030607844,0.000054183227,0.000034833076,0.00018843864,0.00013691568,0.0001881667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023495759,0.00002207555,0.000037546473,0.000006470828,0.00008391535,2.998857e-7,0.0010461856,0.00212792,0.0006987813,0.9860288,0.0062474143,0.0036982545],"study_design_scores_gemma":[0.00008352618,0.0000037879008,0.000018745955,0.00000797385,0.0000316914,9.6241784e-8,0.001090464,0.38904804,0.0012371569,0.607379,0.0009696179,0.00012985722],"about_ca_topic_score_codex":0.0000033331082,"about_ca_topic_score_gemma":0.0000028754662,"teacher_disagreement_score":0.9428158,"about_ca_system_score_codex":0.000013998804,"about_ca_system_score_gemma":0.000018716717,"threshold_uncertainty_score":0.40234816},"labels":[],"label_agreement":null},{"id":"W4388159066","doi":"10.1016/j.dam.2023.10.016","title":"Rolling horizon strategies for a dynamic and stochastic ridesharing problem with rematches","year":2023,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Mathematics; Mathematical optimization; Dynamic programming; Horizon; Geometry","score_opus":0.01275822793577122,"score_gpt":0.23435627171026435,"score_spread":0.22159804377449313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388159066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35697657,0.000008101918,0.6406505,0.00003985945,0.000018823923,0.000615538,0.000035006407,0.00052735896,0.0011282198],"genre_scores_gemma":[0.9369963,0.0000067487854,0.06246294,0.000004006643,0.000010062547,0.0003894909,0.000064601816,0.000045437322,0.000020442341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993558,6.92847e-7,0.00022728344,0.00013525822,0.00009586832,0.00018513006],"domain_scores_gemma":[0.9996388,0.00007326432,0.00004641965,0.00018004398,0.000027462987,0.000033988632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000109839995,0.00013709751,0.00016588402,0.000075125026,0.00012782193,0.00011679104,0.00007710982,0.000042958443,0.000002471725],"category_scores_gemma":[0.000005514063,0.00012036826,0.000020076486,0.00017538504,0.00004123066,0.00010362328,0.000009967447,0.00007379799,0.0000053312788],"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.000023404942,0.000026607178,0.000018312681,0.003668478,0.00017262505,0.000001730611,0.008174867,0.33229974,0.023529714,0.6301068,0.00005327088,0.0019244327],"study_design_scores_gemma":[0.0010414552,0.000078122925,0.00072779093,0.00028501797,0.00014941563,0.000003956725,0.01811559,0.79962933,0.000850015,0.17855184,0.000043455148,0.00052400184],"about_ca_topic_score_codex":0.0000014519878,"about_ca_topic_score_gemma":0.00005780725,"teacher_disagreement_score":0.5800197,"about_ca_system_score_codex":0.0000144880605,"about_ca_system_score_gemma":0.000014795321,"threshold_uncertainty_score":0.49084753},"labels":[],"label_agreement":null},{"id":"W4389067604","doi":"10.1016/j.dam.2023.11.042","title":"Vertex-critical <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e185\" altimg=\"si23.svg\"><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub><mml:mo linebreak=\"goodbreak\" linebreakstyle=\"after\">+</mml:mo><mml:mi>ℓ</mml:mi><mml:msub><mml:mrow><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math>-free and vertex-critical (gem, co-gem)-free graphs","year":2023,"lang":"lv","type":"article","venue":"Discrete Applied 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":"University of Guelph; University of Prince Edward Island; Wilfrid Laurier University","funders":"","keywords":"Combinatorics; Vertex (graph theory); Mathematics; Graph; Clique number; Discrete mathematics","score_opus":0.019513514046064873,"score_gpt":0.264985636913285,"score_spread":0.24547212286722014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389067604","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17152205,0.0040219794,0.008789769,0.002843609,0.007193052,0.00023701153,0.0028458072,0.0014773,0.80106944],"genre_scores_gemma":[0.9537618,0.004456209,0.0150117725,0.0044716643,0.0049996814,0.007300087,0.005151418,0.004072869,0.0007744821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96276057,0.0019915167,0.007063694,0.0073032677,0.010514916,0.010366063],"domain_scores_gemma":[0.9676624,0.0103395805,0.0055203014,0.009620259,0.00095865794,0.0058987876],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.008165802,0.003729036,0.0014561957,0.003070286,0.005917838,0.0071855104,0.012136861,0.0085957,0.7451517],"category_scores_gemma":[0.010834826,0.0078084995,0.006524046,0.006506391,0.0103627695,0.005491507,0.012225948,0.0074309423,0.007973899],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038672842,0.001040451,0.000018553246,0.004451017,0.0038861672,0.004764961,0.0036751411,0.0016088102,0.0042279297,0.48837864,0.48031235,0.003768681],"study_design_scores_gemma":[0.0067369547,0.0049452707,0.00012247778,0.004459967,0.005452338,0.0064451583,0.006053768,0.036553,0.91074204,0.0056536533,0.0057804314,0.00705491],"about_ca_topic_score_codex":0.002908201,"about_ca_topic_score_gemma":0.0040943976,"teacher_disagreement_score":0.90651417,"about_ca_system_score_codex":0.00007592288,"about_ca_system_score_gemma":0.0053708004,"threshold_uncertainty_score":0.99754304},"labels":[],"label_agreement":null},{"id":"W4390238367","doi":"10.1016/j.dam.2023.12.003","title":"Induced forests in some distance-regular graphs","year":2023,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Regina; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Combinatorics; Vertex (graph theory); Upper and lower bounds; Order (exchange); Graph; Discrete mathematics","score_opus":0.028890506300846216,"score_gpt":0.29864886284332104,"score_spread":0.2697583565424748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390238367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49592826,0.00006602241,0.49384606,0.0005487297,0.00018227095,0.0012429467,0.0000121642415,0.0010296581,0.0071439054],"genre_scores_gemma":[0.9639697,0.000024655938,0.035428185,0.00006014248,0.000024717707,0.00026763542,0.000012889475,0.000043875938,0.00016818092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775743,0.000029085228,0.00041444178,0.00049094175,0.0006017265,0.0007063585],"domain_scores_gemma":[0.99828875,0.00027077913,0.00011366615,0.001155472,0.000032349064,0.00013897305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006924513,0.00023686617,0.00032766483,0.00048024885,0.00011779243,0.000119924916,0.0013855454,0.00009508946,0.000006216068],"category_scores_gemma":[0.00007045803,0.0002115265,0.00008812529,0.0022266733,0.00010858418,0.0003962031,0.00055924436,0.00027578062,0.0002853555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005986862,0.000041837025,0.000079204576,0.00008687604,0.000010706,0.000030096564,0.0011586146,0.00013490004,0.006348471,0.98925275,0.00009868541,0.0027518694],"study_design_scores_gemma":[0.00042732153,0.000023590179,0.00080975186,0.00004303755,0.0000026700027,0.0000024122244,0.0002828689,0.02151463,0.0051476313,0.971356,0.0001296589,0.0002604307],"about_ca_topic_score_codex":0.0000020287266,"about_ca_topic_score_gemma":0.000021629705,"teacher_disagreement_score":0.46804148,"about_ca_system_score_codex":0.000049487706,"about_ca_system_score_gemma":0.000041471507,"threshold_uncertainty_score":0.86258},"labels":[],"label_agreement":null},{"id":"W4391123222","doi":"10.1016/j.dam.2024.01.017","title":"A note on the minimum size of matching-saturated graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied 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":"Thompson Rivers University","funders":"Xi’an Jiaotong University; National Natural Science Foundation of China","keywords":"Combinatorics; Mathematics; Graph; Complement (music); Matching (statistics); Discrete mathematics; Statistics","score_opus":0.018700145839186038,"score_gpt":0.2922533596073705,"score_spread":0.2735532137681844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391123222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070914485,0.00017465127,0.8837072,0.0021880048,0.0002668178,0.0010911543,0.000028346722,0.00057636807,0.041052964],"genre_scores_gemma":[0.9216675,0.000018048426,0.077739775,0.00015955667,0.000020814547,0.00007681924,0.0000019979102,0.000034915065,0.00028053098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983205,0.0000400226,0.00036037495,0.0003627765,0.0005726905,0.00034362834],"domain_scores_gemma":[0.9962471,0.0024900958,0.000098887904,0.0010450529,0.00004817373,0.00007068307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067542156,0.00021543581,0.00025148736,0.00012842061,0.00011557397,0.0001882748,0.0012864163,0.00006814885,0.00003350922],"category_scores_gemma":[0.0001224508,0.00012864824,0.00013332046,0.0010289081,0.00018735143,0.0001275798,0.00030599046,0.00035710653,0.00014684447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010331991,0.000036554422,1.7582319e-7,0.00017368482,0.000034808392,0.000008689527,0.0030834517,0.000053560987,0.031785652,0.96291196,0.00025468416,0.0016464468],"study_design_scores_gemma":[0.000105402316,0.00004701698,0.000006894919,0.00014028414,0.000011198025,0.0000065068816,0.00032075332,0.021569349,0.0233317,0.95401174,0.00028522857,0.00016390844],"about_ca_topic_score_codex":0.00000130193,"about_ca_topic_score_gemma":8.638639e-7,"teacher_disagreement_score":0.85075307,"about_ca_system_score_codex":0.000022530523,"about_ca_system_score_gemma":0.000053084972,"threshold_uncertainty_score":0.5246123},"labels":[],"label_agreement":null},{"id":"W4391294907","doi":"10.1016/j.dam.2024.01.014","title":"The <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e20\" altimg=\"si5.svg\"> <mml:mi>q</mml:mi> </mml:math> -analogue of zero forcing for certain families of graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Manitoba; University of Regina","funders":"Natural Sciences and Engineering Research Council of Canada; University of Regina","keywords":"Mathematics; Scalable Vector Graphics; Zero (linguistics); Combinatorics; Forcing (mathematics); Algorithm; Discrete mathematics; Mathematical analysis; Computer science; World Wide Web","score_opus":0.02191222765559496,"score_gpt":0.275700517625191,"score_spread":0.253788289969596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391294907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.594599,0.0003773161,0.40218982,0.00016924318,0.00023536949,0.00027493524,0.00013142938,0.00016025557,0.0018626279],"genre_scores_gemma":[0.9394423,0.00019253665,0.059522804,0.000071385366,0.00007090182,0.00046559138,0.000065011925,0.00010794268,0.000061539344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689937,0.000044811106,0.00090075796,0.00057974475,0.0008662917,0.0007090331],"domain_scores_gemma":[0.99582237,0.0020710388,0.00048341675,0.0013767738,0.00010049486,0.00014588112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013906021,0.0003457045,0.00036193462,0.0001987083,0.00043449798,0.00027843838,0.001545587,0.00022913895,0.0000032647738],"category_scores_gemma":[0.00030147398,0.00029797497,0.0004824354,0.0006809409,0.000596448,0.00033990963,0.00077295094,0.00037802407,0.0000630423],"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.000064795255,0.00006602954,0.0000010998639,0.0014166592,0.00024991969,0.00001536659,0.0026990697,0.00065104844,0.005807128,0.98668736,0.00011517679,0.0022263296],"study_design_scores_gemma":[0.00024085783,0.00015330323,0.0000025962875,0.00025784306,0.000098986755,0.000023506593,0.0015436938,0.71151567,0.019505564,0.26603994,0.00039747488,0.00022056671],"about_ca_topic_score_codex":0.000025236275,"about_ca_topic_score_gemma":0.00003145979,"teacher_disagreement_score":0.72064745,"about_ca_system_score_codex":0.000015054059,"about_ca_system_score_gemma":0.00018274902,"threshold_uncertainty_score":0.99994725},"labels":[],"label_agreement":null},{"id":"W4392646833","doi":"10.1016/j.dam.2024.02.021","title":"Metric spaces in which many triangles are degenerate","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Geometric and Algebraic Topology","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":"Concordia University","funders":"Horizon 2020 Framework Programme; Agence Nationale de la Recherche; Grantová Agentura České Republiky; Univerzita Karlova v Praze","keywords":"Mathematics; Degenerate energy levels; Metric space; Metric (unit); Combinatorics; Discrete mathematics; Algebra over a field; Pure mathematics","score_opus":0.03521962646800665,"score_gpt":0.29880754060297376,"score_spread":0.2635879141349671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392646833","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83234674,0.0032979446,0.09173423,0.001738077,0.0007579506,0.0015655602,0.00007363158,0.00095886533,0.067527026],"genre_scores_gemma":[0.94983584,0.00012107853,0.04810484,0.000057509773,0.00017915707,0.0001486521,0.00001385164,0.00009789702,0.0014411748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977613,0.00003774614,0.0007206973,0.000497021,0.00041011078,0.0005731407],"domain_scores_gemma":[0.99789953,0.0012047545,0.00019459688,0.00052995596,0.00005087642,0.000120282755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008073883,0.00037606037,0.0007054349,0.0010559902,0.000079490455,0.00019081582,0.00037676955,0.00023359446,0.000337557],"category_scores_gemma":[0.0006172978,0.00030009288,0.00013119711,0.0032915277,0.00007783874,0.00009855772,0.0001541907,0.00037978232,0.0003727795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009109911,0.00015143106,0.000049863094,0.0011590658,0.000097310134,0.00007146816,0.0020162202,0.00002074871,0.00042870032,0.99160486,0.0027078225,0.0016833945],"study_design_scores_gemma":[0.0007962381,0.00004857409,0.00019313702,0.00028116646,0.00018642061,0.000052418938,0.0049954355,0.004904361,0.0020310944,0.9816513,0.0042121266,0.0006477221],"about_ca_topic_score_codex":0.000009657492,"about_ca_topic_score_gemma":0.00006949761,"teacher_disagreement_score":0.11748912,"about_ca_system_score_codex":0.00008536226,"about_ca_system_score_gemma":0.00007083575,"threshold_uncertainty_score":0.9999451},"labels":[],"label_agreement":null},{"id":"W4394944952","doi":"10.1016/j.dam.2024.04.006","title":"Polynomial-time equivalences and refined algorithms for longest common subsequence variants","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Longest common subsequence problem; Longest increasing subsequence; Time complexity; Combinatorics; Subsequence; Algorithm; Discrete mathematics","score_opus":0.025046929772513573,"score_gpt":0.285335616274388,"score_spread":0.2602886865018745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394944952","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042100847,0.0006920575,0.9894993,0.0007008221,0.0003054445,0.0006078132,0.00013452982,0.0004380202,0.0034119645],"genre_scores_gemma":[0.08434637,0.00012698409,0.9142526,0.00015342898,0.00024032414,0.00017920234,0.00007130866,0.000048565133,0.00058123545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984345,0.000012794134,0.0003563419,0.0005572822,0.00028134228,0.00035775846],"domain_scores_gemma":[0.9986965,0.00040654864,0.000095523385,0.0006429831,0.000030184776,0.00012824479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043485413,0.0002451249,0.00032213403,0.000091008886,0.00019005919,0.0006005237,0.0007780984,0.00009578584,0.000016524551],"category_scores_gemma":[0.000023424855,0.00019030216,0.000059415135,0.00024202699,0.00010049263,0.00046530127,0.0004814113,0.00012795474,0.000069525064],"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.000031295593,0.0001861712,0.000005906486,0.0017007207,0.00014882459,0.00007814959,0.0040337467,0.000044483517,0.045760512,0.6474236,0.021976562,0.27860996],"study_design_scores_gemma":[0.00039932624,0.0001260218,0.00006740561,0.00034722005,0.000053041545,0.00006546458,0.0001229341,0.9303618,0.0035452554,0.057479713,0.006894796,0.0005370365],"about_ca_topic_score_codex":0.0000120649065,"about_ca_topic_score_gemma":0.0000018584853,"teacher_disagreement_score":0.9303173,"about_ca_system_score_codex":0.000026432208,"about_ca_system_score_gemma":0.00005661816,"threshold_uncertainty_score":0.7760297},"labels":[],"label_agreement":null},{"id":"W4395689393","doi":"10.1016/j.dam.2024.04.012","title":"Proximity and remoteness in graphs: A survey","year":2024,"lang":"en","type":"article","venue":"Discrete Applied 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":"Polytechnique Montréal","funders":"United Arab Emirates University","keywords":"Mathematics; Combinatorics","score_opus":0.030622952570315574,"score_gpt":0.30350614578349416,"score_spread":0.2728831932131786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395689393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09857776,0.0003973711,0.8937667,0.00017539652,0.00007734999,0.000594263,0.000010504517,0.00029410826,0.0061065536],"genre_scores_gemma":[0.8618464,0.00006957391,0.1378253,0.00004622502,0.000009838307,0.00006523178,0.0000055209043,0.00002785992,0.0001040557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986599,0.000049888215,0.00025547683,0.00043051277,0.00028357495,0.0003206417],"domain_scores_gemma":[0.9988184,0.0004907722,0.000032886164,0.00054695876,0.000027063848,0.00008394801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273672,0.0001566059,0.00021597162,0.00023847594,0.000054514734,0.00025123756,0.0005425322,0.000060271366,0.0000046323366],"category_scores_gemma":[0.00008241059,0.00012807545,0.000032255062,0.0010232623,0.0001184261,0.0003077652,0.00036344185,0.00023301531,0.000025643369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054093225,0.000027719943,0.00008998866,0.00028285797,0.000010369514,0.000021587408,0.0010487246,0.000010711141,0.0009274716,0.988861,0.00004097173,0.008673173],"study_design_scores_gemma":[0.00014699395,0.00001664901,0.0013043421,0.00007545772,0.0000027890305,0.000014253443,0.0000798717,0.049147114,0.00083374494,0.94807,0.00011615406,0.00019261727],"about_ca_topic_score_codex":0.000009779711,"about_ca_topic_score_gemma":0.000031195865,"teacher_disagreement_score":0.76326865,"about_ca_system_score_codex":0.000024090734,"about_ca_system_score_gemma":0.000040492705,"threshold_uncertainty_score":0.5222765},"labels":[],"label_agreement":null},{"id":"W4399412507","doi":"10.1016/j.dam.2024.05.024","title":"Graph exploration by a deterministic memoryless automaton with pebbles","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Mathematics; Deterministic automaton; Two-way deterministic finite automaton; Automaton; Graph; Büchi automaton; Combinatorics; Theoretical computer science; Discrete mathematics; Nondeterministic finite automaton; Algorithm; Finite-state machine; Computer science; Automata theory","score_opus":0.01631122847895078,"score_gpt":0.2548495017715611,"score_spread":0.23853827329261035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399412507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010495533,0.000079598125,0.98687017,0.00040942282,0.00006521263,0.00039215962,0.000008139384,0.0007171311,0.010408592],"genre_scores_gemma":[0.6053607,0.0000655026,0.39324403,0.00016590669,0.000033516462,0.00034039465,0.000054821063,0.00005977503,0.00067534915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987229,0.0000152472385,0.00025712443,0.00034925944,0.0004013859,0.0002540673],"domain_scores_gemma":[0.9992539,0.00010463267,0.00006193517,0.0004389458,0.000039313047,0.00010125889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021858087,0.0001817877,0.00018041253,0.00012106492,0.00011909695,0.000672283,0.00044368595,0.00005322693,0.000022349961],"category_scores_gemma":[0.000008631501,0.00013519105,0.000039068807,0.00049444556,0.000065357715,0.00045809976,0.00010292424,0.00012108954,0.00009605495],"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.0000039978213,0.00008561234,0.0000013330224,0.0005877022,0.00005031486,0.000022460275,0.00636273,0.0010676282,0.002223566,0.9787791,0.0033566314,0.007458957],"study_design_scores_gemma":[0.00029010972,0.00008872255,0.0000018711208,0.00017735215,0.000028695815,0.000025813184,0.00059888884,0.9067975,0.0037305774,0.086197235,0.0016920884,0.00037111016],"about_ca_topic_score_codex":0.0000013070456,"about_ca_topic_score_gemma":0.000002229118,"teacher_disagreement_score":0.9057299,"about_ca_system_score_codex":0.000023888266,"about_ca_system_score_gemma":0.000065172026,"threshold_uncertainty_score":0.6482841},"labels":[],"label_agreement":null},{"id":"W4399765963","doi":"10.1016/j.dam.2024.06.004","title":"Tilted inequalities and facets of the set covering polytope: A theoretical analysis","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polytope; Mathematics; Combinatorics; Set (abstract data type); Inequality; Convex polytope; Geometry; Convex set; Regular polygon; Computer science; Mathematical analysis","score_opus":0.009344354657184235,"score_gpt":0.23148237974984825,"score_spread":0.22213802509266403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399765963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06576866,0.00021237892,0.9252922,0.00003118965,0.00006357401,0.00015368625,0.000071074755,0.0002223293,0.008184939],"genre_scores_gemma":[0.9864878,0.00005894332,0.01334273,0.000007646549,0.00001355297,0.000012045199,0.000013816429,0.000022958302,0.00004049168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945414,0.0000051112775,0.0002025945,0.00010062668,0.00012049633,0.000117024836],"domain_scores_gemma":[0.9996011,0.00013396669,0.000024549392,0.00020505054,0.000009093491,0.000026234307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000090274494,0.00011522217,0.00019283462,0.000068308414,0.00003235531,0.00004322731,0.00008700718,0.000047372807,0.000026767195],"category_scores_gemma":[0.000025433543,0.000078511504,0.000053785665,0.00023847469,0.000117146315,0.00003019758,0.000054758366,0.00009948971,0.0000022322324],"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.0000017732642,0.0000043336763,0.0000055122323,0.00055809144,0.00020883472,4.872544e-7,0.0020977787,0.28918174,0.0010958924,0.7065597,0.000024419118,0.0002614343],"study_design_scores_gemma":[0.00009054662,0.0000068507834,0.000063139,0.00007517719,0.00043214305,0.0000022788247,0.00087805383,0.87105256,0.019567078,0.10753305,0.00011504106,0.00018405623],"about_ca_topic_score_codex":0.0000012456015,"about_ca_topic_score_gemma":0.0000011672137,"teacher_disagreement_score":0.92071915,"about_ca_system_score_codex":0.000014827487,"about_ca_system_score_gemma":0.000005045782,"threshold_uncertainty_score":0.32016063},"labels":[],"label_agreement":null},{"id":"W4400031672","doi":"10.1016/j.dam.2024.06.008","title":"On cop-win dynamic graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Indifference graph; Graph; Discrete mathematics","score_opus":0.010982075287346188,"score_gpt":0.24721741445034295,"score_spread":0.23623533916299677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400031672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016314517,0.00014183685,0.9010502,0.00029270706,0.0003894767,0.00023037543,0.000009508107,0.0005386162,0.095715836],"genre_scores_gemma":[0.9258853,0.000039338152,0.07280698,0.0003807626,0.000038732494,0.0000455252,0.000018126571,0.000034896602,0.00075033685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852824,0.000009304984,0.00032077404,0.00042508604,0.00037296684,0.00034360815],"domain_scores_gemma":[0.9987738,0.00030307958,0.000059528924,0.0007153576,0.000017641709,0.00013055488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024311617,0.00023348218,0.00025027047,0.00012088697,0.00010058813,0.00033550806,0.00062142516,0.00009729994,0.000056404377],"category_scores_gemma":[0.000003147964,0.00018576776,0.00010739904,0.00039796272,0.0000631835,0.00011050942,0.00016232177,0.00024141825,0.0006333767],"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.0000024481167,0.00003765887,1.8538506e-7,0.00011101674,0.000027476368,0.000050849347,0.0005953431,0.000037707086,0.00011857494,0.96346325,0.0045500216,0.031005464],"study_design_scores_gemma":[0.00008627343,0.000027787915,0.0000013459518,0.00008699184,0.0000150662445,0.00001403285,0.000049620718,0.5870075,0.00004055778,0.41140404,0.0010908947,0.000175839],"about_ca_topic_score_codex":8.357162e-7,"about_ca_topic_score_gemma":7.6424215e-7,"teacher_disagreement_score":0.9242539,"about_ca_system_score_codex":0.000032778917,"about_ca_system_score_gemma":0.00005571331,"threshold_uncertainty_score":0.8140988},"labels":[],"label_agreement":null},{"id":"W4400089048","doi":"10.1016/j.dam.2024.06.016","title":"Constructing cospectral graphs by unfolding non-bipartite graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied 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":"Simon Fraser University","funders":"","keywords":"Mathematics; Bipartite graph; Combinatorics; Cograph; Discrete mathematics; Chordal graph; Graph; 1-planar graph","score_opus":0.018870227043850385,"score_gpt":0.2890157208435074,"score_spread":0.270145493799657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400089048","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6934682,0.00046383147,0.119261056,0.000473807,0.00044867554,0.0020519646,0.00036072367,0.002029759,0.18144196],"genre_scores_gemma":[0.93708813,0.00003206275,0.0618171,0.000060677823,0.00005938925,0.0003229218,0.00007133233,0.00013048615,0.00041793048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976633,0.000020311723,0.0007579344,0.00054935704,0.00038997605,0.0006190741],"domain_scores_gemma":[0.9980331,0.0008363026,0.00020052423,0.0006975105,0.000041441617,0.00019113031],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060544047,0.00044567333,0.00052679674,0.00021730624,0.00031895342,0.00028967808,0.00042958863,0.00017182187,0.00020711364],"category_scores_gemma":[0.00006391264,0.00039823196,0.00029064444,0.00087258784,0.0002951066,0.00016374674,0.00010616498,0.00043650475,0.00018138922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005128533,0.000082222316,0.000018728184,0.00061296823,0.00015013674,0.0000058212486,0.0012749789,0.000001346891,0.022375245,0.9678405,0.0067403545,0.00089259236],"study_design_scores_gemma":[0.00023965255,0.000018773715,0.0000016693026,0.00022509308,0.00021516599,0.000037041995,0.00271715,0.0018325826,0.028259715,0.96482986,0.0011504004,0.0004729169],"about_ca_topic_score_codex":0.0000030472474,"about_ca_topic_score_gemma":0.0000049828463,"teacher_disagreement_score":0.24361987,"about_ca_system_score_codex":0.00005692968,"about_ca_system_score_gemma":0.000037099737,"threshold_uncertainty_score":0.99984694},"labels":[],"label_agreement":null},{"id":"W4400348129","doi":"10.1016/j.dam.2024.06.006","title":"Improving the Caro–Wei bound and applications to Turán stability","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Canadian Institutes of Health Research; Government of Ontario; National Science Foundation","keywords":"Mathematics; Stability (learning theory); Combinatorics; Upper and lower bounds; Computer science; Mathematical analysis","score_opus":0.014677408376058179,"score_gpt":0.25225150570604343,"score_spread":0.23757409732998525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400348129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006478755,0.00024198068,0.98433244,0.00065374735,0.0000864523,0.0007853716,0.000013712336,0.00026878662,0.0071387556],"genre_scores_gemma":[0.792523,0.000015147624,0.20575899,0.0003740686,0.000263166,0.0007374671,0.0000049158166,0.000034760076,0.00028844952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894136,0.000015396128,0.0002317829,0.0003819152,0.00020149522,0.00022805584],"domain_scores_gemma":[0.99871045,0.00033364273,0.000041176565,0.00079150853,0.00002266393,0.000100566234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634141,0.00015054809,0.00014689805,0.000043566735,0.00024069594,0.0005937216,0.00061796955,0.00004156257,0.000014167295],"category_scores_gemma":[0.000021694394,0.000098170865,0.00004471046,0.00036152493,0.0000851422,0.00013317664,0.0004151449,0.00015472269,0.00008941886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.052632e-7,0.0000150060105,6.680721e-7,0.0002276903,0.000011548659,9.880631e-7,0.0029297273,0.0000068865093,0.0034097654,0.9578424,0.00007420062,0.03548028],"study_design_scores_gemma":[0.00013181292,0.000036011425,0.000023799501,0.00005186226,0.000055149405,0.000029873161,0.0016494795,0.112693705,0.011615349,0.8557446,0.017504266,0.00046406817],"about_ca_topic_score_codex":0.000005106697,"about_ca_topic_score_gemma":0.0000028264726,"teacher_disagreement_score":0.7860443,"about_ca_system_score_codex":0.00002582898,"about_ca_system_score_gemma":0.000041158975,"threshold_uncertainty_score":0.57252705},"labels":[],"label_agreement":null},{"id":"W4401656754","doi":"10.1016/j.dam.2024.07.044","title":"Hamiltonicity of covering graphs of trees","year":2024,"lang":"en","type":"article","venue":"Discrete Applied 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":"Simon Fraser University","funders":"National Science Foundation","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.019444275876684104,"score_gpt":0.28881422514983274,"score_spread":0.2693699492731486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401656754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053042978,0.00030092505,0.9302635,0.000028054194,0.000059281494,0.00023113079,0.000013879581,0.00013725883,0.015922971],"genre_scores_gemma":[0.8491893,0.000037528105,0.15067312,0.000005701618,0.0000059267795,0.000017762995,0.0000013627086,0.000015178038,0.000054112435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987606,0.000012495529,0.0003721045,0.00024079774,0.00039457154,0.00021944066],"domain_scores_gemma":[0.9988102,0.0003388138,0.00009909509,0.00065706944,0.0000432319,0.00005159647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039121683,0.0001290814,0.00027713605,0.00018999609,0.00003207243,0.000043049084,0.0007687352,0.00004441748,0.0000120661925],"category_scores_gemma":[0.00003354811,0.00010640312,0.00011396933,0.0006923105,0.00017207171,0.00016722099,0.00032392904,0.00013025853,0.000012802296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038008304,0.000033943605,0.000006066509,0.0005861746,0.00003664501,0.0000028646648,0.0013135723,0.00021635844,0.044700697,0.9506259,0.000024247,0.0024497276],"study_design_scores_gemma":[0.000114932605,0.000041212254,0.000054383494,0.00017169662,0.000012007481,0.0000040850696,0.00018241176,0.0502614,0.11722452,0.8316989,0.00010333297,0.0001311074],"about_ca_topic_score_codex":0.0000021524365,"about_ca_topic_score_gemma":0.000002260835,"teacher_disagreement_score":0.79614633,"about_ca_system_score_codex":0.000014589941,"about_ca_system_score_gemma":0.000042078558,"threshold_uncertainty_score":0.43389934},"labels":[],"label_agreement":null},{"id":"W4403135795","doi":"10.1016/j.dam.2024.09.017","title":"Serial exchanges in random bases","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Stochastic processes and statistical mechanics","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":"Thompson Rivers University","funders":"","keywords":"Mathematics; Combinatorics","score_opus":0.03781750750461036,"score_gpt":0.3201137146271223,"score_spread":0.2822962071225119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403135795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061381897,0.00034097084,0.9640953,0.0002243211,0.00041611787,0.0007720158,0.000095377975,0.00039324057,0.02752449],"genre_scores_gemma":[0.619471,0.00011545895,0.37803334,0.00016099552,0.00052813644,0.0006261633,0.00003950118,0.00020376052,0.0008216677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983169,0.0000137881,0.00053857785,0.00035932974,0.0003616179,0.0004098237],"domain_scores_gemma":[0.9976116,0.0018619573,0.00006950525,0.0003245822,0.000028895036,0.000103483755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046619953,0.00028423202,0.0005009303,0.00014417282,0.00005358075,0.00013902651,0.00023042424,0.00012718003,0.0003599191],"category_scores_gemma":[0.00063278055,0.00022547468,0.0000871585,0.00035241467,0.00005282745,0.00007234466,0.00010127221,0.00023235145,0.00015562894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047365636,0.00008445554,1.831304e-7,0.0017484362,0.000028903723,0.000042890715,0.0015311348,0.0000051333736,0.0009993466,0.9902642,0.0013294378,0.003918539],"study_design_scores_gemma":[0.0007863138,0.000040711824,9.465652e-7,0.0003958043,0.000086377164,0.000013875476,0.0008402997,0.022714937,0.001065401,0.9724937,0.0012557132,0.00030593853],"about_ca_topic_score_codex":0.0000037745383,"about_ca_topic_score_gemma":0.000022553779,"teacher_disagreement_score":0.6133328,"about_ca_system_score_codex":0.0000495031,"about_ca_system_score_gemma":0.000071783754,"threshold_uncertainty_score":0.91945904},"labels":[],"label_agreement":null},{"id":"W4403248961","doi":"10.1016/j.dam.2024.09.034","title":"Sequence saturation","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","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 British Columbia","funders":"Ministry of Science and Technology, Taiwan","keywords":"Mathematics; Sequence (biology); Combinatorics; Saturation (graph theory); Algorithm; Chemistry","score_opus":0.023562439140389378,"score_gpt":0.2774487977528039,"score_spread":0.25388635861241454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403248961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006706633,0.0001481095,0.98233587,0.00025480601,0.00022327612,0.00013683812,0.000008119043,0.000450552,0.015771782],"genre_scores_gemma":[0.26681817,0.000031411528,0.7325677,0.000119313765,0.00011374873,0.000038411028,0.00003190751,0.00001692816,0.0002623526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915695,0.0000045960805,0.00017410476,0.00026889358,0.0002377165,0.00015774553],"domain_scores_gemma":[0.99932903,0.00007240571,0.000033338372,0.00049764337,0.000015818587,0.000051753617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013878799,0.00011196182,0.00010279034,0.000051614836,0.000076005825,0.00041964772,0.00048225382,0.00004403112,0.00001933245],"category_scores_gemma":[0.0000081922735,0.00008286443,0.000035094825,0.00024332717,0.00002360938,0.00040197064,0.00022095603,0.000108050364,0.00031913642],"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":[3.6855505e-7,0.000009417748,1.3762588e-7,0.00008076449,0.0000061837195,0.000008758184,0.0008554897,0.000017700913,0.010108155,0.95407003,0.0016083742,0.033234626],"study_design_scores_gemma":[0.000064572465,0.000013915389,0.000007850398,0.00010622117,0.000008954241,0.000024904626,0.000092297225,0.7718403,0.005612133,0.20826566,0.0137482835,0.00021491478],"about_ca_topic_score_codex":0.0000021384656,"about_ca_topic_score_gemma":4.4328254e-7,"teacher_disagreement_score":0.7718226,"about_ca_system_score_codex":0.000022585293,"about_ca_system_score_gemma":0.00003419318,"threshold_uncertainty_score":0.41019595},"labels":[],"label_agreement":null},{"id":"W4403386980","doi":"10.1016/j.dam.2024.09.029","title":"On some classes of quasi-triangulated graphs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics; Discrete mathematics","score_opus":0.02014365155555507,"score_gpt":0.30091563586410225,"score_spread":0.28077198430854716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403386980","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050981797,0.0004995171,0.92621595,0.000396099,0.00026956777,0.00073502667,0.000023944765,0.0007571954,0.020120878],"genre_scores_gemma":[0.9157152,0.000043279713,0.08378522,0.00008355369,0.000020978996,0.000058534275,0.000006740915,0.000043220505,0.0002432577],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99833226,0.000025265655,0.00038173993,0.00038726584,0.0005357805,0.0003376803],"domain_scores_gemma":[0.99791706,0.0009871806,0.00008700793,0.0008722161,0.00004289073,0.00009365371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042308925,0.00019996752,0.00030085526,0.00034806336,0.00006358236,0.0001313092,0.0008935899,0.000079338155,0.000026530164],"category_scores_gemma":[0.000090950554,0.00015710283,0.00013034506,0.0009475513,0.00014274637,0.00024320677,0.00022038541,0.00023311315,0.00016504402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008862921,0.00008901802,5.071013e-7,0.00029590985,0.000046758076,0.000012672779,0.0007318639,0.00006774549,0.009247052,0.98514664,0.0002862185,0.0040667555],"study_design_scores_gemma":[0.00015779941,0.000095464966,0.000005207865,0.00012044612,0.0000105402705,0.000004547745,0.00010700961,0.025137322,0.019559393,0.9544235,0.00021017494,0.00016861007],"about_ca_topic_score_codex":8.9262716e-7,"about_ca_topic_score_gemma":4.088505e-7,"teacher_disagreement_score":0.8647334,"about_ca_system_score_codex":0.00002639443,"about_ca_system_score_gemma":0.000053637774,"threshold_uncertainty_score":0.64064676},"labels":[],"label_agreement":null},{"id":"W4403462576","doi":"10.1016/j.dam.2024.09.030","title":"Time-delayed Cops and Robbers","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Vancouver Island University; Mount Saint Vincent University; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.012243395674120416,"score_gpt":0.2746837846845574,"score_spread":0.262440389010437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403462576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006493469,0.000409027,0.9546763,0.00040264853,0.00007384715,0.00037003777,0.000008649064,0.0006189522,0.036947075],"genre_scores_gemma":[0.35235322,0.00010068158,0.64411813,0.0001971727,0.00008035656,0.0001346704,0.000012579027,0.00008900623,0.0029141908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99878067,0.000013818742,0.00020984959,0.00037548336,0.00030482307,0.00031535132],"domain_scores_gemma":[0.99897426,0.00031130473,0.00003295242,0.00053881545,0.00002133203,0.000121332276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037793757,0.00016442864,0.0001845813,0.00012615135,0.00009590166,0.0002951273,0.0005331604,0.00005479608,0.000038883492],"category_scores_gemma":[0.000021392856,0.0001341101,0.000045733555,0.00043575952,0.00016234064,0.00023523453,0.00036939429,0.00018800948,0.0004961292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003346728,0.000013567028,2.5268133e-7,0.00012859465,0.00003522611,0.000016157177,0.0016116233,0.000037915073,0.0064982553,0.983066,0.00072332215,0.007865699],"study_design_scores_gemma":[0.00015604618,0.00004034228,0.000002367614,0.000056731475,0.00001481116,0.00003512102,0.00021382041,0.2729239,0.0027725934,0.7207773,0.0027425396,0.0002644857],"about_ca_topic_score_codex":5.5321635e-7,"about_ca_topic_score_gemma":3.6031767e-7,"teacher_disagreement_score":0.34585974,"about_ca_system_score_codex":0.000024136576,"about_ca_system_score_gemma":0.00003335631,"threshold_uncertainty_score":0.63769025},"labels":[],"label_agreement":null},{"id":"W4403572595","doi":"10.1016/j.dam.2024.10.001","title":"Distance Laplacian spectra of graphs: A survey","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Combinatorics; Laplace operator; Spectral line; Discrete mathematics; Mathematical analysis","score_opus":0.035698751838526124,"score_gpt":0.3067660870989439,"score_spread":0.27106733526041776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403572595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38427687,0.00061970577,0.4105007,0.0002017387,0.0002784027,0.0020062497,0.0007942021,0.0011083533,0.20021379],"genre_scores_gemma":[0.95165133,0.00003439274,0.04753874,0.0000175828,0.000031048192,0.00013239171,0.00004862182,0.00007263522,0.000473267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984595,0.000031782893,0.000592198,0.0003240272,0.00030195055,0.00029052293],"domain_scores_gemma":[0.9978927,0.0011047629,0.00015887748,0.0007085754,0.000047860754,0.000087224646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008477108,0.0002553162,0.00042592883,0.00013827944,0.00008913411,0.000065340624,0.00035793145,0.00009859747,0.00017261265],"category_scores_gemma":[0.00011323426,0.00021426805,0.00017336398,0.00073355157,0.00020047085,0.00006843773,0.00005967059,0.00020641758,0.000085991334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011953701,0.0001337066,0.000024193989,0.00093616056,0.00008946077,0.0000024897406,0.0012117282,0.0000013895125,0.0032421036,0.99230814,0.0017167103,0.0003219459],"study_design_scores_gemma":[0.00012882322,0.000017627697,0.00011421775,0.00016712095,0.000090244896,0.0000056301974,0.00046354491,0.00043703898,0.005819572,0.9914865,0.0010264163,0.00024326937],"about_ca_topic_score_codex":0.000005721231,"about_ca_topic_score_gemma":0.000035713343,"teacher_disagreement_score":0.56737447,"about_ca_system_score_codex":0.000020444679,"about_ca_system_score_gemma":0.000036056343,"threshold_uncertainty_score":0.87375975},"labels":[],"label_agreement":null},{"id":"W4404235910","doi":"10.1016/j.dam.2024.10.026","title":"Recoloring some hereditary graph classes","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"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","keywords":"Mathematics; Combinatorics; Graph","score_opus":0.02648004777911063,"score_gpt":0.2954527750302783,"score_spread":0.26897272725116766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404235910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009912248,0.00089464075,0.95731103,0.0005444158,0.00060870504,0.0004859292,0.0000096146805,0.0012541007,0.028979301],"genre_scores_gemma":[0.45575354,0.0002063157,0.5422854,0.00019809586,0.00037642062,0.00032600306,0.000012002798,0.00010293349,0.00073928456],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981945,0.000019057077,0.00032456263,0.00049875927,0.00046792201,0.00049516105],"domain_scores_gemma":[0.9984626,0.00049728825,0.00004923536,0.00082309934,0.000031036278,0.00013671878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048192244,0.00022412025,0.00024124944,0.0002613796,0.00014359746,0.00035747606,0.0010756325,0.000078311445,0.000026435122],"category_scores_gemma":[0.000039852028,0.00018732982,0.00011687892,0.00078878406,0.00011373435,0.0006818392,0.00046502324,0.00033525113,0.00039825466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024597787,0.000027579867,0.0000015363115,0.00028092825,0.000040333867,0.0000624549,0.0006616562,0.000056447887,0.0027722467,0.98770124,0.00071330025,0.007679819],"study_design_scores_gemma":[0.00009471164,0.000031753494,0.0000115676785,0.00008940499,0.000010418058,0.000028343688,0.00026374927,0.01829186,0.0051627196,0.97351855,0.0022413414,0.00025558672],"about_ca_topic_score_codex":8.4531393e-7,"about_ca_topic_score_gemma":0.0000013707861,"teacher_disagreement_score":0.44584128,"about_ca_system_score_codex":0.00004922595,"about_ca_system_score_gemma":0.00006211849,"threshold_uncertainty_score":0.7639088},"labels":[],"label_agreement":null},{"id":"W4404575037","doi":"10.1016/j.dam.2024.11.015","title":"Renting servers in the cloud: The case of equal duration jobs","year":2024,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Optimization and Packing Problems","field":"Engineering","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":"Concordia University","funders":"","keywords":"Server; Cloud computing; Mathematics; Duration (music); Renting; Operating system; Computer science; Engineering","score_opus":0.017041590930676552,"score_gpt":0.2450997963983055,"score_spread":0.22805820546762895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404575037","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.386792,0.0007700436,0.47621232,0.0010436504,0.0009484687,0.0017590503,0.000048447837,0.0007398444,0.13168617],"genre_scores_gemma":[0.9955254,0.000022904876,0.00430272,0.000021480348,0.00004191402,0.000027526225,0.000011197913,0.00002146604,0.000025343443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994428,0.0000121767125,0.0002736929,0.00006917175,0.00009430537,0.000107830594],"domain_scores_gemma":[0.99957526,0.0001808421,0.000032695258,0.00019138806,0.000008821699,0.000010974133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042973054,0.000086401385,0.00009030484,0.000040452265,0.000043755852,0.00008148043,0.00011555483,0.000038302627,0.000025318423],"category_scores_gemma":[0.000015033415,0.00005099301,0.000034626588,0.0002674472,0.000024207926,0.000045071483,0.000017591072,0.0001350509,0.000015646663],"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.0000021664998,0.000019925768,0.000006326407,0.0015093184,0.000050785235,0.000050324863,0.040377617,0.1198008,0.0013968219,0.8334876,0.000997432,0.0023009349],"study_design_scores_gemma":[0.0001447073,0.0000076274096,0.0000073971355,0.00015171431,0.00004437845,0.00009374957,0.008147142,0.968235,0.0012113824,0.020961093,0.00085071975,0.00014509476],"about_ca_topic_score_codex":0.000006927285,"about_ca_topic_score_gemma":0.00003339106,"teacher_disagreement_score":0.8484342,"about_ca_system_score_codex":0.000013087265,"about_ca_system_score_gemma":0.000006470953,"threshold_uncertainty_score":0.20794347},"labels":[],"label_agreement":null},{"id":"W4406501602","doi":"10.1016/j.dam.2025.01.015","title":"A tight lower bound on non-adaptive group testing estimation","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"SARS-CoV-2 detection and testing","field":"Medicine","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal; National Science Foundation","keywords":"Mathematics; Group testing; Upper and lower bounds; Group (periodic table); Combinatorics; Estimation; Mathematical optimization; Algorithm; Discrete mathematics; Statistics; Mathematical analysis","score_opus":0.0306439409079913,"score_gpt":0.296499309791565,"score_spread":0.26585536888357375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406501602","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45289177,0.000018030816,0.18290034,0.00011795434,0.00020479632,0.0009578546,0.0000039572806,0.0003658922,0.3625394],"genre_scores_gemma":[0.8597406,4.96387e-7,0.1386086,0.0011584399,0.0000720169,0.00010083869,0.0000087000835,0.000037020465,0.00027329187],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876714,0.0000073767155,0.00038921216,0.00029895958,0.0002767636,0.00026054538],"domain_scores_gemma":[0.99888366,0.00044961984,0.00016254107,0.00037609134,0.00007805235,0.000050005638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002244358,0.0002339655,0.00034430553,0.00018579274,0.0001808664,0.00005935509,0.00008950125,0.00011067052,0.00001828776],"category_scores_gemma":[0.0004329554,0.00019848868,0.00007674932,0.0005281756,0.000071500785,0.000049282156,0.000052321207,0.00027107037,0.00016776446],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048272574,0.0011844062,0.00019805641,0.0017189017,0.00038334145,0.00008428593,0.0021272318,0.00016627686,0.72196585,0.21980304,0.0017448872,0.050141033],"study_design_scores_gemma":[0.004747103,0.00089941814,0.0010997037,0.003218028,0.0006790939,0.00009344929,0.0015723392,0.5166666,0.38732478,0.0814663,0.0013661311,0.00086706254],"about_ca_topic_score_codex":0.0000077220275,"about_ca_topic_score_gemma":0.0000024896083,"teacher_disagreement_score":0.5165003,"about_ca_system_score_codex":0.0001077251,"about_ca_system_score_gemma":0.000060712588,"threshold_uncertainty_score":0.8094134},"labels":[],"label_agreement":null},{"id":"W4407162572","doi":"10.1016/j.dam.2025.01.044","title":"The phase transitions of diameters in random axis-parallel hyperrectangle intersection graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Stochastic processes and statistical mechanics","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Intersection (aeronautics); Combinatorics; Intersection graph; Random graph; Discrete mathematics; Graph; Line graph","score_opus":0.020981631345995764,"score_gpt":0.31687771158196637,"score_spread":0.2958960802359706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407162572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01816266,0.000081028105,0.9679399,0.00016039533,0.00015783022,0.00075893087,0.000042282532,0.00005459407,0.01264235],"genre_scores_gemma":[0.91508466,0.000041239335,0.08438652,0.000046286237,0.000011446886,0.00029520673,0.000010296419,0.000027544987,0.00009677668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856883,0.000025008865,0.0007004711,0.00020706304,0.00022378562,0.00027481298],"domain_scores_gemma":[0.9974354,0.0019238207,0.00017811071,0.00035612148,0.000058925372,0.000047626338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004420476,0.00019955309,0.00044615264,0.00014386825,0.0001381944,0.000035178324,0.00025730507,0.00008869042,0.000018075338],"category_scores_gemma":[0.00061158964,0.00014199308,0.00012827167,0.00049004605,0.00013445262,0.000038420607,0.000043505366,0.00019698602,0.0000040528257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022589206,0.00032541473,4.124362e-7,0.000398926,0.0000718837,0.0000015001009,0.0016820965,0.000018048522,0.0022529827,0.99120325,0.00026210034,0.0035574888],"study_design_scores_gemma":[0.0030297446,0.00007479934,0.0000018280004,0.00019206718,0.00013396685,0.0000029276962,0.003703852,0.018525392,0.0015805963,0.9725261,0.000082246406,0.00014652238],"about_ca_topic_score_codex":0.0000056175436,"about_ca_topic_score_gemma":0.00006106886,"teacher_disagreement_score":0.896922,"about_ca_system_score_codex":0.000042782613,"about_ca_system_score_gemma":0.00005489492,"threshold_uncertainty_score":0.579031},"labels":[],"label_agreement":null},{"id":"W4408225562","doi":"10.1016/j.dam.2025.02.024","title":"An introduction to the deduction number","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Calculus (dental); Combinatorics; Arithmetic","score_opus":0.011608572319302658,"score_gpt":0.3122440572055866,"score_spread":0.30063548488628394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408225562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007223674,0.000005755829,0.97226465,0.008096784,0.00026094614,0.00045980484,0.0000010838113,0.00017619877,0.011511093],"genre_scores_gemma":[0.50380725,0.000005079455,0.49373654,0.0005830873,0.00039921934,0.0002764183,0.0000066461766,0.000020777663,0.0011649883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988847,0.00003242812,0.00020371836,0.00035718316,0.00026542423,0.0002565784],"domain_scores_gemma":[0.99842954,0.000078996025,0.000050013074,0.0013048137,0.000068126006,0.00006852797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619821,0.00012196726,0.00012505932,0.000094462375,0.00024127009,0.0001831152,0.001031642,0.00003923384,0.00002436691],"category_scores_gemma":[0.000058415855,0.000085243824,0.000035598656,0.000937345,0.000061074614,0.00023505553,0.00023518442,0.00015980881,0.00023754613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061892965,0.0000436321,0.0000037777945,0.000020649719,0.0000111005465,2.5725572e-7,0.00088228896,0.0005654749,0.0056559867,0.9767451,0.004514268,0.011551225],"study_design_scores_gemma":[0.00016936807,0.000030953062,0.00008524101,0.000012110503,0.000013413653,0.000010649817,0.0011387832,0.017065035,0.02246932,0.93153346,0.027256168,0.00021549322],"about_ca_topic_score_codex":0.0000012583472,"about_ca_topic_score_gemma":0.0000025112035,"teacher_disagreement_score":0.49658358,"about_ca_system_score_codex":0.00004377839,"about_ca_system_score_gemma":0.00003121201,"threshold_uncertainty_score":0.34761423},"labels":[],"label_agreement":null},{"id":"W4408359848","doi":"10.1016/j.dam.2025.02.032","title":"Practical KMP/BM style pattern-matching on indeterminate strings","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Indeterminate; Mathematics; Matching (statistics); Style (visual arts); Arithmetic; Algorithm; Statistics; Pure mathematics; Literature; Art","score_opus":0.017829833761205553,"score_gpt":0.3005822650504465,"score_spread":0.28275243128924094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408359848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070483033,0.0000064157707,0.9674944,0.00070840586,0.0001694335,0.00027641215,0.000009968311,0.00019787377,0.02408878],"genre_scores_gemma":[0.59921145,0.000012293833,0.39903182,0.0011565076,0.0000638483,0.00007259229,0.000017586,0.000025663474,0.00040824895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984506,0.000020019395,0.00035730234,0.00045038117,0.00039197877,0.00032977067],"domain_scores_gemma":[0.99835414,0.00036574432,0.00016971675,0.0009899149,0.000031181156,0.000089296664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000304671,0.00022908016,0.00027496973,0.00012008738,0.00019906802,0.00033448634,0.00080429064,0.00009865631,0.000022437805],"category_scores_gemma":[0.000045682995,0.00018468355,0.000062704705,0.0002473171,0.000039248338,0.00031096517,0.00083496474,0.00032031612,0.00015474983],"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.000009628445,0.0002555157,0.0000076263445,0.00022558247,0.00003949103,0.00003628479,0.0015521531,0.000051777686,0.0014890746,0.90579903,0.004597623,0.08593619],"study_design_scores_gemma":[0.002291234,0.00020615217,0.00045897433,0.001286419,0.00010793076,0.00004612296,0.0020008143,0.5390561,0.03085107,0.4034831,0.018619563,0.0015924854],"about_ca_topic_score_codex":0.000007097144,"about_ca_topic_score_gemma":0.000001126258,"teacher_disagreement_score":0.59216315,"about_ca_system_score_codex":0.00004283296,"about_ca_system_score_gemma":0.000053878084,"threshold_uncertainty_score":0.7531177},"labels":[],"label_agreement":null},{"id":"W4409158217","doi":"10.1016/j.dam.2025.03.023","title":"Preprocessing complexity for some graph problems parameterized by structural parameters","year":2025,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Preprocessor; Graph; Computational complexity theory; Combinatorics; Algorithm; Theoretical computer science; Computer science; Artificial intelligence","score_opus":0.04015370730956459,"score_gpt":0.32062872376984347,"score_spread":0.2804750164602789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409158217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046968684,0.00013244106,0.9494027,0.00027795936,0.00009928153,0.0016152336,0.00003892283,0.00031220657,0.001152583],"genre_scores_gemma":[0.28988996,0.000008293496,0.7090061,0.00023101305,0.000010129656,0.0006258675,0.00003452673,0.000029088673,0.00016505564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977267,0.000034224224,0.0005396134,0.0006895305,0.0003653873,0.0006445836],"domain_scores_gemma":[0.9979568,0.0005686521,0.00023789276,0.0010394767,0.000079686695,0.00011749966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005206102,0.00031745996,0.0004810557,0.00018741927,0.0003703207,0.00038163166,0.0014508724,0.000083162864,0.000003851791],"category_scores_gemma":[0.00012046986,0.00027131347,0.00015610164,0.00065120956,0.00037608188,0.0004376353,0.00042056286,0.00021835408,0.0000063885595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034026354,0.000049926555,0.0000069239054,0.0007318341,0.00007517327,5.452214e-7,0.0006338074,0.00021803284,0.019111134,0.97320634,0.00025433188,0.005677926],"study_design_scores_gemma":[0.000734645,0.000037797527,0.000007756029,0.0000700193,0.00001897618,0.000002257606,0.00013391036,0.06618437,0.02108871,0.9112921,0.00015050909,0.00027899342],"about_ca_topic_score_codex":0.000002506442,"about_ca_topic_score_gemma":0.0000010403096,"teacher_disagreement_score":0.24292128,"about_ca_system_score_codex":0.00005137298,"about_ca_system_score_gemma":0.000059131893,"threshold_uncertainty_score":0.9999739},"labels":[],"label_agreement":null},{"id":"W4409754254","doi":"10.1016/j.dam.2025.04.031","title":"Edge addition and the change in Kemeny’s constant","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Constant (computer programming); Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Artificial intelligence; Computer science","score_opus":0.013388564479732447,"score_gpt":0.2501760721015539,"score_spread":0.23678750762182146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409754254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003877371,0.00036355486,0.7980885,0.0027657917,0.00019690354,0.0012733574,0.000015919839,0.00014108731,0.19327751],"genre_scores_gemma":[0.9337056,0.00012005635,0.06393696,0.0013555305,0.000062112464,0.00047786036,0.0000074950103,0.000010256816,0.00032411644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933857,0.000025716863,0.00020527541,0.00017184242,0.00010447281,0.00015411383],"domain_scores_gemma":[0.999274,0.00028023997,0.000064697255,0.00034550397,0.00001206616,0.000023496104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344654,0.00010261221,0.00017492408,0.000068637724,0.00008813005,0.000091282716,0.00034526768,0.00003699538,0.000019481557],"category_scores_gemma":[0.000022229717,0.000066276625,0.00002603029,0.00026590348,0.00013993923,0.000098489676,0.00022376195,0.00009933673,0.000013164185],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065506038,0.000018667004,0.0000018652863,0.000062815794,0.000006650346,0.0000014548148,0.001822252,7.531515e-7,0.000045337576,0.987263,0.000114283364,0.010656368],"study_design_scores_gemma":[0.0011741255,0.000007348324,0.00004991139,0.00008605001,0.000012006342,0.0000036695612,0.0004195302,0.05381698,0.00050763966,0.9422214,0.0015785208,0.00012281314],"about_ca_topic_score_codex":0.000003855264,"about_ca_topic_score_gemma":0.0000037409916,"teacher_disagreement_score":0.9298282,"about_ca_system_score_codex":0.000013488684,"about_ca_system_score_gemma":0.000016480864,"threshold_uncertainty_score":0.27026823},"labels":[],"label_agreement":null},{"id":"W4410550235","doi":"10.1016/j.dam.2025.05.019","title":"Cops and attacking robbers with cycle constraints","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Crime, Illicit Activities, and Governance","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Allison University; Vancouver Island University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics","score_opus":0.011837213807594185,"score_gpt":0.2852311999761479,"score_spread":0.2733939861685537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410550235","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23770611,0.00009066406,0.0154059315,0.00048168557,0.00007306226,0.00041080514,0.000013119232,0.00010488724,0.7457137],"genre_scores_gemma":[0.9921691,0.00006510204,0.0061063385,0.00019741086,0.00003748882,0.000023615003,0.0000021695623,0.000011569935,0.0013871973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99916553,0.000011847169,0.00014717827,0.00018133817,0.00023874965,0.00025534836],"domain_scores_gemma":[0.99943566,0.00021733131,0.00010005277,0.00015902026,0.000025919453,0.000061999046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000226624,0.00011895423,0.00019941214,0.000034229528,0.0003495009,0.00010883785,0.0001331614,0.00006299357,0.000053875996],"category_scores_gemma":[0.000048443057,0.00010252115,0.000023919492,0.00016928073,0.0006894964,0.000089145484,0.000041371524,0.00010112151,0.000007831086],"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.0000115031025,0.000034166005,0.000268324,0.0000969358,0.000041266732,0.0000030007247,0.019677574,0.0000130791905,0.00024119431,0.97278523,0.0006786584,0.006149063],"study_design_scores_gemma":[0.004620383,0.00012444449,0.003563978,0.0016225589,0.00056141394,0.000019172352,0.42889008,0.0017715358,0.0057507404,0.41969597,0.1310428,0.002336904],"about_ca_topic_score_codex":0.00023855208,"about_ca_topic_score_gemma":0.00076124066,"teacher_disagreement_score":0.754463,"about_ca_system_score_codex":0.00005263061,"about_ca_system_score_gemma":0.000108865155,"threshold_uncertainty_score":0.41806912},"labels":[],"label_agreement":null},{"id":"W4412558656","doi":"10.1016/j.dam.2025.07.009","title":"Obstructions for local tournament orientation completions with cut-vertices","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"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","keywords":"Tournament; Mathematics; Orientation (vector space); Combinatorics; Geometry","score_opus":0.01855583382420776,"score_gpt":0.30799474652268233,"score_spread":0.28943891269847455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412558656","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019480714,0.000015635362,0.9898695,0.0005788982,0.000078646866,0.00072829693,0.000010676669,0.00012691325,0.0066433884],"genre_scores_gemma":[0.27307552,0.000005125066,0.725966,0.000107267864,0.00001622929,0.000475637,0.000015382324,0.000013160899,0.00032565702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989163,0.000011849564,0.00025468893,0.00028465694,0.00025897747,0.00027350278],"domain_scores_gemma":[0.99890083,0.00029808006,0.00009579869,0.0005220075,0.00011760254,0.00006568326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017262818,0.00013563935,0.00017765081,0.00014384907,0.00034231882,0.00013738856,0.0005060542,0.0000346195,0.000008766475],"category_scores_gemma":[0.000024751174,0.00010804267,0.000049176604,0.00055700465,0.00015948732,0.00020000486,0.00013283468,0.0001048038,0.000012708229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016619015,0.00006036326,0.0000072137036,0.000094002025,0.000039776747,5.2174323e-7,0.0006189138,0.0015198443,0.0006237008,0.9918058,0.00016117764,0.005052082],"study_design_scores_gemma":[0.00081744365,0.000081268336,0.000066522116,0.00006774763,0.000044746324,0.0000063584394,0.0026184977,0.1061896,0.0055102576,0.88218546,0.00220292,0.00020919742],"about_ca_topic_score_codex":0.0000015872303,"about_ca_topic_score_gemma":0.000013151361,"teacher_disagreement_score":0.27112746,"about_ca_system_score_codex":0.000073788644,"about_ca_system_score_gemma":0.00006210961,"threshold_uncertainty_score":0.4405852},"labels":[],"label_agreement":null},{"id":"W4413104359","doi":"10.1016/j.dam.2025.08.006","title":"Trail Trap: A variant of Partizan Edge Geography","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Geographic Information Systems Studies","field":"Social Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Combinatorics Foundation; Institute for Basic Science; Grantová Agentura České Republiky; Natural Sciences and Engineering Research Council of Canada; European Commission; Javna Agencija za Raziskovalno Dejavnost RS; European Research Council; National Science Foundation","keywords":"Trap (plumbing); Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Geography; Computer science; Artificial intelligence; Meteorology","score_opus":0.016027664277498008,"score_gpt":0.28033922128272387,"score_spread":0.26431155700522585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413104359","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027920635,0.00015291022,0.025704356,0.00061481533,0.00024109751,0.0009732756,0.000025707495,0.0001690831,0.94419813],"genre_scores_gemma":[0.99351954,0.00007358535,0.0056433356,0.00010380173,0.00003484088,0.00014472057,0.0000056265626,0.000008836299,0.0004656903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984666,0.000025430814,0.00062372006,0.00014434084,0.0004171253,0.00032276878],"domain_scores_gemma":[0.999052,0.0001907475,0.0002709513,0.00029652502,0.00012788744,0.000061899926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090480177,0.00014729517,0.00036870863,0.00025542956,0.0003890853,0.000051481657,0.0003105738,0.00010585908,0.000058244437],"category_scores_gemma":[0.00007645044,0.00012992196,0.00015939133,0.0009013591,0.00042863243,0.0000923854,0.00005952396,0.00009093859,0.00002407894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004708135,0.0000560394,0.00031164152,0.00024653555,0.00011389546,4.210534e-7,0.038844068,0.0000038060589,0.00008437282,0.9586222,0.0007008211,0.0010114803],"study_design_scores_gemma":[0.0021044041,0.00006829706,0.007008865,0.0005816176,0.00046740705,0.0000023904565,0.32870102,0.00035531382,0.0014629045,0.5444347,0.11383514,0.0009779143],"about_ca_topic_score_codex":0.00014381774,"about_ca_topic_score_gemma":0.00014432722,"teacher_disagreement_score":0.96559894,"about_ca_system_score_codex":0.000017537042,"about_ca_system_score_gemma":0.00008087213,"threshold_uncertainty_score":0.5298064},"labels":[],"label_agreement":null},{"id":"W4413105468","doi":"10.1016/j.dam.2025.08.012","title":"Bounds on Kemeny’s constant of a graph and the Nordhaus–Gaddum problem","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; York University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Graph; Combinatorics; Constant (computer programming); Discrete mathematics; Computer science","score_opus":0.015425017341538439,"score_gpt":0.2800924389007287,"score_spread":0.26466742155919026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413105468","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19017892,0.00018831826,0.058334373,0.0022427426,0.00008672199,0.004232642,0.000115050716,0.00025537235,0.7443659],"genre_scores_gemma":[0.95893854,0.00005486628,0.039433286,0.0002609943,0.000015052693,0.0005536256,0.000008178886,0.000032600798,0.00070284493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860424,0.00003845693,0.0006189381,0.00025401037,0.00024080202,0.00024355981],"domain_scores_gemma":[0.99740297,0.0014299592,0.00031080056,0.0007459544,0.000061648825,0.00004867488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008278615,0.0002467572,0.00049801276,0.00012795391,0.0002572819,0.00005145877,0.00033199196,0.000092950424,0.000028189028],"category_scores_gemma":[0.00010549204,0.00015645541,0.00012854813,0.00044050254,0.0008174558,0.00002834262,0.00012866284,0.0002078004,0.000008703653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008396263,0.0001791797,0.000006525578,0.00054668635,0.0001339085,2.9675675e-7,0.0016409981,0.000002504667,0.001062066,0.994953,0.0010406394,0.00035023515],"study_design_scores_gemma":[0.0013729307,0.000025522531,0.000008397707,0.00017076581,0.00021030854,0.0000024564833,0.002012326,0.0001836385,0.0028169125,0.9923565,0.0006863302,0.00015395279],"about_ca_topic_score_codex":0.0000029735888,"about_ca_topic_score_gemma":0.000006803196,"teacher_disagreement_score":0.7687596,"about_ca_system_score_codex":0.000013979121,"about_ca_system_score_gemma":0.00003983292,"threshold_uncertainty_score":0.6380067},"labels":[],"label_agreement":null},{"id":"W4413122925","doi":"10.1016/j.dam.2025.08.004","title":"An efficient polynomial-time approximation scheme for parallel multi-stage open shops","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Shaanxi Provincial Science and Technology Department; Key Science and Technology Program of Shaanxi Province; National Social Science Fund of China; Key Research and Development Program of Zhejiang Province; Natural Sciences and Engineering Research Council of Canada; Georgia Southern University","keywords":"Mathematics; Scheme (mathematics); Polynomial-time approximation scheme; Time complexity; Polynomial; Combinatorics","score_opus":0.026400667419957287,"score_gpt":0.29886612374858745,"score_spread":0.2724654563286302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413122925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062308507,0.000028704952,0.9819026,0.000039616883,0.000109601315,0.001429776,0.000050537725,0.00042207667,0.009786258],"genre_scores_gemma":[0.021106916,0.000004314444,0.9771755,0.000061519684,0.00003594231,0.000476489,0.00020631256,0.000059267153,0.00087377586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989839,0.0000066006305,0.00038213193,0.00024391404,0.00012162249,0.00026181954],"domain_scores_gemma":[0.99928266,0.000077919845,0.000068869165,0.00044535665,0.00004636253,0.00007881134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000290883,0.00021813727,0.00029807052,0.00010202822,0.00013140752,0.00022140979,0.00044657956,0.00011740699,0.00004565865],"category_scores_gemma":[0.00003348388,0.00021255187,0.0000579241,0.00021170595,0.000029055578,0.00008534854,0.00007260552,0.00009787236,0.000050254595],"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.000025175921,0.00020060173,0.0000021782414,0.00047898927,0.000083328734,3.1489665e-7,0.0010718881,0.94740117,0.008742313,0.039924838,0.00058120786,0.001487989],"study_design_scores_gemma":[0.001139358,0.000010626953,0.0000063755974,0.00004070998,0.000031690153,2.9489937e-7,0.00061331573,0.99290705,0.004278075,0.0004113712,0.00031540805,0.00024575018],"about_ca_topic_score_codex":0.000001709559,"about_ca_topic_score_gemma":0.0000010445536,"teacher_disagreement_score":0.045505848,"about_ca_system_score_codex":0.00005549887,"about_ca_system_score_gemma":0.000028838953,"threshold_uncertainty_score":0.8667613},"labels":[],"label_agreement":null},{"id":"W4413327064","doi":"10.1016/j.dam.2025.08.026","title":"Firefighting with a distance-based restriction","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Fire Detection and Safety Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Toronto Metropolitan University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Mathematics; Firefighting; Combinatorics; Geography; Cartography","score_opus":0.004866721824933904,"score_gpt":0.19125592757207108,"score_spread":0.18638920574713716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413327064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019490605,0.000052214553,0.81279683,0.0000601071,0.00017103693,0.0003277387,0.000007950146,0.0007777319,0.1663158],"genre_scores_gemma":[0.98981935,0.0000075734647,0.00972506,0.00003390963,0.000027004236,0.000106361906,0.000011209744,0.000028552362,0.00024095394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993496,0.0000038088756,0.00022905698,0.00012078961,0.0001344715,0.00016229071],"domain_scores_gemma":[0.999605,0.000058046746,0.000038041013,0.00024852259,0.000017608418,0.000032802276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007496107,0.00014127514,0.00017262464,0.00008281233,0.000084233376,0.000040388153,0.00008281512,0.000061190556,0.0000117420495],"category_scores_gemma":[0.000007501183,0.000114392846,0.000034184945,0.00035558228,0.000020774665,0.000030837044,0.000007847781,0.000110871595,0.000026950256],"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.00023665625,0.00024633107,0.00045949622,0.009689513,0.0005928384,0.00002683254,0.0032147393,0.16303402,0.040618617,0.74876755,0.01084273,0.022270681],"study_design_scores_gemma":[0.0019153995,0.000054989625,0.0005250779,0.000863092,0.00012339618,0.0000058931855,0.0016821355,0.91131634,0.02442218,0.0063464893,0.051940873,0.000804138],"about_ca_topic_score_codex":0.0000021766866,"about_ca_topic_score_gemma":0.000010382561,"teacher_disagreement_score":0.97032875,"about_ca_system_score_codex":0.00006723458,"about_ca_system_score_gemma":0.000015185813,"threshold_uncertainty_score":0.4664805},"labels":[],"label_agreement":null},{"id":"W4413808816","doi":"10.1016/j.dam.2025.08.041","title":"Monitoring edge-geodetic sets in graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Labeling and Dimension Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Centre National de la Recherche Scientifique; Fonds De La Recherche Scientifique - FNRS; Agence Nationale de la Recherche","keywords":"Geodetic datum; Mathematics; Enhanced Data Rates for GSM Evolution; Combinatorics; Discrete mathematics; Geodesy; Artificial intelligence; Computer science; Geography","score_opus":0.013787492273016542,"score_gpt":0.2593338930233943,"score_spread":0.24554640075037779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413808816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4966249,0.0010932939,0.39960372,0.0011302091,0.0013126403,0.0010953584,0.0000034979248,0.0009873394,0.09814904],"genre_scores_gemma":[0.8303135,0.0000310257,0.1693618,0.00010209304,0.0000027207566,0.000060474853,0.0000010913454,0.000010271236,0.00011702558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872684,0.000012320883,0.00037883478,0.00033861445,0.00022248251,0.00032090154],"domain_scores_gemma":[0.9990151,0.00012176162,0.00007955283,0.0006894463,0.000033528042,0.000060622744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032751207,0.00017271706,0.00024122393,0.00028355478,0.00009247983,0.00011890157,0.00062810414,0.000077950295,0.0000026518583],"category_scores_gemma":[0.00002784628,0.00015457938,0.000058487065,0.000895661,0.00004703214,0.00009692817,0.0002670421,0.00017011448,0.00004609737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015481016,0.00007352036,0.00026917103,0.00012003207,0.000012833141,0.000004245466,0.000929246,0.0001604263,0.0038952685,0.9878781,0.00014074356,0.006514907],"study_design_scores_gemma":[0.0004029561,0.000009703999,0.00039429747,0.00023945373,0.000010621493,0.0000017861006,0.0002161627,0.01648516,0.009723975,0.9722388,0.00007916974,0.0001979131],"about_ca_topic_score_codex":0.000007542622,"about_ca_topic_score_gemma":0.0000019758263,"teacher_disagreement_score":0.33368862,"about_ca_system_score_codex":0.000023151106,"about_ca_system_score_gemma":0.00003868069,"threshold_uncertainty_score":0.63035643},"labels":[],"label_agreement":null},{"id":"W4414001643","doi":"10.1016/j.dam.2025.08.042","title":"Entanglement statistics of polymers in a lattice tube and unknotting of 4-plats","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Topological and Geometric Data Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; Saskatoon City Hospital; Capilano University","funders":"Japan Society for the Promotion of Science; Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Compute Canada; Pacific Institute for the Mathematical Sciences; Division of Mathematical Sciences; National Science Foundation","keywords":"Mathematics; Quantum entanglement; Combinatorics; Lattice (music); Statistics; Quantum mechanics; Quantum; Physics","score_opus":0.010011778679498503,"score_gpt":0.2586941472269866,"score_spread":0.24868236854748807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414001643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06961864,0.00017443133,0.9211992,0.0001543977,0.000025266772,0.00017071201,0.000067732144,0.00001801795,0.008571576],"genre_scores_gemma":[0.6750579,0.000034699537,0.3247614,0.00004990297,0.0000022021711,0.000006882366,0.000007874646,0.00000252124,0.00007662767],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990572,0.0000111385425,0.00043298435,0.00017411985,0.0001815851,0.00014297142],"domain_scores_gemma":[0.999108,0.00037635653,0.00016589637,0.00029397025,0.000025540725,0.000030215646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026416464,0.00008993556,0.0002921837,0.00024247062,0.000022059401,0.00001828949,0.0003286547,0.00003445672,0.000029028295],"category_scores_gemma":[0.000088254055,0.00007227974,0.000025647061,0.00095145963,0.000074888885,0.000049575054,0.0003152859,0.000058268623,0.000001273547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029539115,0.0000948316,0.00047976724,0.00023279042,0.000041746745,0.0000018309771,0.0006408341,0.00001966332,0.0007172256,0.9757377,0.00003439456,0.021996291],"study_design_scores_gemma":[0.0025697865,0.00023181108,0.012638089,0.0004415895,0.0003851852,0.0000046493506,0.0060504396,0.12312019,0.02391258,0.8290955,0.0008152052,0.0007349765],"about_ca_topic_score_codex":0.000033010376,"about_ca_topic_score_gemma":0.0000096690865,"teacher_disagreement_score":0.60543925,"about_ca_system_score_codex":0.000011647437,"about_ca_system_score_gemma":0.000019265122,"threshold_uncertainty_score":0.29474825},"labels":[],"label_agreement":null},{"id":"W4415595910","doi":"10.1016/j.dam.2025.10.035","title":"Eternally surrounding a robber","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lexicographical order; Multipartite; Variation (astronomy); Class (philosophy); Group (periodic table)","score_opus":0.018495355132309266,"score_gpt":0.304831071605036,"score_spread":0.2863357164727267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415595910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053811427,0.00004344525,0.87576246,0.00025380016,0.000099518955,0.00026864867,0.0000013361124,0.00021063726,0.11797901],"genre_scores_gemma":[0.43989062,0.000014601489,0.55667,0.00032823786,0.000028406143,0.00011051008,0.0000026089197,0.000023450522,0.0029315772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985622,0.000020414927,0.00030463343,0.0003537446,0.00034993808,0.00040906877],"domain_scores_gemma":[0.9985354,0.00032576724,0.00008825817,0.0009188537,0.000052769854,0.000078937745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005195334,0.00017454618,0.00023442224,0.00020860032,0.00015956054,0.00023756972,0.0013305093,0.00005923687,0.000017748796],"category_scores_gemma":[0.00006923475,0.00015135844,0.00007924154,0.00071344216,0.00008214907,0.00022237153,0.000599204,0.00021102489,0.000117194395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040172445,0.000033441716,0.000020921378,0.00008247918,0.000027105727,0.000004903313,0.00043564578,0.000049005524,0.0054201297,0.98915565,0.00018012083,0.0045865513],"study_design_scores_gemma":[0.0003167531,0.000013160854,0.000060009,0.000072812836,0.000009181252,0.0000051794877,0.00016798005,0.016138235,0.006966142,0.9742488,0.0017918135,0.00020987724],"about_ca_topic_score_codex":0.0000012978392,"about_ca_topic_score_gemma":0.0000018828312,"teacher_disagreement_score":0.4345095,"about_ca_system_score_codex":0.000053314285,"about_ca_system_score_gemma":0.000059670696,"threshold_uncertainty_score":0.61722183},"labels":[],"label_agreement":null},{"id":"W4415727271","doi":"10.1016/j.dam.2025.10.032","title":"Cops &amp; Robber on periodic temporal graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Graph; Class (philosophy); Set (abstract data type); Sequence (biology); Representation (politics)","score_opus":0.018296448455811316,"score_gpt":0.2578047928780514,"score_spread":0.2395083444222401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415727271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035250678,0.000043324395,0.81436765,0.00039612807,0.00024981506,0.0002920453,0.0000044583785,0.00023503821,0.18088649],"genre_scores_gemma":[0.83497465,0.000018697738,0.1605041,0.0013172524,0.000043051823,0.000069824804,0.00003079976,0.000021084488,0.003020543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984117,0.000015534408,0.00042156066,0.00042475187,0.00034386897,0.00038254642],"domain_scores_gemma":[0.9984937,0.00016948913,0.00014042771,0.0010312252,0.00004137995,0.00012380237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027011055,0.00026732378,0.00035837654,0.00013854727,0.00021728376,0.00023529859,0.00079247326,0.00012476776,0.00005624065],"category_scores_gemma":[0.0000062534386,0.0002223335,0.00011502871,0.00047288282,0.0001067527,0.00008692435,0.0002561064,0.00023868892,0.00026781714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000087416865,0.00010279791,0.000038250062,0.00006693481,0.00003514655,0.000008200223,0.0006342543,0.00003592164,0.000072206865,0.97467476,0.013648387,0.010674387],"study_design_scores_gemma":[0.0011869352,0.000079218975,0.000088597924,0.00029459444,0.00008404078,0.000017696,0.00036766918,0.23076057,0.00026588232,0.72169316,0.04426816,0.0008934444],"about_ca_topic_score_codex":0.0000037293455,"about_ca_topic_score_gemma":0.0000050348995,"teacher_disagreement_score":0.83144957,"about_ca_system_score_codex":0.000030248802,"about_ca_system_score_gemma":0.000097917975,"threshold_uncertainty_score":0.9066497},"labels":[],"label_agreement":null},{"id":"W4416573669","doi":"10.1016/j.dam.2025.11.013","title":"Bounds on broadcast time in well-connected graphs","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Upper and lower bounds; Vertex (graph theory); Graph; Connectivity; Binary logarithm; Time complexity","score_opus":0.007889908169945536,"score_gpt":0.23062912929525203,"score_spread":0.2227392211253065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416573669","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007581284,0.000037704383,0.6566249,0.0003849512,0.00016038005,0.00035689605,0.0000040238233,0.00021808936,0.3346318],"genre_scores_gemma":[0.9458848,0.00002435191,0.04996996,0.00115076,0.00003451008,0.0000743411,0.000025287785,0.000025451747,0.0028105164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984303,0.000019541001,0.00045674833,0.00041969985,0.00027411195,0.000399596],"domain_scores_gemma":[0.9986472,0.00029570196,0.00011795848,0.00081967935,0.000029986253,0.00008946297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002950013,0.00024616029,0.00037051595,0.00024422375,0.0001092976,0.00017716584,0.0007488474,0.00013712146,0.000059673104],"category_scores_gemma":[0.000007802951,0.00021869359,0.000077823825,0.0008084607,0.00007328899,0.000088336026,0.00021368946,0.00028745056,0.00036742675],"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.000014900632,0.00015561612,0.000012819426,0.0000624921,0.0000265554,0.00002332775,0.000527429,0.000060270602,0.0002716637,0.9795017,0.005009083,0.014334134],"study_design_scores_gemma":[0.0007998431,0.000045729288,0.00004845001,0.00018542972,0.000020863743,0.000005766081,0.00012482492,0.64114875,0.00034765797,0.3544004,0.002511161,0.00036113238],"about_ca_topic_score_codex":0.000004010991,"about_ca_topic_score_gemma":0.0000022354827,"teacher_disagreement_score":0.93830353,"about_ca_system_score_codex":0.000040599607,"about_ca_system_score_gemma":0.00008413812,"threshold_uncertainty_score":0.8918066},"labels":[],"label_agreement":null},{"id":"W4416573728","doi":"10.1016/j.dam.2025.11.040","title":"Selected topics from the theory of intersections of balls","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Point processes and geometric inequalities","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; Innovációs és Technológiai Minisztérium; Eötvös Loránd Tudományegyetem","keywords":"Convex body; Unit sphere; Isoperimetric inequality; Euclidean geometry; Ball (mathematics); Intersection (aeronautics); Convex hull; Orthogonal convex hull; Mixed volume","score_opus":0.02812746529859494,"score_gpt":0.29021288609020907,"score_spread":0.2620854207916141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416573728","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29820412,0.00032065387,0.5700537,0.0004319142,0.00022196781,0.0007856374,0.0002151788,0.00012063873,0.1296462],"genre_scores_gemma":[0.965907,0.000035967896,0.032103732,0.000091325666,0.000053341257,0.000046209385,0.000017527937,0.000020508684,0.0017243813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987965,0.000032530952,0.0006484405,0.0001388568,0.00021796486,0.00016571075],"domain_scores_gemma":[0.99644494,0.0024995753,0.00033360202,0.0005132339,0.00018805201,0.000020620588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046099504,0.00015355513,0.0004124482,0.000112495676,0.00006857693,0.000017071134,0.0003832399,0.00008781608,0.00014162187],"category_scores_gemma":[0.0010537689,0.000101217986,0.0001049188,0.0008361149,0.00014020038,0.00003465144,0.00013583933,0.00014648729,0.0000036247177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020054793,0.000115156385,0.00003532044,0.0005981547,0.00020686878,1.4127812e-7,0.004459301,0.000002629404,0.0014637796,0.9906193,0.0013087284,0.0011705882],"study_design_scores_gemma":[0.0002626215,0.000020592608,0.0001308097,0.00018452932,0.0001914832,5.2094396e-7,0.011574023,0.00014540713,0.025010673,0.9618552,0.000522426,0.000101732236],"about_ca_topic_score_codex":0.000025767209,"about_ca_topic_score_gemma":0.000020711284,"teacher_disagreement_score":0.6677029,"about_ca_system_score_codex":0.000018827448,"about_ca_system_score_gemma":0.0000699868,"threshold_uncertainty_score":0.41275495},"labels":[],"label_agreement":null},{"id":"W4417323639","doi":"10.1016/j.dam.2025.12.001","title":"Non-adaptive prophet inequalities for minor-closed classes of matroids","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Matroid; Inequality; Class (philosophy); Omega; Construct (python library)","score_opus":0.019543219072344565,"score_gpt":0.27368628426838837,"score_spread":0.2541430651960438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417323639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014587949,0.000055478857,0.96461654,0.00012581969,0.00008706315,0.0007687751,0.000017415736,0.00009733235,0.019643651],"genre_scores_gemma":[0.55247056,0.0000044142607,0.44669777,0.00010189987,0.00001959341,0.00018761944,0.0000054966245,0.000010168491,0.00050247856],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988273,0.000007539949,0.00042916616,0.00028095866,0.00018616248,0.00026891474],"domain_scores_gemma":[0.99881124,0.00029972644,0.00021479203,0.000544588,0.000090339454,0.000039299986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016894791,0.00019464595,0.0003914579,0.000102224185,0.000085200314,0.000046594283,0.00064624747,0.000072339266,0.000004208085],"category_scores_gemma":[0.000037079713,0.00015578119,0.00012687783,0.000293099,0.00009811781,0.0001305095,0.000216537,0.00007756308,0.0000070895744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016005744,0.000070134396,0.0000066126977,0.00050969305,0.000042873944,5.3607096e-7,0.0012468994,0.000051252897,0.0047329306,0.9911831,0.00028105525,0.0018588894],"study_design_scores_gemma":[0.0006476315,0.00012395406,0.000059385202,0.00010103032,0.00004056007,0.0000010732223,0.0018115074,0.018797236,0.040469028,0.9373217,0.00038096652,0.00024593264],"about_ca_topic_score_codex":0.0000016770322,"about_ca_topic_score_gemma":0.000001572963,"teacher_disagreement_score":0.5378826,"about_ca_system_score_codex":0.000025538002,"about_ca_system_score_gemma":0.000081101134,"threshold_uncertainty_score":0.63525724},"labels":[],"label_agreement":null},{"id":"W578461542","doi":"10.1016/j.dam.2015.03.012","title":"Synthesizing cubes to satisfy a given intersection pattern","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"VLSI and Analog Circuit Testing","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é de Montréal","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Intersection (aeronautics); Set (abstract data type); Set function; Set operations; Mathematics; Power set; Function (biology); Discrete mathematics; Cartesian product; Product (mathematics); Combinatorics; Algorithm; Computer science","score_opus":0.03778289706106965,"score_gpt":0.25627612562961505,"score_spread":0.2184932285685454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W578461542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026829554,0.0000116772835,0.95331615,0.00032083524,0.00012540966,0.00020512292,0.000001682398,0.00028960156,0.018899946],"genre_scores_gemma":[0.9458563,5.772471e-7,0.053676277,0.0002850148,0.00008429068,0.000040156883,0.000001676269,0.000018798337,0.000036935297],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988426,0.000013918989,0.0002691907,0.0002993673,0.00029283846,0.00028208346],"domain_scores_gemma":[0.99907917,0.00011588583,0.0000997276,0.00046112767,0.000051005736,0.00019311071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034436633,0.00016192005,0.00020857836,0.0001038753,0.00008363608,0.00019637262,0.00056504604,0.0000457796,0.0000050748004],"category_scores_gemma":[0.00012347703,0.00014461747,0.00004730752,0.00027657434,0.000019066481,0.00016994077,0.0002561503,0.00010485656,0.00028962077],"study_design_candidate":"design_other","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.000001304939,0.000160363,0.0006250587,0.0002808009,0.000080232596,0.000038491824,0.05315846,0.00089992414,0.018041812,0.17385952,0.002844847,0.7500092],"study_design_scores_gemma":[0.0016608965,0.00049472996,0.0011496749,0.0012952418,0.00012752606,0.00025496754,0.019217264,0.66916376,0.034914162,0.2652635,0.0036557894,0.0028025133],"about_ca_topic_score_codex":0.000022738506,"about_ca_topic_score_gemma":0.000011895907,"teacher_disagreement_score":0.91902673,"about_ca_system_score_codex":0.00006801065,"about_ca_system_score_gemma":0.00003377858,"threshold_uncertainty_score":0.58973294},"labels":[],"label_agreement":null},{"id":"W650364680","doi":"10.1016/j.dam.2015.05.035","title":"Ferrers dimension of grid intersection graphs","year":2015,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Combinatorics; Mathematics; Bipartite graph; Intersection (aeronautics); Permutation graph; Intersection graph; Discrete mathematics; Chordal graph; Grid; Indifference graph; Dimension (graph theory); Graph; Line graph","score_opus":0.03533442601073086,"score_gpt":0.2956990426382853,"score_spread":0.2603646166275544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W650364680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07501801,0.00003428955,0.90604275,0.00007250621,0.00030276048,0.0003402229,0.0000031377604,0.00016331085,0.018022997],"genre_scores_gemma":[0.81879455,0.0000051832353,0.18104334,0.00002802137,0.00001824189,0.000027367654,0.000004579816,0.000017027127,0.00006167924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986928,0.000024201672,0.00030678263,0.0002547429,0.00047415736,0.00024730226],"domain_scores_gemma":[0.99880654,0.00008981963,0.0001627295,0.0006910002,0.0001082523,0.0001416882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005301197,0.00014160038,0.00022551106,0.0001862695,0.000049005124,0.000036559006,0.0006287068,0.000053372205,0.0000047823205],"category_scores_gemma":[0.00006612283,0.00011803003,0.00007019088,0.0005357782,0.0001235254,0.00021486131,0.0003350609,0.00013965204,0.000044908164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019880592,0.000066125736,0.000015698868,0.000058584577,0.000019510317,0.0000023208022,0.0029975988,0.00015193288,0.0123262005,0.9818572,0.00044772835,0.002037223],"study_design_scores_gemma":[0.0005330654,0.00012701044,0.000026719348,0.00004370696,0.0000105977615,0.000013322991,0.0018096699,0.018108485,0.038609486,0.94026256,0.00023844965,0.00021693559],"about_ca_topic_score_codex":0.0000030359786,"about_ca_topic_score_gemma":0.0000015259902,"teacher_disagreement_score":0.74377656,"about_ca_system_score_codex":0.00004119965,"about_ca_system_score_gemma":0.000036992056,"threshold_uncertainty_score":0.48131248},"labels":[],"label_agreement":null},{"id":"W7108448399","doi":"10.1016/j.dam.2025.10.062","title":"<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e22\" altimg=\"si21.svg\"> <mml:mrow> <mml:mi>H</mml:mi> <mml:mi>V</mml:mi> </mml:mrow> </mml:math> -symmetric polyhedra and bipolarity","year":2025,"lang":"en","type":"article","venue":"Discrete Applied 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":"McGill University","funders":"Japan Society for the Promotion of Science; Japan Society for the Promotion of Science London","keywords":"Polyhedron; Polytope; Vertex (graph theory); Convex polytope; Enumeration; Regular polygon; Convex hull","score_opus":0.019238732870892013,"score_gpt":0.2670158124523098,"score_spread":0.24777707958141781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108448399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7712384,0.0008686936,0.031998016,0.00048527206,0.0016892272,0.00028274782,0.00028318187,0.0006496932,0.19250476],"genre_scores_gemma":[0.9250621,0.00043351104,0.07125043,0.00055791944,0.00066682533,0.0008934814,0.00026857277,0.0005712206,0.0002958952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936191,0.000118942924,0.0018568852,0.0011811227,0.00169053,0.0015334464],"domain_scores_gemma":[0.99250835,0.0027300394,0.0016284247,0.0024097408,0.00014199245,0.00058147206],"candidate_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014940505,0.0008837428,0.0006434973,0.0004979778,0.00093208277,0.00072707405,0.0015229511,0.0013092607,0.0020721443],"category_scores_gemma":[0.0023862417,0.0012466697,0.0007531739,0.001344576,0.0007849327,0.0006283293,0.0017596151,0.0012637201,0.00074111007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001949191,0.00047603095,0.0000042867473,0.0034527783,0.00070669333,0.00013629049,0.0019269524,0.00007414412,0.0015290091,0.98142594,0.009020157,0.0010527985],"study_design_scores_gemma":[0.0038107543,0.0008428203,0.000024481164,0.0023958008,0.0029249717,0.0005459088,0.0052768965,0.19429055,0.34792307,0.43577415,0.0035070286,0.0026836013],"about_ca_topic_score_codex":0.00010939876,"about_ca_topic_score_gemma":0.00010048815,"teacher_disagreement_score":0.5456518,"about_ca_system_score_codex":0.000038227427,"about_ca_system_score_gemma":0.0005282416,"threshold_uncertainty_score":0.99998724},"labels":[],"label_agreement":null},{"id":"W7116927456","doi":"10.1016/j.dam.2025.12.013","title":"An approximation algorithm for zero forcing","year":2025,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Mathematical Dynamics and Fractals","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Toronto Metropolitan University; University of Prince Edward Island","funders":"Natural Sciences and Engineering Research Council of Canada; Government of Ontario","keywords":"Forcing (mathematics); Upper and lower bounds; Vertex (graph theory); Zero (linguistics); Path (computing); Order (exchange); Approximation algorithm","score_opus":0.023217347314962396,"score_gpt":0.32347881136881756,"score_spread":0.3002614640538552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116927456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034956827,0.000014816253,0.9538322,0.000098716344,0.00010732684,0.0018696883,0.00006718099,0.00029531127,0.04021905],"genre_scores_gemma":[0.06908674,0.0000053185167,0.9289462,0.00015824486,0.00006758287,0.0007175328,0.0000972818,0.00008441399,0.0008366988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786955,0.000016757616,0.0008615434,0.00043763596,0.0003231168,0.00049139373],"domain_scores_gemma":[0.9975536,0.0009986245,0.00031670908,0.00087180105,0.00013104423,0.00012821714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084417016,0.00036875613,0.00065544015,0.0001764115,0.00025610434,0.00017274937,0.00045518661,0.00021670459,0.00004553523],"category_scores_gemma":[0.00027177122,0.0003181012,0.0001997248,0.00029139675,0.00008076874,0.00016567795,0.00008925094,0.00017386064,0.00001841442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008568431,0.00033110823,9.0165605e-7,0.0011713952,0.000075073316,5.047891e-7,0.0005905709,0.000011567896,0.002175617,0.96622586,0.0008168413,0.028592],"study_design_scores_gemma":[0.0004628395,0.000030458197,0.000001614711,0.00009761995,0.00011512506,0.000001559515,0.00045436015,0.3510219,0.0018260791,0.6454733,0.00028518296,0.00022995967],"about_ca_topic_score_codex":0.000001591722,"about_ca_topic_score_gemma":0.0000023316052,"teacher_disagreement_score":0.35101032,"about_ca_system_score_codex":0.00007079732,"about_ca_system_score_gemma":0.000049300495,"threshold_uncertainty_score":0.9999271},"labels":[],"label_agreement":null},{"id":"W766160502","doi":"10.1016/j.dam.2015.06.002","title":"A new measure for comparing biomedical regions of interest in segmentation of digital images","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Segmentation; Region of interest; Computer science; Hausdorff distance; Artificial intelligence; Measure (data warehouse); Feature (linguistics); Estimator; Pattern recognition (psychology); Image segmentation; Digital image; Computer vision; Data mining; Mathematics; Image (mathematics); Image processing; Statistics","score_opus":0.12608197161782891,"score_gpt":0.3325182755227295,"score_spread":0.2064363039049006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W766160502","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033779945,0.000014743735,0.9946689,0.00014422074,0.000030334662,0.0004354406,0.00000695734,0.000060017235,0.0012613613],"genre_scores_gemma":[0.39677387,0.0000010846625,0.6031354,0.000011118241,0.000010043384,0.000030434716,0.000015471232,0.0000067775427,0.00001580787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989448,0.000008824164,0.0005059124,0.00015554103,0.0002553354,0.0001295556],"domain_scores_gemma":[0.99912393,0.00014579849,0.00025338202,0.00027399155,0.00007674663,0.0001261694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003195851,0.000097333774,0.00026986375,0.00013828771,0.00001047321,0.000040687504,0.00043199307,0.000045329525,0.0000021940734],"category_scores_gemma":[0.00019757818,0.00008450972,0.00004433279,0.00025818672,0.00009164575,0.00023592859,0.00014310899,0.00006446563,0.0000023374268],"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.000087183245,0.0010210143,0.00045350016,0.0015688414,0.00011738593,0.0000060857574,0.024508031,0.000030403427,0.18860835,0.64063174,0.022715803,0.120251685],"study_design_scores_gemma":[0.0032969106,0.0003121011,0.00007838112,0.0005343739,0.000039896804,0.000009881604,0.004568167,0.018144375,0.59828115,0.37432078,0.000052977728,0.0003610405],"about_ca_topic_score_codex":0.000006503539,"about_ca_topic_score_gemma":0.0000070541882,"teacher_disagreement_score":0.4096728,"about_ca_system_score_codex":0.00003556359,"about_ca_system_score_gemma":0.00009993612,"threshold_uncertainty_score":0.34462062},"labels":[],"label_agreement":null},{"id":"W786724073","doi":"10.1016/j.dam.2015.05.004","title":"On the complexity of the shortest-path broadcast problem","year":2015,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Interconnection Networks and Systems","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":"Concordia University","funders":"Agence Nationale de la Recherche","keywords":"Shortest path problem; Multiplicative function; Longest path problem; Mathematics; Combinatorics; Time complexity; Computer science; Discrete mathematics; Graph","score_opus":0.06746691470365561,"score_gpt":0.2504173971662269,"score_spread":0.18295048246257128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W786724073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021421194,0.000025260279,0.7655443,0.0021352663,0.00050478446,0.0011783913,0.000009100673,0.00012745999,0.20905425],"genre_scores_gemma":[0.9843781,6.932196e-7,0.015043783,0.00026313783,0.00005244683,0.00004844372,8.592799e-7,0.000011060582,0.00020146434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882096,0.000044567492,0.00034256623,0.00018183136,0.00042326425,0.00018682216],"domain_scores_gemma":[0.99853,0.00016325555,0.00023134991,0.0009359033,0.00008393027,0.00005559064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064662466,0.00013690133,0.00020243975,0.000020733247,0.00012640697,0.000092120004,0.0010841074,0.000045347428,0.000010215433],"category_scores_gemma":[0.000037381622,0.000065241904,0.000086799075,0.0002559548,0.00018126731,0.000052760264,0.00027491356,0.00015395075,0.000042382922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022347085,0.00004303724,0.0000046086107,0.000017040482,0.000012652956,2.5870767e-7,0.0027323614,0.00047521704,0.00012299673,0.9913573,0.0049997587,0.00023248045],"study_design_scores_gemma":[0.00025127703,0.00007442417,0.000037191083,0.00012959602,0.000012694483,0.000017752687,0.00133264,0.21043722,0.0014437743,0.78428406,0.0017904803,0.00018888815],"about_ca_topic_score_codex":0.0000103485745,"about_ca_topic_score_gemma":0.0000065768386,"teacher_disagreement_score":0.9629569,"about_ca_system_score_codex":0.000029251138,"about_ca_system_score_gemma":0.00004151774,"threshold_uncertainty_score":0.26604876},"labels":[],"label_agreement":null},{"id":"W833184608","doi":"10.1016/j.dam.2015.05.025","title":"Triangulations and equality in the domination chain","year":2015,"lang":"en","type":"article","venue":"Discrete Applied 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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada; Universities Space Research Association","keywords":"Mathematics; Characterization (materials science); Cardinality (data modeling); Combinatorics; Domination analysis; Dominating set; Chain (unit); Discrete mathematics; Graph; Computer science; Data mining","score_opus":0.06494971143370033,"score_gpt":0.3402882606783024,"score_spread":0.2753385492446021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W833184608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02771955,0.000036810026,0.9536999,0.001203293,0.00002107737,0.0004964164,0.0000019891193,0.00004533015,0.016775677],"genre_scores_gemma":[0.88689005,0.0000030064095,0.11283176,0.00011298996,0.00001617867,0.00008708199,0.0000032383275,0.0000060820694,0.000049601516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990474,0.000075683805,0.00020701808,0.00016889007,0.0003307968,0.00017022272],"domain_scores_gemma":[0.9989886,0.00038207765,0.0000693484,0.00047133473,0.0000334672,0.000055131983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020984965,0.00008232207,0.00011761878,0.00008846469,0.00006618765,0.000104397615,0.00048793788,0.000033370543,0.0000014734666],"category_scores_gemma":[0.00016492396,0.000055755634,0.000017944969,0.0004358849,0.000076219505,0.00016774349,0.00014780973,0.00011168743,0.000012801457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037458217,0.000029892477,0.000010183921,0.000014054028,0.0000020590383,9.42798e-7,0.009599994,0.000046261204,0.00020464332,0.98612535,0.000030959203,0.003931904],"study_design_scores_gemma":[0.00048657646,0.000016144184,0.00023730722,0.000006479218,0.0000024364424,0.000004570703,0.0022586586,0.036964748,0.00023825714,0.95946985,0.0002296166,0.00008532846],"about_ca_topic_score_codex":0.0000030571746,"about_ca_topic_score_gemma":0.000009294412,"teacher_disagreement_score":0.8591705,"about_ca_system_score_codex":0.000023956742,"about_ca_system_score_gemma":0.000024990151,"threshold_uncertainty_score":0.22736487},"labels":[],"label_agreement":null}]}