{"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6163658,0.0032486324,0.32290614,0.008693837,0.00039972886,0.00008584011,0.0015205152,0.00031277732,0.046466805],"genre_scores_gemma":[0.9528638,0.0014684625,0.037454825,0.00047846214,0.0006753658,0.00016820975,0.00060207985,0.0001552535,0.006133381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99617493,0.0014807833,0.0001947239,0.0008840812,0.00082303956,0.00044229403],"domain_scores_gemma":[0.97447395,0.016276762,0.0024411615,0.0024068952,0.0015007065,0.002900515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035998928,0.0012121496,0.0023022802,0.0041478625,0.0033438953,0.0069648805,0.003989242,0.0028000788,0.0067627905],"category_scores_gemma":[0.020696454,0.0018259387,0.0018067067,0.004465706,0.0063738814,0.020283855,0.006602851,0.005486768,0.00043008843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005354166,0.000022705064,0.0006805591,0.000065132204,0.000021363838,0.000031571297,0.0002140523,0.0031030905,0.0003813508,0.989725,0.0013770984,0.0043246145],"study_design_scores_gemma":[0.000014671211,0.000013958574,0.0004950984,0.000017331779,0.000016829517,0.0000839709,0.00013215492,0.017528366,0.0002707333,0.9799329,0.0014754417,0.00001853533],"about_ca_topic_score_codex":0.0016132302,"about_ca_topic_score_gemma":0.0012667266,"teacher_disagreement_score":0.0069648805,"about_ca_system_score_codex":0.0031620297,"about_ca_system_score_gemma":0.0010807948,"threshold_uncertainty_score":0.022942185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8196829,0.0006289621,0.16162074,0.001934125,0.0004947281,0.00015457423,0.002103195,0.00093025697,0.012450482],"genre_scores_gemma":[0.86411333,0.00046358342,0.12403542,0.00040047098,0.0003799568,0.00021503006,0.0035418635,0.00044505662,0.006405238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9920849,0.0018655178,0.0006765795,0.002180765,0.0021722286,0.0010199886],"domain_scores_gemma":[0.9474923,0.035276342,0.0029849554,0.007841891,0.003650442,0.0027541136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003000121,0.0013225891,0.0018652439,0.0036751833,0.0024976507,0.005333045,0.0057171397,0.0028210871,0.0077236593],"category_scores_gemma":[0.033626534,0.0012146229,0.0016888148,0.0036178485,0.00289131,0.009108307,0.0026897232,0.002682613,0.0007154046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004601751,0.0014192043,0.11858819,0.0022870288,0.0014810811,0.0014876999,0.0017507635,0.13729705,0.06494072,0.41041985,0.02056273,0.23516403],"study_design_scores_gemma":[0.0002868919,0.00036566317,0.013701968,0.0001257521,0.00053727074,0.002564695,0.0007185138,0.3541697,0.02035916,0.5990252,0.008002097,0.00014316394],"about_ca_topic_score_codex":0.0011472938,"about_ca_topic_score_gemma":0.0020563907,"teacher_disagreement_score":0.0077236593,"about_ca_system_score_codex":0.0021076791,"about_ca_system_score_gemma":0.0016571253,"threshold_uncertainty_score":0.025838196},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69359654,0.0023511115,0.22464785,0.007649444,0.000442879,0.00018043684,0.0021472143,0.000770451,0.068214126],"genre_scores_gemma":[0.9643548,0.0013664889,0.019277103,0.0005892492,0.00064289174,0.00026945613,0.0008781172,0.00030331037,0.012318532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822444,0.0006773542,0.000051971834,0.00039714438,0.00037360706,0.00027536135],"domain_scores_gemma":[0.9690778,0.022471394,0.0026842444,0.0020993822,0.0012900545,0.0023770928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024929591,0.0009839386,0.0016671973,0.0051146345,0.0030405961,0.0058406587,0.0035148521,0.0023273672,0.01122038],"category_scores_gemma":[0.022015693,0.001476492,0.0009661779,0.003461895,0.005926699,0.0078830365,0.0026956454,0.0033767794,0.0007744432],"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.00020548467,0.00005079166,0.0012846014,0.00012529227,0.00004443621,0.00006074306,0.00030399874,0.027796017,0.001640841,0.9569871,0.0052907784,0.0062099895],"study_design_scores_gemma":[0.00006586852,0.00003770115,0.0012423625,0.00004747785,0.0000328379,0.00012802637,0.0000999355,0.111233175,0.0006858658,0.8838898,0.0024908248,0.000046051307],"about_ca_topic_score_codex":0.003334383,"about_ca_topic_score_gemma":0.0029860314,"teacher_disagreement_score":0.01122038,"about_ca_system_score_codex":0.0050335433,"about_ca_system_score_gemma":0.001728343,"threshold_uncertainty_score":0.037535846},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74933255,0.0012054945,0.13116008,0.0014963357,0.00032224713,0.00009824777,0.00079318875,0.00046509205,0.11512674],"genre_scores_gemma":[0.948521,0.00086816336,0.02294108,0.00020730801,0.00023253383,0.000050612,0.0006379936,0.00013976166,0.026401429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971277,0.000053437732,0.000012984972,0.000064868655,0.00007904811,0.00007695268],"domain_scores_gemma":[0.99851483,0.0005906394,0.00019680933,0.00015683168,0.00016729756,0.00037364571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002933857,0.00034454858,0.00066232367,0.0013536917,0.0019949374,0.0028209318,0.0010087845,0.0010099713,0.007555285],"category_scores_gemma":[0.0032966717,0.00035576237,0.0004137742,0.0015267623,0.0018963416,0.002595202,0.001585205,0.0015410396,0.0013172958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014318211,0.00002213685,0.0010260028,0.00008514643,0.00000982863,0.00017898141,0.000805988,0.0020299738,0.004320387,0.9692236,0.0024165867,0.0197382],"study_design_scores_gemma":[0.000022928785,0.00003056517,0.0006735679,0.000026997137,0.000011572742,0.00013058331,0.0003370762,0.0066570193,0.0010087185,0.98293686,0.008152096,0.000012056216],"about_ca_topic_score_codex":0.0020152817,"about_ca_topic_score_gemma":0.0018008514,"teacher_disagreement_score":0.007555285,"about_ca_system_score_codex":0.00074237306,"about_ca_system_score_gemma":0.0005042353,"threshold_uncertainty_score":0.025274932},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5442727,0.0010033386,0.25611615,0.0018093989,0.00079533714,0.00015064582,0.0010313779,0.00040172756,0.19441919],"genre_scores_gemma":[0.8462853,0.0011431862,0.059687413,0.00078599085,0.00030081513,0.00022540241,0.0010999049,0.00046257512,0.090009496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997646,0.000031574342,0.000011828798,0.000063772,0.00008703542,0.000041226245],"domain_scores_gemma":[0.99935764,0.00013108736,0.00011949159,0.00005957735,0.00009658689,0.00023561771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024728026,0.00061411713,0.0007761491,0.001622604,0.0015848526,0.0028056363,0.00080090703,0.0014278004,0.012938388],"category_scores_gemma":[0.0012228325,0.0004721088,0.0006106511,0.00085295795,0.0014129437,0.0024919156,0.0024732547,0.0023735305,0.0017485024],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043394637,0.000022838947,0.0002959473,0.000040148254,0.0000136252,0.00008937068,0.00010966741,0.0030040306,0.0014459348,0.98237026,0.0024092537,0.010155494],"study_design_scores_gemma":[0.000026758353,0.00004002114,0.0005053666,0.00003562889,0.000012556562,0.0003427961,0.00016874037,0.0245082,0.00075738115,0.9608342,0.012750208,0.00001819291],"about_ca_topic_score_codex":0.00041899114,"about_ca_topic_score_gemma":0.0007329705,"teacher_disagreement_score":0.012938388,"about_ca_system_score_codex":0.00071105384,"about_ca_system_score_gemma":0.00040059368,"threshold_uncertainty_score":0.043283165},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03422834,0.00038222305,0.16536231,0.003308573,0.0015731257,0.00027457575,0.0008460614,0.00079709466,0.79322773],"genre_scores_gemma":[0.43711436,0.00049090444,0.041171394,0.0007901046,0.00034140298,0.00039328705,0.0008367697,0.00041736485,0.51844436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994506,0.00009404265,0.000021416114,0.00012465163,0.00022399922,0.00008524402],"domain_scores_gemma":[0.99947435,0.00013769873,0.000026228337,0.00007985635,0.00012659564,0.00015522349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003461137,0.0006330295,0.0008016637,0.0008997207,0.0017383785,0.0025912973,0.0010360902,0.0011479876,0.07705025],"category_scores_gemma":[0.0029231121,0.00021919425,0.0004586479,0.000570905,0.001251846,0.0033891262,0.001780888,0.0018529993,0.009892649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047163594,0.00002057195,0.000049922117,0.00002656588,0.0000036104534,0.000028518754,0.000052460124,0.00069471035,0.0006604252,0.9753439,0.010763974,0.012308236],"study_design_scores_gemma":[0.000035249755,0.00003118887,0.00013017243,0.000016955444,0.000006895228,0.00007906629,0.000065924905,0.0102165425,0.00073814264,0.91121304,0.077451795,0.000015108612],"about_ca_topic_score_codex":0.0013180306,"about_ca_topic_score_gemma":0.0017121694,"teacher_disagreement_score":0.07705025,"about_ca_system_score_codex":0.0013869103,"about_ca_system_score_gemma":0.00073570537,"threshold_uncertainty_score":0.25775874},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010444514,0.0018354143,0.95253164,0.00240173,0.00048716896,0.00038502473,0.0014684602,0.0008372957,0.029608684],"genre_scores_gemma":[0.25664625,0.0024178256,0.6852346,0.0010496102,0.0003092928,0.002056374,0.0028249593,0.0007361424,0.04872493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988986,0.00027445314,0.00006183072,0.0003062129,0.00025790333,0.00020099367],"domain_scores_gemma":[0.9945458,0.0038851127,0.00022863981,0.00012521882,0.0010658059,0.00014943544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026990229,0.0022940875,0.00197224,0.0011696997,0.0009774361,0.0036941182,0.0016651097,0.0042511523,0.03858785],"category_scores_gemma":[0.013159559,0.0011538529,0.001710471,0.0010559094,0.0011820185,0.0020423117,0.0017018337,0.0035146018,0.007092035],"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.00016529975,0.00013836702,0.0010538929,0.00081655895,0.00005114495,0.00026935322,0.00023375537,0.90047807,0.0017229919,0.025852663,0.021442726,0.047775157],"study_design_scores_gemma":[0.00007731608,0.000079562946,0.0005629595,0.00023159494,0.000040031035,0.00012380315,0.0003037744,0.9682585,0.00095251855,0.021020837,0.008308898,0.000040257713],"about_ca_topic_score_codex":0.017352216,"about_ca_topic_score_gemma":0.026140478,"teacher_disagreement_score":0.03858785,"about_ca_system_score_codex":0.002811292,"about_ca_system_score_gemma":0.006613889,"threshold_uncertainty_score":0.12908918},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87755334,0.0006839174,0.063331276,0.0006562483,0.000045811175,0.00005469552,0.00052050984,0.00016531305,0.056988772],"genre_scores_gemma":[0.9805376,0.0005487718,0.006435675,0.00013748347,0.00009103565,0.00008011962,0.0007526108,0.00016923014,0.011247439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973947,0.00004892305,0.000012644537,0.000072242794,0.00007828909,0.00004841778],"domain_scores_gemma":[0.9982414,0.0007999288,0.0003042683,0.000169051,0.00020788632,0.0002774228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003568378,0.00054152386,0.00055946346,0.0021100773,0.0009412128,0.001935553,0.000976495,0.00075943174,0.010745407],"category_scores_gemma":[0.0024844382,0.0004113194,0.0004928711,0.0015431327,0.0014908876,0.0032485903,0.0014955051,0.0013314709,0.00062288943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015516384,0.00006435022,0.003381834,0.00015047373,0.00003122225,0.00026200153,0.0010691704,0.00762781,0.008155309,0.95179975,0.0025661169,0.024736835],"study_design_scores_gemma":[0.000027072085,0.000052265732,0.002800569,0.000029729155,0.000027595795,0.00023931178,0.0006215734,0.019476527,0.0017733376,0.9715371,0.003395829,0.000019141462],"about_ca_topic_score_codex":0.0013826697,"about_ca_topic_score_gemma":0.001472015,"teacher_disagreement_score":0.010745407,"about_ca_system_score_codex":0.00062063226,"about_ca_system_score_gemma":0.00028865543,"threshold_uncertainty_score":0.035946965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16547765,0.001803225,0.8126972,0.0007172645,0.00020095309,0.000118283366,0.00182446,0.0027270205,0.014434065],"genre_scores_gemma":[0.6183391,0.0016752643,0.36636278,0.0002665683,0.00033436046,0.00020164777,0.004552075,0.0006200181,0.0076481774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793434,0.00033443017,0.00019205622,0.000407075,0.0009059692,0.00022609778],"domain_scores_gemma":[0.9940189,0.0030961954,0.00026413644,0.0018573167,0.0005584367,0.00020494874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011784312,0.00073671667,0.0014649518,0.003366635,0.0010384584,0.0040912163,0.0011548195,0.0008288011,0.007525706],"category_scores_gemma":[0.0093003865,0.0006706077,0.0010649227,0.005797544,0.001214988,0.011348604,0.0033652147,0.0014691645,0.0020884464],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080790155,0.000112533795,0.004086637,0.0004139447,0.00013920183,0.0002921201,0.0005579903,0.07492542,0.009157959,0.48677006,0.01352019,0.40921608],"study_design_scores_gemma":[0.000028914688,0.00010843882,0.0005361509,0.00008790819,0.00007137588,0.00027791303,0.00016312879,0.22671665,0.010642473,0.74666446,0.014676297,0.00002627325],"about_ca_topic_score_codex":0.0008796913,"about_ca_topic_score_gemma":0.0013089753,"teacher_disagreement_score":0.007525706,"about_ca_system_score_codex":0.001171442,"about_ca_system_score_gemma":0.00090789126,"threshold_uncertainty_score":0.025175989},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18288688,0.0017946628,0.7302036,0.0028913869,0.0003128682,0.0004702628,0.0009428206,0.0006137866,0.07988373],"genre_scores_gemma":[0.9408316,0.000750338,0.04202191,0.00044620648,0.00028304907,0.00022904486,0.000328224,0.00025057848,0.014858917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941789,0.0020462635,0.0001480003,0.00058760797,0.0012003109,0.0018388686],"domain_scores_gemma":[0.97531974,0.019156097,0.0013256815,0.001041561,0.0019947274,0.0011622105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057290355,0.0023717596,0.002278475,0.0021475223,0.0014198729,0.005320254,0.003925647,0.0025732424,0.013408831],"category_scores_gemma":[0.022058068,0.0012539045,0.0013527392,0.0023161252,0.0024750978,0.0042963657,0.0023792891,0.002295463,0.0011480827],"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.00083138124,0.00023485435,0.0009205519,0.00022892331,0.00015816985,0.00037244736,0.00013245337,0.8720438,0.0034192994,0.10250037,0.0058526867,0.013305031],"study_design_scores_gemma":[0.000035810433,0.00009376891,0.00017070117,0.000018349916,0.000050380066,0.000131482,0.00008149108,0.96525127,0.0005381962,0.03302897,0.0005767355,0.000022868811],"about_ca_topic_score_codex":0.0055435994,"about_ca_topic_score_gemma":0.00392553,"teacher_disagreement_score":0.013408831,"about_ca_system_score_codex":0.004077811,"about_ca_system_score_gemma":0.003530638,"threshold_uncertainty_score":0.044857025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08323161,0.0014828622,0.85806715,0.0067867106,0.00027678674,0.0003533678,0.001501917,0.0008424657,0.047457185],"genre_scores_gemma":[0.82787746,0.0020195646,0.08663296,0.0013108688,0.0005424117,0.0008792045,0.0014496737,0.00068712846,0.078600846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729866,0.0011172307,0.00010395275,0.00056522526,0.00049097295,0.00042401213],"domain_scores_gemma":[0.98645663,0.008889652,0.0012559677,0.0015250928,0.0007627591,0.0011099763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003352112,0.0014185531,0.0033550141,0.0025664174,0.0024841735,0.0052967495,0.00784445,0.00769557,0.028684296],"category_scores_gemma":[0.030340109,0.0015262455,0.0018857933,0.0041504474,0.0035592434,0.012979388,0.004283843,0.00807719,0.003910852],"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.00018180725,0.00014446802,0.00052134,0.00020618757,0.00006801426,0.00016284341,0.00038771713,0.12864912,0.00064233394,0.8465014,0.010334658,0.012200109],"study_design_scores_gemma":[0.00007195533,0.000052911364,0.00010650436,0.000023164828,0.00002617944,0.000072953015,0.00009606389,0.3359991,0.000086654836,0.66110903,0.0023344161,0.000021099419],"about_ca_topic_score_codex":0.0048080203,"about_ca_topic_score_gemma":0.00454601,"teacher_disagreement_score":0.028684296,"about_ca_system_score_codex":0.0030368303,"about_ca_system_score_gemma":0.0020215146,"threshold_uncertainty_score":0.09595853},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031878937,0.0013633262,0.33644754,0.009826159,0.0054663983,0.0010509015,0.022508938,0.10764867,0.48380908],"genre_scores_gemma":[0.22293095,0.003254568,0.17627431,0.004201194,0.0010263701,0.0011600448,0.034561455,0.029005451,0.5275857],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987525,0.00022117456,0.00008699342,0.0001572391,0.0005993234,0.00018273764],"domain_scores_gemma":[0.99710995,0.0003632154,0.00018891993,0.0010751762,0.0010307948,0.00023204907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012252207,0.00086854526,0.0005236364,0.0015503583,0.0011550984,0.0024054055,0.0014794123,0.0007297206,0.15721087],"category_scores_gemma":[0.0051916577,0.00034663145,0.0005424682,0.0012237991,0.00054087647,0.0022437305,0.0022696673,0.0015599285,0.06015068],"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.00046213222,0.00020411915,0.0018166534,0.0005678402,0.000043676864,0.00033397012,0.000774295,0.0029197577,0.02772904,0.05237866,0.5854876,0.32728228],"study_design_scores_gemma":[0.000038799815,0.000066713714,0.00086701754,0.00014535502,0.000018303264,0.00023871262,0.00020553739,0.005136652,0.036223017,0.010008685,0.94701844,0.000032736563],"about_ca_topic_score_codex":0.004013456,"about_ca_topic_score_gemma":0.006440406,"teacher_disagreement_score":0.15721087,"about_ca_system_score_codex":0.0010203457,"about_ca_system_score_gemma":0.0020544415,"threshold_uncertainty_score":0.5259228},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071094795,0.0023200558,0.22661789,0.005070501,0.006317603,0.00012246215,0.0046547134,0.0025801307,0.74520713],"genre_scores_gemma":[0.13197616,0.0054375683,0.17817794,0.0018662727,0.0018276647,0.0004182383,0.00967144,0.007196474,0.66342825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990019,0.00022248531,0.00006134045,0.00020100179,0.00041626144,0.000097104166],"domain_scores_gemma":[0.99878806,0.0005293919,0.000056248457,0.0001965737,0.00034307103,0.00008673665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007467491,0.0010983078,0.0007332996,0.0025246837,0.0014178029,0.00447251,0.0011286966,0.0007978331,0.1820387],"category_scores_gemma":[0.006495078,0.00066457584,0.0008545483,0.0028620332,0.0014454459,0.0057497094,0.0021858902,0.0029663977,0.098480225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088180364,0.000022162865,0.00017379358,0.00014442785,0.000009788674,0.000102810234,0.00031678713,0.0013563071,0.0011401532,0.68142986,0.23188213,0.0833336],"study_design_scores_gemma":[0.000020033514,0.00001719895,0.00041069998,0.00013555646,0.00000879454,0.0001629794,0.00012176421,0.0046833013,0.0015891221,0.40876347,0.58405685,0.000030209058],"about_ca_topic_score_codex":0.0035641647,"about_ca_topic_score_gemma":0.005411726,"teacher_disagreement_score":0.1820387,"about_ca_system_score_codex":0.001492939,"about_ca_system_score_gemma":0.0009045489,"threshold_uncertainty_score":0.60898006},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40953413,0.0035570182,0.5665072,0.0014538864,0.00020224405,0.000067154644,0.00030639325,0.0010155586,0.017356304],"genre_scores_gemma":[0.96091235,0.00088026974,0.034140263,0.00029539835,0.00039097475,0.00007349688,0.00018552897,0.0001986419,0.0029230593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947484,0.0011513816,0.0004449971,0.0013533962,0.0014766512,0.0008251665],"domain_scores_gemma":[0.9621612,0.023133496,0.0025088438,0.009485071,0.0017934644,0.0009180221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040319148,0.0005259073,0.0016186676,0.0021556828,0.0016431271,0.0042336755,0.0026403214,0.0015889889,0.0020819977],"category_scores_gemma":[0.029641222,0.0010751279,0.0013803783,0.0020544014,0.008944965,0.011270377,0.0065531544,0.003746214,0.000418045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002681629,0.000053483687,0.0020298453,0.00017604187,0.000055614128,0.00023766524,0.00094218634,0.017998368,0.004226206,0.9382081,0.00085825747,0.034946],"study_design_scores_gemma":[0.000033328386,0.00007035235,0.000489311,0.00005152372,0.000036696696,0.0002573858,0.000082424864,0.053674474,0.0027271453,0.9408962,0.0016343719,0.000046823843],"about_ca_topic_score_codex":0.0009460881,"about_ca_topic_score_gemma":0.0004871647,"teacher_disagreement_score":0.0042336755,"about_ca_system_score_codex":0.0016980966,"about_ca_system_score_gemma":0.0013348534,"threshold_uncertainty_score":0.021323025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14971142,0.0022568258,0.7692838,0.005740235,0.00049502344,0.00017991869,0.00045602393,0.0007603673,0.07111634],"genre_scores_gemma":[0.81480205,0.0015741985,0.14129554,0.0010429006,0.0005353433,0.0004859617,0.00056471204,0.0007122614,0.038986914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986518,0.00055565714,0.000057531794,0.00021043252,0.00033086934,0.00019380887],"domain_scores_gemma":[0.9884039,0.008848316,0.0005439109,0.000731379,0.0004273664,0.0010451294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022905194,0.0009292003,0.0022025576,0.0021189132,0.002247086,0.0026231634,0.0026826207,0.0025478655,0.0124971885],"category_scores_gemma":[0.024028841,0.00086804386,0.0015019273,0.0023819017,0.0048026866,0.0060820743,0.005439711,0.005805669,0.00068174105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007453344,0.00003327641,0.00016621345,0.00008810012,0.000012258786,0.000050055805,0.00013807401,0.017225863,0.00041630334,0.9718169,0.0027667142,0.0072117085],"study_design_scores_gemma":[0.000034369492,0.000019569368,0.000100705605,0.000019385401,0.000009340026,0.000038620845,0.000042867483,0.10004912,0.00016597912,0.89770144,0.0018073301,0.000011193065],"about_ca_topic_score_codex":0.0025775505,"about_ca_topic_score_gemma":0.0024836077,"teacher_disagreement_score":0.0124971885,"about_ca_system_score_codex":0.0018608937,"about_ca_system_score_gemma":0.0015739617,"threshold_uncertainty_score":0.041807234},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055775594,0.06123223,0.16523845,0.13171615,0.03937022,0.000060818358,0.0007540304,0.0004825295,0.54537],"genre_scores_gemma":[0.65589625,0.049236234,0.10132768,0.020742383,0.06392038,0.0002742612,0.0005509242,0.00082732795,0.10722454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987488,0.0004246315,0.00008083409,0.00030088806,0.00033198786,0.00011295889],"domain_scores_gemma":[0.99517256,0.0036358142,0.0001758938,0.0005010423,0.0003116435,0.00020302928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024333089,0.0010751765,0.001583446,0.0031380185,0.0033929779,0.004215492,0.0020014143,0.002775254,0.009899956],"category_scores_gemma":[0.007273147,0.00063691894,0.0013970361,0.0032227554,0.01106032,0.015398872,0.0043457043,0.008752352,0.0017316155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017882821,0.0000057157854,0.000054583048,0.00003723011,0.0000045249617,0.000043250457,0.00009213996,0.0001664593,0.0001314948,0.9874407,0.0074699097,0.0045361635],"study_design_scores_gemma":[0.000004353732,0.0000059041313,0.0000754837,0.000010764724,0.0000038008134,0.00004121184,0.00002189289,0.00022817965,0.000065122986,0.981427,0.018106623,0.000009785496],"about_ca_topic_score_codex":0.001480501,"about_ca_topic_score_gemma":0.0016245632,"teacher_disagreement_score":0.009899956,"about_ca_system_score_codex":0.0018109004,"about_ca_system_score_gemma":0.0007484219,"threshold_uncertainty_score":0.033118606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7562487,0.00091754954,0.12355636,0.003127361,0.00064124254,0.0000927177,0.00057105033,0.00041795225,0.1144271],"genre_scores_gemma":[0.93324655,0.00064565224,0.025229009,0.00058472203,0.00043984354,0.00013272988,0.00049963035,0.00035113146,0.038870633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995153,0.00015646749,0.000014502146,0.00009793493,0.00012199862,0.00009372237],"domain_scores_gemma":[0.99844605,0.00068970496,0.00025234808,0.00015265887,0.00016205247,0.00029719583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004620395,0.0012226298,0.00087657117,0.003172309,0.0016857499,0.0022777987,0.0012108184,0.0018252131,0.011324917],"category_scores_gemma":[0.0023071088,0.0005680291,0.00064304826,0.0011306239,0.002581765,0.0031898725,0.0024562762,0.0019797704,0.0017304635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010828468,0.000046955574,0.0003085879,0.00008400012,0.000013751893,0.00022120429,0.00035077296,0.0033809207,0.002700977,0.98084533,0.0038623663,0.008076888],"study_design_scores_gemma":[0.000017783801,0.000011576931,0.00021106051,0.00001908866,0.000006436089,0.000118604075,0.00014199762,0.012039338,0.00045914372,0.98587286,0.0010935478,0.000008451145],"about_ca_topic_score_codex":0.0005146575,"about_ca_topic_score_gemma":0.0006316512,"teacher_disagreement_score":0.011324917,"about_ca_system_score_codex":0.0008640326,"about_ca_system_score_gemma":0.00034763702,"threshold_uncertainty_score":0.037885606},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5316338,0.0018165996,0.31109884,0.0059610577,0.0008677209,0.00025804204,0.0011984487,0.0005957002,0.14656986],"genre_scores_gemma":[0.9044192,0.0007732952,0.06140902,0.000573991,0.0005159211,0.0003849384,0.00092201395,0.00043510715,0.030566527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788433,0.00077935547,0.00014297056,0.0003803881,0.00049079605,0.00032210804],"domain_scores_gemma":[0.9686983,0.02398071,0.0018210432,0.0018508992,0.001816445,0.0018324838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002419171,0.0007212352,0.0013705179,0.0017702534,0.002242837,0.0052667097,0.002713843,0.002400568,0.02284737],"category_scores_gemma":[0.022058597,0.0007419632,0.0009599297,0.0013748268,0.0039509367,0.0071419706,0.002773336,0.0031280436,0.0020423944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038164805,0.0000688979,0.0018031913,0.00011848573,0.000020104333,0.00012351506,0.00035813657,0.008193753,0.002895438,0.95916086,0.0050598113,0.021816077],"study_design_scores_gemma":[0.00009596569,0.000077455086,0.00059868663,0.000043421063,0.000023277646,0.00027713273,0.00022909517,0.03780448,0.002335448,0.9528621,0.005626651,0.000026258213],"about_ca_topic_score_codex":0.0008944337,"about_ca_topic_score_gemma":0.0013179673,"teacher_disagreement_score":0.02284737,"about_ca_system_score_codex":0.0014200081,"about_ca_system_score_gemma":0.0010029776,"threshold_uncertainty_score":0.07643211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48437187,0.0009047455,0.50291985,0.0014147835,0.00004984885,0.00013829497,0.00031360355,0.00063088967,0.009256123],"genre_scores_gemma":[0.9452705,0.00031290593,0.050156873,0.00012869893,0.000056226647,0.00008509254,0.00034040975,0.00021118228,0.0034381775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975534,0.0009311365,0.00010478304,0.00056849245,0.00045896112,0.0003832561],"domain_scores_gemma":[0.9657122,0.02513876,0.0031923587,0.002993026,0.0018030703,0.0011606107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022190434,0.00077768945,0.0014032645,0.0016738797,0.0015061937,0.00402493,0.0043984293,0.0020763592,0.005229712],"category_scores_gemma":[0.02711967,0.0007628338,0.00090026273,0.0024737702,0.0027482898,0.0076206475,0.0027943726,0.0021146527,0.0005994016],"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.0006244604,0.00029755518,0.0058674295,0.00045312964,0.000116660725,0.00022815894,0.0008816034,0.5449777,0.004677441,0.40685838,0.0036742236,0.03134317],"study_design_scores_gemma":[0.000056796198,0.000067121764,0.0010850537,0.000024348243,0.00004207228,0.00009059135,0.00034459628,0.7547467,0.0014511214,0.2411242,0.00094610103,0.000021305745],"about_ca_topic_score_codex":0.004159867,"about_ca_topic_score_gemma":0.0043978156,"teacher_disagreement_score":0.005229712,"about_ca_system_score_codex":0.0030084134,"about_ca_system_score_gemma":0.0018387878,"threshold_uncertainty_score":0.021827638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3421203,0.0063473675,0.53900665,0.0068851947,0.0006107777,0.00008489959,0.00038563204,0.00020853842,0.104350634],"genre_scores_gemma":[0.92864704,0.0025832157,0.04332376,0.0009508245,0.00093152514,0.00013199815,0.00034328445,0.000111087575,0.022977266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849916,0.0006839946,0.00006388065,0.00020315057,0.0003623582,0.00018740453],"domain_scores_gemma":[0.99293035,0.004972837,0.00050634675,0.00030857604,0.0007493018,0.00053259375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002873651,0.00063972623,0.0013711988,0.002025666,0.0014496276,0.0034502607,0.0016496519,0.0017442228,0.0050800466],"category_scores_gemma":[0.010840576,0.0005935766,0.0012019239,0.0018662747,0.0036391146,0.0061841276,0.0024459672,0.0034909304,0.00038422688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033289125,0.000027729568,0.0001052972,0.00003794797,0.0000060728507,0.000025669833,0.00007021615,0.0011478332,0.00019163861,0.99483705,0.0007564467,0.0027609558],"study_design_scores_gemma":[0.000013662753,0.000011358373,0.00006778331,0.00000805447,0.0000042349134,0.000049835253,0.00003686123,0.0134197585,0.00014756604,0.98548746,0.0007485211,0.0000048559914],"about_ca_topic_score_codex":0.00064289506,"about_ca_topic_score_gemma":0.00042314228,"teacher_disagreement_score":0.0050800466,"about_ca_system_score_codex":0.0020122651,"about_ca_system_score_gemma":0.0008525285,"threshold_uncertainty_score":0.016994417},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3384742,0.002768643,0.63408977,0.0012472079,0.00025766372,0.00013092226,0.00043318607,0.00051179883,0.022086615],"genre_scores_gemma":[0.8828971,0.0021514408,0.10319001,0.00018429075,0.00031343996,0.00013627629,0.00023647181,0.000110469315,0.01078047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991351,0.00024252146,0.00005922445,0.00018193039,0.00019206994,0.00018913546],"domain_scores_gemma":[0.9936941,0.0037799766,0.0007328699,0.0004626479,0.0007023471,0.00062798266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071126,0.0010312437,0.0010351223,0.003620333,0.0018524402,0.003150093,0.0015977131,0.0013385275,0.0042784424],"category_scores_gemma":[0.009171009,0.0008165661,0.00071783614,0.0041436045,0.0014462548,0.005599969,0.003924911,0.0017368195,0.00033858573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033450953,0.000083063205,0.0017736244,0.00017738764,0.000062063256,0.00023916262,0.00029283957,0.12110938,0.0030219683,0.8252709,0.0026410301,0.04499421],"study_design_scores_gemma":[0.000041299143,0.000046040725,0.00039836243,0.000039009912,0.000049390997,0.00025667236,0.00018039689,0.3394863,0.0012503755,0.65410995,0.0041144337,0.000027821918],"about_ca_topic_score_codex":0.0016786724,"about_ca_topic_score_gemma":0.0015413206,"teacher_disagreement_score":0.0042784424,"about_ca_system_score_codex":0.0015736484,"about_ca_system_score_gemma":0.00090746064,"threshold_uncertainty_score":0.014312863},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6613229,0.0026015714,0.20143881,0.0036649904,0.00043569988,0.00020350292,0.0017528633,0.0003448761,0.1282347],"genre_scores_gemma":[0.87366253,0.0021602914,0.084698096,0.0011262313,0.0006647338,0.00035748215,0.002456305,0.0003642927,0.03450997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983804,0.0004826086,0.0001062904,0.00030987262,0.00041024838,0.00031055245],"domain_scores_gemma":[0.9932192,0.0037770027,0.0007768039,0.0005110999,0.0007315541,0.0009843293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011514582,0.0011355571,0.002076896,0.004665147,0.005754798,0.0062674168,0.0037645805,0.0028535668,0.012019763],"category_scores_gemma":[0.0074544987,0.0016210806,0.0016107261,0.0051996857,0.004484268,0.008062388,0.0041418793,0.004480223,0.0014069766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012973322,0.0000637284,0.0008711899,0.00012936135,0.000021056505,0.0001214152,0.00062726124,0.0050150114,0.0006893684,0.9819432,0.0027361638,0.007652633],"study_design_scores_gemma":[0.000018352303,0.000016720594,0.0004184688,0.000055805893,0.000013122906,0.00008881202,0.00028737224,0.01189223,0.00018216527,0.9847712,0.0022420106,0.000013729701],"about_ca_topic_score_codex":0.004116023,"about_ca_topic_score_gemma":0.005220777,"teacher_disagreement_score":0.012019763,"about_ca_system_score_codex":0.002258536,"about_ca_system_score_gemma":0.0008004256,"threshold_uncertainty_score":0.04021007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06161339,0.0012291217,0.914891,0.0015455481,0.0001678283,0.00038797146,0.0007180913,0.0013344306,0.018112589],"genre_scores_gemma":[0.3242281,0.00091453444,0.65829223,0.00052856654,0.0005067309,0.0010700391,0.0023294266,0.0008447275,0.011285646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9947212,0.002057042,0.00020017658,0.0010241102,0.0013991854,0.0005983114],"domain_scores_gemma":[0.97819877,0.014825523,0.0012030757,0.0033778667,0.0013150735,0.0010797232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050201635,0.001976375,0.0031918064,0.003314467,0.0032198387,0.004295709,0.0075402907,0.0030620557,0.008267081],"category_scores_gemma":[0.025127508,0.0018797679,0.0028286844,0.005920014,0.0027364984,0.01208439,0.0065255715,0.005663151,0.0017040644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023261167,0.0012478592,0.00298593,0.0009568576,0.00035570937,0.00012393012,0.0010848864,0.20174453,0.0041522994,0.4615447,0.024699515,0.2987777],"study_design_scores_gemma":[0.00022432792,0.00011978368,0.00062181463,0.00007380448,0.00013341049,0.00011360214,0.00017756276,0.58502984,0.0033212472,0.4045855,0.005554794,0.00004424138],"about_ca_topic_score_codex":0.0027155033,"about_ca_topic_score_gemma":0.0056945053,"teacher_disagreement_score":0.008267081,"about_ca_system_score_codex":0.002878652,"about_ca_system_score_gemma":0.0042171115,"threshold_uncertainty_score":0.027656138},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020039916,0.0098775495,0.91771066,0.0013929391,0.00025390348,0.0002626276,0.00041916492,0.00017927025,0.049863886],"genre_scores_gemma":[0.375893,0.025015429,0.5789116,0.00064386526,0.00049641985,0.0008861663,0.0012673436,0.0007709245,0.016115295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988092,0.00054304535,0.00006148275,0.00011028071,0.00041569248,0.000060391856],"domain_scores_gemma":[0.9967483,0.0022090597,0.0002094819,0.00024634702,0.00049180415,0.00009498709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003145164,0.001021255,0.0016002716,0.0019332174,0.0005277201,0.0029928077,0.0022557655,0.0019120341,0.007784425],"category_scores_gemma":[0.007845364,0.00052241475,0.0011832899,0.0030660785,0.0011086029,0.0041682688,0.0014563175,0.002145745,0.0007016951],"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.00015852963,0.00024230249,0.0005188237,0.0010017407,0.00010809682,0.00005344087,0.00018075788,0.3763584,0.00064779964,0.42070624,0.008218672,0.1918052],"study_design_scores_gemma":[0.000057870977,0.00016180582,0.00060271897,0.00028905921,0.00007198355,0.00012486846,0.0002813361,0.80658066,0.00058099994,0.17858522,0.012624764,0.00003875807],"about_ca_topic_score_codex":0.002444805,"about_ca_topic_score_gemma":0.004115523,"teacher_disagreement_score":0.007784425,"about_ca_system_score_codex":0.0020061696,"about_ca_system_score_gemma":0.0028687418,"threshold_uncertainty_score":0.026041508},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010576523,0.0003681493,0.91232234,0.0016592825,0.0006466437,0.0001096265,0.0059698434,0.014284519,0.0635819],"genre_scores_gemma":[0.029799676,0.0009652875,0.84427106,0.0011315105,0.00086499023,0.00037738818,0.011367616,0.017216088,0.09400639],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986291,0.00035643412,0.0001238011,0.00025171263,0.00056801783,0.00007099014],"domain_scores_gemma":[0.995531,0.0017523724,0.00016350878,0.001153705,0.0012148955,0.00018444515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014047173,0.0010719871,0.0008387543,0.003537419,0.0008922189,0.0036492813,0.0027491278,0.0017639181,0.17515838],"category_scores_gemma":[0.010377721,0.000806585,0.0009701692,0.003703227,0.0010167399,0.005732545,0.002388351,0.0035065096,0.11224647],"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.00025046425,0.000085833184,0.00032223057,0.0005163136,0.000036893307,0.00018709897,0.000189478,0.003738439,0.006950858,0.33935875,0.4347277,0.21363597],"study_design_scores_gemma":[0.00007411424,0.00005936925,0.00069938763,0.00016141823,0.000021211255,0.0006668438,0.00008494387,0.07082006,0.01638581,0.36855644,0.54239804,0.000072207906],"about_ca_topic_score_codex":0.0014504588,"about_ca_topic_score_gemma":0.0031110605,"teacher_disagreement_score":0.17515838,"about_ca_system_score_codex":0.0012310188,"about_ca_system_score_gemma":0.0008697551,"threshold_uncertainty_score":0.58596313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031285845,0.010633409,0.9517712,0.0021267,0.00034483604,0.00003870315,0.00030120622,0.0002205404,0.0032775656],"genre_scores_gemma":[0.65565413,0.011195864,0.32590184,0.0006664858,0.002544642,0.00022134192,0.00044826287,0.00013778103,0.0032296667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99499905,0.0023316317,0.0003684961,0.0006137571,0.0014688654,0.00021818165],"domain_scores_gemma":[0.9539279,0.037186846,0.0037903702,0.0016849663,0.002398037,0.0010118551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067515,0.00081733207,0.0015003913,0.0056047826,0.0007950106,0.003942861,0.0016342844,0.0012688466,0.0019697149],"category_scores_gemma":[0.04573915,0.0005699649,0.0008489127,0.009613878,0.0039457083,0.0066038934,0.002623031,0.0025332067,0.0002813621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094043826,0.00004549823,0.0017520832,0.00029677994,0.00006719587,0.00007091263,0.00022670323,0.022366766,0.0009685885,0.8834046,0.0018666942,0.0888402],"study_design_scores_gemma":[0.000028377553,0.00007365197,0.0011574135,0.00010648694,0.000044933673,0.00020201101,0.000096626456,0.17403054,0.0007186492,0.81867826,0.004813109,0.000049853486],"about_ca_topic_score_codex":0.001387489,"about_ca_topic_score_gemma":0.0009680187,"teacher_disagreement_score":0.0067515,"about_ca_system_score_codex":0.0021337902,"about_ca_system_score_gemma":0.0009114232,"threshold_uncertainty_score":0.035705745},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8293341,0.0003084195,0.067112364,0.00038232838,0.00010890363,0.00005471435,0.0005013118,0.0002891178,0.10190865],"genre_scores_gemma":[0.9669215,0.0002883068,0.0157788,0.00008405422,0.00004271873,0.00003758829,0.0004957131,0.000069975475,0.016281204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969316,0.00004551577,0.000017229819,0.000040020583,0.000115403636,0.00008870246],"domain_scores_gemma":[0.99946123,0.00018989659,0.000084052685,0.00005646745,0.00011296533,0.00009549228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015823632,0.0004193492,0.00047535016,0.001504647,0.0011925447,0.0029177982,0.0008779467,0.00079687044,0.010826734],"category_scores_gemma":[0.0010707449,0.00029012267,0.00029670834,0.001707539,0.0010319931,0.002027642,0.0012896482,0.001003282,0.0013216698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011741797,0.000059255985,0.000882197,0.00008319307,0.000010639049,0.00032461583,0.0006106347,0.0043405415,0.004731834,0.96422786,0.0019293787,0.022682358],"study_design_scores_gemma":[0.000028174763,0.000046194426,0.00095498614,0.00003442996,0.000015430194,0.00030844795,0.0006120552,0.024722017,0.0036467828,0.96280223,0.0068081543,0.000021225525],"about_ca_topic_score_codex":0.0014163852,"about_ca_topic_score_gemma":0.002443974,"teacher_disagreement_score":0.010826734,"about_ca_system_score_codex":0.00082672195,"about_ca_system_score_gemma":0.00037234652,"threshold_uncertainty_score":0.03621906},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1871282,0.0012832714,0.15272292,0.004557761,0.0008122608,0.00014266501,0.0003083081,0.00041762684,0.65262705],"genre_scores_gemma":[0.8519806,0.0016881711,0.05521512,0.0017848691,0.00092930114,0.00020274954,0.00063175906,0.00037269696,0.08719468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979512,0.0008920282,0.00011563404,0.0003405082,0.0004424535,0.0002581735],"domain_scores_gemma":[0.9943258,0.0036750392,0.00043150777,0.0007603127,0.00045184765,0.00035555928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015258763,0.0007736156,0.0008954957,0.0023875409,0.0045371694,0.0042207614,0.0020619447,0.0018027056,0.03578403],"category_scores_gemma":[0.011816455,0.00053159805,0.00081927096,0.0041495864,0.0033940196,0.00916462,0.0034229076,0.0040319646,0.0032949788],"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.000021605745,0.000024374189,0.00011168457,0.000035645095,0.0000019884517,0.00004187033,0.00016039246,0.00047928616,0.00013148857,0.9903458,0.0013467962,0.007299078],"study_design_scores_gemma":[0.000006528434,0.000013087143,0.00010448285,0.000019270878,0.0000028830625,0.000087668035,0.00019595225,0.0019555546,0.00032602833,0.9905758,0.006707148,0.000005567502],"about_ca_topic_score_codex":0.0005701491,"about_ca_topic_score_gemma":0.00064441207,"teacher_disagreement_score":0.03578403,"about_ca_system_score_codex":0.0013697703,"about_ca_system_score_gemma":0.0007756146,"threshold_uncertainty_score":0.11970955},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.761085,0.0010320976,0.14710024,0.003998969,0.00037922428,0.00012923988,0.0024226184,0.0009861195,0.08286648],"genre_scores_gemma":[0.9243188,0.0007441448,0.0418209,0.000488364,0.0004681023,0.00026534058,0.0013561937,0.0003309372,0.030207235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998615,0.00042472914,0.00008707233,0.00035608187,0.00032281736,0.00019431252],"domain_scores_gemma":[0.9855875,0.008980989,0.0017838028,0.00082122994,0.0011479484,0.0016785379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906802,0.0005732682,0.00095123326,0.0033967881,0.0021766443,0.005307327,0.0021154617,0.0019133196,0.0213074],"category_scores_gemma":[0.008777482,0.00083770877,0.0005695069,0.0028954232,0.0021884732,0.008908629,0.0013025395,0.0018973346,0.0019022804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004548629,0.00014149236,0.006508453,0.0002965223,0.00006897299,0.0002713309,0.00074496586,0.0060144635,0.006100369,0.94215965,0.009709587,0.027529228],"study_design_scores_gemma":[0.00009714765,0.000069545385,0.002593851,0.00007950722,0.0000625864,0.00051125226,0.00046196688,0.020887665,0.0024574148,0.96485096,0.007897735,0.00003041756],"about_ca_topic_score_codex":0.00047361382,"about_ca_topic_score_gemma":0.0006171927,"teacher_disagreement_score":0.0213074,"about_ca_system_score_codex":0.001220301,"about_ca_system_score_gemma":0.00046984342,"threshold_uncertainty_score":0.07128036},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06741505,0.008329547,0.8508825,0.0026898365,0.0008682261,0.00008688817,0.00035726998,0.00042457215,0.06894615],"genre_scores_gemma":[0.7147081,0.009629524,0.24108793,0.0015734669,0.0015578733,0.00039429686,0.0006075904,0.0011883813,0.02925282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989749,0.0003692907,0.00007020117,0.000117290685,0.00033692128,0.00013151827],"domain_scores_gemma":[0.9943614,0.0041036597,0.0002748055,0.00045195714,0.00057691283,0.00023132669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034800062,0.0017334587,0.0012434296,0.0027933125,0.0012858497,0.003538276,0.003535535,0.00201467,0.008795227],"category_scores_gemma":[0.022976477,0.0010145893,0.0010183413,0.0031705422,0.00280197,0.01225833,0.0032752668,0.0056036296,0.0013443481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048718943,0.000037394137,0.0002799702,0.00013575789,0.000013831741,0.00009894271,0.0002872164,0.012483967,0.00094195415,0.9649969,0.0027428973,0.017932545],"study_design_scores_gemma":[0.000010635781,0.000008819391,0.00013089342,0.000073871044,0.000013365906,0.00007304991,0.000083319785,0.061068792,0.0003905807,0.9353721,0.0027581358,0.000016395783],"about_ca_topic_score_codex":0.0015348662,"about_ca_topic_score_gemma":0.0030077358,"teacher_disagreement_score":0.008795227,"about_ca_system_score_codex":0.0024914783,"about_ca_system_score_gemma":0.00076716556,"threshold_uncertainty_score":0.029422998},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04586048,0.0008959898,0.9457301,0.0010781777,0.000098190976,0.000059246016,0.00021599222,0.00032449997,0.0057372744],"genre_scores_gemma":[0.6933693,0.0013286979,0.29505318,0.00061687356,0.00048774682,0.00033905986,0.0005780893,0.00026317392,0.007963882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949963,0.0025600742,0.0004152132,0.00081301125,0.0008307825,0.00038459073],"domain_scores_gemma":[0.9735738,0.019503063,0.0015915799,0.0028008025,0.0019254369,0.0006052662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062915925,0.0007172136,0.0015987265,0.0030204454,0.0020387482,0.00524037,0.0023059698,0.0015057062,0.0057930853],"category_scores_gemma":[0.028930511,0.0013837426,0.002649873,0.0026867893,0.010054362,0.011940023,0.005657132,0.002485729,0.00070992135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039999755,0.000008097695,0.00029117224,0.000061066145,0.000022654607,0.00004835228,0.00019691818,0.0046123797,0.00046164545,0.9905543,0.0002997151,0.003403715],"study_design_scores_gemma":[0.0000131775705,0.000010304266,0.000099883844,0.00001687795,0.000020818583,0.000025492454,0.00004730023,0.02674459,0.000526056,0.9712388,0.0012429138,0.000013888813],"about_ca_topic_score_codex":0.0040031993,"about_ca_topic_score_gemma":0.0026441377,"teacher_disagreement_score":0.0062915925,"about_ca_system_score_codex":0.0023199255,"about_ca_system_score_gemma":0.002487432,"threshold_uncertainty_score":0.033273578},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014027408,0.0024170042,0.9657329,0.0015363691,0.003281846,0.00004705393,0.00015148372,0.001202701,0.024227858],"genre_scores_gemma":[0.054046072,0.0101941135,0.8893746,0.0013571664,0.0033537524,0.00013364543,0.0005459149,0.0015499336,0.03944476],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991609,0.0001600986,0.000053582815,0.00013150551,0.00045343515,0.000040434858],"domain_scores_gemma":[0.9984274,0.00069605233,0.00003987583,0.00045904552,0.00029060777,0.00008706593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006961438,0.0009691917,0.0007501617,0.001742068,0.0008685696,0.002049763,0.002011925,0.0014734552,0.022568218],"category_scores_gemma":[0.0040682554,0.00080136704,0.001162747,0.0028254138,0.0015089004,0.003560749,0.002897574,0.0037107454,0.004620336],"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.00008224348,0.000044113007,0.0002769303,0.0003192739,0.000035588495,0.0003477578,0.00016372236,0.026193883,0.0062305196,0.36853153,0.08222591,0.51554847],"study_design_scores_gemma":[0.000020823514,0.000048428865,0.0003991113,0.00013429353,0.000033203924,0.0009468779,0.00008886958,0.12924565,0.006416735,0.36720556,0.4953797,0.0000808195],"about_ca_topic_score_codex":0.0023421294,"about_ca_topic_score_gemma":0.0040936917,"teacher_disagreement_score":0.022568218,"about_ca_system_score_codex":0.0006074778,"about_ca_system_score_gemma":0.00047892434,"threshold_uncertainty_score":0.07549822},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25941777,0.0013203342,0.6803013,0.0013542345,0.00026067047,0.00020191538,0.0005975171,0.00090295693,0.055643335],"genre_scores_gemma":[0.838697,0.0004984387,0.15195112,0.00047711347,0.00009748669,0.00023247907,0.00023649774,0.00005690015,0.0077530104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761534,0.0009484667,0.00014995014,0.0003479206,0.00064729736,0.00029106872],"domain_scores_gemma":[0.99527633,0.0023392204,0.0007094603,0.001081481,0.00042753562,0.00016599368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018640396,0.00087964855,0.0008502703,0.00093223044,0.0009295005,0.0015036666,0.0011891157,0.0016604128,0.0050297095],"category_scores_gemma":[0.006629258,0.00070561265,0.0005883791,0.0008362732,0.00097154564,0.0015336762,0.0014234307,0.0008708415,0.001102918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012107253,0.000117146184,0.0010451542,0.00029441647,0.00014429027,0.00033181734,0.0002864128,0.042046692,0.033439804,0.830181,0.0024772652,0.08842524],"study_design_scores_gemma":[0.0005937718,0.0008313251,0.0007219923,0.00020471631,0.00015402303,0.001002003,0.0001167803,0.15600148,0.035062406,0.7906878,0.014484516,0.00013907367],"about_ca_topic_score_codex":0.00041881326,"about_ca_topic_score_gemma":0.00088013517,"teacher_disagreement_score":0.0050297095,"about_ca_system_score_codex":0.0009440198,"about_ca_system_score_gemma":0.0013256883,"threshold_uncertainty_score":0.016826034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2440708,0.0017673594,0.7375764,0.0027759173,0.000160636,0.00013526494,0.000102400765,0.0002995194,0.013111543],"genre_scores_gemma":[0.93350816,0.0006948946,0.053798467,0.00023935894,0.00017126469,0.00020035058,0.000070572074,0.000045193443,0.01127172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999111,0.00047072544,0.00004363477,0.00014785232,0.000094931456,0.00013183345],"domain_scores_gemma":[0.9913761,0.0065840436,0.0009930428,0.00020989108,0.00033902415,0.0004978397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027199052,0.00080501544,0.0019040512,0.0016402901,0.0015590518,0.0028695236,0.0019965284,0.0034219087,0.0030708848],"category_scores_gemma":[0.014218669,0.0008078118,0.00088011223,0.0011467055,0.0023981952,0.00379429,0.0026450043,0.0013376456,0.00044020306],"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.00038240512,0.000101733654,0.0015474327,0.0001948459,0.00012961327,0.0004590113,0.00027920582,0.79869497,0.0012600869,0.18193325,0.0017105143,0.013306833],"study_design_scores_gemma":[0.00006413998,0.00006676866,0.00007565816,0.000015635966,0.000020194266,0.000040994542,0.000059502738,0.9541123,0.00027752703,0.04465796,0.00059939694,0.000009799642],"about_ca_topic_score_codex":0.002473884,"about_ca_topic_score_gemma":0.0018031603,"teacher_disagreement_score":0.0034219087,"about_ca_system_score_codex":0.0011728962,"about_ca_system_score_gemma":0.00068751135,"threshold_uncertainty_score":0.0143844485},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32393524,0.0030631872,0.539788,0.023186196,0.00049581105,0.00022330739,0.0019315797,0.0003963104,0.10698045],"genre_scores_gemma":[0.91042286,0.0023760682,0.069428,0.0012998856,0.0010144839,0.0004159072,0.0016056986,0.00030238047,0.013134809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9924435,0.0032755097,0.00034626562,0.000936963,0.0021952158,0.00080248236],"domain_scores_gemma":[0.8886559,0.09893495,0.0025359748,0.005919972,0.0026232614,0.0013298898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061196713,0.0012120999,0.0025152373,0.0026315136,0.0029178576,0.00892555,0.0046919035,0.0029542614,0.012633588],"category_scores_gemma":[0.048761588,0.0012744446,0.00213802,0.0040994035,0.008462459,0.027253557,0.006954283,0.009794336,0.00097557023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085077874,0.000049474835,0.0004902799,0.00006747656,0.00001609801,0.00004079559,0.0002223763,0.0112784,0.00018929357,0.9799187,0.0018264242,0.0058155954],"study_design_scores_gemma":[0.000013966908,0.00000828816,0.00012677003,0.000012417132,0.0000074941004,0.00002523811,0.000051010396,0.027156115,0.000116053685,0.9718332,0.0006397368,0.000009548405],"about_ca_topic_score_codex":0.0025331397,"about_ca_topic_score_gemma":0.0020933244,"teacher_disagreement_score":0.012633588,"about_ca_system_score_codex":0.004117159,"about_ca_system_score_gemma":0.002161928,"threshold_uncertainty_score":0.042263567},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008858852,0.1635691,0.79516196,0.0016970505,0.0011159672,0.00009567081,0.00024887786,0.0004219741,0.02883047],"genre_scores_gemma":[0.21677737,0.37279427,0.38877416,0.0013140956,0.0056513427,0.00043116658,0.0009222525,0.00039405198,0.0129412105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985697,0.00042452218,0.000120095356,0.00030482383,0.00046956274,0.0001112333],"domain_scores_gemma":[0.9984843,0.00094289175,0.00012818858,0.00018574166,0.00019556233,0.00006326133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017275632,0.001305212,0.0016528977,0.0013804362,0.00066612527,0.002501089,0.0016719222,0.0011534836,0.0029680114],"category_scores_gemma":[0.003993401,0.0008538345,0.000908797,0.005677806,0.0009765057,0.0027967708,0.00095626386,0.0015710089,0.0010379105],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019768151,0.00019452184,0.0007903453,0.00312188,0.00009923693,0.000106500614,0.00011676587,0.09310229,0.0026596405,0.47652933,0.015507513,0.40757427],"study_design_scores_gemma":[0.000084332845,0.00027131074,0.00073664007,0.00047968057,0.000089665504,0.0003710334,0.00009636121,0.29504973,0.0025257117,0.5191907,0.18103354,0.000071307135],"about_ca_topic_score_codex":0.0011090011,"about_ca_topic_score_gemma":0.00091870595,"teacher_disagreement_score":0.0029680114,"about_ca_system_score_codex":0.0013725191,"about_ca_system_score_gemma":0.0018691887,"threshold_uncertainty_score":0.009958327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34297588,0.0009702399,0.591567,0.001399495,0.0002059104,0.00006953451,0.00031427603,0.00032624733,0.062171455],"genre_scores_gemma":[0.96704435,0.00055164844,0.020689646,0.00018973136,0.00014700758,0.00006749138,0.00019134294,0.00014647162,0.010972294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868244,0.00035080273,0.00007814981,0.0003039183,0.0003671311,0.00021755179],"domain_scores_gemma":[0.99451905,0.0031181243,0.000721913,0.0004862753,0.00081597216,0.00033866777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017695634,0.00075790554,0.0009915291,0.0011465078,0.00073552236,0.002319954,0.0011552987,0.00057442934,0.0051634773],"category_scores_gemma":[0.009007271,0.0005669935,0.0009241086,0.0006225375,0.0031005545,0.0039907256,0.0024504834,0.0025107015,0.00060239545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020572609,0.000057862206,0.0009222315,0.00015811971,0.000035367044,0.00035570815,0.00059163145,0.017736847,0.015453026,0.93821526,0.0014873841,0.024780925],"study_design_scores_gemma":[0.00003575412,0.00017498799,0.0017404616,0.000034617085,0.000017435972,0.00041650428,0.0002598246,0.16608903,0.00418359,0.823371,0.0036355858,0.000041275016],"about_ca_topic_score_codex":0.0013212067,"about_ca_topic_score_gemma":0.00063452625,"teacher_disagreement_score":0.0051634773,"about_ca_system_score_codex":0.00079547026,"about_ca_system_score_gemma":0.0005836772,"threshold_uncertainty_score":0.017273605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13952231,0.00489245,0.5761182,0.019003192,0.003412475,0.00014772706,0.0008423703,0.0003509028,0.25571042],"genre_scores_gemma":[0.7492397,0.004717634,0.12784909,0.002682397,0.0029113644,0.00024627606,0.0007541386,0.00058055425,0.1110189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988223,0.00034429386,0.000070823444,0.00029869896,0.00034207944,0.00012177216],"domain_scores_gemma":[0.9956601,0.0029781368,0.00030703252,0.00043042074,0.00038899182,0.000235276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020050262,0.00075933797,0.0010499752,0.0026223762,0.0026790383,0.002334043,0.0016248217,0.002783281,0.011187275],"category_scores_gemma":[0.011182206,0.0005899865,0.0010745595,0.001982119,0.0039939834,0.007767854,0.0033494348,0.004278706,0.0013624124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027086387,0.000015568576,0.000093657305,0.000049145252,0.0000081720555,0.000054895492,0.000083142666,0.002307676,0.00037514223,0.9876602,0.0030289628,0.006296387],"study_design_scores_gemma":[0.0000092483715,0.0000064992405,0.00006625869,0.000010865594,0.0000049010487,0.00007119198,0.000033198183,0.007491436,0.00032386975,0.9867237,0.0052506425,0.000008333308],"about_ca_topic_score_codex":0.0011732773,"about_ca_topic_score_gemma":0.0006377696,"teacher_disagreement_score":0.011187275,"about_ca_system_score_codex":0.0014025084,"about_ca_system_score_gemma":0.0007594581,"threshold_uncertainty_score":0.03742522},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31613362,0.0007531102,0.64076465,0.0011791427,0.00016063686,0.0007360501,0.005399484,0.0067991107,0.028074145],"genre_scores_gemma":[0.29148936,0.00045594448,0.6853817,0.00016224722,0.00004060248,0.00017167245,0.0068653687,0.0010003595,0.014432841],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929297,0.00011952625,0.000048144717,0.00017969644,0.00022253719,0.00013707358],"domain_scores_gemma":[0.9973254,0.001371922,0.00020374093,0.0004739382,0.0004517979,0.00017308557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077759,0.0008782867,0.0008616602,0.0026847392,0.001440261,0.0020097098,0.0014688309,0.0012717987,0.012206603],"category_scores_gemma":[0.005924345,0.0005997722,0.0011590029,0.0031633151,0.00086721097,0.004650704,0.0016911132,0.0012204115,0.0019617307],"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.00057219056,0.000608664,0.01313684,0.00145893,0.0001542776,0.0008749604,0.0010637214,0.055341404,0.018945346,0.14858967,0.029593967,0.72966],"study_design_scores_gemma":[0.00015111669,0.00035482884,0.0030739468,0.00031144673,0.00023492021,0.0007490578,0.0016142619,0.3212115,0.031870723,0.58587915,0.05446812,0.00008089195],"about_ca_topic_score_codex":0.0050305445,"about_ca_topic_score_gemma":0.012961799,"teacher_disagreement_score":0.012206603,"about_ca_system_score_codex":0.00090963824,"about_ca_system_score_gemma":0.0019350465,"threshold_uncertainty_score":0.0408352},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064509355,0.004166846,0.8927879,0.004432151,0.0005833044,0.00065907586,0.0023856184,0.0025779095,0.027897876],"genre_scores_gemma":[0.5588519,0.0021569917,0.40288016,0.0018174105,0.00073578424,0.0012039117,0.003582352,0.0015111226,0.027260352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972166,0.0010276589,0.00009449706,0.0006315535,0.00040242012,0.000627259],"domain_scores_gemma":[0.9848236,0.011257462,0.0007826626,0.0012946952,0.00086835504,0.00097315735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005011825,0.0030169196,0.0050265365,0.0019387179,0.0021844942,0.003902005,0.008797739,0.0047518206,0.016547728],"category_scores_gemma":[0.018501064,0.0015101933,0.0015474174,0.0042723096,0.0023376623,0.006428736,0.004739175,0.0056023514,0.0021554981],"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.0011342495,0.0005203423,0.00066063536,0.00047926308,0.00012428287,0.0000662411,0.00012996345,0.8135264,0.0005291326,0.074567735,0.03941927,0.06884256],"study_design_scores_gemma":[0.000112558395,0.0000798927,0.000108449705,0.000034436707,0.000027174863,0.000029704477,0.00003680811,0.9354614,0.00029822573,0.06227161,0.0015264972,0.0000131954075],"about_ca_topic_score_codex":0.008679666,"about_ca_topic_score_gemma":0.012703569,"teacher_disagreement_score":0.016547728,"about_ca_system_score_codex":0.0064786733,"about_ca_system_score_gemma":0.0048983367,"threshold_uncertainty_score":0.055357695},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08282869,0.33379886,0.30408654,0.04785875,0.0068218587,0.00016584383,0.0005492587,0.00042206448,0.22346817],"genre_scores_gemma":[0.79180336,0.10063106,0.051408097,0.0028807179,0.0072048903,0.00026367552,0.0003877563,0.000076269724,0.045344163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940026,0.00017824236,0.000028095437,0.00008675439,0.00023315861,0.00007346064],"domain_scores_gemma":[0.9985682,0.00097281736,0.00012017492,0.00014809282,0.00014152827,0.00004907056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066401873,0.00056447,0.0007485614,0.0014083894,0.0007304296,0.002361691,0.00043049574,0.0021467141,0.0045814887],"category_scores_gemma":[0.0030694604,0.0002241807,0.00027751928,0.001923504,0.004649332,0.002843844,0.0010012534,0.002513592,0.0008065819],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038065085,0.00002666772,0.00019508689,0.00018052485,0.0000103795255,0.000055125794,0.00010886724,0.0035717804,0.0012193082,0.9481112,0.0068078316,0.039675094],"study_design_scores_gemma":[0.000018883366,0.000030564646,0.00027350863,0.00006632084,0.000006992732,0.00015003311,0.00007194035,0.0107879145,0.0005317462,0.9645312,0.023516575,0.000014275652],"about_ca_topic_score_codex":0.0015966196,"about_ca_topic_score_gemma":0.0010901236,"teacher_disagreement_score":0.0045814887,"about_ca_system_score_codex":0.0013673082,"about_ca_system_score_gemma":0.0011827946,"threshold_uncertainty_score":0.01532656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44391653,0.00067438034,0.4905083,0.0008415609,0.00027682743,0.00012213984,0.000740462,0.00033330976,0.062586546],"genre_scores_gemma":[0.7667345,0.00067902316,0.1693479,0.0003063057,0.00017949115,0.00020493763,0.0011927101,0.00076652045,0.060588542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999526,0.00010616939,0.000027771186,0.00009463771,0.00016977474,0.00007565019],"domain_scores_gemma":[0.99883026,0.00044866302,0.000106937085,0.00017020658,0.0002628306,0.00018113111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065007724,0.00054008677,0.00075452134,0.0007035053,0.00059176417,0.0016530685,0.0013964741,0.0008281103,0.010342331],"category_scores_gemma":[0.0024818964,0.00045786245,0.0005677133,0.00065396546,0.0008631698,0.0028472631,0.0012335341,0.0011004474,0.0010805267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027503117,0.00018033563,0.00073673297,0.00045800948,0.00006537406,0.00019704108,0.00037865434,0.020934772,0.010424,0.84815377,0.013882802,0.104313485],"study_design_scores_gemma":[0.00003283767,0.00010815168,0.00049728237,0.000038707953,0.00002360983,0.00025741776,0.0002498064,0.08466696,0.009818919,0.89627147,0.008014171,0.000020625368],"about_ca_topic_score_codex":0.0004061243,"about_ca_topic_score_gemma":0.0007610835,"teacher_disagreement_score":0.010342331,"about_ca_system_score_codex":0.0006192582,"about_ca_system_score_gemma":0.0005801719,"threshold_uncertainty_score":0.03459853},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019267756,0.007402499,0.9014337,0.007957074,0.0016652843,0.00021924805,0.0011669038,0.0014107989,0.059476726],"genre_scores_gemma":[0.38783386,0.012078876,0.52343976,0.004662589,0.0049135904,0.001641813,0.005139704,0.0029948608,0.057294946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99423546,0.0014429587,0.00020730536,0.0007136065,0.0019943884,0.0014062832],"domain_scores_gemma":[0.97242314,0.020410717,0.0011005673,0.001921253,0.0025556495,0.0015887802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067002447,0.0041369945,0.004083741,0.0037862419,0.0029421314,0.008383946,0.007881507,0.00519023,0.024836414],"category_scores_gemma":[0.03139611,0.0017591144,0.002665187,0.005176851,0.0028871133,0.010988435,0.0061889617,0.012351395,0.006005952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015050533,0.000901193,0.0010380951,0.0016079949,0.00022182721,0.00024290259,0.00041174953,0.33891067,0.006736617,0.42117423,0.08156636,0.14568338],"study_design_scores_gemma":[0.00012220684,0.00021407018,0.0004563252,0.00022657524,0.000123316,0.00020197178,0.000095405434,0.7283303,0.0021939627,0.25334358,0.014633375,0.00005885667],"about_ca_topic_score_codex":0.0024834943,"about_ca_topic_score_gemma":0.0029274903,"teacher_disagreement_score":0.024836414,"about_ca_system_score_codex":0.004639903,"about_ca_system_score_gemma":0.00418278,"threshold_uncertainty_score":0.08308613},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7069653,0.000701373,0.17127559,0.0017179754,0.00017006781,0.000079865924,0.0015238014,0.0005068049,0.11705928],"genre_scores_gemma":[0.9619347,0.00040075884,0.01989117,0.00024003076,0.00015763685,0.00007366937,0.0010507074,0.00016569585,0.016085701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999223,0.00013115672,0.00004955284,0.00018781582,0.0002337923,0.00017468103],"domain_scores_gemma":[0.9934617,0.003458926,0.00086753245,0.0007059443,0.0006602455,0.0008456612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007058313,0.00044705928,0.0009854265,0.0021899866,0.0024340856,0.0037673605,0.0012549219,0.0011200097,0.010769977],"category_scores_gemma":[0.0041169203,0.00057586504,0.0008157507,0.0028307538,0.0032275626,0.0050869053,0.001534994,0.003176496,0.0008329433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001275546,0.000039350536,0.00074940524,0.000047077836,0.000012223837,0.000116409916,0.00040678587,0.0026048883,0.0008437831,0.98554176,0.0016459518,0.007864717],"study_design_scores_gemma":[0.000033784683,0.000019037861,0.0005091056,0.0000133745125,0.000016075548,0.000114606344,0.00017938214,0.006748765,0.0006460609,0.9892726,0.0024313286,0.000015893278],"about_ca_topic_score_codex":0.0027029468,"about_ca_topic_score_gemma":0.003170212,"teacher_disagreement_score":0.010769977,"about_ca_system_score_codex":0.0012287059,"about_ca_system_score_gemma":0.0007208631,"threshold_uncertainty_score":0.0360291},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08499523,0.002501114,0.89696145,0.001118095,0.00048268453,0.00044501555,0.0016370873,0.0017312869,0.010128044],"genre_scores_gemma":[0.50887525,0.0007838372,0.48490566,0.0002714245,0.00015663086,0.00020951412,0.0016840504,0.000066987086,0.0030466442],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998432,0.00039602222,0.00021250838,0.00021228575,0.00066890504,0.00007833329],"domain_scores_gemma":[0.9962851,0.002572558,0.00013635066,0.00040151316,0.00053478725,0.000069732945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002071691,0.00044842417,0.001008674,0.0010806018,0.0007594983,0.001362631,0.0015424987,0.0007905859,0.0039742496],"category_scores_gemma":[0.008136226,0.00033658437,0.0012084305,0.0010108193,0.0005740665,0.0012635263,0.0006960455,0.0010219836,0.00071104296],"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.0010802355,0.00040851996,0.0057771616,0.0009307661,0.00039446572,0.002962829,0.00078253227,0.13426864,0.013912521,0.09145004,0.020744452,0.72728777],"study_design_scores_gemma":[0.00013881894,0.0001968555,0.0023538254,0.00014259275,0.0005138906,0.0017586935,0.00018670959,0.8241484,0.01653013,0.13965929,0.0143021075,0.00006864602],"about_ca_topic_score_codex":0.003442189,"about_ca_topic_score_gemma":0.005257684,"teacher_disagreement_score":0.0039742496,"about_ca_system_score_codex":0.00048017822,"about_ca_system_score_gemma":0.00087921874,"threshold_uncertainty_score":0.013295233},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023507213,0.0023322823,0.44447792,0.006057276,0.0020408144,0.00020444076,0.0055326256,0.0021952805,0.5136522],"genre_scores_gemma":[0.47097751,0.0042520184,0.2153534,0.0039523407,0.0014572707,0.00073248363,0.009167048,0.004161559,0.28994632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990522,0.00016701527,0.00007805195,0.00014379024,0.00037833172,0.00018057798],"domain_scores_gemma":[0.9982974,0.0007737216,0.00012171582,0.00018768749,0.00053859595,0.00008085035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009126216,0.0009861384,0.0007915247,0.0018319966,0.0016246823,0.0044396035,0.001364939,0.0011771342,0.07799223],"category_scores_gemma":[0.006221976,0.0004811938,0.0010546016,0.0022845424,0.0015646026,0.008311879,0.0021416142,0.003997287,0.02971114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041630272,0.00001992834,0.0001596678,0.000085979045,0.000005552858,0.00011869523,0.0001570445,0.0006174843,0.000431521,0.9317012,0.04154472,0.025116645],"study_design_scores_gemma":[0.00002224711,0.000013599463,0.00016844094,0.00006305076,0.000010607264,0.00024102407,0.0001286352,0.0034989705,0.0014403128,0.94758445,0.04680307,0.00002558003],"about_ca_topic_score_codex":0.002767209,"about_ca_topic_score_gemma":0.0041478546,"teacher_disagreement_score":0.07799223,"about_ca_system_score_codex":0.0023198426,"about_ca_system_score_gemma":0.0013836103,"threshold_uncertainty_score":0.26090997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46828675,0.0010304813,0.20648162,0.0025773079,0.00030191423,0.00022821284,0.0019399403,0.000724191,0.31842965],"genre_scores_gemma":[0.8917894,0.000664025,0.032108564,0.00045962256,0.00013712056,0.0001270545,0.0018612158,0.0001432034,0.072709784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937457,0.00014838834,0.000022808168,0.00019164532,0.00015444227,0.000108271866],"domain_scores_gemma":[0.9980496,0.00082655234,0.00017765822,0.00031328274,0.00027195798,0.0003609647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054068526,0.0005536033,0.000586145,0.0011072409,0.0018675865,0.0022786765,0.00096071756,0.00069823966,0.014016102],"category_scores_gemma":[0.0019040075,0.0005356996,0.00044489407,0.001179702,0.0010408236,0.003403874,0.0016720966,0.0014069257,0.0013868443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007472759,0.000045596145,0.0008188742,0.00008448636,0.000022398168,0.00018514546,0.00031229877,0.0015233636,0.0025426822,0.9738253,0.006745396,0.013819729],"study_design_scores_gemma":[0.00003838907,0.00004956221,0.0010423227,0.000027951182,0.00006486288,0.0006891286,0.00040600702,0.01072709,0.005275526,0.9564016,0.025261011,0.000016531369],"about_ca_topic_score_codex":0.00043410299,"about_ca_topic_score_gemma":0.0007448139,"teacher_disagreement_score":0.014016102,"about_ca_system_score_codex":0.0011502923,"about_ca_system_score_gemma":0.0005490724,"threshold_uncertainty_score":0.04688847},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03491909,0.002523097,0.9200814,0.0040512253,0.00036314756,0.00022432073,0.00048573106,0.00032410803,0.037027854],"genre_scores_gemma":[0.48927796,0.0035181458,0.4287538,0.003655853,0.0018774988,0.00074403355,0.0012278252,0.0009838362,0.06996104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741983,0.0012494784,0.00006934906,0.00048248234,0.0005231271,0.00025574517],"domain_scores_gemma":[0.992322,0.005717968,0.00029490291,0.0006986102,0.00061386655,0.0003526805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003540617,0.0011776295,0.0019607514,0.0028586728,0.0019437455,0.0034810598,0.004194107,0.004473527,0.01095377],"category_scores_gemma":[0.018147957,0.0007092127,0.0019476209,0.004472183,0.0040021804,0.0104977265,0.0037699598,0.0047267424,0.0016783791],"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.00006911134,0.000087568194,0.00035825867,0.0001874868,0.000028823084,0.000042817202,0.00011290053,0.027751595,0.0010498923,0.94852734,0.0067189005,0.015065333],"study_design_scores_gemma":[0.000035139878,0.000052847026,0.00012347999,0.000038047372,0.000024785915,0.000059571666,0.000043023618,0.24457039,0.00041869938,0.7498718,0.0047450443,0.000017242475],"about_ca_topic_score_codex":0.0019479323,"about_ca_topic_score_gemma":0.0020846138,"teacher_disagreement_score":0.01095377,"about_ca_system_score_codex":0.0029266067,"about_ca_system_score_gemma":0.0020628693,"threshold_uncertainty_score":0.03664404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065100547,0.00007120211,0.9892811,0.0000836668,0.000029450948,0.000028022836,0.00010485383,0.0012976616,0.002594071],"genre_scores_gemma":[0.27340737,0.00032325383,0.7172491,0.0001330125,0.000055568926,0.00017019731,0.0006487948,0.00046610428,0.0075466423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997255,0.00007588396,0.000011758379,0.00003815729,0.0001200515,0.000028593648],"domain_scores_gemma":[0.99940276,0.00025627512,0.000047683214,0.00015253523,0.00011547898,0.000025307634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026875097,0.0006439445,0.00041696327,0.00066129334,0.00036198323,0.0008311583,0.0010305989,0.00067819626,0.0071062525],"category_scores_gemma":[0.0023429664,0.00037113077,0.00044223576,0.0010056616,0.00036038435,0.0014701057,0.000697533,0.00088169985,0.0025373707],"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.00020770876,0.0001527505,0.00061072735,0.0001700335,0.00005568573,0.00019807246,0.0001630233,0.4422633,0.014660623,0.17849465,0.012660113,0.35036328],"study_design_scores_gemma":[0.000015391674,0.000025877334,0.00007356022,0.000007878793,0.0000067667747,0.000041428004,0.00001767143,0.95777905,0.0032948244,0.035251338,0.0034740265,0.000012165439],"about_ca_topic_score_codex":0.004698816,"about_ca_topic_score_gemma":0.012378629,"teacher_disagreement_score":0.0071062525,"about_ca_system_score_codex":0.0003913051,"about_ca_system_score_gemma":0.0007316194,"threshold_uncertainty_score":0.023772776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5795985,0.0022988417,0.35981,0.004206001,0.00028249537,0.00011621726,0.000867633,0.00081570604,0.052004587],"genre_scores_gemma":[0.9792671,0.00060248235,0.013833328,0.00032592987,0.00033149633,0.00009079015,0.0004134408,0.00021325443,0.004922122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99616086,0.0014221692,0.0002782047,0.00082273525,0.00089089974,0.00042513415],"domain_scores_gemma":[0.9185444,0.0641503,0.0049061007,0.0078006224,0.0029266274,0.0016719736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004135311,0.00083916844,0.0016561546,0.002448655,0.0014674063,0.004067645,0.0020040877,0.0023800498,0.005492537],"category_scores_gemma":[0.03923209,0.00079682865,0.0016915335,0.001409206,0.0067410897,0.009893686,0.004224567,0.0034947214,0.00070882245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055765203,0.000036516944,0.0011980325,0.00016364321,0.00007454587,0.00027138184,0.00075990567,0.025339492,0.005819069,0.9510933,0.0012719686,0.013414425],"study_design_scores_gemma":[0.000028408254,0.00006317836,0.00039627755,0.000019567637,0.00002917202,0.00007847677,0.000103665334,0.030808691,0.0016596904,0.9656584,0.0011303952,0.000024042887],"about_ca_topic_score_codex":0.00079460844,"about_ca_topic_score_gemma":0.00033735283,"teacher_disagreement_score":0.005492537,"about_ca_system_score_codex":0.0014337117,"about_ca_system_score_gemma":0.0005777756,"threshold_uncertainty_score":0.021869898},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81620127,0.00051242276,0.1380117,0.000942211,0.00014490205,0.00011213127,0.00070264004,0.00018129795,0.043191496],"genre_scores_gemma":[0.95221895,0.0009975998,0.031841025,0.00020771848,0.000155251,0.00015263722,0.0011854538,0.00011512962,0.013126278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963045,0.00008831243,0.00001958569,0.00007307929,0.00009962212,0.000088921755],"domain_scores_gemma":[0.997914,0.00079438294,0.0004762681,0.00011406982,0.0002604638,0.00044085566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030230315,0.0005708718,0.0004805734,0.0016489577,0.0010947766,0.0026847483,0.0007487511,0.00078988104,0.004743074],"category_scores_gemma":[0.002437238,0.00060673314,0.00039709877,0.0012821124,0.0014191639,0.0019675132,0.0014344772,0.0018353132,0.00073195074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026818307,0.00007526981,0.0028434393,0.000090480076,0.000023587925,0.00028397777,0.0006948912,0.008613311,0.0063929535,0.9573633,0.002414997,0.02093555],"study_design_scores_gemma":[0.00006927845,0.000049793292,0.001767963,0.000035249413,0.000025945548,0.00022195524,0.00070949487,0.022265876,0.0019802381,0.9657389,0.0071139303,0.000021248074],"about_ca_topic_score_codex":0.0015317322,"about_ca_topic_score_gemma":0.0017468135,"teacher_disagreement_score":0.004743074,"about_ca_system_score_codex":0.0007540322,"about_ca_system_score_gemma":0.00048329408,"threshold_uncertainty_score":0.015867174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13085397,0.00091063336,0.86461484,0.00051568716,0.00004451487,0.000045535104,0.00030514153,0.0013623751,0.0013472852],"genre_scores_gemma":[0.45493194,0.0008442954,0.5411487,0.00007222312,0.00011241051,0.000073007315,0.0005473544,0.00037010893,0.0018998939],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996469,0.00006930574,0.000020474392,0.000090319685,0.00013149396,0.000041542],"domain_scores_gemma":[0.997767,0.0016595639,0.00013393398,0.0001490521,0.00018816182,0.000102347585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064486393,0.0008425897,0.0015549717,0.0015931346,0.00088360347,0.001469105,0.0014816865,0.0013728223,0.0018623165],"category_scores_gemma":[0.004883487,0.0008001553,0.0010331529,0.0027005712,0.0012077263,0.0017211108,0.0021673443,0.0012823096,0.0003072605],"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.0003562861,0.00008385189,0.0026219904,0.00023546041,0.000072984956,0.00034840152,0.00035386253,0.8276372,0.0079874955,0.026396848,0.0031267675,0.13077888],"study_design_scores_gemma":[0.000021980908,0.000022978704,0.00038237442,0.0000060810435,0.000009767299,0.00007002006,0.00004186443,0.98063755,0.00090059906,0.017142856,0.000755805,0.000008034453],"about_ca_topic_score_codex":0.008518476,"about_ca_topic_score_gemma":0.011573975,"teacher_disagreement_score":0.008518476,"about_ca_system_score_codex":0.0005818679,"about_ca_system_score_gemma":0.00055687415,"threshold_uncertainty_score":0.016937792},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038461278,0.00032411265,0.49769846,0.0015609332,0.0011235487,0.00029598927,0.012944014,0.060310766,0.4218961],"genre_scores_gemma":[0.08530461,0.0008047309,0.28462952,0.002048803,0.0006039461,0.00081859715,0.0208105,0.027889363,0.57708997],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991036,0.00018848902,0.00007821863,0.0001389827,0.00037175542,0.000118905744],"domain_scores_gemma":[0.99765426,0.000563239,0.000114639544,0.00077291933,0.0007726747,0.00012227279],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010212775,0.0011217822,0.0008449837,0.0012805632,0.00097326085,0.0032875375,0.0018892616,0.0011986655,0.40641245],"category_scores_gemma":[0.0045415675,0.0008958738,0.00092041004,0.0013057559,0.00066166057,0.0035497742,0.0018567478,0.0018512732,0.21120979],"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.00044234857,0.00010160912,0.00045622635,0.0006498275,0.00003612655,0.0002571412,0.0002924511,0.003306367,0.013053618,0.2563443,0.57181585,0.15324421],"study_design_scores_gemma":[0.00008219991,0.000059259477,0.0002886723,0.000083253304,0.00001950413,0.000306359,0.00004876114,0.010035846,0.014994502,0.07850721,0.895525,0.00004941847],"about_ca_topic_score_codex":0.0025390016,"about_ca_topic_score_gemma":0.005735794,"teacher_disagreement_score":0.40641245,"about_ca_system_score_codex":0.0013394366,"about_ca_system_score_gemma":0.0014494709,"threshold_uncertainty_score":0.8466806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1147588,0.0067680506,0.7775551,0.0065867626,0.00042738108,0.00024402782,0.0015137012,0.0009671075,0.09117917],"genre_scores_gemma":[0.79705435,0.0032484583,0.17510128,0.0016734767,0.00073151535,0.0004890886,0.0017356663,0.0008090229,0.019157095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974413,0.00080808875,0.00008729639,0.000519461,0.0006953443,0.00044856372],"domain_scores_gemma":[0.9719928,0.023047592,0.00086163025,0.0020782573,0.0010937379,0.0009260575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040063565,0.0009734886,0.0020561717,0.0024234266,0.0018236674,0.002720416,0.004074036,0.001469245,0.012881186],"category_scores_gemma":[0.031110244,0.00088999985,0.0016031098,0.003073001,0.0031000844,0.008914644,0.003504256,0.0059625157,0.0013447476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006740672,0.00033277727,0.0047598234,0.0006209685,0.00018035024,0.00017490517,0.00050390564,0.13892166,0.0035509616,0.72672534,0.0242372,0.09931807],"study_design_scores_gemma":[0.000049346516,0.00007895251,0.0012852115,0.000111358284,0.00008507568,0.000095419724,0.00006772521,0.27725184,0.0019467702,0.71447414,0.0045228964,0.000031287294],"about_ca_topic_score_codex":0.0027311174,"about_ca_topic_score_gemma":0.005266837,"teacher_disagreement_score":0.012881186,"about_ca_system_score_codex":0.002537039,"about_ca_system_score_gemma":0.001331937,"threshold_uncertainty_score":0.043091893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0824259,0.0008794393,0.86816895,0.0012159786,0.00016949727,0.00017274359,0.00076646724,0.00042599626,0.045775052],"genre_scores_gemma":[0.4822121,0.0016016056,0.43715003,0.0005002359,0.00015629377,0.0003225044,0.0017172233,0.0003957256,0.07594433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999564,0.0001426367,0.00002168148,0.000121469246,0.00009556004,0.000054617856],"domain_scores_gemma":[0.99852353,0.0007544761,0.00012325954,0.0002344766,0.00020949407,0.00015475553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053470995,0.00063002907,0.00072493526,0.0011009135,0.0005895931,0.0013169309,0.0014809408,0.001210254,0.013412194],"category_scores_gemma":[0.0044407714,0.0004025875,0.0005883536,0.0017843498,0.00053485396,0.0027461383,0.0013386473,0.0017066436,0.0016070114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003042771,0.00026130083,0.0009672397,0.00041051232,0.00009643223,0.00015452062,0.00013983305,0.10342709,0.0070012845,0.6009519,0.018281525,0.26800415],"study_design_scores_gemma":[0.000049409125,0.00011407766,0.00045365558,0.000055605808,0.000066662986,0.00020401752,0.000065646374,0.30250084,0.004359176,0.6740726,0.018040031,0.00001816669],"about_ca_topic_score_codex":0.00071228575,"about_ca_topic_score_gemma":0.0010254312,"teacher_disagreement_score":0.013412194,"about_ca_system_score_codex":0.000533933,"about_ca_system_score_gemma":0.0005439392,"threshold_uncertainty_score":0.04486829},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47488984,0.0025670938,0.455555,0.010804059,0.00023006738,0.0004459141,0.0024565165,0.0007434071,0.052308153],"genre_scores_gemma":[0.82358634,0.0017866429,0.15141343,0.0008100019,0.00063573045,0.00033813788,0.003072168,0.00040917107,0.017948447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971928,0.0006621417,0.000119453885,0.0006366956,0.000862093,0.0005268573],"domain_scores_gemma":[0.97254217,0.021194953,0.0019306522,0.0025875003,0.0007477992,0.0009969509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022227976,0.0010464191,0.0023976797,0.0020860943,0.0024927265,0.007764037,0.0043592146,0.0033528015,0.010714208],"category_scores_gemma":[0.026133904,0.0012124394,0.0024345857,0.005363136,0.0032088507,0.014711415,0.003854034,0.0048157526,0.00077494886],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013601568,0.0007124633,0.007613721,0.0008956363,0.00026996818,0.00035280103,0.0015502047,0.25922114,0.0038989296,0.6128908,0.02376616,0.08746807],"study_design_scores_gemma":[0.00013937888,0.00006396195,0.0013221018,0.00003631712,0.0000953441,0.0003442089,0.00037828443,0.38736457,0.0010684186,0.60577255,0.0033816756,0.000033125536],"about_ca_topic_score_codex":0.0063511576,"about_ca_topic_score_gemma":0.008452965,"teacher_disagreement_score":0.010714208,"about_ca_system_score_codex":0.0037544149,"about_ca_system_score_gemma":0.0027291153,"threshold_uncertainty_score":0.035842597},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88811374,0.00071365025,0.097662956,0.0008602299,0.00011152046,0.000043569038,0.00083687506,0.00021334665,0.011444215],"genre_scores_gemma":[0.9528783,0.0005924417,0.040363427,0.00016513932,0.00017438846,0.00009262752,0.0012666195,0.00017343878,0.004293533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900764,0.0002509668,0.00007339138,0.00026647132,0.00023396313,0.00016762022],"domain_scores_gemma":[0.98944944,0.0055587487,0.0013758743,0.00076221407,0.0010149508,0.0018387035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010526403,0.0010679755,0.0015790572,0.002476027,0.0016644432,0.0039419997,0.0023728036,0.0016426805,0.0045579458],"category_scores_gemma":[0.010558716,0.0009726704,0.00064508495,0.0021492592,0.0019228461,0.0048003057,0.002116375,0.0022016494,0.0007284318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020348446,0.00030322914,0.014923987,0.000656699,0.0001949361,0.00037102608,0.0012297323,0.047494214,0.02178438,0.8449599,0.007707884,0.058339264],"study_design_scores_gemma":[0.00010863578,0.0001714499,0.0045487015,0.000043188596,0.00006508646,0.0003118166,0.000545522,0.065653816,0.003972127,0.9214896,0.0030517883,0.000038131693],"about_ca_topic_score_codex":0.0008697154,"about_ca_topic_score_gemma":0.001610165,"teacher_disagreement_score":0.0045579458,"about_ca_system_score_codex":0.0014890912,"about_ca_system_score_gemma":0.0007012964,"threshold_uncertainty_score":0.015247822},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005282311,0.00019345057,0.98600453,0.00040241197,0.00015605208,0.00016552354,0.00019704098,0.001843363,0.0057554473],"genre_scores_gemma":[0.06757574,0.00016090415,0.92672366,0.00020364336,0.00007728833,0.00030491495,0.00045201308,0.0002425832,0.0042591793],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892527,0.00025845607,0.000051788422,0.00024558595,0.0003458548,0.00017307828],"domain_scores_gemma":[0.9983348,0.0009672653,0.00008689918,0.00026427477,0.00024392192,0.000102868515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001002554,0.0012799035,0.0011087202,0.0009213906,0.0011172428,0.001742238,0.0024291442,0.0018461355,0.012171455],"category_scores_gemma":[0.0045816386,0.00064155704,0.00090231205,0.001973144,0.00085777807,0.0019216192,0.0018551693,0.0024604448,0.0033247166],"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.0007905483,0.0007170731,0.0005225143,0.0004971937,0.00007951804,0.0001632837,0.00014813524,0.30027124,0.009629561,0.082039654,0.03231774,0.5728235],"study_design_scores_gemma":[0.0003929849,0.0001252302,0.00020604246,0.000022627275,0.00002815556,0.00012962369,0.0000457572,0.93432695,0.0025377916,0.054471485,0.007687465,0.000025790638],"about_ca_topic_score_codex":0.0049829837,"about_ca_topic_score_gemma":0.00710739,"teacher_disagreement_score":0.012171455,"about_ca_system_score_codex":0.0014494489,"about_ca_system_score_gemma":0.004344217,"threshold_uncertainty_score":0.040717542},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038384803,0.011376892,0.89083827,0.014495696,0.0012246378,0.0006273899,0.0018959091,0.0022903034,0.03886608],"genre_scores_gemma":[0.5336752,0.010584205,0.403898,0.006089756,0.0047886395,0.0030759084,0.0038396255,0.003062158,0.030986505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9765609,0.00843876,0.0009257957,0.0049454444,0.0053534005,0.0037757785],"domain_scores_gemma":[0.82137054,0.14745463,0.006743875,0.014082519,0.0053492724,0.0049991016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017706085,0.0066310633,0.007277538,0.0073538423,0.0068254774,0.015218419,0.018162103,0.007588569,0.021261165],"category_scores_gemma":[0.104061365,0.004220369,0.0055777854,0.0127066,0.012806707,0.03619957,0.015534202,0.022409663,0.0036809756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001815229,0.0012184825,0.002411175,0.0014518828,0.00043131548,0.00016161747,0.00084304484,0.26266348,0.0030351595,0.60813844,0.034846388,0.0829838],"study_design_scores_gemma":[0.00027621468,0.000098211065,0.00043691174,0.00013877772,0.00017274577,0.00011556211,0.00013061601,0.38441697,0.0013920363,0.6083468,0.0043940013,0.000081085316],"about_ca_topic_score_codex":0.006100632,"about_ca_topic_score_gemma":0.0112793865,"teacher_disagreement_score":0.021261165,"about_ca_system_score_codex":0.015662296,"about_ca_system_score_gemma":0.009683134,"threshold_uncertainty_score":0.11363846},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040588032,0.0071374057,0.936604,0.0030388928,0.00061918993,0.00005326967,0.00019384778,0.00010677659,0.011658469],"genre_scores_gemma":[0.77715075,0.015487267,0.17840034,0.0013474652,0.0041868594,0.00027638307,0.0006660536,0.0004339338,0.022050913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99531543,0.0021186979,0.0002828934,0.0007948687,0.00115014,0.00033805473],"domain_scores_gemma":[0.91495043,0.07397327,0.003640289,0.0017446077,0.0033885883,0.0023027644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012835356,0.00166351,0.0026437645,0.0046592653,0.0013023204,0.003185992,0.0050614174,0.0024750682,0.004847935],"category_scores_gemma":[0.059152465,0.00093248626,0.0019387023,0.004304762,0.0071161,0.010561516,0.005884407,0.0056453603,0.0005105131],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009044889,0.000037670925,0.0009045429,0.00014771258,0.00004359514,0.000085632026,0.00019043681,0.054283928,0.00053791224,0.9340323,0.0011094154,0.00853632],"study_design_scores_gemma":[0.000018018607,0.000050202943,0.0006136702,0.000049662085,0.000028148464,0.000119325996,0.00007619919,0.40029573,0.0003357084,0.59565026,0.0027228987,0.00004018277],"about_ca_topic_score_codex":0.0019599602,"about_ca_topic_score_gemma":0.0011595672,"teacher_disagreement_score":0.012835356,"about_ca_system_score_codex":0.0029177887,"about_ca_system_score_gemma":0.0016111908,"threshold_uncertainty_score":0.06788063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050897956,0.0040608714,0.8216376,0.004973788,0.00078306254,0.00021759259,0.0010551603,0.00071659224,0.11565744],"genre_scores_gemma":[0.6940046,0.004811223,0.25667715,0.0030196833,0.00264951,0.0010565177,0.002864802,0.0015396274,0.033376902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9907568,0.003089316,0.00036947677,0.001241701,0.0031691832,0.001373626],"domain_scores_gemma":[0.9643993,0.028337922,0.0011803479,0.0025034216,0.0025757304,0.0010033468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070991437,0.0023130355,0.0030371407,0.004111151,0.0020555465,0.010006591,0.0057120137,0.00333734,0.017484106],"category_scores_gemma":[0.03949549,0.0010021654,0.0023392832,0.004585396,0.0040158452,0.012882737,0.005243351,0.012173232,0.0024783034],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037824223,0.00033624045,0.000504944,0.00030692425,0.00007092336,0.00009383121,0.00029397252,0.045716133,0.0015010745,0.87874675,0.012622554,0.0594283],"study_design_scores_gemma":[0.000045014778,0.000077269535,0.0002727046,0.00007255023,0.00003436007,0.00005500587,0.00008738443,0.17884627,0.0010956116,0.8159595,0.0034223092,0.00003210579],"about_ca_topic_score_codex":0.0018981664,"about_ca_topic_score_gemma":0.001722859,"teacher_disagreement_score":0.017484106,"about_ca_system_score_codex":0.004650256,"about_ca_system_score_gemma":0.0024850634,"threshold_uncertainty_score":0.058490157},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02403299,0.00033891614,0.96221834,0.00020751906,0.00019092463,0.00009267427,0.00022991918,0.0020914956,0.010597268],"genre_scores_gemma":[0.32584232,0.00029989798,0.66048145,0.00021460642,0.00015762767,0.00025309928,0.001688783,0.0017745922,0.009287564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997324,0.0009942445,0.00010812227,0.00080151786,0.00053925614,0.00023285068],"domain_scores_gemma":[0.9968424,0.0009844017,0.00018854604,0.0015376643,0.00031511355,0.00013186254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016149736,0.0007528569,0.0015363371,0.0020063769,0.0015032236,0.0021806373,0.0025146527,0.0023284312,0.010183649],"category_scores_gemma":[0.006822152,0.0006758174,0.001106624,0.0032423725,0.0016525147,0.003264745,0.003127596,0.0025369592,0.0051369127],"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.00071559695,0.0002536461,0.0011147877,0.000309669,0.00015468727,0.00059933885,0.00071060116,0.123545475,0.031434596,0.29685956,0.015690094,0.52861196],"study_design_scores_gemma":[0.00013155966,0.00031024643,0.00056564255,0.00008077978,0.00010468465,0.0007891171,0.00029198843,0.51230985,0.03569646,0.40038264,0.04925225,0.00008486948],"about_ca_topic_score_codex":0.00050600705,"about_ca_topic_score_gemma":0.00059374014,"teacher_disagreement_score":0.010183649,"about_ca_system_score_codex":0.00065952446,"about_ca_system_score_gemma":0.0006918441,"threshold_uncertainty_score":0.03406775},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020940997,0.00036778307,0.58571017,0.0024391941,0.0008453479,0.00046809216,0.009024929,0.0060365745,0.37416694],"genre_scores_gemma":[0.31723505,0.0011303261,0.3594541,0.001495734,0.00031477114,0.0009314237,0.025396232,0.0132961115,0.28074622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990877,0.00019974595,0.00006566125,0.00021164927,0.00024746597,0.00018782425],"domain_scores_gemma":[0.997638,0.0008881374,0.00014799142,0.0005096881,0.00056542293,0.0002508786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797711,0.0009653314,0.00047434715,0.001774997,0.0025565433,0.0030358112,0.0018314543,0.0008650013,0.09406612],"category_scores_gemma":[0.0035831002,0.0009394833,0.0013012884,0.0020674858,0.0018257509,0.0044860803,0.0032376768,0.002754321,0.030368667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091454946,0.00004980853,0.00024473306,0.00020261048,0.0000146605325,0.00022102664,0.00066398614,0.0014472042,0.0034968443,0.8842522,0.08789167,0.02142368],"study_design_scores_gemma":[0.000053554944,0.000029471754,0.0004792069,0.00010769859,0.000038294624,0.00032813137,0.00044317494,0.0033031711,0.00860891,0.6121449,0.37439418,0.00006922987],"about_ca_topic_score_codex":0.003083028,"about_ca_topic_score_gemma":0.005880514,"teacher_disagreement_score":0.09406612,"about_ca_system_score_codex":0.002219203,"about_ca_system_score_gemma":0.0013973708,"threshold_uncertainty_score":0.31468248},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1040085,0.02352069,0.5265886,0.09034959,0.0061001214,0.00009707471,0.0011700846,0.002279101,0.24588619],"genre_scores_gemma":[0.82298857,0.0063317004,0.064726345,0.008156927,0.0037607125,0.0002011149,0.0011043602,0.0020708274,0.09065952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964491,0.0014225523,0.00019374173,0.0007252052,0.00082431483,0.00038507735],"domain_scores_gemma":[0.98723185,0.008639516,0.000535957,0.0019441368,0.0010701118,0.0005784078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002654954,0.0010055936,0.0017143094,0.0031264399,0.0038826356,0.00602006,0.0018956519,0.0033565164,0.019965129],"category_scores_gemma":[0.022817366,0.0012059256,0.0015629288,0.003639661,0.010356728,0.022944571,0.0065038996,0.006002213,0.002385646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020217221,0.000008736099,0.00024273383,0.000035246787,0.000008594836,0.000035983296,0.00042845236,0.0005132149,0.00007031024,0.9825226,0.0072951736,0.008818663],"study_design_scores_gemma":[0.0000044108588,0.0000024715741,0.0000392012,0.000013932145,0.000004943014,0.000029935056,0.0000969695,0.0008098367,0.000032666547,0.9918365,0.007124206,0.0000050051694],"about_ca_topic_score_codex":0.003007813,"about_ca_topic_score_gemma":0.0020303552,"teacher_disagreement_score":0.019965129,"about_ca_system_score_codex":0.0022086883,"about_ca_system_score_gemma":0.0009178878,"threshold_uncertainty_score":0.066790044},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058947958,0.0027849465,0.92362785,0.0012302534,0.000117680516,0.000111299465,0.00058355526,0.00053305115,0.012063437],"genre_scores_gemma":[0.39943814,0.0033611024,0.58083016,0.00042577815,0.00017695616,0.00019209362,0.0012511166,0.00026957103,0.014055077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999198,0.00024943418,0.000038031645,0.00022337587,0.00018780146,0.000103325045],"domain_scores_gemma":[0.99507916,0.0037756225,0.0004221999,0.00029448062,0.00019324744,0.00023527937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010917339,0.00085250207,0.001413702,0.0019266071,0.0009719761,0.0021970982,0.0023715554,0.0016514637,0.004931045],"category_scores_gemma":[0.009258871,0.00079794327,0.00072894216,0.004526046,0.0012937117,0.00553163,0.0018272322,0.0022228146,0.0005426578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054644234,0.0003581446,0.0023810433,0.0007761965,0.00012724432,0.00015369382,0.00021901137,0.34685096,0.0038545048,0.39289433,0.012726364,0.23911208],"study_design_scores_gemma":[0.00008479108,0.00008681309,0.00037001588,0.000064936714,0.000059873644,0.0002000926,0.000082095525,0.5504742,0.001834549,0.4411597,0.0055580093,0.000024913294],"about_ca_topic_score_codex":0.0039147492,"about_ca_topic_score_gemma":0.0056524635,"teacher_disagreement_score":0.004931045,"about_ca_system_score_codex":0.0015015897,"about_ca_system_score_gemma":0.0017553412,"threshold_uncertainty_score":0.016495943},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013374935,0.0060491697,0.5086396,0.005782696,0.0018916308,0.00008002037,0.00042770692,0.0009851211,0.46276915],"genre_scores_gemma":[0.5023147,0.0050405706,0.20762415,0.0024941366,0.0027840072,0.00035311974,0.00089591206,0.0011815128,0.2773119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988393,0.00043074467,0.000047507492,0.0002983513,0.0002923107,0.00009174416],"domain_scores_gemma":[0.9990996,0.00048812633,0.000034971992,0.00019741592,0.00010862179,0.0000712754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008179301,0.0011010965,0.000982709,0.0013673538,0.0019424342,0.0043775523,0.0008807284,0.0013639429,0.03287981],"category_scores_gemma":[0.0038917938,0.00044336062,0.0010433244,0.0013755457,0.0031252021,0.0073510716,0.0026485387,0.0041363286,0.0068465173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011720668,0.000010245611,0.000044759738,0.000039753984,0.000006772633,0.00001023889,0.00006559809,0.0004326376,0.000100498335,0.9783507,0.0042719943,0.01665494],"study_design_scores_gemma":[0.000006597345,0.0000056095428,0.000037236787,0.000015554819,0.0000047034528,0.000033701646,0.000014261658,0.0016470328,0.00015270767,0.97351336,0.024565253,0.0000040659365],"about_ca_topic_score_codex":0.00041670637,"about_ca_topic_score_gemma":0.0004276836,"teacher_disagreement_score":0.03287981,"about_ca_system_score_codex":0.0011954193,"about_ca_system_score_gemma":0.00058521435,"threshold_uncertainty_score":0.109993875},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03777791,0.00033123014,0.94233114,0.00017513726,0.00007734213,0.0001731667,0.0006244164,0.011586477,0.0069231023],"genre_scores_gemma":[0.13789314,0.00017281779,0.8529311,0.00010982662,0.000047236474,0.00020657125,0.002131248,0.000633878,0.0058741686],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995565,0.000049973216,0.00003753566,0.00013241298,0.0001386023,0.00008496191],"domain_scores_gemma":[0.99937683,0.00018542183,0.00003922669,0.00022426374,0.00011186682,0.000062438914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030157485,0.0009794305,0.0010747674,0.0017081496,0.0006962522,0.0014895819,0.0018029081,0.0009842686,0.017637273],"category_scores_gemma":[0.0016667935,0.00044128406,0.00077229645,0.0017140019,0.00045957702,0.002182706,0.0017455486,0.0010447352,0.004835544],"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.00034356126,0.00013474711,0.0007291074,0.0001406839,0.000026213756,0.000074906144,0.00010237792,0.010403557,0.023844285,0.007320208,0.008638451,0.94824183],"study_design_scores_gemma":[0.0004133493,0.00040471126,0.002673235,0.000094097595,0.00010229776,0.00067162095,0.00052852347,0.7926595,0.061979163,0.09043214,0.049903937,0.00013744495],"about_ca_topic_score_codex":0.0035454943,"about_ca_topic_score_gemma":0.0050229775,"teacher_disagreement_score":0.017637273,"about_ca_system_score_codex":0.0005930255,"about_ca_system_score_gemma":0.0009605881,"threshold_uncertainty_score":0.05900258},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08532731,0.0007399173,0.7458419,0.0023036674,0.0006075751,0.0000914188,0.0025798623,0.0024779588,0.16003034],"genre_scores_gemma":[0.62768275,0.0009894309,0.2580511,0.0011135542,0.00029942437,0.00013841908,0.0034613484,0.0018607532,0.106403165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993918,0.00012473027,0.00002702028,0.00017395208,0.00014378192,0.00013862718],"domain_scores_gemma":[0.9978225,0.00075730524,0.0001144393,0.0008090177,0.00033724649,0.00015956745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006759282,0.00057047856,0.00064401515,0.001082176,0.0017336814,0.0028196014,0.0009769906,0.0009843657,0.01828056],"category_scores_gemma":[0.003064926,0.00035194136,0.00088335853,0.0015646182,0.0016878487,0.0031418216,0.0016677426,0.0015736695,0.0027469741],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013097489,0.000027136153,0.0003595018,0.0001475213,0.000017134416,0.00007651174,0.00023438728,0.007939163,0.0061637484,0.915752,0.022925261,0.046226624],"study_design_scores_gemma":[0.000019866018,0.000023794226,0.00035612527,0.00002699455,0.000022611088,0.00013660676,0.00008136782,0.023593962,0.005332186,0.9280198,0.04236127,0.000025360507],"about_ca_topic_score_codex":0.004796587,"about_ca_topic_score_gemma":0.0075599994,"teacher_disagreement_score":0.01828056,"about_ca_system_score_codex":0.002164463,"about_ca_system_score_gemma":0.0011423749,"threshold_uncertainty_score":0.061154604},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5613036,0.0025067593,0.27302414,0.02427955,0.000636397,0.00022119509,0.002158215,0.0015377663,0.13433243],"genre_scores_gemma":[0.9497338,0.0012419703,0.023553941,0.0019417877,0.000923617,0.00032665653,0.0018209557,0.00024551002,0.020211766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983321,0.00052890484,0.00006763986,0.00031862216,0.00042868816,0.0003241083],"domain_scores_gemma":[0.9918665,0.006267178,0.00046188597,0.00042452294,0.00034283297,0.00063709205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017841825,0.00074253825,0.0019276079,0.0019335322,0.0029662608,0.0068230242,0.0027684618,0.0034237404,0.01645851],"category_scores_gemma":[0.0111714555,0.0006683472,0.0012201007,0.0025785263,0.003313372,0.013178423,0.0037248745,0.006233633,0.0014682371],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018172251,0.00017275,0.00047459957,0.00015058575,0.000024043497,0.00010657019,0.00036651114,0.004395302,0.0005137839,0.9755735,0.0083775,0.0096632205],"study_design_scores_gemma":[0.0000404015,0.000014336757,0.00011692736,0.000012702838,0.000009680735,0.00004488283,0.00008257231,0.015536163,0.00015693295,0.98337734,0.00059984165,0.000008214711],"about_ca_topic_score_codex":0.0010314909,"about_ca_topic_score_gemma":0.0010628343,"teacher_disagreement_score":0.01645851,"about_ca_system_score_codex":0.0027209232,"about_ca_system_score_gemma":0.0017111999,"threshold_uncertainty_score":0.055059195},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51747745,0.0034831194,0.35212925,0.030295182,0.0009650584,0.00036363848,0.0042805304,0.0015913079,0.08941438],"genre_scores_gemma":[0.91490316,0.0019435895,0.064511515,0.0016611842,0.0012183534,0.0003586603,0.0021437684,0.00064317405,0.012616605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99400455,0.002463973,0.00024071807,0.0008700631,0.0012996403,0.0011211178],"domain_scores_gemma":[0.90751487,0.08032705,0.0024034814,0.0059393398,0.0020864021,0.0017287984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004799743,0.0014921246,0.0024259537,0.001755489,0.0024877351,0.0068947263,0.0050584357,0.002675439,0.01610107],"category_scores_gemma":[0.04312851,0.0012405165,0.0022061004,0.004254775,0.0054323766,0.0194032,0.00554033,0.006588842,0.0014197599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025434208,0.00050935696,0.0043703336,0.0006344584,0.00018482412,0.00025034955,0.0007517964,0.19030736,0.0036038132,0.711483,0.028973194,0.05638813],"study_design_scores_gemma":[0.00016603143,0.000054335793,0.0007146496,0.000035684818,0.0000647072,0.00009102216,0.0001615199,0.2266714,0.0008609565,0.7691834,0.0019648902,0.00003133506],"about_ca_topic_score_codex":0.0051674005,"about_ca_topic_score_gemma":0.0059208195,"teacher_disagreement_score":0.01610107,"about_ca_system_score_codex":0.0049881707,"about_ca_system_score_gemma":0.0044252425,"threshold_uncertainty_score":0.053863406},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16239196,0.0013719292,0.7154276,0.004291732,0.00046760816,0.000813621,0.004059292,0.0101743275,0.10100197],"genre_scores_gemma":[0.48040086,0.000987647,0.4501435,0.0011025092,0.00026984097,0.00066885015,0.0061349515,0.0024036253,0.057888184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978199,0.00040659533,0.00010324298,0.00055352255,0.00055218174,0.00056463253],"domain_scores_gemma":[0.99551326,0.002288846,0.00038233094,0.0010290028,0.00039426962,0.00039226012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009922307,0.0013560782,0.0023873807,0.0015301824,0.0023277858,0.0048321746,0.0027487301,0.001752451,0.03451855],"category_scores_gemma":[0.006642195,0.0009953101,0.0017402844,0.004300643,0.0017087415,0.007858904,0.004050033,0.0032042754,0.004937278],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024732153,0.0008047511,0.0014006823,0.0015072883,0.00029169192,0.00029236212,0.0009246306,0.14333639,0.020114077,0.43009883,0.07009037,0.32866573],"study_design_scores_gemma":[0.00052051333,0.0002176176,0.0007932734,0.00007346069,0.00020099599,0.00026372858,0.00049064506,0.30198517,0.008785803,0.6650611,0.021550598,0.00005708883],"about_ca_topic_score_codex":0.006194681,"about_ca_topic_score_gemma":0.00949071,"teacher_disagreement_score":0.03451855,"about_ca_system_score_codex":0.0035054684,"about_ca_system_score_gemma":0.0025774215,"threshold_uncertainty_score":0.11547601},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15584634,0.00089369225,0.7525695,0.008136125,0.0005060968,0.0001265785,0.00057645363,0.00045153432,0.080893554],"genre_scores_gemma":[0.89536804,0.00060766557,0.07288618,0.0007367273,0.00054764433,0.000107605956,0.00046614977,0.00020280057,0.02907716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982827,0.0005393754,0.00010740703,0.00029965458,0.0005343943,0.00023645315],"domain_scores_gemma":[0.9957768,0.0023562175,0.00050057354,0.00056772796,0.00032697682,0.00047165333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018249031,0.0008150556,0.0013866383,0.0012696371,0.0019116037,0.0056346823,0.0017802947,0.0051801973,0.008204903],"category_scores_gemma":[0.012297149,0.00063143147,0.0014598242,0.0012887991,0.004191385,0.0054856394,0.0033280347,0.0040692315,0.00068225904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005093977,0.000026351527,0.00020494573,0.00005953645,0.000015779426,0.0003569347,0.00011996189,0.0066272696,0.00047647924,0.9877458,0.0016052607,0.0027107513],"study_design_scores_gemma":[0.000033505014,0.000010841984,0.00008069332,0.000012906966,0.000007462132,0.00036555965,0.00006863587,0.07259588,0.00043178038,0.9252004,0.0011789515,0.000013379818],"about_ca_topic_score_codex":0.0016991412,"about_ca_topic_score_gemma":0.0010867697,"teacher_disagreement_score":0.008204903,"about_ca_system_score_codex":0.00097456,"about_ca_system_score_gemma":0.0010648799,"threshold_uncertainty_score":0.027448177},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74664515,0.0003320049,0.15303321,0.0013361851,0.00014518994,0.0001656896,0.0025255773,0.00036340143,0.095453605],"genre_scores_gemma":[0.95627636,0.00022825696,0.022997895,0.00024489377,0.000057379933,0.00016022066,0.0022156732,0.00006948086,0.017749948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987914,0.00031633695,0.00005844785,0.0002827959,0.00019394838,0.00035712292],"domain_scores_gemma":[0.99200505,0.0041748374,0.0009154443,0.0004460458,0.00068245817,0.0017761801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095471035,0.0005648666,0.0011072747,0.0010347634,0.003383063,0.0041756225,0.00092998816,0.0011981769,0.020014172],"category_scores_gemma":[0.006335426,0.00070482364,0.0010329585,0.0015158729,0.0010772737,0.001949161,0.0017292202,0.0012709378,0.0016450235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010111516,0.00027427755,0.009701507,0.00033638036,0.00023585063,0.001362727,0.0010819278,0.012046256,0.0049055605,0.91715664,0.020086084,0.031801607],"study_design_scores_gemma":[0.0004724309,0.00026356804,0.006752105,0.00009547159,0.00013824242,0.001600795,0.0011144826,0.078494735,0.0032943604,0.887548,0.020137805,0.0000879595],"about_ca_topic_score_codex":0.0024217004,"about_ca_topic_score_gemma":0.0041955807,"teacher_disagreement_score":0.020014172,"about_ca_system_score_codex":0.000985748,"about_ca_system_score_gemma":0.0007993113,"threshold_uncertainty_score":0.06695408},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59039325,0.002686923,0.33623248,0.0024496592,0.00013729933,0.00056610623,0.00089809526,0.00061211636,0.066024005],"genre_scores_gemma":[0.91122836,0.0011723773,0.074107856,0.00039080714,0.00017180573,0.00034498842,0.00084522855,0.00027747868,0.011461037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979096,0.0007917633,0.00007162559,0.00023482573,0.00041517528,0.0005769993],"domain_scores_gemma":[0.9767379,0.018838806,0.0012115808,0.0010226986,0.001456109,0.0007327643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003055037,0.0011234954,0.0013761242,0.0035278325,0.00183132,0.0030929407,0.002654608,0.0013266028,0.008282519],"category_scores_gemma":[0.021591073,0.00079714385,0.0016107736,0.0034196232,0.0018177683,0.0033981754,0.0010963065,0.0020881293,0.00047511503],"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.0011221725,0.0007041327,0.005977359,0.0005569708,0.00027922174,0.00028460252,0.00076769036,0.57281995,0.0064806594,0.31056842,0.014869894,0.08556894],"study_design_scores_gemma":[0.00009978666,0.00014823033,0.0014344183,0.000046745165,0.00010954781,0.00010204553,0.00015758465,0.8879444,0.001220413,0.10643725,0.0022683502,0.00003120862],"about_ca_topic_score_codex":0.007387179,"about_ca_topic_score_gemma":0.0066584116,"teacher_disagreement_score":0.008282519,"about_ca_system_score_codex":0.004052615,"about_ca_system_score_gemma":0.0034197564,"threshold_uncertainty_score":0.029403865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061540633,0.005143885,0.91033375,0.0019056932,0.00046337256,0.00007720627,0.00022672543,0.0008630409,0.019445729],"genre_scores_gemma":[0.77614695,0.005132097,0.17646684,0.00076369016,0.00084343104,0.00020950288,0.00039619269,0.00024820594,0.039793096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953103,0.00011801659,0.00001976126,0.00004551286,0.00022437879,0.000061361236],"domain_scores_gemma":[0.9986583,0.0007345852,0.00012189181,0.00020431752,0.00023079242,0.00004998229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042464267,0.00047680555,0.0003965544,0.0007808376,0.0003434306,0.0008642158,0.00036534786,0.0009887377,0.0039658304],"category_scores_gemma":[0.0023276352,0.00023752429,0.0002165552,0.001036331,0.0010665877,0.00088279013,0.0012585123,0.0014705474,0.0013008162],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034431924,0.00009559175,0.00049279566,0.00044632988,0.000032449254,0.00022278822,0.00028264604,0.06686173,0.048607823,0.62284374,0.008389114,0.2513807],"study_design_scores_gemma":[0.000078391546,0.0002488868,0.00068459567,0.00019245443,0.000038890877,0.00066121144,0.00008208738,0.44975665,0.060937803,0.45964986,0.027577883,0.00009133593],"about_ca_topic_score_codex":0.0005987898,"about_ca_topic_score_gemma":0.0006139533,"teacher_disagreement_score":0.0039658304,"about_ca_system_score_codex":0.000722532,"about_ca_system_score_gemma":0.00054510386,"threshold_uncertainty_score":0.013266981},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005038044,0.00039673867,0.3293309,0.013674327,0.0012286344,0.00035337283,0.049355183,0.008042457,0.5925803],"genre_scores_gemma":[0.096223645,0.0016585394,0.19657731,0.0026513676,0.00084234774,0.00084519316,0.046450883,0.008944766,0.6458059],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996809,0.000080209014,0.000026492993,0.00006130223,0.00011283616,0.000038308903],"domain_scores_gemma":[0.999074,0.00037515428,0.000061057945,0.00017895068,0.00023927983,0.00007157129],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005940636,0.0005636799,0.0005210834,0.00095241406,0.00070371554,0.0025388338,0.0016532968,0.0012328435,0.3364688],"category_scores_gemma":[0.0032604437,0.00037441208,0.0005856937,0.0024662532,0.00044522036,0.00343263,0.000965605,0.0014147607,0.11464201],"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.000054541553,0.000046818284,0.00017235425,0.00017585672,0.00000571635,0.00007668594,0.0001240486,0.001591169,0.0010114429,0.3260766,0.62029135,0.050373446],"study_design_scores_gemma":[0.00006370045,0.000020551453,0.00061119464,0.00004955355,0.000006825303,0.00016433316,0.000085238826,0.017900722,0.0028454664,0.24025396,0.73795515,0.00004323411],"about_ca_topic_score_codex":0.008566381,"about_ca_topic_score_gemma":0.008200598,"teacher_disagreement_score":0.3364688,"about_ca_system_score_codex":0.0016045535,"about_ca_system_score_gemma":0.001239254,"threshold_uncertainty_score":0.9464468},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20637193,0.0022630827,0.15364996,0.0037885448,0.0010808199,0.0001354151,0.0010621564,0.00046446227,0.6311837],"genre_scores_gemma":[0.77544254,0.0009040134,0.036768675,0.0003355265,0.00024598895,0.00008513239,0.0005626368,0.00033535596,0.18532012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993338,0.00008870651,0.000022569553,0.000178027,0.00026338626,0.00011347446],"domain_scores_gemma":[0.99949837,0.00010086303,0.0000721332,0.000085029445,0.000117054165,0.0001266139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034623727,0.00053440547,0.0005978337,0.001903694,0.0027171993,0.0047447835,0.00148176,0.0016796595,0.024440376],"category_scores_gemma":[0.0020900527,0.00060598593,0.0005942151,0.0011764226,0.004378847,0.0030199944,0.0031222547,0.0028163653,0.0031510976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055351382,0.0000061908986,0.00014000447,0.000025890346,0.0000038900184,0.00015968867,0.00024021082,0.0020600492,0.00067913067,0.9848453,0.0037682,0.008016059],"study_design_scores_gemma":[0.00004250959,0.000068686175,0.0009389859,0.0000524492,0.000015969701,0.0013160496,0.0011510848,0.008872824,0.0022151489,0.885086,0.10018283,0.000057444315],"about_ca_topic_score_codex":0.004818701,"about_ca_topic_score_gemma":0.0045375116,"teacher_disagreement_score":0.024440376,"about_ca_system_score_codex":0.00152073,"about_ca_system_score_gemma":0.0010373994,"threshold_uncertainty_score":0.08176118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20557067,0.008205138,0.6299435,0.008927309,0.0009825089,0.00031762465,0.0038724672,0.0008626542,0.1413182],"genre_scores_gemma":[0.471861,0.011475624,0.40714663,0.0017055447,0.00078619755,0.00039871476,0.005537378,0.0007051311,0.10038377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993673,0.00016735499,0.00003137264,0.00013954777,0.00018999375,0.000104424296],"domain_scores_gemma":[0.9966274,0.0018470208,0.00029064156,0.0003923577,0.00047505315,0.00036748333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070232234,0.0010480004,0.0014702484,0.0019012005,0.0023134153,0.0050696987,0.0021525698,0.0016611993,0.012193909],"category_scores_gemma":[0.005318664,0.00093604863,0.00075094023,0.006290197,0.0023369351,0.0068026013,0.0018011291,0.004796107,0.0014902786],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084987165,0.00008369295,0.0004609715,0.0001763876,0.000012173553,0.000049610695,0.0002132449,0.006850646,0.0005919582,0.9303498,0.01376613,0.04736031],"study_design_scores_gemma":[0.000020996735,0.000014179299,0.0002190549,0.00003087577,0.00000866026,0.00008000077,0.000116851115,0.015882798,0.00033729157,0.9751609,0.008118005,0.000010320107],"about_ca_topic_score_codex":0.007030472,"about_ca_topic_score_gemma":0.011551876,"teacher_disagreement_score":0.012193909,"about_ca_system_score_codex":0.0030147186,"about_ca_system_score_gemma":0.0024822543,"threshold_uncertainty_score":0.040792704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0319482,0.00087229226,0.9558251,0.00093581685,0.000091847345,0.00007830068,0.00017280044,0.00015439795,0.00992109],"genre_scores_gemma":[0.5493489,0.00091873494,0.4299784,0.0003074392,0.00022988698,0.0004986591,0.00066159514,0.00029399962,0.017762456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993006,0.0004329047,0.00001190132,0.0001107178,0.0000863582,0.000057453883],"domain_scores_gemma":[0.9967614,0.0027009526,0.000121398356,0.0001266665,0.0001787477,0.00011082197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559339,0.00055922725,0.0016180228,0.0011443229,0.0008814512,0.0010571047,0.0017821608,0.0014055428,0.005633037],"category_scores_gemma":[0.008554674,0.00068170205,0.0007455539,0.0014020656,0.0012020315,0.0021569743,0.0015808986,0.0014809424,0.00046121835],"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.00020520097,0.000099504454,0.0005608365,0.0001828752,0.00007729354,0.000049544342,0.00013139338,0.7015879,0.00064075453,0.23852973,0.008691085,0.04924399],"study_design_scores_gemma":[0.000028492417,0.000014314295,0.00008134488,0.000011468748,0.000006614657,0.000008704983,0.0000139603735,0.9223863,0.00007994944,0.0763284,0.0010361517,0.0000043241407],"about_ca_topic_score_codex":0.004571136,"about_ca_topic_score_gemma":0.005538494,"teacher_disagreement_score":0.005633037,"about_ca_system_score_codex":0.0012433414,"about_ca_system_score_gemma":0.0011448,"threshold_uncertainty_score":0.018844366},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35735694,0.0013276696,0.58155775,0.0014463956,0.00017866214,0.00010615761,0.0008108787,0.00044851433,0.056767106],"genre_scores_gemma":[0.8564095,0.0025217426,0.11686175,0.00033834775,0.00030726608,0.00010148623,0.0016523859,0.0006956625,0.021111766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959475,0.000099632154,0.000015659434,0.00009467898,0.00012652518,0.00006873855],"domain_scores_gemma":[0.99698275,0.0017631403,0.00045362182,0.00024319699,0.00029621963,0.0002610218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036637872,0.0007913965,0.0009344919,0.0019675123,0.0010629416,0.0020418796,0.0011818109,0.0010086591,0.007098928],"category_scores_gemma":[0.00438782,0.0007078524,0.0006328102,0.0014884094,0.00227455,0.0031760866,0.0018897043,0.0022157107,0.0009547049],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002086219,0.0000694602,0.0013914355,0.0001742787,0.000027699905,0.00042426554,0.00068158115,0.02887116,0.0056215785,0.903268,0.006360437,0.052901592],"study_design_scores_gemma":[0.000031395237,0.000044384466,0.0012550919,0.000046227608,0.00002117421,0.00028031258,0.0002994799,0.08539784,0.0018162756,0.90359557,0.007191755,0.000020498475],"about_ca_topic_score_codex":0.0025039,"about_ca_topic_score_gemma":0.0019848524,"teacher_disagreement_score":0.007098928,"about_ca_system_score_codex":0.0005991631,"about_ca_system_score_gemma":0.00037068632,"threshold_uncertainty_score":0.023748338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6264222,0.00065169623,0.30737948,0.004065526,0.0001476916,0.000432753,0.001327803,0.00033849917,0.059234243],"genre_scores_gemma":[0.9814554,0.0002736794,0.01512971,0.00017457428,0.000103429484,0.00018002228,0.00033238097,0.000047989302,0.0023028944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927429,0.0020923032,0.000630523,0.0009970103,0.0023291751,0.0012081079],"domain_scores_gemma":[0.9230819,0.049157545,0.00843734,0.0118259685,0.0044401297,0.0030571474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069922647,0.0006418218,0.0018608784,0.0014939117,0.002162176,0.0061974404,0.003139978,0.0023985044,0.006724416],"category_scores_gemma":[0.049464736,0.00074464217,0.0008595495,0.0028426475,0.0036487454,0.009682883,0.0032415034,0.004156305,0.00062356214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049820443,0.00016944605,0.0013132826,0.00013003952,0.000035266134,0.00023057414,0.00033401948,0.0248652,0.005144861,0.9553922,0.0014366987,0.0104501415],"study_design_scores_gemma":[0.00017021324,0.00015473724,0.0005362995,0.000048356447,0.0000329128,0.0004952066,0.00017950656,0.14243256,0.0052606096,0.84784746,0.0027954134,0.000046642388],"about_ca_topic_score_codex":0.00056596793,"about_ca_topic_score_gemma":0.00035099348,"teacher_disagreement_score":0.0069922647,"about_ca_system_score_codex":0.002166402,"about_ca_system_score_gemma":0.0023585442,"threshold_uncertainty_score":0.03697908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30922624,0.0012226017,0.3910204,0.0058639543,0.0005934757,0.0003533649,0.0032917198,0.0013112219,0.28711694],"genre_scores_gemma":[0.8451319,0.0010077846,0.051906057,0.0014522192,0.0003266714,0.00039746505,0.0022054645,0.00035050552,0.09722199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999358,0.00015902062,0.00002771604,0.00016929288,0.00012928752,0.00015668818],"domain_scores_gemma":[0.99661344,0.0015325164,0.00032550414,0.0005413655,0.0004721203,0.00051505014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235186,0.00053823105,0.00074526976,0.0012992728,0.0017356534,0.0017808973,0.0014996993,0.0012762302,0.019647554],"category_scores_gemma":[0.003577592,0.00047814412,0.000488663,0.0011694601,0.0014622672,0.0022066578,0.0022869774,0.0026114003,0.0023330895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013910342,0.000025870544,0.0002183228,0.00006962309,0.000010241746,0.00010299394,0.00014514933,0.0040546027,0.0021833219,0.9772321,0.0063838763,0.009434833],"study_design_scores_gemma":[0.000070572554,0.00003358482,0.00033759302,0.000031445124,0.00002504441,0.0002642379,0.00022928222,0.029562688,0.0021395772,0.94889003,0.018399315,0.000016656402],"about_ca_topic_score_codex":0.0020544357,"about_ca_topic_score_gemma":0.0025402035,"teacher_disagreement_score":0.019647554,"about_ca_system_score_codex":0.0015569319,"about_ca_system_score_gemma":0.0007875909,"threshold_uncertainty_score":0.06572765},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17376067,0.0007799868,0.8040464,0.0005084252,0.0005385349,0.00011148097,0.00014124686,0.0018595619,0.018253636],"genre_scores_gemma":[0.7747161,0.000611989,0.1958412,0.00016784001,0.00010183506,0.00015207482,0.0002157535,0.00055109797,0.027642107],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995844,0.000045143126,0.000022008768,0.0001320734,0.0001448719,0.000071489674],"domain_scores_gemma":[0.99914,0.00016056359,0.00006224317,0.00040395817,0.00013606079,0.0000971426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040498114,0.00051172887,0.0014595885,0.00078906625,0.0016797506,0.0014131792,0.0011647396,0.0009724873,0.009882257],"category_scores_gemma":[0.001816434,0.00067659974,0.0008235811,0.0008112771,0.0008888973,0.0021279522,0.0025737542,0.0011935227,0.0014491051],"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.0012424041,0.00035945338,0.002632197,0.00048030913,0.00021559316,0.0009113484,0.00086507027,0.2852305,0.3102081,0.13443214,0.008836975,0.25458586],"study_design_scores_gemma":[0.000099439894,0.00031788374,0.0011669875,0.000048399677,0.00006358336,0.00036196123,0.00028568992,0.7986337,0.07418742,0.10073442,0.024038667,0.00006183084],"about_ca_topic_score_codex":0.0011806812,"about_ca_topic_score_gemma":0.0014877185,"teacher_disagreement_score":0.009882257,"about_ca_system_score_codex":0.00064894755,"about_ca_system_score_gemma":0.0005076617,"threshold_uncertainty_score":0.033059478},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07687211,0.004884921,0.7864501,0.014884129,0.0017465961,0.00017137705,0.0008254979,0.0008387207,0.11332653],"genre_scores_gemma":[0.82376856,0.010170979,0.11978596,0.004352084,0.0050905533,0.00048243962,0.000560782,0.0005121926,0.035276484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977169,0.0008298063,0.000090747024,0.00046903064,0.00050635386,0.0003872056],"domain_scores_gemma":[0.98401296,0.012299281,0.0007117181,0.0015630772,0.0008423348,0.0005706482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022867825,0.0007135872,0.0015038464,0.0013590346,0.0022067472,0.0035297542,0.0024622784,0.0024318392,0.008896643],"category_scores_gemma":[0.01760203,0.0006373315,0.0012433123,0.0031265304,0.0037325998,0.01041278,0.003455712,0.00553427,0.00113117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027571124,0.0000420938,0.00039718172,0.00016506751,0.000032283733,0.0001295688,0.00037601613,0.013598578,0.0015853487,0.9464137,0.012308378,0.024676181],"study_design_scores_gemma":[0.00006397232,0.0000677752,0.00022473076,0.000052135114,0.000053055606,0.00017540029,0.00017219716,0.056939907,0.0011834186,0.9281248,0.012902052,0.00004051669],"about_ca_topic_score_codex":0.0029207948,"about_ca_topic_score_gemma":0.0019594165,"teacher_disagreement_score":0.008896643,"about_ca_system_score_codex":0.002760338,"about_ca_system_score_gemma":0.001256706,"threshold_uncertainty_score":0.029762268},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16387303,0.0010399477,0.82161665,0.0010309827,0.00011773805,0.00021666786,0.00046241167,0.00034633777,0.011296312],"genre_scores_gemma":[0.7470875,0.0015081522,0.23431516,0.00031530557,0.00022953037,0.0007788994,0.0005119955,0.00061031256,0.014643171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997595,0.00089068187,0.00009206687,0.00030336948,0.0005918439,0.00052705564],"domain_scores_gemma":[0.97888446,0.015867904,0.0018779277,0.00064278767,0.0016957786,0.001031162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010664745,0.003143943,0.0032339767,0.0050116084,0.001541747,0.003876085,0.002997736,0.0027206477,0.005656684],"category_scores_gemma":[0.031324808,0.002027174,0.0029284747,0.0034211446,0.00349717,0.0037575336,0.00252191,0.004111175,0.0007144671],"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.000294076,0.00011964647,0.00047588383,0.00017692824,0.00009792016,0.00007000782,0.00019796005,0.8929289,0.0015925411,0.09339472,0.0013679657,0.009283506],"study_design_scores_gemma":[0.000055718687,0.00009064025,0.00045404703,0.000047133137,0.00003981754,0.00002588043,0.000076388125,0.89822185,0.00082168105,0.099787235,0.00034339225,0.00003616919],"about_ca_topic_score_codex":0.00582087,"about_ca_topic_score_gemma":0.0051340065,"teacher_disagreement_score":0.010664745,"about_ca_system_score_codex":0.0054253684,"about_ca_system_score_gemma":0.0041561904,"threshold_uncertainty_score":0.056401253},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2912195,0.0040536695,0.61961555,0.008271685,0.00045834537,0.00012737603,0.00088549906,0.0004908183,0.07487758],"genre_scores_gemma":[0.89041793,0.0037451237,0.084502846,0.0012270433,0.00077025656,0.0002452006,0.0007490086,0.00064679823,0.017695677],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99702966,0.0011689635,0.00013804731,0.00086163636,0.0005018141,0.00029987816],"domain_scores_gemma":[0.95204234,0.036213655,0.0026251704,0.004571195,0.0023574878,0.0021901773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047972724,0.001071666,0.0020673384,0.003896555,0.0023323337,0.004832521,0.0037627926,0.0036599475,0.009714942],"category_scores_gemma":[0.047745716,0.0014320443,0.0012247966,0.0037975805,0.009646987,0.021822143,0.005669056,0.010385736,0.0009154572],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008238413,0.000027107671,0.00074804726,0.00005399592,0.000012597034,0.00008917734,0.00037846318,0.004074433,0.0004664451,0.9864851,0.0010240563,0.0065580965],"study_design_scores_gemma":[0.000018538341,0.000021403777,0.00037725136,0.00002603105,0.000009808226,0.0000925607,0.00011456667,0.015235038,0.00023678553,0.9819016,0.0019521754,0.0000142315],"about_ca_topic_score_codex":0.0016479966,"about_ca_topic_score_gemma":0.0009148219,"teacher_disagreement_score":0.009714942,"about_ca_system_score_codex":0.0022780232,"about_ca_system_score_gemma":0.00093147974,"threshold_uncertainty_score":0.03249967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26027992,0.003266949,0.5446147,0.024210675,0.0018146989,0.0006347306,0.0077480227,0.0022412862,0.15518907],"genre_scores_gemma":[0.837886,0.003014152,0.11616235,0.003952953,0.002064121,0.00064088084,0.007938711,0.00094782736,0.027393043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99704236,0.0006553611,0.00015309814,0.0009241716,0.0007032554,0.000521758],"domain_scores_gemma":[0.9826738,0.012973223,0.0008130976,0.002077284,0.0006591859,0.0008033366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018025596,0.0018063509,0.0025137318,0.0011502069,0.0026064608,0.004526955,0.00554908,0.0035307053,0.020356815],"category_scores_gemma":[0.014134621,0.0010435088,0.002676009,0.0029079863,0.0032210187,0.016691128,0.005107971,0.008732852,0.002253885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002035227,0.00087968714,0.0022108871,0.0020648495,0.00032910908,0.0010961524,0.0008872929,0.070951596,0.0069564665,0.74970925,0.07619767,0.08668176],"study_design_scores_gemma":[0.00027551423,0.00010805253,0.0005503271,0.00007540635,0.00008787826,0.00041151338,0.00022367002,0.055935334,0.001809618,0.9325645,0.007918478,0.00003969318],"about_ca_topic_score_codex":0.0014016351,"about_ca_topic_score_gemma":0.0013160068,"teacher_disagreement_score":0.020356815,"about_ca_system_score_codex":0.0015452935,"about_ca_system_score_gemma":0.0019135781,"threshold_uncertainty_score":0.06810027},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016413346,0.00022338268,0.9687081,0.00040791108,0.00024950528,0.00009232656,0.00006160478,0.0005984976,0.013245421],"genre_scores_gemma":[0.7969197,0.00031028336,0.1937077,0.00033627806,0.00011902126,0.0001868794,0.00008896437,0.000120993966,0.008210079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966335,0.00011233064,0.000018148394,0.00007646606,0.00009159543,0.000038118036],"domain_scores_gemma":[0.9989172,0.0003410705,0.00013500352,0.00022621409,0.00033336313,0.000047131573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066127756,0.00046816983,0.00032803247,0.00038827775,0.0004087499,0.0008995055,0.0010748903,0.0005001108,0.0068782736],"category_scores_gemma":[0.0030273844,0.0002654823,0.00022049449,0.00035299783,0.00039059494,0.0014081789,0.00060680055,0.00064704544,0.0006964951],"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.00033136184,0.0003532486,0.0008449799,0.00045896333,0.00008349026,0.00019793824,0.0001778135,0.5440505,0.07708063,0.17721711,0.011599382,0.18760462],"study_design_scores_gemma":[0.00008120158,0.0002176979,0.00031595663,0.000040721756,0.00007089934,0.00017967401,0.00004190228,0.91433686,0.022661155,0.042528618,0.019504901,0.000020419866],"about_ca_topic_score_codex":0.00050618534,"about_ca_topic_score_gemma":0.0017535014,"teacher_disagreement_score":0.0068782736,"about_ca_system_score_codex":0.00058380293,"about_ca_system_score_gemma":0.0006435561,"threshold_uncertainty_score":0.023010135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12976234,0.0009969901,0.81563914,0.017622944,0.00039335774,0.0002441196,0.0010799007,0.0007127015,0.033548564],"genre_scores_gemma":[0.5138327,0.002460679,0.44726625,0.0028211502,0.0010575086,0.00052926765,0.0037454735,0.0009875399,0.027299453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99732804,0.001277845,0.00013649899,0.0006547688,0.00035053116,0.00025239412],"domain_scores_gemma":[0.96572435,0.029465294,0.0010480302,0.0018737216,0.00089557073,0.0009929774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031963396,0.0016527498,0.002359069,0.0021259421,0.0031148824,0.0045909556,0.0035801325,0.005847737,0.011244593],"category_scores_gemma":[0.023244968,0.0015363371,0.0022881213,0.0044844127,0.004792865,0.019745585,0.0040248055,0.0064560254,0.0010282829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000259569,0.00029734173,0.0011378778,0.00041155235,0.000060800965,0.00021499068,0.0006884762,0.033807784,0.001083622,0.8958797,0.017307779,0.048850477],"study_design_scores_gemma":[0.00006057035,0.00003294783,0.00019939525,0.00006621458,0.00003431503,0.0000871518,0.0001650178,0.05638936,0.00045007537,0.9392503,0.0032489812,0.000015676203],"about_ca_topic_score_codex":0.0035724654,"about_ca_topic_score_gemma":0.002606462,"teacher_disagreement_score":0.011244593,"about_ca_system_score_codex":0.0028365895,"about_ca_system_score_gemma":0.0017049043,"threshold_uncertainty_score":0.03761691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040855454,0.0003469022,0.34054607,0.004505695,0.0021820734,0.00032804633,0.055967957,0.066569,0.5254687],"genre_scores_gemma":[0.061713103,0.0014768586,0.23599851,0.0019423921,0.0010117503,0.0006902493,0.11097966,0.07437615,0.5118113],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995128,0.00008529755,0.000040708772,0.00008449891,0.00021262481,0.00006410865],"domain_scores_gemma":[0.99863476,0.0003194719,0.000056137687,0.0004180866,0.00041471672,0.00015670368],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007007025,0.0007999113,0.00064115116,0.0015305191,0.0010735722,0.0033899026,0.0018719202,0.0009500445,0.34730577],"category_scores_gemma":[0.0027327414,0.0007446042,0.0008624771,0.0023839648,0.0007296299,0.004084096,0.002179264,0.002749376,0.24410418],"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.00011374847,0.00005743453,0.0002449499,0.00026254612,0.0000095545265,0.00009132661,0.0002232786,0.0005509305,0.004858007,0.13742518,0.79228604,0.06387708],"study_design_scores_gemma":[0.00003492808,0.000015350639,0.0003484266,0.00003835858,0.000006597513,0.00014414851,0.000060248643,0.0021854443,0.0054701804,0.04081957,0.9508429,0.00003376614],"about_ca_topic_score_codex":0.0037450239,"about_ca_topic_score_gemma":0.0048725614,"teacher_disagreement_score":0.34730577,"about_ca_system_score_codex":0.0015815814,"about_ca_system_score_gemma":0.0013775082,"threshold_uncertainty_score":0.9309891},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7140805,0.0018781207,0.0508516,0.0028922725,0.00066749135,0.00012772957,0.00045256648,0.00059205637,0.22845769],"genre_scores_gemma":[0.9801893,0.00047742116,0.0038470991,0.00015689644,0.00014868788,0.00007410154,0.00015794675,0.00009405903,0.014854517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997249,0.000059337453,0.000011590105,0.000041711064,0.000057757472,0.000104647326],"domain_scores_gemma":[0.9992355,0.00019414327,0.00012718768,0.000105046034,0.00008366395,0.00025443177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030573373,0.00044797428,0.0010231214,0.0015168706,0.0024835167,0.0028073394,0.0009634004,0.0013319794,0.0113132205],"category_scores_gemma":[0.001640223,0.0004374009,0.00068806496,0.00081269373,0.002513452,0.0020908497,0.0016595513,0.0014480981,0.0011192429],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006354401,0.000017209064,0.00013629008,0.00004164906,0.00000923701,0.00010715022,0.0002141896,0.0076187323,0.00086956343,0.9858132,0.0021947734,0.0029144497],"study_design_scores_gemma":[0.000053808617,0.000035850284,0.0003523028,0.000021739153,0.000009971664,0.00011701102,0.00029089107,0.03197544,0.00031015734,0.9620973,0.004714733,0.000020727095],"about_ca_topic_score_codex":0.0021404924,"about_ca_topic_score_gemma":0.0021136075,"teacher_disagreement_score":0.0113132205,"about_ca_system_score_codex":0.0014759923,"about_ca_system_score_gemma":0.0006292615,"threshold_uncertainty_score":0.037846506},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75246716,0.002712419,0.13546361,0.002686076,0.00037009318,0.00007404069,0.00073563674,0.00024987094,0.10524109],"genre_scores_gemma":[0.9789697,0.0011878842,0.011876883,0.0002753512,0.00047391347,0.000060287257,0.00024371322,0.00011977267,0.0067925155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991961,0.00024974527,0.000028687786,0.00016096955,0.0002132543,0.00015124778],"domain_scores_gemma":[0.9888287,0.0072350004,0.0012557525,0.00074890355,0.0007980184,0.0011335635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016157243,0.0007157414,0.00086744566,0.0040370594,0.0017966195,0.0030911816,0.0013779661,0.0009682246,0.00619059],"category_scores_gemma":[0.009005841,0.00067109236,0.00042188304,0.0034290093,0.0033059241,0.005175046,0.0023225183,0.0022789834,0.00049282575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023855096,0.000038680508,0.0018286387,0.00009568889,0.000027266027,0.00007197213,0.00035556825,0.013253522,0.0038740404,0.9663118,0.0032681609,0.010635964],"study_design_scores_gemma":[0.000033393433,0.00005207171,0.0016483109,0.000052630225,0.000030667303,0.000110583394,0.00016340578,0.053089764,0.0013576511,0.9395821,0.0038456598,0.000033793123],"about_ca_topic_score_codex":0.0018255719,"about_ca_topic_score_gemma":0.0023996045,"teacher_disagreement_score":0.00619059,"about_ca_system_score_codex":0.002694392,"about_ca_system_score_gemma":0.00081382436,"threshold_uncertainty_score":0.020709634},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7490939,0.002238124,0.13031153,0.0027975738,0.00030395552,0.00009489719,0.0006990217,0.0004985538,0.1139624],"genre_scores_gemma":[0.9487356,0.0011920838,0.025728932,0.00046005298,0.00038449132,0.0001500278,0.0008286496,0.00019031786,0.022329822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991179,0.00030641627,0.000057855057,0.00015643061,0.00025494854,0.00010639985],"domain_scores_gemma":[0.9951047,0.0028370728,0.0006417054,0.0005284368,0.00025114,0.0006370251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076354586,0.00062989513,0.0013901342,0.0026600144,0.0019261148,0.003517343,0.0014659809,0.0017228248,0.010593104],"category_scores_gemma":[0.006562344,0.0012336927,0.0009256966,0.002836917,0.0029156986,0.0060005174,0.0029314682,0.0029129288,0.0011250023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013305299,0.00006319827,0.0005886456,0.00011793735,0.000022120457,0.0001969857,0.0004427147,0.006511579,0.0012837305,0.97614384,0.003447657,0.011048606],"study_design_scores_gemma":[0.000015613174,0.000018427507,0.000359781,0.00002285014,0.000009077515,0.00017339484,0.00012705525,0.013646062,0.0003357746,0.98373127,0.0015534167,0.0000072383305],"about_ca_topic_score_codex":0.0006581406,"about_ca_topic_score_gemma":0.0007585627,"teacher_disagreement_score":0.010593104,"about_ca_system_score_codex":0.00091003353,"about_ca_system_score_gemma":0.00029983209,"threshold_uncertainty_score":0.035437524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5106513,0.00416901,0.2518485,0.002479457,0.0014603527,0.00010554795,0.00083774544,0.000557019,0.22789106],"genre_scores_gemma":[0.9023603,0.0019885357,0.031394057,0.0006219395,0.0007534337,0.00011167927,0.0010952782,0.00035338296,0.06132147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950063,0.000094707,0.000025013047,0.00010252874,0.00016765993,0.000109415465],"domain_scores_gemma":[0.9993437,0.00021359071,0.00009939638,0.00014252763,0.00007457036,0.00012618532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000273194,0.00069829397,0.0012418991,0.0019517601,0.0018866478,0.0023199222,0.0009390443,0.0013624085,0.011996538],"category_scores_gemma":[0.0020579698,0.00056096766,0.0009891598,0.0023221914,0.0020449872,0.0031048642,0.0028064265,0.0028040186,0.0013207576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005201988,0.000021629348,0.00020026889,0.000042995736,0.000013395048,0.00011686918,0.00022606064,0.0050019645,0.0006544392,0.97543633,0.0035787644,0.014655319],"study_design_scores_gemma":[0.0000095208925,0.00001642265,0.00027822776,0.000014980512,0.000006816857,0.0001674928,0.00011721017,0.014485829,0.00027553365,0.9781014,0.0065184426,0.00000810901],"about_ca_topic_score_codex":0.0016789584,"about_ca_topic_score_gemma":0.00097252545,"teacher_disagreement_score":0.011996538,"about_ca_system_score_codex":0.00076098205,"about_ca_system_score_gemma":0.00031593168,"threshold_uncertainty_score":0.040132403},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64461476,0.0007199217,0.05334927,0.0036754508,0.0007114132,0.00014442627,0.0010758009,0.00022648645,0.2954825],"genre_scores_gemma":[0.97586864,0.0005322589,0.0048170476,0.00035824455,0.0003407103,0.000058435377,0.0006884129,0.00008706622,0.017249094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961406,0.00008391247,0.000015622727,0.00006817671,0.000118637596,0.00009955439],"domain_scores_gemma":[0.9979814,0.0009425315,0.00021363769,0.000117990276,0.00038775767,0.00035662306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003264837,0.0003214451,0.00042161407,0.0013794433,0.0014222512,0.0035404358,0.00071974454,0.0007609265,0.008453153],"category_scores_gemma":[0.0032837945,0.00031301606,0.000316202,0.0008421081,0.0019384071,0.003392233,0.0011797644,0.0019517804,0.0010677914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014154734,0.000017121014,0.0005567502,0.00004990472,0.000004689221,0.00013254525,0.00030623455,0.0004644364,0.0024054707,0.9862882,0.0024486864,0.00718445],"study_design_scores_gemma":[0.000030321851,0.000017142927,0.0007934286,0.000014582407,0.000009674684,0.00017165153,0.00033143605,0.0023357957,0.0011214347,0.9889944,0.006168709,0.000011457745],"about_ca_topic_score_codex":0.00087655906,"about_ca_topic_score_gemma":0.00072611857,"teacher_disagreement_score":0.008453153,"about_ca_system_score_codex":0.0008588384,"about_ca_system_score_gemma":0.00047708536,"threshold_uncertainty_score":0.028278649},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08802945,0.0020092279,0.8770944,0.0037555222,0.0002706891,0.00017781317,0.0010372498,0.0016156582,0.026010107],"genre_scores_gemma":[0.5801851,0.002982182,0.38115147,0.00078662066,0.00039588503,0.00036564338,0.0017786309,0.0004130803,0.03194136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729663,0.0007456608,0.0003064396,0.0006576117,0.0007231484,0.00027047013],"domain_scores_gemma":[0.98706436,0.007791833,0.0010922195,0.0023998895,0.0011150591,0.0005367242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024139509,0.00077500724,0.0011878461,0.0029023725,0.0022004973,0.0073318444,0.0019053564,0.002183509,0.008128011],"category_scores_gemma":[0.01727105,0.0009733638,0.0011105689,0.0049346527,0.0026385554,0.013995906,0.0034697328,0.0021537961,0.0014451061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025426774,0.00012216141,0.001397315,0.00033684747,0.00005914567,0.00014513018,0.00024548115,0.051352676,0.002001751,0.8536396,0.0057368306,0.08470887],"study_design_scores_gemma":[0.000021216802,0.000025324505,0.00011625055,0.000037398004,0.000027228314,0.00010555964,0.000059223807,0.05844184,0.0012152528,0.9317615,0.008173389,0.000015930707],"about_ca_topic_score_codex":0.0021008663,"about_ca_topic_score_gemma":0.0033538805,"teacher_disagreement_score":0.008128011,"about_ca_system_score_codex":0.0027933484,"about_ca_system_score_gemma":0.0020258133,"threshold_uncertainty_score":0.027190924},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6702852,0.004962166,0.18437283,0.022771863,0.0004307103,0.0002879383,0.005047226,0.0008636931,0.11097832],"genre_scores_gemma":[0.9601173,0.0024838874,0.022931298,0.0011686127,0.00068607344,0.00027036096,0.002958929,0.00018457987,0.00919896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9963899,0.0009428677,0.00023496192,0.0009491872,0.00084500585,0.00063810765],"domain_scores_gemma":[0.9628369,0.028701717,0.002772479,0.0027132065,0.0017152008,0.0012604612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021294206,0.0010171201,0.002261951,0.0016315434,0.0033627509,0.0060956087,0.003199153,0.0026216093,0.0077225957],"category_scores_gemma":[0.019134738,0.001936209,0.0021235682,0.004081083,0.0065512797,0.014378612,0.0043362486,0.008282867,0.0008989169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009749017,0.00038801256,0.004536015,0.0010512508,0.00024398752,0.0005701539,0.0021378784,0.03169466,0.0035016728,0.9107521,0.016334726,0.027814724],"study_design_scores_gemma":[0.00007184711,0.000026451147,0.00064246537,0.000022344097,0.000038896393,0.00021944639,0.00019859581,0.0114508085,0.0006219237,0.98471594,0.0019733156,0.000017996927],"about_ca_topic_score_codex":0.0033222036,"about_ca_topic_score_gemma":0.0033034582,"teacher_disagreement_score":0.0077225957,"about_ca_system_score_codex":0.0022117388,"about_ca_system_score_gemma":0.001837947,"threshold_uncertainty_score":0.02583462},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3771126,0.0027685717,0.43284115,0.003244821,0.0021141726,0.00031616376,0.00035927392,0.0011420626,0.18010116],"genre_scores_gemma":[0.8592815,0.0010950483,0.10727367,0.0006560303,0.00041560276,0.00032551144,0.00022882853,0.00037582006,0.03034815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993635,0.0002403091,0.000028171917,0.000072846255,0.00017318194,0.000122066216],"domain_scores_gemma":[0.99912196,0.00039148287,0.00008061574,0.0001657186,0.000098845776,0.00014133695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086278614,0.00071567803,0.00082121097,0.0029718324,0.0026618985,0.0023760102,0.0012191671,0.0016524484,0.007139256],"category_scores_gemma":[0.004616066,0.0006055012,0.0007270572,0.0020928723,0.0031869914,0.0019845436,0.003528894,0.0028204112,0.0015770346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003484196,0.000015824926,0.00008838143,0.000029577375,0.0000030990038,0.0000667865,0.000119249125,0.0011096399,0.00086875015,0.98729867,0.0011015964,0.0092636105],"study_design_scores_gemma":[0.000024820465,0.000033590448,0.000090365014,0.000032806132,0.0000043878963,0.00017147792,0.000084646505,0.010288505,0.0016662895,0.9802626,0.0073139076,0.000026728258],"about_ca_topic_score_codex":0.0005242135,"about_ca_topic_score_gemma":0.000579896,"teacher_disagreement_score":0.007139256,"about_ca_system_score_codex":0.0010881299,"about_ca_system_score_gemma":0.0008340592,"threshold_uncertainty_score":0.023883224},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07499718,0.002630484,0.9032483,0.00088329695,0.00035622704,0.00027037208,0.00029079727,0.0010030637,0.01632014],"genre_scores_gemma":[0.70257413,0.0012387988,0.28864533,0.00047318733,0.00030830494,0.00026162283,0.00022892188,0.00010462762,0.0061650523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989477,0.00033119123,0.0000511443,0.00013314695,0.0003303197,0.00020661062],"domain_scores_gemma":[0.99872595,0.00047817678,0.000091836504,0.00036932615,0.00024091624,0.00009380818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012001827,0.00090116035,0.0018308512,0.0013564011,0.0016379585,0.0018656604,0.0018393032,0.0016638753,0.0022902284],"category_scores_gemma":[0.0032038868,0.00044695355,0.0005022168,0.0020249556,0.0014357243,0.0014876534,0.0023218256,0.0011532832,0.0005655632],"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.0017666912,0.00016558751,0.00086113525,0.00068061275,0.00013103998,0.00060592184,0.00072975544,0.10226251,0.06794833,0.51090795,0.01060355,0.30333695],"study_design_scores_gemma":[0.00028597418,0.00022014117,0.00038190652,0.00008940031,0.0001380312,0.001025286,0.00012711267,0.77120465,0.0122005055,0.20032805,0.013849067,0.00014986005],"about_ca_topic_score_codex":0.001921142,"about_ca_topic_score_gemma":0.0027743368,"teacher_disagreement_score":0.0022902284,"about_ca_system_score_codex":0.0018917359,"about_ca_system_score_gemma":0.0020994423,"threshold_uncertainty_score":0.013725519},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005863553,0.0005715005,0.99267125,0.00020468063,0.000021850221,0.000046344743,0.000095880205,0.00013703656,0.00038796393],"genre_scores_gemma":[0.11691941,0.0006037876,0.8809011,0.00011855264,0.000078489844,0.00022717769,0.00037945315,0.00007136107,0.00070067175],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99349916,0.0028967473,0.0005996241,0.001082739,0.0016537951,0.00026787532],"domain_scores_gemma":[0.9842165,0.012928072,0.00064183463,0.0013686068,0.00063885446,0.0002061929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008289971,0.001090632,0.0029601129,0.0026481962,0.0009961003,0.0030947293,0.0024674828,0.0015618586,0.0022851394],"category_scores_gemma":[0.026270568,0.0011732511,0.0022284088,0.0050532524,0.0027343377,0.005481481,0.0029625597,0.003982919,0.00037835573],"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.00043181717,0.00029603523,0.002013026,0.0005438424,0.0002522028,0.00007993077,0.0004035516,0.45406708,0.001679678,0.14417225,0.003282352,0.39277813],"study_design_scores_gemma":[0.000033700002,0.000044215765,0.00024329206,0.000026704927,0.0000382421,0.00003983735,0.00006086943,0.86180496,0.0007759439,0.1360694,0.00084719696,0.000015617663],"about_ca_topic_score_codex":0.0035307156,"about_ca_topic_score_gemma":0.0045323973,"teacher_disagreement_score":0.008289971,"about_ca_system_score_codex":0.0022033826,"about_ca_system_score_gemma":0.002675841,"threshold_uncertainty_score":0.043842137},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80845815,0.0012453102,0.10045893,0.002652096,0.00057163683,0.00007712845,0.000274059,0.00022846303,0.08603419],"genre_scores_gemma":[0.96951854,0.00052397273,0.009689489,0.0003154966,0.000580126,0.000056399836,0.00013693435,0.00007341257,0.019105611],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900216,0.00023421123,0.000056913,0.00017764709,0.00027074284,0.00025833846],"domain_scores_gemma":[0.99765426,0.0008532362,0.00043803063,0.0003079242,0.00025361642,0.0004930545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017596354,0.00090419035,0.0009855791,0.003328095,0.0026907336,0.00416413,0.0011912034,0.0012613324,0.005768697],"category_scores_gemma":[0.0037947658,0.0006446274,0.00083731936,0.0017685093,0.004507702,0.0060440977,0.0032085138,0.0026577017,0.00084797974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003679425,0.00001441557,0.00014781773,0.000012231629,0.000003431641,0.000035489724,0.00015191466,0.00031245244,0.0004615788,0.99692625,0.0002674153,0.0016301034],"study_design_scores_gemma":[0.000014974817,0.000012094924,0.00016181642,0.0000071105787,0.000007345996,0.000060245005,0.000043367243,0.0014435917,0.00036865633,0.99683386,0.0010330885,0.000013806938],"about_ca_topic_score_codex":0.0010031966,"about_ca_topic_score_gemma":0.001148889,"teacher_disagreement_score":0.005768697,"about_ca_system_score_codex":0.0017787243,"about_ca_system_score_gemma":0.0007102655,"threshold_uncertainty_score":0.019298196},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037139777,0.00042733504,0.9434353,0.0014635583,0.00013136178,0.00014675947,0.00034543173,0.00027955777,0.016630933],"genre_scores_gemma":[0.56752896,0.00088303763,0.41590133,0.0008440855,0.00040649046,0.000563773,0.0014655843,0.00040285196,0.012003907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99390453,0.0025223503,0.00044832693,0.0009519509,0.001533471,0.000639294],"domain_scores_gemma":[0.9684902,0.02536799,0.0015497687,0.0021856555,0.0017868886,0.0006195112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007173074,0.0015577512,0.0014242315,0.0016600451,0.0011720273,0.004599805,0.002979395,0.0015004034,0.0070395092],"category_scores_gemma":[0.033296186,0.0017244214,0.0028941776,0.001789942,0.004829128,0.008581769,0.0040346617,0.009966764,0.0007746495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002104402,0.00027260528,0.00035066693,0.00041486075,0.00008349891,0.00014443549,0.0008447008,0.07877339,0.0020519479,0.8794518,0.0031925393,0.034209106],"study_design_scores_gemma":[0.00004263235,0.000038805276,0.00006593073,0.00004833588,0.000019985955,0.00005634199,0.00014183338,0.13341409,0.0013184241,0.86357415,0.0012550125,0.000024557812],"about_ca_topic_score_codex":0.0017918121,"about_ca_topic_score_gemma":0.0021323438,"teacher_disagreement_score":0.007173074,"about_ca_system_score_codex":0.0017729038,"about_ca_system_score_gemma":0.0017335964,"threshold_uncertainty_score":0.037935317},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12704629,0.000602725,0.82367635,0.0003846157,0.00022337757,0.0002878162,0.00087157567,0.00067987456,0.0462274],"genre_scores_gemma":[0.7479774,0.0004792131,0.23919556,0.000361152,0.0001231065,0.00033714506,0.0005719573,0.000083214814,0.010871267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890995,0.0003784947,0.00008102512,0.00015913953,0.00030533512,0.00016608476],"domain_scores_gemma":[0.9978161,0.00067140395,0.00034276347,0.0004999139,0.0005188514,0.0001509607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012503404,0.00077673735,0.00088970945,0.00071554194,0.00055846316,0.0011104345,0.0007099234,0.00070555956,0.008852308],"category_scores_gemma":[0.0027960897,0.0003477595,0.00049226586,0.0008409198,0.0004405082,0.0009849651,0.0007336686,0.0004542891,0.0019606722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032522173,0.00032886746,0.0034480563,0.00081957306,0.0003564826,0.00054975646,0.0002628815,0.09086012,0.17688839,0.4727328,0.010948447,0.23955236],"study_design_scores_gemma":[0.0008061183,0.0029801517,0.0032983276,0.000333718,0.0005554784,0.0017185698,0.0001534865,0.51906765,0.07857771,0.34387445,0.048470065,0.00016415237],"about_ca_topic_score_codex":0.00057673897,"about_ca_topic_score_gemma":0.0017523416,"teacher_disagreement_score":0.008852308,"about_ca_system_score_codex":0.0005483692,"about_ca_system_score_gemma":0.0009687421,"threshold_uncertainty_score":0.029613912},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07224478,0.0014234409,0.44644648,0.0031456845,0.0019914499,0.00026948054,0.011584942,0.017226404,0.44566736],"genre_scores_gemma":[0.45719093,0.0024647538,0.21771462,0.0014839863,0.00075074274,0.00065283565,0.02195448,0.009818429,0.28796917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916506,0.00011718241,0.00008288109,0.00021058021,0.00020278398,0.00022152225],"domain_scores_gemma":[0.9970757,0.000974506,0.0002176177,0.00046235116,0.00071116054,0.000558722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094111817,0.00076233095,0.0007604267,0.0011738306,0.0016416899,0.0023808007,0.0008364373,0.0009808134,0.092390336],"category_scores_gemma":[0.0029160203,0.0009113529,0.0010637089,0.0011793869,0.0015903632,0.0052528754,0.0028280388,0.0017718079,0.057376225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004365305,0.00017573056,0.002608334,0.00053899386,0.000030305038,0.00053117523,0.0012786872,0.0008133689,0.016749796,0.78188413,0.099659026,0.09529404],"study_design_scores_gemma":[0.00008766824,0.00007640896,0.005001149,0.00014912926,0.00003980934,0.0011060643,0.0007570015,0.0026973968,0.022964606,0.45931575,0.5075703,0.00023470301],"about_ca_topic_score_codex":0.0017689982,"about_ca_topic_score_gemma":0.002543065,"teacher_disagreement_score":0.092390336,"about_ca_system_score_codex":0.0011633193,"about_ca_system_score_gemma":0.0010992419,"threshold_uncertainty_score":0.30907643},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38192153,0.0012211632,0.5233786,0.004804255,0.00022311347,0.00082609366,0.0017566473,0.0033432092,0.08252535],"genre_scores_gemma":[0.6327989,0.000808168,0.32874745,0.00076836644,0.0002511514,0.0005417937,0.003217842,0.0012074678,0.03165882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976278,0.0006503209,0.000114831484,0.0005662228,0.00046034247,0.00058049016],"domain_scores_gemma":[0.99228716,0.005002394,0.00046013904,0.0013805092,0.00040157896,0.0004682574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018852862,0.0013410617,0.0017996054,0.002005762,0.0029035222,0.0044473303,0.0038649621,0.001987881,0.017929321],"category_scores_gemma":[0.009383907,0.0011496417,0.0023787606,0.0028296555,0.0021151528,0.008684833,0.004548259,0.003886957,0.002229047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012713755,0.00081812835,0.0041606803,0.00084717834,0.0002126072,0.00026271868,0.00172975,0.070204735,0.010159851,0.575121,0.0383324,0.29687956],"study_design_scores_gemma":[0.00036161713,0.00008444775,0.00079323305,0.00006456059,0.00010798622,0.00024556147,0.00039146718,0.2587507,0.004384482,0.7234728,0.011299034,0.00004415276],"about_ca_topic_score_codex":0.0027313838,"about_ca_topic_score_gemma":0.0069870814,"teacher_disagreement_score":0.017929321,"about_ca_system_score_codex":0.0032749448,"about_ca_system_score_gemma":0.00231747,"threshold_uncertainty_score":0.059979558},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27171078,0.0006447013,0.65370274,0.0019501138,0.0003244819,0.0001726994,0.00038941635,0.000604423,0.07050058],"genre_scores_gemma":[0.8809693,0.00036503907,0.10586562,0.0005648129,0.0002179247,0.00031636693,0.0005603351,0.00034319435,0.010797525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99257505,0.0025182725,0.0005649529,0.0009208678,0.0026026864,0.00081815536],"domain_scores_gemma":[0.97543734,0.018978294,0.0008958318,0.0021121185,0.0020196354,0.0005567391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005014429,0.0012718485,0.0016843629,0.0045079733,0.0020814827,0.0053041456,0.0039002819,0.0030819145,0.011276644],"category_scores_gemma":[0.03399334,0.0010343904,0.0017536418,0.0034784689,0.0039531556,0.013846599,0.0049101124,0.0046070656,0.00079633796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043956934,0.000030445668,0.00032449994,0.00005755591,0.00000997477,0.000054851665,0.00010148875,0.001171626,0.0007965017,0.9887917,0.00045186433,0.008165614],"study_design_scores_gemma":[0.000010152603,0.000011679279,0.0001403981,0.000018859966,0.000016785521,0.000097552824,0.00003576219,0.018970776,0.0015435651,0.9781415,0.0010023754,0.000010504653],"about_ca_topic_score_codex":0.0006132997,"about_ca_topic_score_gemma":0.0007075732,"teacher_disagreement_score":0.011276644,"about_ca_system_score_codex":0.0031622008,"about_ca_system_score_gemma":0.0008608367,"threshold_uncertainty_score":0.037724078},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55040026,0.0005619467,0.40046325,0.0012182193,0.00036595334,0.0003275144,0.00070821546,0.0012446335,0.044710107],"genre_scores_gemma":[0.78500056,0.00084559206,0.17468457,0.0005287675,0.000101995094,0.00039792,0.0008439042,0.0005490343,0.037047632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991929,0.0001695588,0.000065244305,0.00023784512,0.00017106233,0.00016342007],"domain_scores_gemma":[0.9945129,0.0029018363,0.0005089601,0.0006505653,0.00042471365,0.0010010882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079578377,0.00090483035,0.0011045466,0.0021424976,0.003164441,0.003326936,0.0020011635,0.0025447335,0.008625426],"category_scores_gemma":[0.0081335325,0.0015946855,0.0011873088,0.0024331005,0.0016436662,0.005204445,0.0039423103,0.002764644,0.0016003691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028008953,0.00019187058,0.0015771852,0.00031291784,0.00007493508,0.0009171835,0.0010475153,0.02132843,0.008665353,0.9140005,0.003490223,0.04811379],"study_design_scores_gemma":[0.00006302869,0.00005738346,0.00038723365,0.000070096394,0.00005462466,0.00019446723,0.00038991024,0.036985558,0.0031948332,0.9520018,0.006567781,0.000033125812],"about_ca_topic_score_codex":0.0015007785,"about_ca_topic_score_gemma":0.0030103335,"teacher_disagreement_score":0.008625426,"about_ca_system_score_codex":0.0010310904,"about_ca_system_score_gemma":0.0008628676,"threshold_uncertainty_score":0.028854907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07789946,0.0018809653,0.7013887,0.01116444,0.0009059023,0.0002190758,0.0009924163,0.00024309983,0.20530593],"genre_scores_gemma":[0.754137,0.00277277,0.1512245,0.0019888263,0.0012227916,0.0005198797,0.0015991287,0.0003881977,0.086146906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979559,0.0008906035,0.00007548332,0.000419814,0.0004020289,0.0002562692],"domain_scores_gemma":[0.9933903,0.0047765877,0.00036180232,0.00050515047,0.00054278394,0.00042346964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002906362,0.0012390333,0.0013516864,0.0012379363,0.00143446,0.0050463425,0.002047474,0.0032813405,0.020702269],"category_scores_gemma":[0.015583318,0.0011702807,0.0013947996,0.00166927,0.0045487797,0.008037733,0.003391522,0.0073792534,0.0018662091],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080893544,0.000022454351,0.00006971883,0.00008106499,0.000013339424,0.00004902386,0.00006310325,0.004424918,0.00046389792,0.9859454,0.003880308,0.0049059503],"study_design_scores_gemma":[0.000025332072,0.0000112415855,0.00004961964,0.000015144598,0.0000065010136,0.000036488516,0.000025731704,0.0126341395,0.00020430067,0.98391414,0.0030698383,0.000007491189],"about_ca_topic_score_codex":0.0013353748,"about_ca_topic_score_gemma":0.00090996973,"teacher_disagreement_score":0.020702269,"about_ca_system_score_codex":0.0015302291,"about_ca_system_score_gemma":0.0017206413,"threshold_uncertainty_score":0.06925601},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28010732,0.0028078593,0.68509835,0.007556934,0.0002214882,0.0002497108,0.0023139063,0.00028822402,0.021356246],"genre_scores_gemma":[0.94019556,0.0018410669,0.0465377,0.00036301502,0.00043050863,0.00033664523,0.001397703,0.00018775657,0.008710118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977937,0.0007895014,0.00011248726,0.00048014935,0.00053293124,0.0002912371],"domain_scores_gemma":[0.9648408,0.029601011,0.0031297812,0.0006060956,0.00092950655,0.00089279056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032581927,0.0016278706,0.0036426745,0.0019120196,0.0010930285,0.005205917,0.0033431198,0.0037894316,0.0070032417],"category_scores_gemma":[0.02485327,0.0016200151,0.0018059416,0.002350739,0.0030086408,0.0073818737,0.003109817,0.0035218503,0.00030331066],"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.00018004236,0.00006198195,0.0010235296,0.00019244714,0.00006833709,0.0001442376,0.000113760914,0.88006794,0.0003490099,0.11049808,0.0020599687,0.0052406085],"study_design_scores_gemma":[0.000038983468,0.000027629108,0.0002687339,0.00001767939,0.000017316353,0.000038867238,0.00006592325,0.86469406,0.00011362079,0.13431232,0.00038734064,0.000017443848],"about_ca_topic_score_codex":0.008322671,"about_ca_topic_score_gemma":0.0047512683,"teacher_disagreement_score":0.008322671,"about_ca_system_score_codex":0.0044968724,"about_ca_system_score_gemma":0.0022303083,"threshold_uncertainty_score":0.032627225},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4915078,0.0025186574,0.17654744,0.009078844,0.001158194,0.00016482873,0.0010764252,0.00042769033,0.31752005],"genre_scores_gemma":[0.872104,0.0027786184,0.026242074,0.0011026082,0.001139197,0.00012037454,0.0008754942,0.00031654653,0.09532103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994418,0.00012184082,0.000013558388,0.00016524777,0.000112899805,0.0001445555],"domain_scores_gemma":[0.99744993,0.001218477,0.000374535,0.0002477339,0.00027106697,0.00043812743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007906265,0.0009333227,0.00089088693,0.0026397489,0.0035791784,0.0029943318,0.0020178938,0.0015600206,0.016640123],"category_scores_gemma":[0.004600829,0.0007927298,0.0010562153,0.0030166472,0.0045819455,0.010431763,0.0032566336,0.004450984,0.00096887606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025157306,0.000015070614,0.00017756347,0.00002670305,0.0000028666814,0.000028976461,0.00019844828,0.00112575,0.00016610793,0.9925856,0.0020201928,0.003627575],"study_design_scores_gemma":[0.000009596465,0.0000073991914,0.00025478686,0.000013770392,0.000007724497,0.000065746885,0.00014607424,0.0033192548,0.00010396445,0.99252325,0.0035399967,0.000008424152],"about_ca_topic_score_codex":0.0050464794,"about_ca_topic_score_gemma":0.0068204175,"teacher_disagreement_score":0.016640123,"about_ca_system_score_codex":0.0028431558,"about_ca_system_score_gemma":0.0010853838,"threshold_uncertainty_score":0.055666745},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37539023,0.007972801,0.47145233,0.015576468,0.0013102873,0.00015380973,0.001820056,0.0005686027,0.1257555],"genre_scores_gemma":[0.82194597,0.007386068,0.12878707,0.0031755664,0.0016849276,0.00025251115,0.0019011279,0.00054177776,0.034325063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990013,0.0004504756,0.000033617733,0.00018767318,0.00014841485,0.00017853708],"domain_scores_gemma":[0.99047905,0.0066299913,0.0006016109,0.00064669864,0.0005763739,0.0010663702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016329358,0.0013046316,0.0015250616,0.0021203877,0.0023820298,0.0038313405,0.002021525,0.0019275591,0.0066308724],"category_scores_gemma":[0.008776868,0.001197084,0.00092664704,0.003623343,0.0039261063,0.0063986536,0.0028070882,0.004026385,0.0009756409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002027321,0.00006932208,0.0009819677,0.00017731631,0.00002496035,0.000063968364,0.00036087146,0.015306057,0.001502447,0.947818,0.014872601,0.01861979],"study_design_scores_gemma":[0.00003352705,0.000018029501,0.0004228416,0.000035081437,0.000012279995,0.000063055006,0.00011889831,0.02702832,0.00023115009,0.9677969,0.004226977,0.000012815643],"about_ca_topic_score_codex":0.004913881,"about_ca_topic_score_gemma":0.0040626316,"teacher_disagreement_score":0.0066308724,"about_ca_system_score_codex":0.0026471636,"about_ca_system_score_gemma":0.00126064,"threshold_uncertainty_score":0.022182465},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43477726,0.0025939136,0.38593045,0.0043360745,0.001069046,0.0000878377,0.0005924665,0.0008611886,0.1697518],"genre_scores_gemma":[0.9465706,0.00069818995,0.030910054,0.0005270878,0.0004399959,0.00008310165,0.00029308413,0.00015530779,0.020322734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922514,0.0002589986,0.000055591274,0.00016530052,0.00016399662,0.00013086152],"domain_scores_gemma":[0.9983089,0.0009541548,0.00023382982,0.00020751926,0.00016629999,0.00012929774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008170238,0.0006538265,0.0008203392,0.0021415346,0.001961429,0.004396064,0.0009625674,0.0016176254,0.009911606],"category_scores_gemma":[0.0031545444,0.000511754,0.000967809,0.0023463771,0.0036807621,0.0061167805,0.0017008843,0.0023793287,0.0009242575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009616638,0.000005051987,0.00003818526,0.000011040006,0.0000016582443,0.000025594914,0.00015999416,0.00037256582,0.00017335992,0.99705887,0.00025964068,0.0018844397],"study_design_scores_gemma":[0.000005316524,0.0000043802656,0.000037956754,0.0000057294646,0.0000032207868,0.00003078631,0.000049731214,0.0015095188,0.00012932824,0.9969156,0.0013023412,0.0000060448647],"about_ca_topic_score_codex":0.00081992196,"about_ca_topic_score_gemma":0.00089572824,"teacher_disagreement_score":0.009911606,"about_ca_system_score_codex":0.0012840916,"about_ca_system_score_gemma":0.0004570466,"threshold_uncertainty_score":0.033157587},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050383873,0.0001773932,0.9192374,0.0005657604,0.00017756093,0.00015208015,0.0011679826,0.0014240391,0.026713917],"genre_scores_gemma":[0.64803195,0.0003529259,0.3280014,0.00021688771,0.00016748502,0.00028938,0.0021452233,0.00064085657,0.020153835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930644,0.00012749547,0.00005600951,0.00019969254,0.0001769026,0.00013351958],"domain_scores_gemma":[0.9981667,0.0006055352,0.00018428345,0.0005607481,0.00036086421,0.00012178371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005619145,0.00055235595,0.0005646217,0.00071075564,0.0007360135,0.0032236436,0.002103639,0.0008838713,0.018227713],"category_scores_gemma":[0.004510906,0.000335949,0.0006170662,0.0016832431,0.0009498455,0.005775825,0.0015640485,0.0020934767,0.0023066446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022369572,0.00009092157,0.00031638046,0.00018981841,0.000010718508,0.00009675265,0.00047167196,0.025275076,0.0036008547,0.908053,0.0033774585,0.058293685],"study_design_scores_gemma":[0.00005185723,0.00007978982,0.00016581341,0.000049220835,0.000027767263,0.00010210822,0.00022386169,0.16521555,0.0029901373,0.8079592,0.02310884,0.000025942702],"about_ca_topic_score_codex":0.001949007,"about_ca_topic_score_gemma":0.0028023645,"teacher_disagreement_score":0.018227713,"about_ca_system_score_codex":0.0011748575,"about_ca_system_score_gemma":0.0008303591,"threshold_uncertainty_score":0.060977817},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5963944,0.00039371333,0.38442916,0.00050908624,0.00013427244,0.00017749249,0.0029965946,0.00096505886,0.014000213],"genre_scores_gemma":[0.89593834,0.00029347336,0.09656668,0.00011067919,0.00007189645,0.00008091873,0.0035549193,0.00017826866,0.003204799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899346,0.00021236198,0.000109363806,0.00030073084,0.0002422564,0.00014195117],"domain_scores_gemma":[0.9958637,0.0023430015,0.00043526408,0.0004829357,0.00045470396,0.00042050594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009694826,0.0008066565,0.001006217,0.0029302223,0.0009424714,0.0039331797,0.0009052296,0.00066101924,0.0052653183],"category_scores_gemma":[0.007815711,0.0006831901,0.0010388294,0.0022820886,0.0010399474,0.0062967394,0.0014879658,0.001162287,0.00058033003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006577188,0.00033387897,0.008441081,0.0007098007,0.00021239341,0.0007491029,0.0019862913,0.040718853,0.0142214345,0.8025271,0.007449975,0.12199247],"study_design_scores_gemma":[0.0000471985,0.00007905204,0.0011474516,0.000080615966,0.00007466361,0.00016258618,0.0005051985,0.10006462,0.002732398,0.8918425,0.0032353739,0.000028338163],"about_ca_topic_score_codex":0.0020828124,"about_ca_topic_score_gemma":0.0041437894,"teacher_disagreement_score":0.0052653183,"about_ca_system_score_codex":0.0011366811,"about_ca_system_score_gemma":0.0006569739,"threshold_uncertainty_score":0.017614245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5070256,0.00050616823,0.4399496,0.0018934129,0.00006524352,0.0001123873,0.00015099125,0.000096018535,0.050200675],"genre_scores_gemma":[0.97350967,0.00010502222,0.023187868,0.00006594594,0.000023412716,0.000064743916,0.000029351399,0.000013832209,0.0030001737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936085,0.003916121,0.0003017301,0.00043200032,0.0010326656,0.0007090588],"domain_scores_gemma":[0.98229516,0.013780715,0.000972857,0.0011291972,0.00086891046,0.0009532017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004817793,0.0005910649,0.0010710974,0.0011959677,0.0009464348,0.005401029,0.0010698355,0.0017564435,0.0078171315],"category_scores_gemma":[0.019211335,0.0007378918,0.0010580407,0.0017320771,0.0026152025,0.0071548717,0.0021473558,0.0026025786,0.0005418618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037658834,0.00012770601,0.003496011,0.00014535231,0.00012664706,0.00025142764,0.0011432115,0.028445832,0.0017117048,0.9408562,0.0006342867,0.022685023],"study_design_scores_gemma":[0.000052661737,0.000096370124,0.0017702568,0.000021312682,0.000052777425,0.00008439328,0.0006104166,0.071511865,0.00042762313,0.92460567,0.0007219548,0.000044669232],"about_ca_topic_score_codex":0.0013944482,"about_ca_topic_score_gemma":0.0022971423,"teacher_disagreement_score":0.0078171315,"about_ca_system_score_codex":0.0014619867,"about_ca_system_score_gemma":0.0007680711,"threshold_uncertainty_score":0.026150882},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29153228,0.01018276,0.48038083,0.011547163,0.002072798,0.00009640238,0.0013016829,0.001493395,0.20139271],"genre_scores_gemma":[0.9119196,0.005788569,0.052241992,0.0012388568,0.0026775477,0.00026137807,0.0009899816,0.0010970824,0.02378502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982797,0.00039923948,0.00008304537,0.00031226015,0.00067455845,0.00025128236],"domain_scores_gemma":[0.9743395,0.01735566,0.0015057676,0.0019848477,0.002138548,0.0026756183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032940046,0.0020935496,0.0019410519,0.0050974456,0.001576047,0.004768852,0.004360334,0.0023465625,0.007350745],"category_scores_gemma":[0.02443576,0.0007706055,0.0011237314,0.0025317362,0.004756191,0.0095987255,0.004195202,0.0072720936,0.0017301101],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043211615,0.0001475605,0.0016480058,0.0003534048,0.00006583222,0.00030799772,0.00045426437,0.017602352,0.010666504,0.93837047,0.009318514,0.020632962],"study_design_scores_gemma":[0.00003173397,0.000080196674,0.0011489431,0.00012226726,0.0000632619,0.00030533326,0.00011028243,0.11413782,0.0028280334,0.8773068,0.0038036122,0.00006162858],"about_ca_topic_score_codex":0.00073767005,"about_ca_topic_score_gemma":0.0011248951,"teacher_disagreement_score":0.007350745,"about_ca_system_score_codex":0.0031812477,"about_ca_system_score_gemma":0.0011616047,"threshold_uncertainty_score":0.024590671},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09249604,0.0018268251,0.8861065,0.0018582019,0.00021132379,0.00019300888,0.0006289262,0.0009726152,0.01570661],"genre_scores_gemma":[0.6065672,0.0009999223,0.376693,0.00041526553,0.00021487287,0.0004107584,0.0010315372,0.00032357356,0.013343854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901617,0.00051221764,0.00002720362,0.00013536162,0.00015001355,0.00015898443],"domain_scores_gemma":[0.9957325,0.0036014728,0.00017210587,0.00019276376,0.0001696038,0.00013150462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015466742,0.0008330862,0.0017635913,0.0016204116,0.00084237586,0.0015444299,0.0014157541,0.00140631,0.006487034],"category_scores_gemma":[0.0073114005,0.0006283452,0.0010286494,0.0027995436,0.0014592459,0.0021628148,0.0012804199,0.0020004287,0.00050761335],"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.00034669437,0.00019949714,0.0007319249,0.00026310713,0.00008125181,0.0000399445,0.00015188944,0.77296704,0.0007042496,0.1078022,0.009151567,0.10756058],"study_design_scores_gemma":[0.00005638928,0.0000385949,0.00010877532,0.000016919643,0.000012195247,0.000009465947,0.000030506197,0.8918463,0.0002078114,0.10662545,0.0010410309,0.000006558202],"about_ca_topic_score_codex":0.011374383,"about_ca_topic_score_gemma":0.009646769,"teacher_disagreement_score":0.011374383,"about_ca_system_score_codex":0.0017367873,"about_ca_system_score_gemma":0.0024911372,"threshold_uncertainty_score":0.022616327},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5538081,0.00045727828,0.41053444,0.0007077738,0.00017250961,0.000079868296,0.0003455034,0.0006564123,0.03323805],"genre_scores_gemma":[0.84061384,0.00072763726,0.14297333,0.00017289908,0.000038541853,0.00008674953,0.00039898427,0.00028304124,0.014704966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977905,0.00007378793,0.000014869969,0.00003484016,0.000038740007,0.000058683007],"domain_scores_gemma":[0.9993678,0.0001682838,0.000113241884,0.00013211896,0.00006817884,0.00015035486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029265098,0.0004898275,0.00043041757,0.00046591004,0.0004336245,0.001345415,0.0006795352,0.0005089083,0.005934579],"category_scores_gemma":[0.0015206713,0.0003972949,0.0002916074,0.00050077983,0.00061473524,0.0020880895,0.0018083552,0.000989082,0.00084877276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010774236,0.0002710057,0.0018170369,0.00036248352,0.000054809974,0.00040148688,0.000549983,0.1557106,0.037033267,0.6498812,0.0077868863,0.14505394],"study_design_scores_gemma":[0.000093633236,0.00021430837,0.000648859,0.00007803283,0.000028756815,0.00014597816,0.00039053735,0.27863514,0.0073470064,0.700196,0.012195824,0.00002595629],"about_ca_topic_score_codex":0.00052582234,"about_ca_topic_score_gemma":0.0009893455,"teacher_disagreement_score":0.005934579,"about_ca_system_score_codex":0.00061728596,"about_ca_system_score_gemma":0.00034944926,"threshold_uncertainty_score":0.019853115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049149124,0.0026078406,0.9782734,0.0017043417,0.00031235794,0.000051744406,0.00025254852,0.00011624818,0.011766627],"genre_scores_gemma":[0.33844423,0.01337525,0.5957439,0.0015221377,0.0023068136,0.0012561398,0.0015615628,0.00054553116,0.04524441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983051,0.0008724264,0.000074348354,0.0002395734,0.00042406254,0.0000844506],"domain_scores_gemma":[0.99378973,0.0045326566,0.00045812776,0.00035445287,0.0006372891,0.00022774443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031169637,0.0022677018,0.0019884943,0.0009917713,0.0007707132,0.0030502903,0.0016822562,0.0017974311,0.0063690515],"category_scores_gemma":[0.010197699,0.00087851606,0.0010567347,0.0026892321,0.0031382723,0.0041965987,0.001838561,0.0071824566,0.0012720713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007782064,0.00016663565,0.00013706787,0.00040804857,0.000055690845,0.00007959897,0.00015364977,0.08748937,0.0011324802,0.86138296,0.011348153,0.03756862],"study_design_scores_gemma":[0.000027264294,0.000041091487,0.00008364647,0.000031604613,0.000011598536,0.000041320865,0.000038342117,0.3336725,0.00022318427,0.6606433,0.00516699,0.000019115094],"about_ca_topic_score_codex":0.0023549462,"about_ca_topic_score_gemma":0.0029313231,"teacher_disagreement_score":0.0063690515,"about_ca_system_score_codex":0.0016694728,"about_ca_system_score_gemma":0.0017778202,"threshold_uncertainty_score":0.021306634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014598373,0.00008852014,0.9799269,0.0001248534,0.00006495099,0.00016315306,0.0001093474,0.0005185488,0.004405429],"genre_scores_gemma":[0.1520622,0.00012528886,0.8408426,0.00008182027,0.000042687556,0.00024847945,0.00044180796,0.00025652768,0.0058986293],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858737,0.00028451523,0.00010086964,0.00037924421,0.00046794873,0.00018014846],"domain_scores_gemma":[0.9980155,0.0012085214,0.000104603074,0.00030685528,0.00024521936,0.00011934568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014193653,0.0006604229,0.0013593464,0.0011809365,0.001157707,0.0019218597,0.003088855,0.0013390171,0.013594269],"category_scores_gemma":[0.0057196235,0.0008874992,0.0013692687,0.0012905409,0.0012831998,0.0027463236,0.003660782,0.0024376172,0.0016792334],"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.00065270066,0.000255651,0.0007033343,0.00037344525,0.00006941635,0.00018498547,0.00025464094,0.15319955,0.009623676,0.33358738,0.007276939,0.4938183],"study_design_scores_gemma":[0.00014703134,0.00016552855,0.00012844229,0.00004760539,0.00003981378,0.000116634495,0.00008575698,0.8125871,0.009054958,0.16947404,0.0081171915,0.00003590953],"about_ca_topic_score_codex":0.001753297,"about_ca_topic_score_gemma":0.0021218017,"teacher_disagreement_score":0.013594269,"about_ca_system_score_codex":0.0010619446,"about_ca_system_score_gemma":0.0014512691,"threshold_uncertainty_score":0.04547739},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19972314,0.0020968672,0.7357125,0.0034275267,0.0005331969,0.0004545542,0.0006784118,0.0012529166,0.056120913],"genre_scores_gemma":[0.8168035,0.0012070242,0.13074687,0.0007917439,0.000688113,0.00040076303,0.0006229722,0.00042895376,0.048310053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968233,0.0012128826,0.00016619939,0.0006192739,0.0006876689,0.0004905894],"domain_scores_gemma":[0.9848935,0.006621234,0.0008456069,0.004372868,0.002650701,0.00061608397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027177641,0.0008721012,0.002076814,0.0016940458,0.0029992117,0.0038088246,0.0016851511,0.0023336867,0.00618309],"category_scores_gemma":[0.015212497,0.0007568521,0.0010863194,0.0025223873,0.001432199,0.004176221,0.0065053357,0.002910336,0.0024024302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034613474,0.00029554663,0.0076706246,0.0011241214,0.00041817987,0.0027409075,0.0049414313,0.037051935,0.07092062,0.69188184,0.016076097,0.16341731],"study_design_scores_gemma":[0.0008380309,0.00080653536,0.002597259,0.00028583893,0.0006596745,0.0054490976,0.0019097293,0.33606374,0.06631756,0.51385486,0.07096283,0.00025473788],"about_ca_topic_score_codex":0.00072274095,"about_ca_topic_score_gemma":0.0008369077,"teacher_disagreement_score":0.00618309,"about_ca_system_score_codex":0.0013152168,"about_ca_system_score_gemma":0.0013472448,"threshold_uncertainty_score":0.02068448},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84481937,0.000093344024,0.12015587,0.00030091745,0.00015048441,0.00012103911,0.00038489525,0.00020485758,0.033769228],"genre_scores_gemma":[0.9459179,0.0000754293,0.043527447,0.00009961874,0.000017304257,0.00009136395,0.00033580372,0.00006010177,0.009874994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995115,0.00012653045,0.000029230843,0.0000990987,0.000101756414,0.00013198986],"domain_scores_gemma":[0.99851006,0.0005069425,0.00019881652,0.00015134833,0.0002014719,0.00043134822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044107207,0.00032488714,0.00037303826,0.0007627542,0.0019002759,0.0022569934,0.0011464844,0.0010742213,0.008424533],"category_scores_gemma":[0.0017687137,0.00037615674,0.00040740296,0.0007417123,0.00087810186,0.0010488353,0.0011058226,0.0008344905,0.0006440596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077816297,0.000332348,0.0063535557,0.00019603784,0.00011185793,0.0013216417,0.0009431666,0.020448493,0.02912845,0.8992944,0.0036798622,0.037412193],"study_design_scores_gemma":[0.00024299635,0.0003740821,0.0032708715,0.000058863134,0.000104190185,0.00072453904,0.0008228935,0.10949389,0.011819899,0.85876507,0.014255256,0.00006748054],"about_ca_topic_score_codex":0.00092534075,"about_ca_topic_score_gemma":0.0017640733,"teacher_disagreement_score":0.008424533,"about_ca_system_score_codex":0.0005512071,"about_ca_system_score_gemma":0.0005111285,"threshold_uncertainty_score":0.028182805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9803642,0.0014966761,0.006094485,0.0013298789,0.00014223786,0.000026559632,0.00065042754,0.0016642166,0.008231229],"genre_scores_gemma":[0.99309266,0.00035882354,0.0045011886,0.00009787147,0.00003166552,0.000028256123,0.0002885964,0.00029431007,0.0013067812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823797,0.00050021446,0.0001371134,0.00031029942,0.00024823318,0.0005662364],"domain_scores_gemma":[0.92471147,0.06373443,0.0016032413,0.0052215806,0.0029177307,0.0018116212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028549712,0.00073284307,0.00078400935,0.0014026125,0.00069922925,0.002054284,0.0019316457,0.0016805521,0.009656348],"category_scores_gemma":[0.05131395,0.00054429495,0.000458352,0.0019176333,0.00087808643,0.0066682966,0.0016015552,0.0009609569,0.0010556068],"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.023737187,0.0019830638,0.03723919,0.0016613499,0.0004379573,0.0014949533,0.0012674044,0.4984001,0.08355729,0.015114557,0.020245675,0.31486118],"study_design_scores_gemma":[0.001550898,0.0042285076,0.0142695205,0.00031570272,0.000850748,0.0014231134,0.0019268114,0.8149797,0.12648313,0.028356722,0.0054349587,0.00018015772],"about_ca_topic_score_codex":0.0019876852,"about_ca_topic_score_gemma":0.002759691,"teacher_disagreement_score":0.009656348,"about_ca_system_score_codex":0.0004998113,"about_ca_system_score_gemma":0.0017371054,"threshold_uncertainty_score":0.03230369},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5126758,0.0012464294,0.23354588,0.0089037195,0.00079013925,0.00021491457,0.0015525268,0.0004328908,0.24063762],"genre_scores_gemma":[0.9099276,0.0007748454,0.024958925,0.00083905103,0.00067975256,0.00022044082,0.0015643444,0.00032018757,0.060714703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994636,0.00016023952,0.0000204505,0.00011594797,0.00013843489,0.00010128025],"domain_scores_gemma":[0.99876887,0.00058409956,0.00012512106,0.00015742474,0.00014496245,0.00021939042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008043529,0.0006896211,0.0014128112,0.0009531974,0.0019321183,0.0037003043,0.0013834271,0.0019578263,0.025049523],"category_scores_gemma":[0.0035393455,0.00047306382,0.0006710636,0.0012529722,0.0018988259,0.004704316,0.0026422737,0.0028723504,0.0018198859],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009306918,0.000042692096,0.00014146858,0.0000503804,0.00001228208,0.00004214919,0.00010843587,0.0036223072,0.0004998683,0.9831323,0.0053148554,0.0069400677],"study_design_scores_gemma":[0.000028737588,0.0000109196735,0.00009685737,0.000008365828,0.000006863557,0.00003579092,0.00008124535,0.015161385,0.00033827865,0.98213655,0.002090121,0.0000048866546],"about_ca_topic_score_codex":0.0005828231,"about_ca_topic_score_gemma":0.0006238692,"teacher_disagreement_score":0.025049523,"about_ca_system_score_codex":0.001061798,"about_ca_system_score_gemma":0.0009647741,"threshold_uncertainty_score":0.083799064},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8313873,0.0012342768,0.058039904,0.004214991,0.00030336302,0.000057220506,0.0008291902,0.00031243108,0.103621304],"genre_scores_gemma":[0.96882266,0.0009122826,0.01797799,0.0003888395,0.00041607165,0.000097897304,0.00060351245,0.00018820685,0.010592469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911195,0.00024912957,0.000030687806,0.00018110634,0.0002258544,0.00020123666],"domain_scores_gemma":[0.99360245,0.0040451037,0.00079164875,0.00042801967,0.0003984162,0.0007343078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013624616,0.0008088247,0.00095452525,0.004144846,0.003042295,0.0041224356,0.0020736696,0.0015493606,0.0109785525],"category_scores_gemma":[0.0074743843,0.00080600986,0.0007031917,0.004317333,0.005526743,0.005146633,0.0019058454,0.003534628,0.00067785644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029636375,0.00007214914,0.001894987,0.000109039756,0.000028304117,0.00010807385,0.00047608334,0.018318309,0.0028968204,0.959562,0.005878043,0.010359863],"study_design_scores_gemma":[0.000047195852,0.000040454386,0.0018634583,0.00003924602,0.000028578268,0.000141748,0.00028362268,0.054870237,0.0013758426,0.93817043,0.0030966206,0.00004252237],"about_ca_topic_score_codex":0.0044546053,"about_ca_topic_score_gemma":0.0041094767,"teacher_disagreement_score":0.0109785525,"about_ca_system_score_codex":0.0036050912,"about_ca_system_score_gemma":0.0010581923,"threshold_uncertainty_score":0.036726892},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124432765,0.0019020935,0.781547,0.0019980636,0.00028653044,0.00012562069,0.000721488,0.00016107572,0.088825405],"genre_scores_gemma":[0.8157703,0.0026047025,0.117352545,0.00044977502,0.0002644719,0.00019744624,0.00082991767,0.00023898174,0.062291835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996277,0.00012911661,0.000011219468,0.00010407396,0.000064394415,0.00006347381],"domain_scores_gemma":[0.99948907,0.00028038255,0.00005887213,0.000039563645,0.00005953906,0.00007252232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005237347,0.0011084329,0.0008581124,0.00057596795,0.0005106447,0.0016134284,0.0015894118,0.0019436992,0.0074543995],"category_scores_gemma":[0.0020630448,0.000521602,0.0006152138,0.001282992,0.0009461445,0.0018290587,0.0013042961,0.0014389458,0.00055938103],"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.00014060264,0.00010568358,0.0007521873,0.0002509682,0.00006384866,0.0002763949,0.00012060756,0.53560346,0.0017966182,0.39425835,0.011044121,0.055587124],"study_design_scores_gemma":[0.000033979537,0.00005340707,0.00035286642,0.000030018538,0.000026902057,0.00013115823,0.00010477819,0.78679836,0.0007387363,0.2010488,0.010658108,0.00002285749],"about_ca_topic_score_codex":0.0041519497,"about_ca_topic_score_gemma":0.0028714084,"teacher_disagreement_score":0.0074543995,"about_ca_system_score_codex":0.0011731632,"about_ca_system_score_gemma":0.00081365614,"threshold_uncertainty_score":0.02493745},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055332873,0.00046566877,0.99070626,0.00022835023,0.00011860614,0.00030763858,0.00012061578,0.00007465066,0.0024450077],"genre_scores_gemma":[0.11339986,0.001707134,0.8753227,0.0005332123,0.00037418984,0.0042006047,0.0003529394,0.00012304042,0.00398627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.8166641,0.15855405,0.004288002,0.007613706,0.010524714,0.0023554063],"domain_scores_gemma":[0.70308816,0.25671127,0.009565453,0.021440178,0.008005406,0.0011896121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.12301749,0.0033457885,0.0059247217,0.0030223816,0.0014661386,0.0030771613,0.002901498,0.0023817602,0.010598018],"category_scores_gemma":[0.19197989,0.0025009841,0.0031085517,0.0031175264,0.009003271,0.0053159003,0.0046343324,0.003764466,0.0011404124],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012963841,0.00014356262,0.0006286785,0.0004987281,0.00029723416,0.000058711514,0.00035584244,0.02910582,0.0008897406,0.8803706,0.0013129365,0.085041724],"study_design_scores_gemma":[0.0006241591,0.0009032958,0.0006053924,0.00019076568,0.00014331509,0.00006124909,0.000059739366,0.077326134,0.0011839794,0.9123235,0.0064972322,0.00008129739],"about_ca_topic_score_codex":0.0013939834,"about_ca_topic_score_gemma":0.0012322178,"teacher_disagreement_score":0.12301749,"about_ca_system_score_codex":0.002740999,"about_ca_system_score_gemma":0.00714472,"threshold_uncertainty_score":0.6505865},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04570659,0.00026021202,0.95214987,0.00020442516,0.000040604016,0.000034418274,0.00021193355,0.00025499007,0.001136953],"genre_scores_gemma":[0.46276978,0.00075507566,0.5318778,0.00012592216,0.00009638613,0.0000935064,0.0010895093,0.00024009128,0.002951892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995421,0.00010002876,0.000029470673,0.000082254264,0.00019918114,0.000047014797],"domain_scores_gemma":[0.9959337,0.0028006132,0.00028348193,0.00042604285,0.00040018593,0.0001559004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007277525,0.0007796643,0.0011381855,0.0017377282,0.000430037,0.0015788646,0.0012221042,0.0016480586,0.001393653],"category_scores_gemma":[0.0062029557,0.0009957559,0.0008700349,0.0015334331,0.0010428732,0.0018547976,0.001711292,0.0030266808,0.0005179156],"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.00034766458,0.00010726163,0.0023645994,0.00032064976,0.00008349921,0.0007360579,0.0004095107,0.64627457,0.017961048,0.11686451,0.0041117193,0.21041897],"study_design_scores_gemma":[0.0000090827925,0.00001925958,0.00019703877,0.000020477213,0.000008544822,0.00011102313,0.00004031643,0.9528337,0.0025620954,0.043311246,0.00087710185,0.000010026886],"about_ca_topic_score_codex":0.0023034809,"about_ca_topic_score_gemma":0.0031000697,"teacher_disagreement_score":0.0023034809,"about_ca_system_score_codex":0.0006732537,"about_ca_system_score_gemma":0.00057787355,"threshold_uncertainty_score":0.0048847795},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28220657,0.0035677366,0.29965058,0.034232326,0.0012869262,0.00014894774,0.00073214417,0.00063478015,0.37754002],"genre_scores_gemma":[0.8782187,0.0026549348,0.043468796,0.0030507096,0.001986068,0.00028640087,0.0014766034,0.0003478825,0.06850986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853575,0.00067835144,0.000048898877,0.00029622758,0.00023357158,0.000207228],"domain_scores_gemma":[0.99567884,0.0030203445,0.00021224396,0.0004626626,0.00023759637,0.00038834673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001809222,0.00076993724,0.0015591282,0.001163736,0.002087674,0.0034198654,0.0023913602,0.0026698732,0.019037057],"category_scores_gemma":[0.008720951,0.00060463964,0.0009422326,0.0018448726,0.003988505,0.011509116,0.0051046913,0.006639625,0.0019972392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000606834,0.000048345006,0.00014328143,0.00006499863,0.0000139030735,0.00005081737,0.00013294732,0.0012084155,0.00018657041,0.9860643,0.004899089,0.007126705],"study_design_scores_gemma":[0.000019170397,0.000005643455,0.000061313505,0.0000075532243,0.00000452381,0.00003838746,0.00005546953,0.0033684617,0.000070600094,0.9947271,0.0016369749,0.000004724069],"about_ca_topic_score_codex":0.001024179,"about_ca_topic_score_gemma":0.0006262079,"teacher_disagreement_score":0.019037057,"about_ca_system_score_codex":0.0011921143,"about_ca_system_score_gemma":0.0008776208,"threshold_uncertainty_score":0.06368536},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03967202,0.0012166924,0.82905066,0.0013711078,0.0006627106,0.0002160651,0.0013260621,0.0011860303,0.12529859],"genre_scores_gemma":[0.3068716,0.0040006745,0.5778398,0.001158391,0.00064819644,0.00038596135,0.0073608863,0.0034638424,0.09827083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989273,0.00031204728,0.000054703603,0.00019702793,0.00035964203,0.00014936752],"domain_scores_gemma":[0.99707913,0.0015860416,0.00015302918,0.0005946,0.0004351778,0.00015215998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456962,0.00075876655,0.00092089345,0.00194133,0.0019466616,0.002218584,0.002601428,0.0010557551,0.03380591],"category_scores_gemma":[0.0066628535,0.00072682305,0.0014450599,0.0023191432,0.0021757144,0.0056806905,0.0055974633,0.003031123,0.006199473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009284731,0.00004800415,0.00060010114,0.0002483053,0.000030765874,0.00018963098,0.00058328244,0.022353584,0.0014651584,0.85790265,0.02699285,0.08949293],"study_design_scores_gemma":[0.000017351535,0.00002019724,0.00027643066,0.00008389945,0.000017899309,0.00008974825,0.00029142955,0.030689823,0.0010107363,0.94496655,0.022513654,0.00002229845],"about_ca_topic_score_codex":0.008395095,"about_ca_topic_score_gemma":0.020363878,"teacher_disagreement_score":0.03380591,"about_ca_system_score_codex":0.001376642,"about_ca_system_score_gemma":0.000854291,"threshold_uncertainty_score":0.113092005},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92077965,0.00034508045,0.055956777,0.00052394735,0.000053954445,0.000056553537,0.0012155663,0.0005219014,0.020546548],"genre_scores_gemma":[0.9657227,0.00019224375,0.027748708,0.00013998654,0.000043933727,0.00008861342,0.00088347786,0.0002758059,0.0049046404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957424,0.000079611935,0.000031922358,0.000116176205,0.00006491686,0.000133031],"domain_scores_gemma":[0.9961039,0.0017735983,0.000670436,0.00047937848,0.00030461565,0.00066818245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006765917,0.0005391275,0.00089594466,0.0009217216,0.0011111218,0.0024625794,0.001635989,0.0010181682,0.00862064],"category_scores_gemma":[0.0042346707,0.00064566004,0.0006791147,0.0010409674,0.00105789,0.0029322908,0.001332378,0.0011587186,0.00096488715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003050055,0.000355483,0.013297969,0.00070749986,0.00015075233,0.0012416057,0.0023045011,0.03870817,0.052284855,0.82740617,0.0134570245,0.047035903],"study_design_scores_gemma":[0.00025983618,0.0002441925,0.007482134,0.00008638904,0.00014445272,0.0014418579,0.0011803856,0.095778815,0.013342379,0.87308747,0.0068934364,0.00005871774],"about_ca_topic_score_codex":0.001280076,"about_ca_topic_score_gemma":0.0016300573,"teacher_disagreement_score":0.00862064,"about_ca_system_score_codex":0.0005949708,"about_ca_system_score_gemma":0.00057788845,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34564203,0.0012136434,0.51133645,0.002349701,0.0008014513,0.00019652428,0.00035343145,0.000686662,0.13742022],"genre_scores_gemma":[0.95667416,0.00053167285,0.022266759,0.0003652211,0.00046343534,0.00007692114,0.00020058705,0.00019374801,0.019227482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713635,0.0007117751,0.00021317016,0.00044801985,0.0010375415,0.00045308057],"domain_scores_gemma":[0.9976966,0.0008324534,0.00023966108,0.0006408662,0.00046695623,0.00012348089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017762252,0.0004738798,0.00074742554,0.0010909266,0.0012766338,0.0032562683,0.0007968229,0.0012027881,0.008389548],"category_scores_gemma":[0.0062805032,0.0003810225,0.00093912793,0.0009863428,0.0030453713,0.006549595,0.002251271,0.003205823,0.0020970958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010667817,0.000033532386,0.00016066377,0.000016517526,0.0000046030523,0.000078634046,0.00012467994,0.0025285326,0.0011259937,0.9851077,0.00063562853,0.010076718],"study_design_scores_gemma":[0.000026608222,0.00006592635,0.00024303603,0.000013692298,0.000008988779,0.00014660576,0.000054267417,0.016567826,0.0033809273,0.97557086,0.0039,0.000021185982],"about_ca_topic_score_codex":0.0006502235,"about_ca_topic_score_gemma":0.00035297024,"teacher_disagreement_score":0.008389548,"about_ca_system_score_codex":0.00090173667,"about_ca_system_score_gemma":0.00088226836,"threshold_uncertainty_score":0.02806586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025829928,0.0009692325,0.9640478,0.000935176,0.00015497606,0.00016891991,0.00022813011,0.00046407394,0.007201719],"genre_scores_gemma":[0.7546414,0.0011227663,0.2282295,0.00067711825,0.00061405107,0.00081302365,0.00033259077,0.00021219591,0.0133574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973883,0.0010440607,0.00013198888,0.00040600845,0.0007604379,0.00026916948],"domain_scores_gemma":[0.9906088,0.005676009,0.00082068244,0.0020713257,0.00048902846,0.00033418028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033163955,0.0008999505,0.0021367476,0.001411045,0.001657594,0.0019495283,0.002606012,0.0021871107,0.0037210013],"category_scores_gemma":[0.01420209,0.00089683715,0.0006022987,0.002335417,0.0027982993,0.0045679845,0.0055953455,0.0022432543,0.0009304539],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022625953,0.0001570763,0.0006242295,0.0005520731,0.00013763401,0.0001675612,0.000537072,0.19286041,0.016596941,0.6304688,0.010068977,0.1455667],"study_design_scores_gemma":[0.0002888906,0.00017809155,0.00015771085,0.000043634347,0.000053040007,0.00015265816,0.000055356384,0.5111122,0.003960333,0.47923172,0.0047124918,0.000053920754],"about_ca_topic_score_codex":0.0005526103,"about_ca_topic_score_gemma":0.0007974963,"teacher_disagreement_score":0.0037210013,"about_ca_system_score_codex":0.0015974812,"about_ca_system_score_gemma":0.0015617805,"threshold_uncertainty_score":0.017539024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05718276,0.00064165227,0.9208074,0.0010617471,0.0006707463,0.000061224375,0.00010615947,0.00023347209,0.019234806],"genre_scores_gemma":[0.7155227,0.0010318555,0.267442,0.0006266774,0.0012198781,0.000083626735,0.00022130572,0.00026315867,0.0135887265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988018,0.00038372676,0.00012837641,0.00019041105,0.0003163146,0.0001793507],"domain_scores_gemma":[0.9954991,0.0016797859,0.00046848014,0.001152322,0.000711887,0.0004883084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027270385,0.00068282784,0.00059343065,0.0007311138,0.0012216967,0.0014378184,0.0014180513,0.00069534505,0.0035617272],"category_scores_gemma":[0.0077124415,0.00049714267,0.0011035132,0.001442646,0.0021568749,0.004186369,0.0024308076,0.0025568388,0.0005427248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031210607,0.00018206982,0.0013462368,0.00018925552,0.00004479994,0.00037628712,0.00037802962,0.09643769,0.004443376,0.8079394,0.004664476,0.08368628],"study_design_scores_gemma":[0.000044318884,0.000099756304,0.00039803173,0.000020038098,0.000032995296,0.00023506457,0.00006753094,0.22610039,0.0020553784,0.761686,0.009227838,0.000032632077],"about_ca_topic_score_codex":0.0020850375,"about_ca_topic_score_gemma":0.0026350843,"teacher_disagreement_score":0.0035617272,"about_ca_system_score_codex":0.0007898645,"about_ca_system_score_gemma":0.00144765,"threshold_uncertainty_score":0.014422119},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20428304,0.0025943022,0.5243695,0.0036367273,0.0012394186,0.0002414184,0.005936644,0.0041900272,0.2535089],"genre_scores_gemma":[0.73291963,0.0032734703,0.12276963,0.0017064861,0.0008722335,0.00029354743,0.0044339076,0.0018387696,0.13189238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939024,0.00014359615,0.00005597661,0.00011676256,0.00017810668,0.000115283656],"domain_scores_gemma":[0.9989905,0.0002460885,0.00011886417,0.00028384532,0.00027614407,0.00008459567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006574644,0.0009901603,0.0005739084,0.0016070871,0.0006262583,0.002453273,0.0006573626,0.0006091714,0.023330623],"category_scores_gemma":[0.0022400026,0.0004273299,0.00067723583,0.0023022592,0.0009078922,0.0027562066,0.0013158765,0.0019022829,0.011052358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005202174,0.000068609945,0.0004983515,0.00028189964,0.000043107408,0.00047529594,0.0004420726,0.005581914,0.013344697,0.81307906,0.02842315,0.13724156],"study_design_scores_gemma":[0.00014014338,0.00021561004,0.0016571148,0.00020719318,0.00006636789,0.0013196006,0.00028529356,0.028516706,0.01939218,0.80949295,0.13856725,0.00013959728],"about_ca_topic_score_codex":0.001141109,"about_ca_topic_score_gemma":0.0013738025,"teacher_disagreement_score":0.023330623,"about_ca_system_score_codex":0.0011659496,"about_ca_system_score_gemma":0.0006919245,"threshold_uncertainty_score":0.078048706},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.410651,0.002623019,0.34662026,0.013382597,0.0007047598,0.0003600278,0.0035726966,0.000571457,0.22151415],"genre_scores_gemma":[0.90858036,0.00074334483,0.053211596,0.0009248177,0.000810283,0.00025715734,0.0018778092,0.0002516998,0.03334293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812144,0.0007435932,0.000059850874,0.00039959932,0.0002825814,0.00039291423],"domain_scores_gemma":[0.9936162,0.004821225,0.0006329637,0.00030752606,0.0003077317,0.00031436075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019304804,0.0013512464,0.0017099736,0.00097638945,0.0015025209,0.0041715596,0.0023157916,0.0045675854,0.01634137],"category_scores_gemma":[0.0120065585,0.00078612874,0.0010882802,0.001909546,0.002240932,0.0039271987,0.0021194536,0.0035547887,0.0010860396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007490385,0.00051961205,0.001505434,0.00094914396,0.00012850168,0.0009273733,0.00033767652,0.12419275,0.0016616202,0.7882046,0.04090889,0.03991532],"study_design_scores_gemma":[0.00014717961,0.00005537826,0.00059964147,0.00005692724,0.00002593023,0.00025017982,0.00019241679,0.21875444,0.0005358433,0.7759447,0.0034045419,0.00003273983],"about_ca_topic_score_codex":0.0037253827,"about_ca_topic_score_gemma":0.0041899425,"teacher_disagreement_score":0.01634137,"about_ca_system_score_codex":0.0014032926,"about_ca_system_score_gemma":0.0013483089,"threshold_uncertainty_score":0.054667294},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070607014,0.0010779344,0.91389865,0.0008165407,0.00009965171,0.0005922348,0.001065806,0.0030658776,0.008776224],"genre_scores_gemma":[0.24152622,0.00061118626,0.74679476,0.00018934283,0.00010042744,0.0005103308,0.0035074102,0.00054060953,0.0062197344],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884725,0.00022415367,0.000081894905,0.0003457938,0.00030699855,0.000193881],"domain_scores_gemma":[0.9935045,0.0042065554,0.0004506915,0.0008948057,0.0006835168,0.0002599564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009973975,0.0018342503,0.0015639463,0.0038429801,0.001762347,0.002359949,0.0033697193,0.0016464879,0.009637757],"category_scores_gemma":[0.008211685,0.0011268632,0.0013656729,0.0035012288,0.0013083384,0.004683338,0.0030624745,0.0019695181,0.001861994],"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.0011318139,0.0006047138,0.0038399221,0.001228,0.00016912108,0.00032235688,0.0008450105,0.078978956,0.020170666,0.11449356,0.036072783,0.7421432],"study_design_scores_gemma":[0.0005994813,0.00020902402,0.0015203493,0.00012952858,0.00023353132,0.00046985238,0.0005785859,0.4772247,0.015504001,0.4901829,0.013292308,0.000055730594],"about_ca_topic_score_codex":0.0035603838,"about_ca_topic_score_gemma":0.007312667,"teacher_disagreement_score":0.009637757,"about_ca_system_score_codex":0.0020426852,"about_ca_system_score_gemma":0.0022487263,"threshold_uncertainty_score":0.032241464},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019228503,0.0003358272,0.963252,0.00020532054,0.00018208494,0.000040962997,0.00007049345,0.00033468165,0.01635015],"genre_scores_gemma":[0.68758464,0.001133725,0.28802365,0.00016622109,0.00023216647,0.00012264418,0.00014090394,0.00015281084,0.02244324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99987173,0.00002728124,0.0000052632495,0.000028448003,0.000048415597,0.00001886441],"domain_scores_gemma":[0.99963176,0.00015147845,0.000036889393,0.000046361274,0.00010456585,0.00002888735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026077006,0.00055512186,0.00036105717,0.0005056691,0.0004069822,0.00084895844,0.00045094747,0.0007533194,0.0047444296],"category_scores_gemma":[0.001205813,0.00035620746,0.00035760368,0.0005233196,0.00038053168,0.00074322394,0.00073258503,0.0006932935,0.0009148277],"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.00020906392,0.00008303514,0.0007053539,0.00018244593,0.000035147455,0.00022049395,0.0001858827,0.4135503,0.032645583,0.3775379,0.0037070436,0.17093778],"study_design_scores_gemma":[0.000021157275,0.000060062324,0.00014443477,0.000033710487,0.00002253521,0.0001691742,0.00003697151,0.9204259,0.008363565,0.06406335,0.0066396953,0.00001940803],"about_ca_topic_score_codex":0.00044112466,"about_ca_topic_score_gemma":0.0007286574,"teacher_disagreement_score":0.0047444296,"about_ca_system_score_codex":0.00057495385,"about_ca_system_score_gemma":0.0004393267,"threshold_uncertainty_score":0.015871763},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010081684,0.023486866,0.9397859,0.0015679857,0.0018733848,0.000040621395,0.0002055182,0.00025417228,0.022703912],"genre_scores_gemma":[0.34770253,0.04779532,0.55994064,0.00083008164,0.0037757764,0.0003266266,0.0005436786,0.0002872662,0.03879813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.0002244421,0.000046700658,0.00008822526,0.00030101146,0.00004697761],"domain_scores_gemma":[0.9973568,0.0017877391,0.00021687466,0.00017634426,0.00036094745,0.00010136038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009583357,0.001530286,0.0015692747,0.0018538374,0.0010405594,0.0029187223,0.0012000637,0.0015306409,0.0071350695],"category_scores_gemma":[0.006189135,0.0008287746,0.0008043978,0.0068347026,0.0020198028,0.0029841906,0.0011915802,0.0035855696,0.0012461762],"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.000080247584,0.000103067054,0.0002924206,0.00042708352,0.000048823713,0.00012882042,0.00019169565,0.2142266,0.0011634239,0.67128456,0.007830761,0.1042225],"study_design_scores_gemma":[0.00001514138,0.00002571696,0.00014419493,0.00004860431,0.000013820582,0.00006785495,0.00007949488,0.25755364,0.00036352413,0.7292963,0.012370718,0.000020929727],"about_ca_topic_score_codex":0.0032042083,"about_ca_topic_score_gemma":0.00484874,"teacher_disagreement_score":0.0071350695,"about_ca_system_score_codex":0.0012758469,"about_ca_system_score_gemma":0.0010853565,"threshold_uncertainty_score":0.023869157},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11092302,0.0015081236,0.7842514,0.0058529694,0.0002886124,0.000992765,0.01699941,0.0015540285,0.077629685],"genre_scores_gemma":[0.33302072,0.0022334985,0.59515595,0.0005337304,0.000348412,0.0016911079,0.021191275,0.0011099343,0.04471541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99582905,0.0013563649,0.00036465217,0.0010177657,0.0008766826,0.00055550446],"domain_scores_gemma":[0.9835127,0.0124499975,0.0015513211,0.0009364336,0.0009789781,0.0005704837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042874245,0.0030054187,0.0032092184,0.00331695,0.0018868642,0.00870277,0.004534999,0.0033529482,0.028756006],"category_scores_gemma":[0.02449289,0.0020303067,0.0031681694,0.0076473937,0.0016941767,0.009874096,0.002182351,0.0036337555,0.0036982638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007822092,0.0005829721,0.004123009,0.002063245,0.00044077222,0.00040132154,0.00048287906,0.25337163,0.0022473861,0.5295867,0.04819286,0.15772505],"study_design_scores_gemma":[0.00019360553,0.00015890086,0.0010420034,0.00019138206,0.00014654263,0.00022101274,0.00018816537,0.31325176,0.00237159,0.670446,0.011712007,0.00007703314],"about_ca_topic_score_codex":0.0051366007,"about_ca_topic_score_gemma":0.00786577,"teacher_disagreement_score":0.028756006,"about_ca_system_score_codex":0.0032769488,"about_ca_system_score_gemma":0.0046015345,"threshold_uncertainty_score":0.09619838},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5255112,0.000526216,0.34348875,0.0026500977,0.00047259658,0.0001846327,0.0008971871,0.000635265,0.12563401],"genre_scores_gemma":[0.960141,0.00018885976,0.017190197,0.00046268682,0.00022677353,0.0001251677,0.00032731262,0.00012814696,0.021209868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975555,0.000824133,0.0000914881,0.00045341477,0.00032056516,0.00075493456],"domain_scores_gemma":[0.9888586,0.005497206,0.0011972476,0.0016172795,0.00073491636,0.002094804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019347371,0.0006540608,0.0018305575,0.0010047259,0.0030967866,0.004913515,0.0013317836,0.0021875873,0.018573912],"category_scores_gemma":[0.011346635,0.00058458274,0.0010074419,0.0017105214,0.0023749343,0.003900591,0.002668916,0.0028471332,0.0013992285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004985388,0.00011383107,0.0017726879,0.000068381574,0.00008479925,0.00034731798,0.00034637275,0.008668471,0.0016775519,0.96029234,0.008286173,0.017843544],"study_design_scores_gemma":[0.00016250196,0.00008870773,0.00094520574,0.000014541812,0.000023098244,0.0002685679,0.00015881512,0.029187078,0.0004417147,0.9639482,0.0047341487,0.000027376582],"about_ca_topic_score_codex":0.0018524121,"about_ca_topic_score_gemma":0.0019809136,"teacher_disagreement_score":0.018573912,"about_ca_system_score_codex":0.0008360429,"about_ca_system_score_gemma":0.001148344,"threshold_uncertainty_score":0.062135935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12622215,0.0027685913,0.4889293,0.02430819,0.0013251235,0.00011696922,0.0008477401,0.0009148842,0.35456708],"genre_scores_gemma":[0.9511598,0.0009921079,0.026509387,0.0019106682,0.0010113486,0.00011033034,0.00031198002,0.0002714992,0.017723018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710065,0.0009090369,0.00016605263,0.00056470354,0.00091673376,0.00034289664],"domain_scores_gemma":[0.98372155,0.010691886,0.0006119137,0.0029220886,0.0014196829,0.00063283497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046208296,0.0005795164,0.0013827151,0.0016959315,0.0022966748,0.00515898,0.0022090487,0.0024382945,0.017499667],"category_scores_gemma":[0.02165646,0.00072634564,0.0012328693,0.0015640603,0.0063377596,0.019089464,0.0051908134,0.0053320057,0.0022406208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006298392,0.000016008973,0.00015386382,0.000042278225,0.000011774405,0.0000448604,0.000076817065,0.00037958528,0.00033713458,0.9936376,0.0012923888,0.003944577],"study_design_scores_gemma":[0.0000219855,0.000009346884,0.00009687901,0.000011054675,0.000010168225,0.00006801297,0.0000263794,0.0017925707,0.0005077235,0.9953434,0.002105644,0.000006829547],"about_ca_topic_score_codex":0.00044023426,"about_ca_topic_score_gemma":0.0002846151,"teacher_disagreement_score":0.017499667,"about_ca_system_score_codex":0.0013412245,"about_ca_system_score_gemma":0.0012119464,"threshold_uncertainty_score":0.058542192},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69467247,0.004345561,0.25396147,0.010210253,0.0002638974,0.000071848925,0.0014482731,0.00028363056,0.03474263],"genre_scores_gemma":[0.95744497,0.0020222978,0.034134302,0.00041332177,0.0005155718,0.00011796117,0.00075837655,0.00010577742,0.004487441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971782,0.0012334125,0.00015478981,0.0006230387,0.0005054814,0.0003050995],"domain_scores_gemma":[0.96219283,0.028908806,0.0032482662,0.0025227643,0.0011137131,0.0020136058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028303878,0.00086661044,0.0017479464,0.004018077,0.002947607,0.0067092734,0.003109323,0.0030764048,0.0047544623],"category_scores_gemma":[0.017517466,0.0011522076,0.0015049215,0.0050583426,0.008471002,0.012268657,0.0040588905,0.0056067337,0.00042163176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006625895,0.000020812153,0.0008340963,0.0000680913,0.000020721804,0.000033474105,0.00031705268,0.0047571245,0.0004521341,0.98826176,0.00083641545,0.004331983],"study_design_scores_gemma":[0.000011701706,0.000010110433,0.00028599193,0.000013686696,0.000008798399,0.000059596827,0.00008989614,0.008150163,0.00022012032,0.990026,0.0011106977,0.000013160886],"about_ca_topic_score_codex":0.0014410033,"about_ca_topic_score_gemma":0.0011234317,"teacher_disagreement_score":0.0067092734,"about_ca_system_score_codex":0.002474595,"about_ca_system_score_gemma":0.00083511136,"threshold_uncertainty_score":0.017954528},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61873,0.00030085075,0.27310276,0.0020999785,0.00016333014,0.00036517793,0.0006864785,0.00053341896,0.10401794],"genre_scores_gemma":[0.95572484,0.00033757684,0.027058722,0.0006519481,0.00011926591,0.00043308994,0.00064989424,0.00013934572,0.014885225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973226,0.0009890889,0.00014959766,0.00052574323,0.00033047024,0.0006825068],"domain_scores_gemma":[0.9842939,0.010494508,0.0017470616,0.0010775987,0.0008677953,0.0015192151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022313264,0.0013258157,0.0018437341,0.0019062789,0.0031332343,0.003768932,0.0018301142,0.0026381689,0.006858803],"category_scores_gemma":[0.012515933,0.0011350369,0.0015873995,0.001815465,0.0042433497,0.0072353836,0.003353407,0.003106605,0.0007520431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013092683,0.00006359819,0.0002975523,0.00006025187,0.000018137085,0.000090032765,0.00023615583,0.0048404513,0.0008406158,0.98918355,0.0010940718,0.0031446724],"study_design_scores_gemma":[0.000065436485,0.000029337016,0.00016179321,0.000015568236,0.000015518326,0.000044952783,0.000073742696,0.018553209,0.00037166846,0.97995275,0.00070197176,0.000014029456],"about_ca_topic_score_codex":0.0022645527,"about_ca_topic_score_gemma":0.0030518307,"teacher_disagreement_score":0.006858803,"about_ca_system_score_codex":0.002226033,"about_ca_system_score_gemma":0.0020951729,"threshold_uncertainty_score":0.022944987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72648025,0.005199327,0.16404682,0.0039471076,0.00033809972,0.000119388336,0.0014557523,0.00022611956,0.09818703],"genre_scores_gemma":[0.94616604,0.0027894464,0.024538925,0.0005513931,0.0005954844,0.0001598801,0.0010439153,0.00009291475,0.024061883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872214,0.0003133767,0.00006524411,0.0002670079,0.0004035954,0.00022857614],"domain_scores_gemma":[0.99308103,0.004930171,0.0006552809,0.00045553685,0.00033648236,0.0005415211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012619747,0.001017854,0.0013503073,0.0025652058,0.0021962738,0.0043142335,0.0017093616,0.0013050528,0.0057051172],"category_scores_gemma":[0.006457169,0.0009412572,0.0010678296,0.0035404456,0.0032668465,0.0065041245,0.003062574,0.0024629484,0.0005042011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032519468,0.00007324179,0.0019288519,0.00017703153,0.000070120936,0.0002667242,0.0006731783,0.01187066,0.001588588,0.96527725,0.0028424666,0.014906711],"study_design_scores_gemma":[0.000055371063,0.000034644247,0.0012531625,0.00003775287,0.000062173836,0.00058591465,0.0002891265,0.023420215,0.00084691466,0.96731365,0.0060843495,0.000016708123],"about_ca_topic_score_codex":0.0010239211,"about_ca_topic_score_gemma":0.0010875086,"teacher_disagreement_score":0.0057051172,"about_ca_system_score_codex":0.001536883,"about_ca_system_score_gemma":0.0004984639,"threshold_uncertainty_score":0.019085526},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42081857,0.003263538,0.48825747,0.0057631494,0.00027810983,0.00014525895,0.0009107897,0.00017109356,0.08039203],"genre_scores_gemma":[0.8381218,0.0030454167,0.12401743,0.00048668403,0.00071532256,0.0002706367,0.0008859237,0.00017246805,0.03228431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900144,0.0005033443,0.000036647954,0.00017471444,0.00018979637,0.00009399634],"domain_scores_gemma":[0.9929174,0.005218903,0.0008161982,0.00027342397,0.00024742653,0.0005265938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016912775,0.00077934196,0.00079897244,0.0020842003,0.0018114074,0.0027602792,0.0016874976,0.003469055,0.011475189],"category_scores_gemma":[0.011046674,0.0006955688,0.00085692643,0.0035107075,0.0020230755,0.007320297,0.0025905506,0.0024424966,0.0007040191],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011860237,0.00007662381,0.0014749927,0.00011304627,0.000032967877,0.00020164922,0.00026188514,0.033621598,0.000538386,0.940035,0.003031613,0.020493658],"study_design_scores_gemma":[0.000017458577,0.000023363495,0.00035168318,0.000025637668,0.000017734628,0.000105800325,0.0001338396,0.03913535,0.00017257032,0.95623773,0.003768788,0.000009967102],"about_ca_topic_score_codex":0.00086184946,"about_ca_topic_score_gemma":0.0007283127,"teacher_disagreement_score":0.011475189,"about_ca_system_score_codex":0.00071679265,"about_ca_system_score_gemma":0.0005275234,"threshold_uncertainty_score":0.038388312},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6327022,0.0009730141,0.2162201,0.0011845161,0.00027069237,0.00028788298,0.0034763638,0.0005806302,0.1443047],"genre_scores_gemma":[0.6215021,0.0012619031,0.31999585,0.00043578816,0.00014193947,0.00050867087,0.0056772786,0.00054665556,0.04992989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889696,0.00026918922,0.00010900776,0.00021115551,0.00029842946,0.00021526721],"domain_scores_gemma":[0.9975757,0.0012541855,0.00035930722,0.00033435522,0.0002371881,0.00023922285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050138595,0.0007581768,0.0013425696,0.00096407253,0.0014051113,0.0032918467,0.0018364028,0.0011532991,0.015949951],"category_scores_gemma":[0.0027424751,0.0009081284,0.0008117804,0.002554042,0.0010993378,0.0023366583,0.0025077702,0.002006921,0.0025321336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015714866,0.00048346925,0.005578826,0.0010909751,0.00015314018,0.0009948761,0.0009416694,0.03479607,0.03810805,0.7623738,0.021286575,0.13262098],"study_design_scores_gemma":[0.0004061563,0.0004816574,0.0065486636,0.00039567836,0.00015580308,0.0020687822,0.0018239068,0.13527173,0.023922643,0.7594519,0.069347836,0.00012518401],"about_ca_topic_score_codex":0.0010219164,"about_ca_topic_score_gemma":0.0017488961,"teacher_disagreement_score":0.015949951,"about_ca_system_score_codex":0.0006409361,"about_ca_system_score_gemma":0.0007429127,"threshold_uncertainty_score":0.05335796},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30108544,0.0014805758,0.41290656,0.0037301425,0.0013830662,0.00026318833,0.001309467,0.0014166061,0.27642494],"genre_scores_gemma":[0.85717326,0.0015529802,0.08128564,0.0015836734,0.0012779353,0.00019114019,0.0010043178,0.00038550707,0.055545576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937576,0.00012088594,0.000044647295,0.00024261781,0.0001146627,0.00010150679],"domain_scores_gemma":[0.9987991,0.00028823141,0.0001546759,0.00036470633,0.0001794087,0.00021381008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007856955,0.0005706311,0.00067014963,0.0013036683,0.0012405744,0.0016599031,0.0011244521,0.0010121424,0.009786847],"category_scores_gemma":[0.0027487932,0.00032012153,0.0015730065,0.001341956,0.0013297803,0.0053733606,0.0029141451,0.00324148,0.0013522169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053749405,0.00005314601,0.00034760713,0.00009424179,0.000014327851,0.00019539816,0.00029154442,0.0013457147,0.0022681395,0.97631615,0.0036205554,0.015399346],"study_design_scores_gemma":[0.000013168219,0.00002250795,0.00037371437,0.000022523755,0.0000143906145,0.00035240303,0.00009678597,0.004299923,0.00082536705,0.9829008,0.011067735,0.000010611216],"about_ca_topic_score_codex":0.0010006416,"about_ca_topic_score_gemma":0.00079174916,"teacher_disagreement_score":0.009786847,"about_ca_system_score_codex":0.0007700132,"about_ca_system_score_gemma":0.0005054079,"threshold_uncertainty_score":0.032740235},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115616985,0.000809862,0.8388294,0.0019173335,0.00011327927,0.000158,0.00029876694,0.00021141306,0.042044956],"genre_scores_gemma":[0.8824091,0.00059104414,0.105599545,0.0002876489,0.00015760807,0.00025016908,0.0001951869,0.00009933052,0.010410356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610656,0.0023739182,0.00013648908,0.0005606862,0.00049667526,0.00032564715],"domain_scores_gemma":[0.9924481,0.004851896,0.00079472415,0.0009443823,0.00051996135,0.00044099014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036562365,0.0009786697,0.0014197775,0.0016346641,0.0012187811,0.0039927145,0.0030143461,0.0019082332,0.009537213],"category_scores_gemma":[0.011587167,0.000667199,0.001673608,0.002266936,0.0034609295,0.008265255,0.002421226,0.0031608965,0.00073474477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007024213,0.000036263013,0.00018452198,0.0000747184,0.000045460376,0.000065189815,0.00017437783,0.060804654,0.00041304683,0.92997974,0.0006157212,0.007535989],"study_design_scores_gemma":[0.000022025346,0.000020964264,0.000069634334,0.000012156964,0.000019926385,0.0000352893,0.000047214242,0.11354568,0.00012959218,0.8852563,0.00082673936,0.000014441929],"about_ca_topic_score_codex":0.0023663647,"about_ca_topic_score_gemma":0.0026375405,"teacher_disagreement_score":0.009537213,"about_ca_system_score_codex":0.0020959417,"about_ca_system_score_gemma":0.0014144186,"threshold_uncertainty_score":0.031905174},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2017714,0.002478415,0.16499442,0.007290224,0.0006486178,0.000089793015,0.00059218507,0.00020414656,0.6219307],"genre_scores_gemma":[0.85674065,0.0023505883,0.026983649,0.0012750796,0.00080805295,0.00017373741,0.0007156018,0.00019311014,0.11075952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995741,0.000103962935,0.000013917065,0.000044319502,0.00018483303,0.00007882223],"domain_scores_gemma":[0.9992532,0.00028338114,0.00006209511,0.00003776574,0.00017879136,0.00018477881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068150775,0.0006608889,0.0009109874,0.00165168,0.0024958195,0.0026900994,0.0008530664,0.0011122507,0.008853906],"category_scores_gemma":[0.0022787894,0.00033270894,0.0005112986,0.001141893,0.0023000347,0.0028666542,0.0015180403,0.0033087549,0.0011268406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016134876,0.000007849829,0.00003749808,0.000010971259,0.0000015483935,0.000020601798,0.0000403466,0.0004998411,0.00014636146,0.9963935,0.0013357766,0.0014896381],"study_design_scores_gemma":[0.0000101299365,0.0000048048755,0.00007960703,0.000010516635,0.000001107492,0.000023189823,0.000027399885,0.005149536,0.00005378504,0.99247426,0.0021617438,0.0000038552485],"about_ca_topic_score_codex":0.0045405757,"about_ca_topic_score_gemma":0.0033306691,"teacher_disagreement_score":0.008853906,"about_ca_system_score_codex":0.0015712162,"about_ca_system_score_gemma":0.0009891593,"threshold_uncertainty_score":0.029619277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0125203,0.009670072,0.817213,0.033201225,0.007896804,0.000059758757,0.00023908721,0.0011491596,0.118050605],"genre_scores_gemma":[0.5094477,0.015886137,0.38059658,0.011759711,0.0064984714,0.0002606682,0.00026179824,0.0015770381,0.0737119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987795,0.00039415274,0.00005799408,0.00035485794,0.00025795324,0.00015554398],"domain_scores_gemma":[0.99122626,0.0044764853,0.00026364293,0.0031605307,0.00044875237,0.0004243007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019743952,0.0007202719,0.00094405765,0.0006045653,0.002276163,0.0035263412,0.0033300333,0.004221084,0.021284824],"category_scores_gemma":[0.013987854,0.000712202,0.0013248451,0.0012234208,0.0061646313,0.015913932,0.003572294,0.007369327,0.003708336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007272367,0.000023105706,0.00018341791,0.000088867666,0.000024654182,0.00014893166,0.00025624133,0.010185177,0.0019130193,0.9174375,0.024508456,0.045157943],"study_design_scores_gemma":[0.000015016822,0.000030840918,0.00010854689,0.000041101444,0.0000151331715,0.00011828454,0.000113976916,0.013075497,0.0009406586,0.92439914,0.061108764,0.00003307981],"about_ca_topic_score_codex":0.0017409091,"about_ca_topic_score_gemma":0.0025216546,"teacher_disagreement_score":0.021284824,"about_ca_system_score_codex":0.0007467748,"about_ca_system_score_gemma":0.0008022135,"threshold_uncertainty_score":0.07120484},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7312375,0.0012734891,0.2456714,0.0012961596,0.00009737041,0.00017690503,0.0023465261,0.00075861474,0.017141957],"genre_scores_gemma":[0.83536774,0.00086460216,0.1473979,0.00034603698,0.0001270526,0.00017056034,0.00504966,0.0004340208,0.010242422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926776,0.00022096581,0.00004399132,0.00017545337,0.00015293364,0.00013894813],"domain_scores_gemma":[0.99475926,0.0026497766,0.00072277524,0.00058338186,0.00062520034,0.0006596168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010435609,0.0006444357,0.0017173503,0.0015511726,0.0013097591,0.0026602598,0.0014721013,0.0016689729,0.0061750896],"category_scores_gemma":[0.007437966,0.00092105404,0.0005810659,0.0020024441,0.00077088905,0.0041994113,0.0010769777,0.0018101317,0.0011705941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017178657,0.0008286567,0.010587387,0.0016307401,0.0003866785,0.0010309175,0.0021473486,0.10705709,0.035434846,0.5578475,0.038727067,0.24260403],"study_design_scores_gemma":[0.00010831978,0.00018722763,0.0032797467,0.00008262379,0.00013090755,0.0005464921,0.00061198405,0.17582487,0.0039804564,0.8092255,0.005994873,0.000026984122],"about_ca_topic_score_codex":0.0005902982,"about_ca_topic_score_gemma":0.0016798355,"teacher_disagreement_score":0.0061750896,"about_ca_system_score_codex":0.00072389183,"about_ca_system_score_gemma":0.0007153903,"threshold_uncertainty_score":0.020657778},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06437522,0.0017677605,0.8658007,0.0019395186,0.0006623459,0.00038155672,0.0010268617,0.0062506613,0.057795405],"genre_scores_gemma":[0.4625618,0.0009961001,0.49015918,0.0011600405,0.0007576851,0.00085657986,0.0022368322,0.0019427098,0.03932896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99494815,0.0015679398,0.0002517887,0.001033424,0.0013645387,0.0008341202],"domain_scores_gemma":[0.9856111,0.0066955322,0.00048362275,0.0045317635,0.0017526225,0.0009253824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005077902,0.00196073,0.0027424386,0.0028368267,0.002548967,0.003884078,0.00720961,0.002571334,0.02257573],"category_scores_gemma":[0.019684186,0.0011356717,0.0019696222,0.00378927,0.0021030977,0.007543852,0.008013256,0.005036971,0.0046005035],"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.002285381,0.0011061927,0.0017305613,0.0007328328,0.00024634696,0.00010193406,0.00068867765,0.1108878,0.01126833,0.38461494,0.062663674,0.42367333],"study_design_scores_gemma":[0.00044554364,0.00017152503,0.00058338617,0.00007087713,0.00015605189,0.00010640231,0.00008426722,0.53769106,0.0056694513,0.44034982,0.014610159,0.00006149918],"about_ca_topic_score_codex":0.0024889305,"about_ca_topic_score_gemma":0.003848709,"teacher_disagreement_score":0.02257573,"about_ca_system_score_codex":0.0032342812,"about_ca_system_score_gemma":0.0038583183,"threshold_uncertainty_score":0.07552338},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72282624,0.0014405175,0.24931136,0.0015246389,0.00015973316,0.00003703411,0.0013927225,0.00051272573,0.022794923],"genre_scores_gemma":[0.98170555,0.0012617344,0.01250328,0.00014501956,0.00021115177,0.000061258856,0.00061070913,0.00008157506,0.0034197716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995503,0.000112860704,0.000021732541,0.00016029454,0.00009185368,0.00006297714],"domain_scores_gemma":[0.99438226,0.0037362338,0.0006287458,0.00034675916,0.00041806058,0.00048795086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059391925,0.0005290925,0.00093079446,0.0023573842,0.00094312534,0.0022212965,0.0014074476,0.0009908245,0.003996953],"category_scores_gemma":[0.0065329117,0.0004558186,0.00046865182,0.0024176924,0.0013757907,0.003844402,0.0008746448,0.0009445745,0.000312985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019122263,0.00005761197,0.0049914406,0.00028080872,0.000115027906,0.0004068801,0.00051377545,0.14244975,0.0063665677,0.80315,0.005211071,0.036265764],"study_design_scores_gemma":[0.000028975612,0.00006794703,0.0027851788,0.000034437955,0.00006852875,0.0004400233,0.00013406061,0.26333675,0.0010999151,0.7284456,0.0035275477,0.00003115854],"about_ca_topic_score_codex":0.0016790088,"about_ca_topic_score_gemma":0.0016672036,"teacher_disagreement_score":0.003996953,"about_ca_system_score_codex":0.0010871321,"about_ca_system_score_gemma":0.0005203159,"threshold_uncertainty_score":0.01337111},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68665767,0.00089756463,0.26046252,0.0010930551,0.00025856405,0.000050835708,0.00049841544,0.0006569078,0.049424402],"genre_scores_gemma":[0.96613634,0.00020841292,0.024001261,0.00015993371,0.000056509107,0.00004076686,0.0002756482,0.0001339081,0.008987127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995808,0.00007473088,0.00001906987,0.000098034594,0.00008463169,0.00014277818],"domain_scores_gemma":[0.99718875,0.0011924477,0.00045788722,0.0003753905,0.00030288377,0.0004826144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031043467,0.00030772813,0.0007880665,0.00086398073,0.0012609347,0.0027390032,0.001037469,0.0010702875,0.007239519],"category_scores_gemma":[0.0026951048,0.0004635747,0.00050330197,0.0007564022,0.001849555,0.0019575963,0.0016631752,0.001414977,0.00070838083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066088524,0.00011731385,0.00726998,0.00014038019,0.00004837379,0.0005773022,0.00085309165,0.07904752,0.009224981,0.8734988,0.0070175747,0.021543743],"study_design_scores_gemma":[0.000119876866,0.00009286744,0.0037321367,0.000044205754,0.000028504768,0.00077631144,0.0011528346,0.2690029,0.0070739025,0.70815176,0.009774576,0.00005006589],"about_ca_topic_score_codex":0.0038562026,"about_ca_topic_score_gemma":0.002406367,"teacher_disagreement_score":0.007239519,"about_ca_system_score_codex":0.0009620512,"about_ca_system_score_gemma":0.00048084944,"threshold_uncertainty_score":0.024218619},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85911894,0.0008694113,0.08661397,0.0013366437,0.000303161,0.00007884514,0.00051510544,0.0003881919,0.05077573],"genre_scores_gemma":[0.97799575,0.00042249085,0.009336274,0.00022971688,0.00017168597,0.00005676183,0.0003213649,0.00012235009,0.011343497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923015,0.00023495535,0.000044944598,0.00013270105,0.00018751774,0.00016985077],"domain_scores_gemma":[0.9965798,0.0015025283,0.0006123008,0.00044566632,0.00028552278,0.00057425105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010229469,0.00048268453,0.00087641925,0.002193667,0.0023863497,0.0037278929,0.0007119519,0.0011160711,0.0071592154],"category_scores_gemma":[0.0048002396,0.0008793775,0.00060900854,0.0019723733,0.003121459,0.0050389385,0.0022909944,0.001497093,0.0006968493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009098219,0.000016006683,0.0005253968,0.000029974344,0.000006067605,0.00008231449,0.00035691986,0.002144178,0.00068224705,0.99118716,0.0011553175,0.0037234474],"study_design_scores_gemma":[0.00001602925,0.000013006446,0.00034656198,0.000011272405,0.000008061327,0.00009533763,0.00020009953,0.004085019,0.00040232806,0.9934521,0.0013620841,0.0000081238095],"about_ca_topic_score_codex":0.0008716497,"about_ca_topic_score_gemma":0.0013462239,"teacher_disagreement_score":0.0071592154,"about_ca_system_score_codex":0.0011658008,"about_ca_system_score_gemma":0.0007259709,"threshold_uncertainty_score":0.023949921},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.070942834,0.00030919132,0.92593384,0.00040813023,0.000076879514,0.00003838933,0.00012087421,0.0003809351,0.0017888643],"genre_scores_gemma":[0.43956465,0.0003172089,0.55114824,0.00014140792,0.00008375154,0.00014333891,0.00056906417,0.00061348686,0.007418886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998566,0.00045685028,0.000091348404,0.00021385784,0.0005819641,0.000090043664],"domain_scores_gemma":[0.9902935,0.0071243136,0.00054739724,0.0009175068,0.0008046925,0.00031266952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003271595,0.0013077684,0.0015968044,0.0012750408,0.00050864863,0.0019538975,0.002053937,0.0034050955,0.0025145449],"category_scores_gemma":[0.014845967,0.0008912711,0.00074939,0.0011311792,0.0020255395,0.003041335,0.0036526464,0.0025529854,0.0008199418],"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.001005809,0.00012239984,0.0012039142,0.00042049034,0.000101122554,0.0001175989,0.00024431842,0.8234577,0.014402097,0.039453354,0.0023870554,0.11708412],"study_design_scores_gemma":[0.000011466402,0.000044894616,0.00008439645,0.00001627283,0.0000045308543,0.000021694614,0.000021567952,0.9873301,0.0029619515,0.009130203,0.0003648351,0.000008212027],"about_ca_topic_score_codex":0.0018113186,"about_ca_topic_score_gemma":0.001734379,"teacher_disagreement_score":0.0034050955,"about_ca_system_score_codex":0.0012091536,"about_ca_system_score_gemma":0.0011537672,"threshold_uncertainty_score":0.017302036},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50001407,0.0009509647,0.35500595,0.0019266477,0.00066068565,0.00018079531,0.0008484772,0.0012353632,0.13917711],"genre_scores_gemma":[0.92182213,0.000522292,0.035424713,0.000466818,0.0003547366,0.0001468279,0.00062180066,0.00031026808,0.040330477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994081,0.000133783,0.00003220028,0.00017921995,0.000108537686,0.00013820558],"domain_scores_gemma":[0.9982364,0.00071442,0.00022278621,0.0002823602,0.00017283607,0.0003711767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042738975,0.0005216542,0.00074397295,0.0019854656,0.0021573522,0.003302273,0.0010025701,0.0009913893,0.015570267],"category_scores_gemma":[0.0028109404,0.00051397487,0.00082445226,0.0019351772,0.0016721331,0.0047280705,0.0016458797,0.0019405659,0.0017481212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005322332,0.000032419084,0.0001542886,0.000027457572,0.000006322828,0.00008376702,0.0003045504,0.00079004874,0.0009872846,0.9882386,0.0014976751,0.007824397],"study_design_scores_gemma":[0.000016104555,0.000016970494,0.00022555387,0.000009007531,0.0000099456975,0.0001717541,0.00015790047,0.0062573664,0.0007724889,0.98940897,0.0029400985,0.000013837592],"about_ca_topic_score_codex":0.0010890181,"about_ca_topic_score_gemma":0.0013756604,"teacher_disagreement_score":0.015570267,"about_ca_system_score_codex":0.0009480313,"about_ca_system_score_gemma":0.00049134117,"threshold_uncertainty_score":0.052087665},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045564897,0.0007015476,0.9387875,0.0009839659,0.00015216618,0.00016055221,0.00022299016,0.0014947227,0.011931632],"genre_scores_gemma":[0.3941667,0.0006784477,0.5869834,0.0004395201,0.00026518275,0.00036092688,0.00073084387,0.0007838559,0.015591168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99303126,0.0022025874,0.00043502005,0.0012793232,0.0022366212,0.00081506505],"domain_scores_gemma":[0.9815314,0.012363836,0.0006041058,0.0036468934,0.0011969773,0.0006568043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004227854,0.0013953454,0.0024863072,0.0017689678,0.0024143828,0.00733865,0.0040674442,0.0018916532,0.008859502],"category_scores_gemma":[0.017904386,0.0015069691,0.0014309795,0.0033370005,0.0037415524,0.015862353,0.0058794827,0.0040058238,0.0017568668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052762864,0.000246514,0.0005823682,0.00021922818,0.00006689118,0.000064178734,0.00035642952,0.04399001,0.0027647878,0.842374,0.006310205,0.10249771],"study_design_scores_gemma":[0.00011604115,0.000031716623,0.00007777672,0.000018555784,0.000025572253,0.000045960882,0.000060705697,0.12211766,0.0026895548,0.871162,0.0036383718,0.00001602878],"about_ca_topic_score_codex":0.0020627484,"about_ca_topic_score_gemma":0.0034968457,"teacher_disagreement_score":0.008859502,"about_ca_system_score_codex":0.0036830867,"about_ca_system_score_gemma":0.0029549398,"threshold_uncertainty_score":0.029638052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43283743,0.0011445389,0.43618128,0.0016392525,0.00043298476,0.00015148988,0.00072091934,0.0008075581,0.12608449],"genre_scores_gemma":[0.88608414,0.00068968884,0.058105294,0.000238805,0.00018142757,0.000104200495,0.0005362527,0.00032697446,0.05373313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995832,0.00009434844,0.000016720103,0.00010132116,0.00010878895,0.00009566218],"domain_scores_gemma":[0.9982395,0.0009296742,0.00018917455,0.00021211168,0.00016403967,0.00026550854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039677354,0.00074627355,0.0010427431,0.0012443052,0.0018073759,0.002074552,0.0017207076,0.0014919875,0.014496963],"category_scores_gemma":[0.00441151,0.0004853096,0.0007145583,0.0009864504,0.0016938767,0.0043347194,0.0019864663,0.0017039704,0.0009752988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023634202,0.000032866632,0.00024868693,0.000112413785,0.000021650425,0.00016672519,0.00023781188,0.03180354,0.0014013116,0.9434882,0.005404671,0.01684582],"study_design_scores_gemma":[0.000033491295,0.00003864571,0.00020830659,0.000017910364,0.00001152187,0.00009413554,0.000114876115,0.06936589,0.00045586162,0.9257392,0.0039059424,0.000014225834],"about_ca_topic_score_codex":0.004203635,"about_ca_topic_score_gemma":0.0037207115,"teacher_disagreement_score":0.014496963,"about_ca_system_score_codex":0.00091668917,"about_ca_system_score_gemma":0.00067431584,"threshold_uncertainty_score":0.04849714},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004764583,0.00118841,0.97865146,0.0008955123,0.00018894425,0.00007077507,0.00027458157,0.00013386301,0.013831764],"genre_scores_gemma":[0.2408277,0.004804381,0.7106578,0.0015235987,0.0010935914,0.0006344073,0.0016677895,0.0007030916,0.038087644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992362,0.0004084154,0.000026042726,0.000092430964,0.00016278597,0.00007401399],"domain_scores_gemma":[0.99705887,0.002186157,0.00016781081,0.00020721514,0.00029994157,0.00007996066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017566878,0.0014933669,0.001104968,0.0009339868,0.0005799563,0.001995497,0.0014784032,0.0015391265,0.01415117],"category_scores_gemma":[0.006295782,0.0006375888,0.0010211447,0.0021975155,0.0010017477,0.0026416478,0.0015185862,0.0031101007,0.0020457804],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012326073,0.00018641837,0.00026431392,0.00042258593,0.00005835032,0.000114798444,0.000117983574,0.42259023,0.0016305406,0.45195246,0.026940804,0.09559827],"study_design_scores_gemma":[0.000025955984,0.000035599023,0.00007400535,0.00005004741,0.000012895867,0.000042553176,0.000032017575,0.7693095,0.0003384637,0.2245071,0.005556479,0.000015349839],"about_ca_topic_score_codex":0.0021134657,"about_ca_topic_score_gemma":0.0029885408,"teacher_disagreement_score":0.01415117,"about_ca_system_score_codex":0.0009069575,"about_ca_system_score_gemma":0.0011479208,"threshold_uncertainty_score":0.047340333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24215244,0.0011626609,0.69523823,0.00094239955,0.0002819537,0.00009078576,0.0009685834,0.0010957075,0.058067303],"genre_scores_gemma":[0.87381226,0.0008773003,0.10580499,0.00040676398,0.00019436295,0.00013035367,0.00081292144,0.00018233566,0.017778734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994234,0.00013346875,0.000043908683,0.00018571451,0.00012502074,0.000088574554],"domain_scores_gemma":[0.9977514,0.00086688815,0.00042617857,0.00035012022,0.000318827,0.0002865783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006231816,0.00035268985,0.00037838728,0.0015742044,0.0010684391,0.0020567097,0.0010911153,0.0005412205,0.007518295],"category_scores_gemma":[0.0032178038,0.0003060122,0.00059353246,0.0018607724,0.0012191039,0.0047289664,0.0011750236,0.0014581978,0.0007468773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064732914,0.000035810746,0.0004002572,0.000058549515,0.000014595589,0.00009805657,0.00028334535,0.0021765756,0.0015442759,0.9747433,0.0012413197,0.019339113],"study_design_scores_gemma":[0.000020851141,0.000029471048,0.00039398597,0.000013181574,0.000021014215,0.0001560165,0.00016575055,0.008955892,0.00096816017,0.9825418,0.006711598,0.000022261087],"about_ca_topic_score_codex":0.0011876882,"about_ca_topic_score_gemma":0.0011814435,"teacher_disagreement_score":0.007518295,"about_ca_system_score_codex":0.0008039005,"about_ca_system_score_gemma":0.00040595615,"threshold_uncertainty_score":0.025151193},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31752503,0.000961865,0.5361554,0.0025358193,0.00018417936,0.00015497931,0.00083207554,0.00024635263,0.14140429],"genre_scores_gemma":[0.825622,0.0006244189,0.13384402,0.00035171528,0.00011365701,0.00015924024,0.00061081053,0.00011053458,0.038563512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939203,0.00025123032,0.000023673612,0.00010952227,0.00010910736,0.00011436097],"domain_scores_gemma":[0.9985098,0.0007777357,0.00021383297,0.00012095847,0.00015628547,0.00022139512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008158416,0.00038584007,0.0005734439,0.001038231,0.0016787587,0.0024915945,0.0013108461,0.0016116942,0.015284192],"category_scores_gemma":[0.0044831675,0.00038815767,0.0007579145,0.0022533454,0.0012079944,0.0028632027,0.0015742554,0.0016584835,0.0011656904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000857993,0.000052690713,0.0006970593,0.00007677355,0.000025836172,0.00024687694,0.00025104175,0.038124718,0.0006091934,0.9318315,0.0038442374,0.024154387],"study_design_scores_gemma":[0.000020114896,0.000016212296,0.0003249401,0.000020174779,0.000010126749,0.00013905855,0.000113721646,0.06747239,0.0002977418,0.92572755,0.0058464017,0.000011558197],"about_ca_topic_score_codex":0.0021884732,"about_ca_topic_score_gemma":0.002444725,"teacher_disagreement_score":0.015284192,"about_ca_system_score_codex":0.0010921359,"about_ca_system_score_gemma":0.00080041,"threshold_uncertainty_score":0.051130652},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18459684,0.0009555378,0.7757175,0.0005806052,0.0004275492,0.000049859085,0.00017264865,0.00083654444,0.036662996],"genre_scores_gemma":[0.853107,0.000484619,0.13162343,0.00013459001,0.00009148486,0.000062309,0.0002462461,0.00045393582,0.013796251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995049,0.00012775547,0.00001297841,0.00011365604,0.00015628347,0.00008433956],"domain_scores_gemma":[0.9980469,0.0010268199,0.00016231072,0.00026231885,0.00031179964,0.0001898716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013008508,0.0008224126,0.00068519125,0.0018340207,0.00055157364,0.0020015256,0.0014243746,0.0012635016,0.006844115],"category_scores_gemma":[0.0071852277,0.00044209266,0.00048548728,0.0010562309,0.001564981,0.0022297525,0.0016325044,0.002031889,0.0010769807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039232738,0.00012834583,0.0030113922,0.00021885145,0.00004185198,0.00025100753,0.00023233648,0.39783284,0.010246832,0.5064,0.005850678,0.075393654],"study_design_scores_gemma":[0.000014227663,0.0000408732,0.00035054304,0.000022695991,0.000010136934,0.00007325768,0.000044759792,0.91646916,0.002539587,0.07779176,0.002626449,0.000016484937],"about_ca_topic_score_codex":0.0017792408,"about_ca_topic_score_gemma":0.0017059579,"teacher_disagreement_score":0.006844115,"about_ca_system_score_codex":0.0020496529,"about_ca_system_score_gemma":0.0006815357,"threshold_uncertainty_score":0.022895813},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5460345,0.0017838444,0.21898691,0.002516929,0.00066233816,0.00008489251,0.0003958092,0.0002520923,0.22928268],"genre_scores_gemma":[0.9224776,0.0006095218,0.019563688,0.00031528377,0.00018343625,0.000060363498,0.00032790034,0.00018815667,0.056274146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952435,0.000087941175,0.000021061083,0.00014629179,0.00010446043,0.00011586669],"domain_scores_gemma":[0.9988367,0.00034639364,0.0001446283,0.000118865704,0.00035575795,0.00019759769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006637144,0.0006232909,0.0011890483,0.002062669,0.003001662,0.0029203824,0.0010229942,0.001960954,0.009796149],"category_scores_gemma":[0.004866618,0.0006145086,0.0010753989,0.0006086946,0.0032717134,0.0050428943,0.00461432,0.0032313555,0.0013068981],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043063283,0.000010378489,0.00025844376,0.000023941324,0.000006822398,0.00005864649,0.0001866325,0.0013464331,0.00092337606,0.99203014,0.000828439,0.0042835963],"study_design_scores_gemma":[0.000014313654,0.000025556665,0.00035177503,0.000026184991,0.00000802878,0.00014681074,0.00035401387,0.008488165,0.0013925231,0.9848451,0.0043309545,0.000016587004],"about_ca_topic_score_codex":0.0014693395,"about_ca_topic_score_gemma":0.00093192264,"teacher_disagreement_score":0.009796149,"about_ca_system_score_codex":0.001325906,"about_ca_system_score_gemma":0.0007314738,"threshold_uncertainty_score":0.03277135},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50247616,0.0010298647,0.44315195,0.0009734034,0.00023745012,0.00008809936,0.0007409226,0.00037841828,0.05092376],"genre_scores_gemma":[0.8962595,0.0009876672,0.075090215,0.00026365172,0.00015857565,0.00013791081,0.00074509677,0.00022929776,0.026128158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964404,0.00009552533,0.000021901933,0.00008534146,0.00008864415,0.00006446828],"domain_scores_gemma":[0.99869365,0.00041538855,0.00027992495,0.00019784448,0.00016272164,0.00025047432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032338162,0.00061353913,0.00054818,0.0006505858,0.00066715805,0.002071971,0.00095367985,0.00074089813,0.0055026524],"category_scores_gemma":[0.002570895,0.0005884113,0.0005094623,0.0009065455,0.0012375544,0.004168065,0.0020585917,0.001899944,0.0005836461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011322269,0.000029238581,0.00041286598,0.000074212265,0.000012625791,0.0001273819,0.00035683223,0.01669047,0.0016534503,0.96719086,0.0018119103,0.011526785],"study_design_scores_gemma":[0.000028790651,0.000038126796,0.00048446143,0.000022939488,0.000010018854,0.00015565148,0.00015088618,0.039091345,0.00062873616,0.9541683,0.005207018,0.000013752467],"about_ca_topic_score_codex":0.0007220891,"about_ca_topic_score_gemma":0.0008552696,"teacher_disagreement_score":0.0055026524,"about_ca_system_score_codex":0.0007106192,"about_ca_system_score_gemma":0.0002998452,"threshold_uncertainty_score":0.01840818},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6713323,0.0019552426,0.2485321,0.0066929236,0.0003777409,0.000120533856,0.0010654564,0.00041034014,0.069513425],"genre_scores_gemma":[0.9297605,0.0015071551,0.045042265,0.0007610366,0.00039301437,0.00012795269,0.0015079408,0.00029257,0.020607604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993412,0.00019230387,0.000028542883,0.0001662229,0.00011738753,0.0001543205],"domain_scores_gemma":[0.9953087,0.003170722,0.00036303516,0.00043230376,0.00022806966,0.0004971339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010133152,0.00081599085,0.0011297888,0.0009822292,0.0015205316,0.0033206062,0.0015869818,0.0018876339,0.012435233],"category_scores_gemma":[0.0064722197,0.00059768726,0.00056953565,0.0013402048,0.0020916467,0.0075472943,0.0021503381,0.0029908775,0.0011657531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048458696,0.0001750814,0.0013109884,0.00034637106,0.00005834224,0.00036631938,0.00070489,0.021363033,0.003526644,0.8940733,0.016468711,0.06112163],"study_design_scores_gemma":[0.000026443604,0.000014296334,0.00015094041,0.000013471674,0.0000102480635,0.00007252824,0.0001810078,0.016735386,0.00045422197,0.98050183,0.0018337672,0.0000057363695],"about_ca_topic_score_codex":0.00090773223,"about_ca_topic_score_gemma":0.0010441537,"teacher_disagreement_score":0.012435233,"about_ca_system_score_codex":0.00084668276,"about_ca_system_score_gemma":0.0008421427,"threshold_uncertainty_score":0.04159999},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17589109,0.0038923589,0.67517424,0.016380591,0.00073816354,0.0012775906,0.009916999,0.005210405,0.11151856],"genre_scores_gemma":[0.6313169,0.0031740607,0.32632402,0.0026650487,0.0011292681,0.0010434848,0.004709524,0.0026914098,0.026946282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99579227,0.0012944082,0.00019619243,0.0010792477,0.0009103487,0.0007274495],"domain_scores_gemma":[0.97914803,0.017269395,0.0009102275,0.0010808298,0.00090380065,0.0006877563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030601548,0.003689849,0.0058175623,0.0018332091,0.0016306402,0.006627032,0.006576799,0.0049527115,0.017692598],"category_scores_gemma":[0.019408088,0.0019871017,0.0021624835,0.005327827,0.0021510373,0.011502217,0.0031243507,0.005059679,0.0028876858],"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.0020489623,0.0015910122,0.00341835,0.0036100242,0.0007446544,0.0008773868,0.00057630613,0.37737006,0.012754351,0.23206826,0.10224831,0.2626924],"study_design_scores_gemma":[0.00060249266,0.00024723474,0.000926494,0.00013680458,0.00027910445,0.0012935873,0.00034863793,0.4468991,0.008509417,0.52805984,0.012626968,0.00007021254],"about_ca_topic_score_codex":0.0018325164,"about_ca_topic_score_gemma":0.002278345,"teacher_disagreement_score":0.017692598,"about_ca_system_score_codex":0.0031900166,"about_ca_system_score_gemma":0.0023546193,"threshold_uncertainty_score":0.05918765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018115735,0.00060343795,0.96318793,0.00039883883,0.00015121802,0.00009068379,0.00086384814,0.0012254987,0.015362844],"genre_scores_gemma":[0.3824217,0.002022335,0.59741503,0.00029044528,0.00010325298,0.0002887906,0.0022709896,0.00047985124,0.014707644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995403,0.00014214787,0.000049303006,0.00008916262,0.000104536346,0.00007461235],"domain_scores_gemma":[0.99921536,0.00032666503,0.00007885664,0.0001779582,0.00015738551,0.00004381685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059392495,0.0006341714,0.00053104607,0.0016414524,0.0005251056,0.0029510383,0.0008109338,0.00060643104,0.006189683],"category_scores_gemma":[0.0017820946,0.0003676293,0.0008157751,0.0014971471,0.0010092647,0.0027443785,0.0011050865,0.0010278817,0.0011394852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009693715,0.000039482213,0.00042685182,0.00023397226,0.000022973529,0.00018757896,0.0003024599,0.0320503,0.0027795215,0.8798445,0.002457629,0.081557885],"study_design_scores_gemma":[0.000030356436,0.000022684113,0.00013548075,0.00012073913,0.000051315554,0.00015087241,0.0001513673,0.076304995,0.004493839,0.8663512,0.052166823,0.000020324407],"about_ca_topic_score_codex":0.0018268836,"about_ca_topic_score_gemma":0.0021420289,"teacher_disagreement_score":0.006189683,"about_ca_system_score_codex":0.0006590908,"about_ca_system_score_gemma":0.0007527497,"threshold_uncertainty_score":0.020706534},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51839644,0.0010234284,0.38879064,0.0030276862,0.00023275547,0.00021461793,0.00030857933,0.0004201548,0.08758572],"genre_scores_gemma":[0.9647057,0.0007110397,0.020344457,0.0002679643,0.0001628665,0.00021639363,0.00014154083,0.000085758176,0.013364404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972372,0.0013477512,0.00016182834,0.0003628361,0.00040353622,0.00048694588],"domain_scores_gemma":[0.98336583,0.0115740355,0.0016646713,0.0014352459,0.0007402202,0.0012201252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033161887,0.0007489895,0.0017088164,0.0011750534,0.0020415597,0.0038965826,0.0012471195,0.0015877518,0.0047078],"category_scores_gemma":[0.011713384,0.0009007431,0.0017380881,0.0013605464,0.0068694786,0.0062705055,0.0023449399,0.0029191512,0.0006563641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041997955,0.000021041706,0.00018399299,0.0000290104,0.000011923047,0.000028799137,0.00023731256,0.002734997,0.00044888823,0.9945417,0.00031388446,0.001406542],"study_design_scores_gemma":[0.000022164219,0.000010478766,0.00006302214,0.0000044501808,0.000008144093,0.000024017194,0.000040179824,0.004926092,0.00013385156,0.99411726,0.0006442807,0.0000060401426],"about_ca_topic_score_codex":0.002489911,"about_ca_topic_score_gemma":0.0016684876,"teacher_disagreement_score":0.0047078,"about_ca_system_score_codex":0.0023040387,"about_ca_system_score_gemma":0.0019721969,"threshold_uncertainty_score":0.017537892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30356568,0.0013509449,0.44494945,0.007241411,0.00080669107,0.00026853336,0.0013024785,0.0014081646,0.23910668],"genre_scores_gemma":[0.80802417,0.0016418456,0.067104355,0.0026164493,0.0007144922,0.0004193011,0.002484984,0.0014276257,0.11556675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99919504,0.00028731689,0.000022613884,0.00019188007,0.00017600365,0.00012711124],"domain_scores_gemma":[0.9958211,0.002076767,0.00041418412,0.0009230154,0.0003055782,0.00045930376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437971,0.0012365533,0.0011592988,0.0020980572,0.002215367,0.0027684344,0.0018551913,0.0024792051,0.02067784],"category_scores_gemma":[0.0076499092,0.0009478705,0.0010704742,0.0022042706,0.0028337569,0.006483962,0.0043168827,0.0041024787,0.0026452623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092942864,0.000028750705,0.00022240535,0.000041788648,0.0000075641287,0.00006306738,0.00017895194,0.0025103241,0.0012530523,0.98146844,0.0046247924,0.0095078545],"study_design_scores_gemma":[0.000009944983,0.000012771168,0.000121691184,0.000012193287,0.0000056902754,0.00006149173,0.00006185056,0.0091571575,0.00040026047,0.98691595,0.0032340533,0.0000067909045],"about_ca_topic_score_codex":0.0010033036,"about_ca_topic_score_gemma":0.0009777402,"teacher_disagreement_score":0.02067784,"about_ca_system_score_codex":0.0013933112,"about_ca_system_score_gemma":0.000645234,"threshold_uncertainty_score":0.06917423},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52702916,0.0022354047,0.4455533,0.0028072242,0.00021444817,0.00012291831,0.0013263852,0.00082846556,0.01988271],"genre_scores_gemma":[0.8986455,0.0014102065,0.08583054,0.00035872118,0.00009777419,0.00011961518,0.0005374417,0.00022668275,0.012773508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995592,0.00010260909,0.00002403448,0.000120146855,0.000060070364,0.00013393766],"domain_scores_gemma":[0.9963767,0.00211948,0.0005243837,0.0004473403,0.00026862195,0.00026338565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077154534,0.0006059298,0.00086558633,0.0008555899,0.0011118477,0.0029233221,0.0023904662,0.0012082164,0.009715282],"category_scores_gemma":[0.0055617117,0.00064387795,0.00047104506,0.0018517518,0.0013438156,0.0061241593,0.0013134012,0.0013894096,0.0005622293],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000994289,0.00013418985,0.0015939778,0.00052475504,0.000057587768,0.0002194718,0.0002926709,0.26474553,0.0063991356,0.6600545,0.008474349,0.056509648],"study_design_scores_gemma":[0.00012825168,0.00014312912,0.0007942486,0.00005057958,0.000046966117,0.00021556935,0.00025733386,0.44635245,0.002388183,0.5461171,0.003474257,0.000031898377],"about_ca_topic_score_codex":0.0042327447,"about_ca_topic_score_gemma":0.0056151487,"teacher_disagreement_score":0.009715282,"about_ca_system_score_codex":0.001779189,"about_ca_system_score_gemma":0.001005997,"threshold_uncertainty_score":0.032500863},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.116400905,0.002055985,0.87174565,0.0019495434,0.0003129403,0.0001992186,0.0006109024,0.00067592587,0.0060488023],"genre_scores_gemma":[0.9350327,0.0013643954,0.042454954,0.00023665473,0.00032672062,0.00017202506,0.00036657683,0.00026700384,0.019778935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685776,0.0012500116,0.0002262747,0.0006428841,0.0004726127,0.00055046583],"domain_scores_gemma":[0.98007697,0.015388842,0.0015645005,0.000990803,0.0012077757,0.00077108596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006185373,0.0014521346,0.0041627577,0.0010679781,0.001475579,0.0038148654,0.0042600445,0.0025795053,0.008598133],"category_scores_gemma":[0.021325698,0.0019881413,0.001335577,0.0022902754,0.0024014257,0.0059095896,0.0022647476,0.0026752304,0.0008551393],"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.0009994386,0.00021801605,0.0012616306,0.000354794,0.00008185558,0.00031508322,0.00022677133,0.8633496,0.0022331413,0.099979974,0.0040385653,0.0269412],"study_design_scores_gemma":[0.000031524403,0.000066347835,0.00027143006,0.000011783752,0.000020085577,0.00005135022,0.000028910985,0.970324,0.0005346633,0.028174933,0.00046652247,0.0000185735],"about_ca_topic_score_codex":0.010938231,"about_ca_topic_score_gemma":0.005254007,"teacher_disagreement_score":0.010938231,"about_ca_system_score_codex":0.0033179466,"about_ca_system_score_gemma":0.0021841323,"threshold_uncertainty_score":0.032711744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36808762,0.0068946066,0.40862894,0.015054123,0.0011101721,0.00029758507,0.0013563674,0.00046961207,0.19810104],"genre_scores_gemma":[0.86077297,0.005404207,0.05978722,0.0021184736,0.0014731255,0.00060123985,0.0022882568,0.00065355655,0.066900946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980926,0.00085063436,0.000073792056,0.0003352448,0.00031895973,0.00032875873],"domain_scores_gemma":[0.9898364,0.007619924,0.00063164433,0.0006544055,0.00043322388,0.0008245139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002432089,0.0017229108,0.002698072,0.002244296,0.0033542472,0.0057070465,0.0040579014,0.0036039352,0.022395825],"category_scores_gemma":[0.017514588,0.0013231542,0.0014335192,0.004701031,0.00530741,0.012386794,0.0064825667,0.0070100497,0.0018565773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025517406,0.00007388704,0.00038426134,0.00019502168,0.00002911511,0.00008160365,0.00029828885,0.0150321,0.000401209,0.9631488,0.007998566,0.012101877],"study_design_scores_gemma":[0.00004742714,0.000018817882,0.00023370607,0.000042971496,0.000013870303,0.000055986526,0.00012469839,0.025117597,0.0001615092,0.9721605,0.0020115438,0.0000114778495],"about_ca_topic_score_codex":0.001831722,"about_ca_topic_score_gemma":0.0016195764,"teacher_disagreement_score":0.022395825,"about_ca_system_score_codex":0.0026834207,"about_ca_system_score_gemma":0.0010403775,"threshold_uncertainty_score":0.07492149},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027660605,0.000954563,0.9608176,0.00087528984,0.00012346508,0.00006335528,0.00053182,0.000243912,0.008729428],"genre_scores_gemma":[0.7038784,0.0018210663,0.2718742,0.0004702918,0.0004289997,0.0004401434,0.0012134186,0.00035616476,0.019517273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990159,0.00044184996,0.000044938646,0.00021270668,0.00019777248,0.00008674518],"domain_scores_gemma":[0.995652,0.0032954814,0.00036140214,0.00022815315,0.0003324481,0.00013045939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031998921,0.0013155369,0.0016182946,0.0007511961,0.0004223013,0.0017574773,0.0022243834,0.0021820145,0.0061516333],"category_scores_gemma":[0.009611626,0.0005102878,0.0006809975,0.0015415457,0.0007502346,0.0029016496,0.0015906873,0.0022129451,0.00058819045],"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.0002287918,0.00008088442,0.0004785176,0.00013599126,0.00006485142,0.00007208933,0.00004516121,0.8792777,0.0005632203,0.0633383,0.0047084,0.05100611],"study_design_scores_gemma":[0.000014278525,0.000039630315,0.00011172526,0.00001406759,0.000015664073,0.000026437374,0.0000116315405,0.9586813,0.00038265047,0.039856452,0.00083998375,0.000006189134],"about_ca_topic_score_codex":0.0013011303,"about_ca_topic_score_gemma":0.00124581,"teacher_disagreement_score":0.0061516333,"about_ca_system_score_codex":0.0014298897,"about_ca_system_score_gemma":0.000540811,"threshold_uncertainty_score":0.020579278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04989829,0.0007054133,0.6612274,0.0009003867,0.0012708894,0.00025197928,0.0010354487,0.0044983677,0.28021184],"genre_scores_gemma":[0.5041919,0.0010199966,0.18119198,0.0007432639,0.00039138208,0.00043200748,0.0017098224,0.0038462717,0.30647343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991999,0.000060734357,0.00004309472,0.00027135923,0.00026643343,0.00015837092],"domain_scores_gemma":[0.9982973,0.0003101809,0.000069519505,0.000811067,0.0002911258,0.00022090664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039433138,0.0011843324,0.0013085945,0.0013515186,0.0017035445,0.002448216,0.0017451023,0.0015614801,0.08316367],"category_scores_gemma":[0.0037934065,0.00071340223,0.0009194603,0.0011149202,0.0014254337,0.004877053,0.0039707324,0.0026371465,0.013464342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042296379,0.00020908353,0.00032684932,0.0004548818,0.000036676847,0.00032268994,0.00030912276,0.015031668,0.050667696,0.6524709,0.0258733,0.25387418],"study_design_scores_gemma":[0.000065737244,0.00014249464,0.00039562484,0.00013257474,0.000034060187,0.00033454562,0.00027184328,0.091087095,0.028603664,0.78136355,0.09750917,0.0000596431],"about_ca_topic_score_codex":0.0010802632,"about_ca_topic_score_gemma":0.0015176269,"teacher_disagreement_score":0.08316367,"about_ca_system_score_codex":0.0005211048,"about_ca_system_score_gemma":0.0005263165,"threshold_uncertainty_score":0.27821022},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023427424,0.00014336844,0.9965282,0.000060169757,0.000029083707,0.00002467149,0.000028280285,0.00039903284,0.00044442771],"genre_scores_gemma":[0.038349245,0.0001372729,0.95859826,0.000055508506,0.000055633154,0.00013424382,0.00021167852,0.00042807424,0.002030141],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896026,0.00029451933,0.00007934337,0.00018737577,0.00039707686,0.00008147926],"domain_scores_gemma":[0.99688894,0.0020007002,0.00014813848,0.0004709061,0.00037823452,0.00011300421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016818718,0.0019200367,0.0020061007,0.00151819,0.000669435,0.0016969709,0.0020059433,0.0021379245,0.01254114],"category_scores_gemma":[0.006784468,0.001332324,0.0013791957,0.0017462107,0.0009623028,0.0028811097,0.0024197532,0.002531216,0.0028373057],"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.0008237001,0.00016777677,0.0006506218,0.00042521424,0.00017163513,0.00015583458,0.00029200516,0.2747316,0.03225706,0.051228605,0.00843952,0.6306564],"study_design_scores_gemma":[0.00004493241,0.000041705283,0.00015272555,0.000012296332,0.000018925759,0.000048253874,0.00002364899,0.9708134,0.005074635,0.021556245,0.0021989616,0.000014206976],"about_ca_topic_score_codex":0.003302322,"about_ca_topic_score_gemma":0.0063169654,"teacher_disagreement_score":0.01254114,"about_ca_system_score_codex":0.0010113053,"about_ca_system_score_gemma":0.0016721943,"threshold_uncertainty_score":0.04195434},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21278541,0.000438713,0.6381098,0.0011894152,0.0015648151,0.00045996858,0.0010696884,0.0022265282,0.14215568],"genre_scores_gemma":[0.61286896,0.0006708282,0.3107314,0.00050541747,0.00023623423,0.00066496123,0.0011568432,0.0013130785,0.0718523],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935585,0.000074752905,0.000035752906,0.00015388394,0.0001809406,0.0001987562],"domain_scores_gemma":[0.9991047,0.00015543266,0.000109855806,0.0004047429,0.000116618365,0.00010875533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031544382,0.0010926276,0.000993619,0.0008808744,0.0012325929,0.0020756284,0.0012784341,0.0010844117,0.015343137],"category_scores_gemma":[0.0017796948,0.00059847336,0.00090887194,0.0012128553,0.0022875858,0.00232077,0.0033994836,0.0017358466,0.0060014674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030185254,0.00038295356,0.002606073,0.000655586,0.00012388463,0.0022591685,0.0011316239,0.023591837,0.19964997,0.42996868,0.023184547,0.3134272],"study_design_scores_gemma":[0.0007856148,0.0016317856,0.0027075587,0.000300944,0.00022031357,0.0036652486,0.002312662,0.10490286,0.23526269,0.36906686,0.2788219,0.00032158406],"about_ca_topic_score_codex":0.00056638883,"about_ca_topic_score_gemma":0.0007400919,"teacher_disagreement_score":0.015343137,"about_ca_system_score_codex":0.00033426745,"about_ca_system_score_gemma":0.0006900997,"threshold_uncertainty_score":0.051327884},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5427961,0.009254667,0.35284877,0.010240747,0.00041066666,0.00016860518,0.004290728,0.0016550791,0.07833462],"genre_scores_gemma":[0.869776,0.0052767457,0.1088758,0.0014383316,0.0005992354,0.0003090191,0.003350804,0.0008092537,0.009564899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998659,0.00033732166,0.000056825076,0.00028481174,0.00036051817,0.00030157375],"domain_scores_gemma":[0.9756874,0.019274864,0.0013387123,0.0016217384,0.0008363876,0.0012408606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020249055,0.0017419683,0.0015743162,0.002993764,0.0016968942,0.0035423336,0.004112524,0.0017934198,0.009138953],"category_scores_gemma":[0.015746057,0.0011278264,0.0012657185,0.0038933686,0.0024961326,0.007031804,0.00285475,0.005367833,0.0010160988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019101738,0.00044044602,0.008649021,0.0014306596,0.00035010302,0.00054255046,0.0012047247,0.21612135,0.022458918,0.6364169,0.03124342,0.079231784],"study_design_scores_gemma":[0.00011681808,0.00013553035,0.0023560012,0.00012640543,0.00013068403,0.0005663418,0.00032691326,0.24830729,0.003765953,0.7363285,0.0077927983,0.00004678652],"about_ca_topic_score_codex":0.0016680238,"about_ca_topic_score_gemma":0.0027196866,"teacher_disagreement_score":0.009138953,"about_ca_system_score_codex":0.002459621,"about_ca_system_score_gemma":0.0009537765,"threshold_uncertainty_score":0.030572832},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7125812,0.0007024782,0.25541368,0.0017534677,0.00017411789,0.0003357771,0.0050836178,0.0065696426,0.017386017],"genre_scores_gemma":[0.83529526,0.00025863445,0.14522113,0.00032730238,0.000086212014,0.00013016458,0.010754126,0.0008012301,0.0071260193],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991528,0.00010303845,0.000054841228,0.00030543117,0.0001446851,0.00023924417],"domain_scores_gemma":[0.99708754,0.0013243463,0.0003374282,0.00074474944,0.00028168174,0.00022428326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003969487,0.0007650936,0.0010651138,0.0006463062,0.0010106845,0.0025461523,0.001953533,0.0013070643,0.01061054],"category_scores_gemma":[0.0032629536,0.0005857914,0.0017424345,0.0013196013,0.00050940603,0.0037800882,0.0013925981,0.0014708204,0.0022615583],"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.004185727,0.0011920047,0.02585453,0.001376743,0.00038092182,0.0011014537,0.001111743,0.12486937,0.20835173,0.072800286,0.0596428,0.49913266],"study_design_scores_gemma":[0.00028386322,0.00026308533,0.012290675,0.000069679474,0.0001251973,0.0008724753,0.0007542781,0.6933016,0.08306341,0.19103317,0.017843533,0.00009897435],"about_ca_topic_score_codex":0.0051247356,"about_ca_topic_score_gemma":0.010598948,"teacher_disagreement_score":0.01061054,"about_ca_system_score_codex":0.0011910904,"about_ca_system_score_gemma":0.0013440077,"threshold_uncertainty_score":0.035495818},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86525357,0.0014347788,0.05880214,0.0052024913,0.00027610373,0.000070060996,0.0010605215,0.0004962086,0.06740413],"genre_scores_gemma":[0.9872765,0.00033419312,0.0043337643,0.0002071834,0.00017781212,0.000053951335,0.00030878303,0.00007860511,0.00722926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934095,0.00016589755,0.000021291402,0.00019438184,0.00014720068,0.00013015266],"domain_scores_gemma":[0.99290186,0.0038623884,0.00080666196,0.00056976185,0.00072094426,0.0011383354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012545807,0.00046209345,0.0009695765,0.0023905546,0.0028555968,0.0029431833,0.0026733063,0.0016461672,0.014105568],"category_scores_gemma":[0.008719401,0.00057682913,0.0006137962,0.001740958,0.0020642783,0.004639225,0.0012629379,0.0019344764,0.0010222183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030815948,0.00006259911,0.0023333284,0.00014678623,0.00004222777,0.00008410258,0.00059973914,0.00907542,0.0043204,0.96430814,0.008446678,0.010272356],"study_design_scores_gemma":[0.00007915652,0.000060886487,0.0024886192,0.00003213012,0.000058012803,0.00015648318,0.00041115805,0.07755341,0.0041493964,0.91233903,0.0026350652,0.00003657782],"about_ca_topic_score_codex":0.0023098763,"about_ca_topic_score_gemma":0.002201133,"teacher_disagreement_score":0.014105568,"about_ca_system_score_codex":0.0017098531,"about_ca_system_score_gemma":0.0011132382,"threshold_uncertainty_score":0.047187805},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6580424,0.0006379525,0.18278474,0.0013414373,0.00052742753,0.0001353407,0.00065249467,0.0003057523,0.15557246],"genre_scores_gemma":[0.9060566,0.0008393156,0.032976676,0.0004305081,0.0006739635,0.00035534045,0.0011305289,0.00038951222,0.057147548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993668,0.00014775965,0.000029179517,0.000076360826,0.0002470858,0.00013279085],"domain_scores_gemma":[0.99846053,0.00070735265,0.00024618325,0.000115897565,0.00017574451,0.0002943007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010911266,0.0011791498,0.0008580249,0.0034328473,0.0021195868,0.0034842868,0.0017014724,0.0013338113,0.012118469],"category_scores_gemma":[0.003144466,0.00053652993,0.0010992718,0.0017738491,0.0027322776,0.0026898396,0.0021150077,0.002798971,0.0013029961],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019496509,0.000024738345,0.0002249793,0.000022396729,0.0000043715518,0.00006139996,0.00015163732,0.0009818922,0.0005022857,0.9928377,0.0008970904,0.004272033],"study_design_scores_gemma":[0.000018873061,0.000013833108,0.00034900376,0.000018400915,0.000007660175,0.00010167781,0.00007677094,0.008370105,0.00050311204,0.98806167,0.0024603242,0.0000185596],"about_ca_topic_score_codex":0.00078518764,"about_ca_topic_score_gemma":0.0010644596,"teacher_disagreement_score":0.012118469,"about_ca_system_score_codex":0.0013248086,"about_ca_system_score_gemma":0.0006334022,"threshold_uncertainty_score":0.040540278},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023197021,0.00041002774,0.9485964,0.0017756902,0.00026089745,0.00012457711,0.0001850075,0.00023380562,0.025216583],"genre_scores_gemma":[0.5921803,0.001236143,0.345407,0.0017336907,0.0012545233,0.0006271911,0.0005009902,0.0005526835,0.056507487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99273527,0.0029479102,0.00024109789,0.0015370232,0.0017393293,0.00079950184],"domain_scores_gemma":[0.9688496,0.020307511,0.0015502018,0.0054474506,0.0023761182,0.0014691427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043715895,0.0024039873,0.0040667197,0.0050292704,0.0024570932,0.0064120907,0.00870866,0.0076233884,0.019792719],"category_scores_gemma":[0.024225604,0.0019858556,0.0034525574,0.004037378,0.008166581,0.015153938,0.009640292,0.005822918,0.0023491136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016211608,0.0001057609,0.00027599998,0.00023908439,0.0000768599,0.000140566,0.00029712878,0.049612887,0.001422665,0.9317432,0.0030245346,0.012899143],"study_design_scores_gemma":[0.00006112945,0.00014036805,0.00013956647,0.000056055964,0.0000509904,0.00015989509,0.00016733882,0.3564564,0.0008610734,0.6386098,0.0032360544,0.0000613305],"about_ca_topic_score_codex":0.0020356723,"about_ca_topic_score_gemma":0.0030338992,"teacher_disagreement_score":0.019792719,"about_ca_system_score_codex":0.0023232861,"about_ca_system_score_gemma":0.002331321,"threshold_uncertainty_score":0.06621319},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07740386,0.0004320322,0.9169945,0.00023170936,0.00009108184,0.00013174805,0.00020487513,0.0015503669,0.0029597594],"genre_scores_gemma":[0.56345767,0.00029394534,0.43109077,0.00014712084,0.0001390027,0.00018333386,0.0009125915,0.00034954312,0.0034260734],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801385,0.00041786052,0.00012304752,0.0003963928,0.0008923662,0.00015647055],"domain_scores_gemma":[0.99601966,0.0016901363,0.0003431916,0.0012382885,0.00054942584,0.00015940955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010386617,0.0007202431,0.0019288778,0.0029665725,0.000860605,0.0018424613,0.0024107057,0.0019686616,0.003635161],"category_scores_gemma":[0.010627819,0.00055417715,0.0007799779,0.004474202,0.0007587948,0.0062948903,0.0033552947,0.0012684049,0.0010599954],"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.0007097515,0.0006248431,0.00487316,0.0006359709,0.0002588441,0.00042009423,0.00042376574,0.26311612,0.0367494,0.10218075,0.012183962,0.57782334],"study_design_scores_gemma":[0.00003039243,0.000082296865,0.00029918255,0.00000925657,0.00003317922,0.0001503422,0.00008687127,0.93073875,0.007295175,0.05932024,0.001941138,0.000013143548],"about_ca_topic_score_codex":0.0015125084,"about_ca_topic_score_gemma":0.0030606787,"teacher_disagreement_score":0.003635161,"about_ca_system_score_codex":0.0009323521,"about_ca_system_score_gemma":0.0009610916,"threshold_uncertainty_score":0.012160838},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46412683,0.007928752,0.334146,0.008318649,0.0011943446,0.00016194825,0.001117028,0.00038502493,0.18262145],"genre_scores_gemma":[0.9098222,0.00451844,0.041308958,0.00080305495,0.0009826879,0.00014994622,0.0007703833,0.00026641882,0.041377977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868494,0.00035487834,0.00007990049,0.00029233244,0.000342158,0.00024582233],"domain_scores_gemma":[0.9925799,0.004690817,0.00059032236,0.0005770068,0.00063197827,0.00093006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015565916,0.0012043478,0.00156166,0.0049378094,0.0042000795,0.0072734337,0.0024675569,0.003460553,0.010512631],"category_scores_gemma":[0.00814619,0.0011340237,0.0013995763,0.006155471,0.007612412,0.012329542,0.0054749446,0.004679537,0.0011219302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020813404,0.000013261182,0.00022792908,0.000033888038,0.000004461388,0.00004830952,0.0003740852,0.0010382301,0.00021191683,0.9944457,0.00057933404,0.0030019588],"study_design_scores_gemma":[0.0000031998545,0.0000026884131,0.00010179738,0.000012775065,0.0000048401957,0.000026458589,0.000117678144,0.0019764702,0.00006373294,0.99653435,0.0011510884,0.0000048623338],"about_ca_topic_score_codex":0.003936643,"about_ca_topic_score_gemma":0.0057224412,"teacher_disagreement_score":0.010512631,"about_ca_system_score_codex":0.002842385,"about_ca_system_score_gemma":0.0008911123,"threshold_uncertainty_score":0.03516823},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29706717,0.0008305605,0.67880934,0.0020549418,0.0002949718,0.000119588454,0.0008152623,0.00028482152,0.019723304],"genre_scores_gemma":[0.91941565,0.0005780314,0.064541765,0.00011290188,0.00017325651,0.00009521683,0.00040132308,0.00011695328,0.014564812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994168,0.0001933477,0.000022712064,0.00013907652,0.00010193928,0.00012597763],"domain_scores_gemma":[0.99860185,0.0007834418,0.00022644199,0.00014775486,0.00009328608,0.00014715327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092634064,0.0005847234,0.001014747,0.0005923358,0.0005949975,0.0012982825,0.0020312588,0.0017033225,0.0044822185],"category_scores_gemma":[0.004064241,0.00067342765,0.00087529875,0.001349429,0.0010071545,0.0018665377,0.00095842785,0.0011840301,0.00029256198],"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.00015704456,0.000044939687,0.0004605577,0.00008101147,0.000033773184,0.00022763434,0.000037984566,0.9198226,0.00065795105,0.06519589,0.0022532449,0.011027447],"study_design_scores_gemma":[0.000016916301,0.000023383063,0.00016166735,0.000005376443,0.00001105794,0.000061405204,0.000030243718,0.96271044,0.00018913017,0.035962477,0.00082039466,0.000007509398],"about_ca_topic_score_codex":0.0047388985,"about_ca_topic_score_gemma":0.003836303,"teacher_disagreement_score":0.0047388985,"about_ca_system_score_codex":0.0012422582,"about_ca_system_score_gemma":0.0010878987,"threshold_uncertainty_score":0.014994502},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26304734,0.01588283,0.63681716,0.011967373,0.0007910648,0.0000975462,0.0029514874,0.002478027,0.06596724],"genre_scores_gemma":[0.9371758,0.008164917,0.04237354,0.0010225883,0.0017322819,0.00033746255,0.0019177117,0.0008782763,0.006397352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99720925,0.0007390552,0.0001128982,0.00072925305,0.0007342146,0.00047533048],"domain_scores_gemma":[0.9148856,0.070710205,0.003285832,0.0045755175,0.00368763,0.0028551915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038213981,0.0022558672,0.0026361446,0.0056853946,0.0021927112,0.0049449676,0.0043139197,0.0028329229,0.01109816],"category_scores_gemma":[0.040703703,0.00120403,0.0014615413,0.0051533394,0.003927615,0.011046747,0.0039071646,0.0056880857,0.0011914127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000919098,0.00018390655,0.004807671,0.0011108567,0.00030703977,0.00044065507,0.00089034514,0.27961275,0.013058455,0.62066376,0.015612417,0.062392984],"study_design_scores_gemma":[0.00005485401,0.00016101713,0.002602657,0.00017586828,0.00015878846,0.00038164057,0.00016616134,0.43117946,0.0032045469,0.5571088,0.0047367834,0.00006935102],"about_ca_topic_score_codex":0.0020071599,"about_ca_topic_score_gemma":0.002639321,"teacher_disagreement_score":0.01109816,"about_ca_system_score_codex":0.0032637694,"about_ca_system_score_gemma":0.0009449683,"threshold_uncertainty_score":0.037127018},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6956177,0.0012142614,0.1693869,0.0019137019,0.0007809184,0.00018030252,0.00051749026,0.00035350758,0.1300352],"genre_scores_gemma":[0.94513565,0.00061381806,0.022683376,0.0006124843,0.0005125813,0.0001409723,0.00027146912,0.000101560436,0.02992816],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996369,0.00008694491,0.000020951085,0.000042908556,0.00013055051,0.000081680846],"domain_scores_gemma":[0.9993981,0.00019442354,0.00012039989,0.0001107022,0.00008482087,0.00009150687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036162365,0.00072074425,0.00048059193,0.0015180511,0.0007972376,0.0015587155,0.00044040367,0.0012698501,0.0062160706],"category_scores_gemma":[0.0013259161,0.00034696667,0.00042579608,0.0009391772,0.0012084536,0.0019576466,0.0018904821,0.0010015424,0.0010805889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010195924,0.000031341613,0.00031580363,0.000043459855,0.000008229282,0.00014693869,0.00024307995,0.0024990146,0.0075157024,0.9751091,0.0012161831,0.01276919],"study_design_scores_gemma":[0.00006131506,0.000080688566,0.00053244556,0.000030605835,0.000011549393,0.00043883524,0.00013253403,0.025059173,0.0044654286,0.96125764,0.007880033,0.0000497436],"about_ca_topic_score_codex":0.00023308628,"about_ca_topic_score_gemma":0.0002818776,"teacher_disagreement_score":0.0062160706,"about_ca_system_score_codex":0.0004135171,"about_ca_system_score_gemma":0.0005290557,"threshold_uncertainty_score":0.020794868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34804246,0.00302287,0.57018536,0.011862389,0.0005035655,0.00021220691,0.0015700327,0.0004391588,0.06416206],"genre_scores_gemma":[0.90626,0.00090468995,0.06643485,0.00045249943,0.00050827675,0.00021775503,0.0009645251,0.00018152,0.024075944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99832934,0.0006102405,0.00007969498,0.0003179365,0.00035517427,0.00030759882],"domain_scores_gemma":[0.99070346,0.007176501,0.00079294096,0.00043393575,0.00034401947,0.0005491547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001691775,0.0011172114,0.002122756,0.0014827374,0.0013031723,0.003296224,0.002530507,0.0048225513,0.017210132],"category_scores_gemma":[0.016008329,0.0007842313,0.0009790428,0.001855777,0.001923701,0.0044412985,0.00378697,0.0034582054,0.0009170321],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008250528,0.00030405828,0.0022010917,0.0006345071,0.00013365565,0.0022108469,0.000341417,0.30493915,0.0019721747,0.6027959,0.027390828,0.056251287],"study_design_scores_gemma":[0.00016179586,0.00008761449,0.00062180765,0.0000552397,0.00002898263,0.0007069932,0.00023073595,0.42032006,0.0007689849,0.5725759,0.0044011497,0.000040627656],"about_ca_topic_score_codex":0.0015361886,"about_ca_topic_score_gemma":0.001251669,"teacher_disagreement_score":0.017210132,"about_ca_system_score_codex":0.0010203486,"about_ca_system_score_gemma":0.0005929857,"threshold_uncertainty_score":0.057573617},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63664323,0.003753552,0.31736866,0.006663655,0.00038657562,0.00019718023,0.0024075597,0.00059641025,0.031983193],"genre_scores_gemma":[0.9093967,0.0020101403,0.07463661,0.00069513026,0.00067249924,0.00029675328,0.0013384606,0.00035242742,0.010601261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976004,0.0007232152,0.00010332092,0.00077422435,0.00038304593,0.0004157881],"domain_scores_gemma":[0.9696275,0.022711217,0.0023771282,0.002070511,0.0010992258,0.002114451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045958874,0.0020395536,0.002866206,0.003311982,0.0035872755,0.0064344765,0.005371348,0.0030379782,0.0051987283],"category_scores_gemma":[0.025733653,0.0029791244,0.0021936637,0.005223938,0.005356824,0.011390721,0.0034652657,0.004943234,0.00042065338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006780269,0.00019147119,0.0025582847,0.00032278933,0.00013403452,0.00013658848,0.00081129343,0.058126334,0.0024157611,0.9156207,0.005633475,0.013371389],"study_design_scores_gemma":[0.0001327111,0.000040763498,0.000853604,0.00005103223,0.00007363366,0.00018188237,0.00021408303,0.103672124,0.0006973271,0.8925911,0.0014599662,0.00003174828],"about_ca_topic_score_codex":0.0032285554,"about_ca_topic_score_gemma":0.0042018928,"teacher_disagreement_score":0.0064344765,"about_ca_system_score_codex":0.004996044,"about_ca_system_score_gemma":0.0021061662,"threshold_uncertainty_score":0.03624904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2804921,0.0043043653,0.4619822,0.007322516,0.0029981039,0.00013313632,0.0008683782,0.0009599372,0.24093921],"genre_scores_gemma":[0.7554056,0.004867444,0.1116369,0.0029312691,0.0033450213,0.0002673503,0.0021183477,0.0014232632,0.1180047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876875,0.00045448818,0.000046174726,0.00024194173,0.00030361026,0.00018503758],"domain_scores_gemma":[0.99521625,0.0028899284,0.0002610224,0.00053082645,0.00047921768,0.0006227743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001273924,0.0014586722,0.0016457613,0.0026052175,0.002582994,0.003878529,0.0022112296,0.0014229091,0.010598678],"category_scores_gemma":[0.0063537126,0.0011058332,0.0015885426,0.0037164877,0.0030442453,0.006899217,0.0042896233,0.005916619,0.0016427977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010354851,0.000050625553,0.00039146017,0.00011537755,0.00002171559,0.00008008633,0.00033843823,0.0046232804,0.0009382146,0.96681464,0.0077836416,0.01873901],"study_design_scores_gemma":[0.000007377003,0.0000090994845,0.00012480088,0.000013953188,0.000011123581,0.000042552285,0.000056558452,0.0069869217,0.00017595346,0.9895111,0.0030544684,0.0000061628584],"about_ca_topic_score_codex":0.002333075,"about_ca_topic_score_gemma":0.0029225799,"teacher_disagreement_score":0.010598678,"about_ca_system_score_codex":0.0020153422,"about_ca_system_score_gemma":0.0008954608,"threshold_uncertainty_score":0.03545612},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7199364,0.0016256438,0.060635295,0.0025675357,0.0012593705,0.00008119788,0.0004727941,0.0002759329,0.21314575],"genre_scores_gemma":[0.9582635,0.0008702911,0.0065204054,0.00057663996,0.0006682341,0.000051683186,0.00022890934,0.00007555485,0.032744855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996338,0.00007787233,0.000017652204,0.00006560122,0.0000895478,0.00011562272],"domain_scores_gemma":[0.9995264,0.00016366743,0.00008337172,0.000078284356,0.000052480846,0.000095794494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037138246,0.00044797728,0.00048259666,0.0013329941,0.0010056065,0.0013742029,0.0003042673,0.00054352253,0.006734201],"category_scores_gemma":[0.0009355337,0.0002154509,0.00040723098,0.0008080189,0.0018192312,0.0017395177,0.001060932,0.0015339464,0.0006338466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000682375,0.000021782598,0.0001658207,0.000015878235,0.0000033501428,0.000081507686,0.00012649548,0.00039750367,0.0015854912,0.98987854,0.0010077576,0.0066475356],"study_design_scores_gemma":[0.000036912705,0.000037323072,0.0004905991,0.000012150424,0.0000064225223,0.00016953825,0.00009207918,0.0014847786,0.0012614672,0.9898318,0.006566328,0.000010547787],"about_ca_topic_score_codex":0.00047602446,"about_ca_topic_score_gemma":0.00043858145,"teacher_disagreement_score":0.006734201,"about_ca_system_score_codex":0.00064969604,"about_ca_system_score_gemma":0.00042908106,"threshold_uncertainty_score":0.022528112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039292283,0.00060162984,0.95053715,0.00059425615,0.00011535023,0.00016384288,0.000271136,0.0013962059,0.007028231],"genre_scores_gemma":[0.23879483,0.0007082073,0.7511429,0.00018468253,0.00016428542,0.00032645056,0.0007091356,0.00029635406,0.007673184],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983047,0.00049287704,0.00009715206,0.0003215849,0.00038132488,0.00040237544],"domain_scores_gemma":[0.9962135,0.0024121243,0.00025720565,0.00065619504,0.00029090932,0.00017002039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016153919,0.0009894656,0.0013644529,0.001124256,0.0013050397,0.002779476,0.0029539736,0.0016071643,0.007189212],"category_scores_gemma":[0.006613604,0.0008506885,0.0011119435,0.0024241405,0.0010520918,0.005258996,0.003000773,0.0021417057,0.0013856653],"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.0008134787,0.00045429243,0.00082138256,0.00052986393,0.00010363014,0.000091068505,0.000429596,0.33000275,0.0064194794,0.21077442,0.020946281,0.42861375],"study_design_scores_gemma":[0.00023257459,0.000094597395,0.0002356105,0.000029979892,0.00004005972,0.00006967423,0.000111081376,0.6846347,0.002385885,0.30728465,0.004860153,0.000021070204],"about_ca_topic_score_codex":0.0023119487,"about_ca_topic_score_gemma":0.0041333674,"teacher_disagreement_score":0.007189212,"about_ca_system_score_codex":0.0018742837,"about_ca_system_score_gemma":0.0022532297,"threshold_uncertainty_score":0.024050295},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58978146,0.0027502736,0.37432513,0.005572112,0.00019540776,0.00022715317,0.0020127275,0.0008137512,0.024322081],"genre_scores_gemma":[0.8713132,0.0010118784,0.116664514,0.00042787526,0.0003267513,0.00019218483,0.0025569838,0.00040392327,0.00710267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988172,0.00040017313,0.00003947688,0.00026185246,0.00027790226,0.0002033673],"domain_scores_gemma":[0.9874456,0.010067429,0.0009287154,0.0006796014,0.00033644054,0.00054225966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016018647,0.0012791838,0.0019736174,0.0017467346,0.001256488,0.002812625,0.0036948796,0.0034952976,0.0073151942],"category_scores_gemma":[0.018204605,0.0011393288,0.0014340155,0.0032314507,0.0018953172,0.006034955,0.0021149686,0.0032072284,0.00047530353],"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.0006732101,0.00039667307,0.005151734,0.0004125184,0.00011998275,0.00025791908,0.00026576116,0.8484166,0.00212145,0.08294776,0.0138082635,0.045428164],"study_design_scores_gemma":[0.000046671837,0.00003662305,0.000722892,0.000019160258,0.000020399024,0.000081452024,0.00007089543,0.9137782,0.00052217214,0.083833955,0.0008590878,0.000008557785],"about_ca_topic_score_codex":0.004523179,"about_ca_topic_score_gemma":0.0066575883,"teacher_disagreement_score":0.0073151942,"about_ca_system_score_codex":0.002732844,"about_ca_system_score_gemma":0.0010950472,"threshold_uncertainty_score":0.02447176},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07106001,0.2860402,0.28907305,0.016096938,0.002994107,0.00014132878,0.0016258322,0.0006157225,0.3323528],"genre_scores_gemma":[0.4652889,0.24261862,0.22650896,0.0061777225,0.0075811325,0.00030654142,0.0027306643,0.0007149897,0.04807244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884486,0.00034080909,0.00009822896,0.00029982132,0.00031271536,0.00010355661],"domain_scores_gemma":[0.998055,0.001165597,0.00014197832,0.0002889003,0.00022674486,0.00012183641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021791852,0.00065675675,0.0014439946,0.0040059797,0.0028138892,0.004175686,0.0017258594,0.0015805268,0.008878842],"category_scores_gemma":[0.0042612096,0.00078446674,0.0008419352,0.0103121195,0.0031277358,0.010259413,0.0024575666,0.003278296,0.0019048986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023569773,0.0000320127,0.00039111826,0.00030566333,0.000009012959,0.000029425799,0.00015133395,0.0007640895,0.00019527372,0.9391362,0.00669354,0.052268673],"study_design_scores_gemma":[0.000010492456,0.000021564732,0.00042372622,0.0001818762,0.000014854434,0.00023802616,0.000108248256,0.002063916,0.00024603156,0.91912323,0.0775422,0.000025915959],"about_ca_topic_score_codex":0.0011720753,"about_ca_topic_score_gemma":0.0013745944,"teacher_disagreement_score":0.008878842,"about_ca_system_score_codex":0.0022575927,"about_ca_system_score_gemma":0.0013643432,"threshold_uncertainty_score":0.029702723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18217953,0.002735652,0.74454,0.0028397993,0.0003418484,0.00016397357,0.0008863542,0.00025500124,0.066057965],"genre_scores_gemma":[0.74249727,0.003385291,0.2036783,0.00034763504,0.00033868634,0.00025846474,0.0012092114,0.00028731124,0.04799789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992956,0.0002587115,0.000031288524,0.0001364906,0.00013764377,0.0001403148],"domain_scores_gemma":[0.9984012,0.0010799866,0.00016701217,0.00008844752,0.00015214407,0.00011130535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000737241,0.0010065113,0.0012604713,0.0011621077,0.00091138715,0.0028830227,0.0018657553,0.0020234066,0.00803481],"category_scores_gemma":[0.0055189645,0.0009047208,0.0007817243,0.0026441214,0.0010214346,0.004021004,0.0014142239,0.0020852953,0.0009044183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002596287,0.00013210527,0.0003947291,0.00045886158,0.00007480016,0.00029898557,0.0002889262,0.34744814,0.0041969176,0.57421285,0.012762898,0.05947121],"study_design_scores_gemma":[0.00002681228,0.000059316437,0.00023260072,0.00004439758,0.000015972371,0.0001421579,0.00016656835,0.5740803,0.0014473214,0.4178252,0.0059351013,0.000024332254],"about_ca_topic_score_codex":0.0041466374,"about_ca_topic_score_gemma":0.0035994125,"teacher_disagreement_score":0.00803481,"about_ca_system_score_codex":0.0010955454,"about_ca_system_score_gemma":0.00084748375,"threshold_uncertainty_score":0.026879072},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8511673,0.0008092355,0.06614744,0.0014040797,0.00011129191,0.00011670814,0.00066010666,0.000307529,0.079276286],"genre_scores_gemma":[0.9741048,0.00036889248,0.012395878,0.00026996422,0.000089417335,0.00011009245,0.0008401504,0.00008633546,0.011734565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991621,0.00011458102,0.000059379883,0.00024219287,0.00025321177,0.0001685511],"domain_scores_gemma":[0.9973248,0.0013599615,0.00030422208,0.0002661816,0.00026769578,0.00047703506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067587086,0.00048800177,0.0010480504,0.002855809,0.0030858873,0.0040200315,0.0018870706,0.0017798999,0.0067211427],"category_scores_gemma":[0.0028480876,0.0009122429,0.0010584242,0.0021002637,0.0024284523,0.0045407373,0.0020749182,0.002064795,0.0005300875],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014260384,0.00008043214,0.0014443812,0.00006332782,0.000023383838,0.00023621976,0.00097410183,0.001256594,0.002522577,0.98651254,0.0012849312,0.005458903],"study_design_scores_gemma":[0.00005289199,0.000024246014,0.00200993,0.000029857882,0.000035831545,0.00040041216,0.00058989134,0.008767029,0.0014609513,0.98289514,0.00370877,0.000025069856],"about_ca_topic_score_codex":0.002155178,"about_ca_topic_score_gemma":0.0028728612,"teacher_disagreement_score":0.0067211427,"about_ca_system_score_codex":0.001358601,"about_ca_system_score_gemma":0.0005015203,"threshold_uncertainty_score":0.022484422},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13783944,0.101739496,0.0032011904,0.34802204,0.043190736,0.000024839277,0.0003337688,0.00014239369,0.36550608],"genre_scores_gemma":[0.72330457,0.020212045,0.0009702065,0.03351078,0.012271423,0.00001572458,0.00011469496,0.0001492379,0.20945136],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993475,0.00033369512,0.000026810201,0.00007085231,0.00011459179,0.00010654262],"domain_scores_gemma":[0.9979956,0.0009231485,0.00023163672,0.00020793229,0.00039012893,0.00025156903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012180564,0.0003239407,0.00040506935,0.00075210363,0.0056258296,0.005056315,0.00040177835,0.001139882,0.007067151],"category_scores_gemma":[0.0043288087,0.000119724435,0.00012771058,0.0009830325,0.0061431318,0.004701265,0.0026865643,0.0036414238,0.0014421173],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026003597,0.000036337926,0.0060716267,0.0005265146,0.00005348664,0.0021256534,0.26305068,0.00014902215,0.0014404786,0.338073,0.31816727,0.07004582],"study_design_scores_gemma":[0.00000718911,0.0000214103,0.0018884005,0.0002275426,0.000011272325,0.0008175024,0.045909513,0.000043980217,0.0003381935,0.012575915,0.93814003,0.000019024816],"about_ca_topic_score_codex":0.0057172207,"about_ca_topic_score_gemma":0.013577206,"teacher_disagreement_score":0.007067151,"about_ca_system_score_codex":0.0023218521,"about_ca_system_score_gemma":0.0011867875,"threshold_uncertainty_score":0.023641944},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034083992,0.015536602,0.8265309,0.004748282,0.0012713611,0.00013250402,0.00053919404,0.00016797139,0.11698928],"genre_scores_gemma":[0.52673984,0.024784043,0.3953654,0.0024438112,0.0032330635,0.00048609442,0.0016458939,0.0006487081,0.044653185],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990023,0.00036814954,0.00004352927,0.00022394017,0.0002563589,0.00010571044],"domain_scores_gemma":[0.9988381,0.0006889084,0.00009226189,0.000115177885,0.00016761097,0.000097929544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002639356,0.0021013443,0.001505238,0.0015001927,0.0011817084,0.002890345,0.0022608698,0.0015502933,0.008794226],"category_scores_gemma":[0.0055994648,0.0007923824,0.0023978974,0.0024645433,0.0018229149,0.0053232275,0.0022263401,0.00610596,0.000985211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079240934,0.00016116016,0.00022962519,0.00039208992,0.0000501641,0.000080178834,0.00025167112,0.06716773,0.0015854524,0.87820387,0.009675389,0.04212346],"study_design_scores_gemma":[0.00002822395,0.00008359746,0.0002471187,0.00012247865,0.000034613473,0.00007373848,0.00014289371,0.34872466,0.0008297922,0.63007915,0.019587342,0.000046400928],"about_ca_topic_score_codex":0.002231546,"about_ca_topic_score_gemma":0.0024075669,"teacher_disagreement_score":0.008794226,"about_ca_system_score_codex":0.001990437,"about_ca_system_score_gemma":0.001232388,"threshold_uncertainty_score":0.029419601},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.631368,0.0033208488,0.1442179,0.0027120658,0.00037004764,0.00011221202,0.0014675375,0.00043763613,0.21599375],"genre_scores_gemma":[0.97134584,0.0010939505,0.010504264,0.00034333504,0.0001935482,0.00005073492,0.00058991666,0.00004689668,0.015831549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973994,0.000020637348,0.0000123674745,0.0000780843,0.00008345112,0.00006555659],"domain_scores_gemma":[0.9986866,0.0005417332,0.00020217046,0.00017376454,0.00022186851,0.0001738267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038787545,0.00058022194,0.0006099147,0.0018601977,0.0014226326,0.0023777424,0.0010805452,0.0011568503,0.0070906556],"category_scores_gemma":[0.0022995654,0.00043663045,0.0006376153,0.0016406844,0.0020856676,0.0032256485,0.0013493738,0.0019614,0.00059796934],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045029108,0.000026016325,0.0003004626,0.00007353876,0.000010359185,0.0001138441,0.00018716237,0.0026331122,0.0021660072,0.9836887,0.002144794,0.008610911],"study_design_scores_gemma":[0.000013845295,0.00001695148,0.00048333406,0.0000254191,0.000014682041,0.00029882844,0.00009893621,0.0066958726,0.00091986323,0.98734146,0.0040794164,0.000011347166],"about_ca_topic_score_codex":0.0020384747,"about_ca_topic_score_gemma":0.0020418735,"teacher_disagreement_score":0.0070906556,"about_ca_system_score_codex":0.0012831771,"about_ca_system_score_gemma":0.0007705461,"threshold_uncertainty_score":0.023720622},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39427313,0.0017175737,0.5311141,0.006325206,0.00030161857,0.00040004292,0.0019412019,0.0018087055,0.062118534],"genre_scores_gemma":[0.78603905,0.0011972382,0.19667052,0.00063578476,0.00032161272,0.00029843763,0.002261261,0.0007060318,0.011870056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9927927,0.002834251,0.0004554871,0.00081040605,0.002343655,0.00076340756],"domain_scores_gemma":[0.9209332,0.06693614,0.0020647089,0.0071964157,0.0021390116,0.00073049974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039401934,0.00083086925,0.0020519227,0.0015564663,0.002412236,0.0076575903,0.002922459,0.0022561313,0.017572494],"category_scores_gemma":[0.048232447,0.0010259594,0.0018199102,0.0028300849,0.0032937464,0.014951243,0.004428584,0.004186931,0.0022162811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001180774,0.00038881868,0.0034924806,0.00059613434,0.00012361177,0.00045394653,0.00097095163,0.16144517,0.004218404,0.6368526,0.017043183,0.17323393],"study_design_scores_gemma":[0.00010313821,0.00005849815,0.00046989732,0.000050578205,0.000043599975,0.0001592611,0.00021715577,0.22062463,0.0021102258,0.77341175,0.0027138197,0.000037513906],"about_ca_topic_score_codex":0.004280206,"about_ca_topic_score_gemma":0.0052503273,"teacher_disagreement_score":0.017572494,"about_ca_system_score_codex":0.002707904,"about_ca_system_score_gemma":0.0028962991,"threshold_uncertainty_score":0.058785856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76950526,0.004416769,0.20824708,0.0041316934,0.00008395001,0.000085078376,0.0012286447,0.00041210765,0.011889392],"genre_scores_gemma":[0.97979695,0.0017471189,0.014351181,0.000336287,0.00020505257,0.0001249798,0.00072259153,0.00014263303,0.0025732322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979236,0.00083704886,0.00009295852,0.00048686922,0.00040560967,0.0002539146],"domain_scores_gemma":[0.9627995,0.026875796,0.0047267266,0.002499606,0.0015190248,0.0015792701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004943077,0.00074716844,0.0019071512,0.003144771,0.0016095188,0.0037349127,0.0038180542,0.0016536012,0.0035620318],"category_scores_gemma":[0.030539416,0.0012514312,0.001031853,0.0036943515,0.0029584754,0.009423702,0.0021464855,0.002817694,0.00037398524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003387056,0.00010754945,0.006779609,0.00018680927,0.00012926481,0.0001992249,0.0008069225,0.06724839,0.0020401662,0.9030114,0.0041983975,0.014953516],"study_design_scores_gemma":[0.00007482045,0.000037901504,0.0021835784,0.000041625666,0.00006969605,0.0003349268,0.00025584945,0.18862589,0.00072536274,0.80553615,0.0020778999,0.00003622866],"about_ca_topic_score_codex":0.0014473784,"about_ca_topic_score_gemma":0.0015752998,"teacher_disagreement_score":0.004943077,"about_ca_system_score_codex":0.0021076018,"about_ca_system_score_gemma":0.00084256724,"threshold_uncertainty_score":0.026141763},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9394887,0.00039530903,0.028534682,0.0005272449,0.000063898035,0.00004608578,0.00076836976,0.00030347053,0.029872242],"genre_scores_gemma":[0.9827608,0.00036084506,0.01201058,0.00010076879,0.00008847591,0.00008364813,0.0006778313,0.00013758271,0.0037795398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960214,0.000094643656,0.000022299879,0.00007666699,0.00010826833,0.0000959434],"domain_scores_gemma":[0.99425757,0.0031205541,0.001005433,0.0004858689,0.00052998186,0.00060057733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063440984,0.00045192175,0.0005474743,0.0033764506,0.0014300586,0.0029580786,0.0013800813,0.0009991132,0.00569488],"category_scores_gemma":[0.0058232658,0.0007655019,0.0003485476,0.0027251588,0.0014648143,0.0023188784,0.0012400693,0.0014874211,0.0005677422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006341095,0.00014844991,0.012424268,0.00019739135,0.00004565309,0.00028929304,0.0009262733,0.024619704,0.017597966,0.8986239,0.007860078,0.03663289],"study_design_scores_gemma":[0.00010056989,0.0000868119,0.009119992,0.0000524211,0.000080985374,0.00039492143,0.000648103,0.07582224,0.00515144,0.90256345,0.0059237746,0.000055328343],"about_ca_topic_score_codex":0.0014716008,"about_ca_topic_score_gemma":0.003326003,"teacher_disagreement_score":0.00569488,"about_ca_system_score_codex":0.0013810114,"about_ca_system_score_gemma":0.0008779655,"threshold_uncertainty_score":0.019051254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22171237,0.0028476438,0.41205963,0.0065566446,0.0014992553,0.00016538003,0.00070646306,0.0010026664,0.35344997],"genre_scores_gemma":[0.78508896,0.0027389857,0.072117195,0.002232344,0.0014604983,0.00028084024,0.0009468176,0.0008921213,0.13424225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985092,0.0003827344,0.000046034973,0.00031186498,0.00047140615,0.00027870477],"domain_scores_gemma":[0.9954804,0.0027837565,0.00024813338,0.0005969408,0.0005565565,0.00033420644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012210738,0.001522713,0.0013370094,0.0023405042,0.0029047346,0.0028471535,0.0015472575,0.0018233411,0.013849151],"category_scores_gemma":[0.0090454025,0.0007292117,0.0009821203,0.002965925,0.0044335607,0.0063672713,0.0050235875,0.0051326132,0.0025656072],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053141935,0.000009908607,0.00007961801,0.000025000863,0.0000042094434,0.000027167676,0.00012070811,0.001551133,0.0003792613,0.98879415,0.002092696,0.0068631],"study_design_scores_gemma":[0.000010245907,0.000008248567,0.000055994104,0.000017903449,0.000006402376,0.00004507963,0.0000426153,0.005926408,0.00063303666,0.98941725,0.003826926,0.000009936698],"about_ca_topic_score_codex":0.0025167945,"about_ca_topic_score_gemma":0.0017294128,"teacher_disagreement_score":0.013849151,"about_ca_system_score_codex":0.0023409585,"about_ca_system_score_gemma":0.0013455445,"threshold_uncertainty_score":0.046329975},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2502683,0.0009886118,0.60122454,0.0039957003,0.0004125034,0.0002129165,0.0006940807,0.00065769284,0.14154573],"genre_scores_gemma":[0.76803225,0.000782496,0.19009541,0.00022775079,0.0001252906,0.00013846098,0.0005561065,0.0001530888,0.039889146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934345,0.00019449413,0.000032188404,0.00016917662,0.00015805733,0.0001025889],"domain_scores_gemma":[0.9986337,0.00043232978,0.00024859648,0.0002454197,0.00029058303,0.00014942906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006219699,0.0005360178,0.0007880406,0.0014409703,0.0015612615,0.003125695,0.00147176,0.0017991088,0.01620951],"category_scores_gemma":[0.005861397,0.00047354386,0.00029313323,0.0014360668,0.001398974,0.003684144,0.004367891,0.0013296499,0.0046808384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085397845,0.00005838689,0.0025877,0.00015573758,0.000027934622,0.0006250019,0.0015031132,0.03045788,0.0064393696,0.85799706,0.01282777,0.086466014],"study_design_scores_gemma":[0.0001482019,0.00033709581,0.002060778,0.00020372828,0.00004292667,0.0016393572,0.0046616704,0.21741652,0.016446246,0.5715787,0.18538809,0.00007674065],"about_ca_topic_score_codex":0.001311473,"about_ca_topic_score_gemma":0.0010624754,"teacher_disagreement_score":0.01620951,"about_ca_system_score_codex":0.0008799105,"about_ca_system_score_gemma":0.00074588857,"threshold_uncertainty_score":0.05422622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025629703,0.00030609322,0.96614134,0.00036756505,0.00015068799,0.00005207782,0.00019618962,0.00012302808,0.007033467],"genre_scores_gemma":[0.68439925,0.0014903875,0.2930238,0.000531986,0.00026273396,0.000347901,0.00042964032,0.00023564327,0.019278763],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901974,0.0005094011,0.000026313066,0.000111180205,0.00018638867,0.00014700399],"domain_scores_gemma":[0.9972705,0.0015135315,0.0001895474,0.00040299245,0.00041235343,0.00021103054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014924258,0.0010977759,0.00095534406,0.0008021459,0.00071081705,0.00160409,0.0016805369,0.0008208706,0.0041114422],"category_scores_gemma":[0.005566648,0.00049392105,0.00048260955,0.0019023346,0.0011604042,0.0015409052,0.0012985484,0.0016468687,0.0005452717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025315757,0.00009407061,0.00075777655,0.0001938018,0.000059918504,0.00010746685,0.00014663098,0.40033925,0.0031523642,0.5284025,0.009347065,0.057145998],"study_design_scores_gemma":[0.000023365687,0.000023401079,0.0001780886,0.000016521211,0.000020786432,0.000043023236,0.00003318515,0.6990538,0.00052423973,0.29731652,0.002753642,0.00001335983],"about_ca_topic_score_codex":0.0033615432,"about_ca_topic_score_gemma":0.0050443057,"teacher_disagreement_score":0.0041114422,"about_ca_system_score_codex":0.0017221794,"about_ca_system_score_gemma":0.0015072312,"threshold_uncertainty_score":0.013754129},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.113282636,0.00044891806,0.85800993,0.0016514511,0.00023790229,0.00052454864,0.0014775883,0.007961752,0.016405288],"genre_scores_gemma":[0.27565342,0.00025627587,0.7105302,0.00035310833,0.00009687319,0.00033482612,0.0030819736,0.0008988484,0.008794513],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869233,0.00022808657,0.00009039277,0.00040796484,0.00024881365,0.00033245352],"domain_scores_gemma":[0.9964851,0.0015752479,0.00022004369,0.000919188,0.00039209073,0.0004083196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010684696,0.0014467466,0.0013772164,0.0009235141,0.0016158674,0.0030367954,0.0029098534,0.0015016561,0.0112729175],"category_scores_gemma":[0.0035722689,0.0010245446,0.001671623,0.0023568054,0.0011680162,0.0047004754,0.0034224992,0.0025035,0.0026622366],"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.0024282427,0.0010456922,0.003132313,0.0013976477,0.00026040385,0.00032197806,0.0008585852,0.10476445,0.043267455,0.10370404,0.047765244,0.691054],"study_design_scores_gemma":[0.0010618875,0.00044940467,0.002194315,0.000100625104,0.00031343178,0.00047227996,0.00066620833,0.6361545,0.02112776,0.31670904,0.020632377,0.000118259435],"about_ca_topic_score_codex":0.005427211,"about_ca_topic_score_gemma":0.012336808,"teacher_disagreement_score":0.0112729175,"about_ca_system_score_codex":0.002599193,"about_ca_system_score_gemma":0.0038017281,"threshold_uncertainty_score":0.03771162},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2188899,0.0029259177,0.7407129,0.0017817944,0.0004052495,0.000080546124,0.0003521779,0.0007860652,0.034065567],"genre_scores_gemma":[0.8253574,0.0014903749,0.16206947,0.00051306444,0.00016091828,0.000095107716,0.000589998,0.00077899604,0.008944698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941635,0.00017451716,0.000026606236,0.000115731484,0.00017975188,0.0000870378],"domain_scores_gemma":[0.9933518,0.0044341986,0.0005479513,0.0008925806,0.0005230047,0.00025043215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094782125,0.00063712837,0.0013995084,0.0012602234,0.0009225251,0.0025009841,0.0011819905,0.0017626012,0.0055456553],"category_scores_gemma":[0.02016943,0.0011685648,0.00079202914,0.0013614992,0.0024834848,0.00405239,0.0026973588,0.002744086,0.00069831253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005271289,0.00012388878,0.0030040417,0.0003191892,0.00006790514,0.0003314735,0.00061458553,0.36119273,0.0017892966,0.527825,0.010741813,0.093462914],"study_design_scores_gemma":[0.000027532958,0.000035926154,0.00038596123,0.00005110233,0.000015137748,0.00008006639,0.00016443605,0.22460994,0.0005923216,0.771732,0.0022911825,0.000014403081],"about_ca_topic_score_codex":0.0030994185,"about_ca_topic_score_gemma":0.0026844584,"teacher_disagreement_score":0.0055456553,"about_ca_system_score_codex":0.0007769735,"about_ca_system_score_gemma":0.00058680674,"threshold_uncertainty_score":0.018552005},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3672268,0.003182226,0.4100996,0.0019299317,0.00041695454,0.00021439757,0.003164697,0.00053279015,0.21323247],"genre_scores_gemma":[0.91246516,0.0019051902,0.04531758,0.00040029275,0.00042066257,0.0002831046,0.003579545,0.0003816361,0.035246905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988531,0.00013658039,0.000055990935,0.00026262843,0.0004038578,0.0002878602],"domain_scores_gemma":[0.99625033,0.00146781,0.00047656542,0.00042004863,0.0005826278,0.00080260093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010825585,0.0009584224,0.000883064,0.002593498,0.0013998515,0.006248145,0.0014634047,0.0009775436,0.0196378],"category_scores_gemma":[0.0056502502,0.0008376425,0.0013387442,0.0016944411,0.002403778,0.0050750794,0.0025949553,0.003979247,0.0011868197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070948015,0.000033575183,0.0012061346,0.00006831846,0.00001938773,0.00013433595,0.0002948214,0.0027057258,0.0011043336,0.97859085,0.0045982497,0.011173287],"study_design_scores_gemma":[0.000056599987,0.000072418035,0.0035760035,0.000105957115,0.0000389732,0.00055552303,0.00077567174,0.03768429,0.0014823725,0.93650347,0.01909871,0.000049932172],"about_ca_topic_score_codex":0.004481157,"about_ca_topic_score_gemma":0.0037962531,"teacher_disagreement_score":0.0196378,"about_ca_system_score_codex":0.0021612253,"about_ca_system_score_gemma":0.0008080412,"threshold_uncertainty_score":0.06569499},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7365158,0.00090815854,0.1850648,0.00066913135,0.00017823213,0.000106274725,0.00078197045,0.00020471866,0.07557087],"genre_scores_gemma":[0.9345538,0.0008932519,0.04738845,0.00023613547,0.000075353826,0.00014732867,0.000967204,0.00015447776,0.015584133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991148,0.00017526915,0.00003981703,0.00017269475,0.00028384058,0.00021362817],"domain_scores_gemma":[0.9959293,0.0018625029,0.00057510124,0.00037516924,0.000651851,0.00060608436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006778525,0.000635999,0.0011065934,0.00148176,0.0018672263,0.0043795807,0.0015253512,0.00099424,0.008548464],"category_scores_gemma":[0.0044805487,0.0008153784,0.00096135534,0.0017187349,0.0028137167,0.0030839895,0.0021312686,0.0019273389,0.00080440816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002562055,0.00003507092,0.0007560405,0.00011094559,0.000024659126,0.00025721142,0.0004585038,0.012146379,0.0036191684,0.9681981,0.0016629235,0.012474752],"study_design_scores_gemma":[0.000043664124,0.00006208765,0.00094544736,0.000096022835,0.000049217873,0.0004826115,0.0009168175,0.04669072,0.0040757433,0.9379062,0.008696212,0.00003523123],"about_ca_topic_score_codex":0.00418998,"about_ca_topic_score_gemma":0.004268214,"teacher_disagreement_score":0.008548464,"about_ca_system_score_codex":0.0012131002,"about_ca_system_score_gemma":0.0011374061,"threshold_uncertainty_score":0.028597474},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07112115,0.024738885,0.58811283,0.024960347,0.0022024098,0.00054223445,0.006692523,0.0034109964,0.27821875],"genre_scores_gemma":[0.77176267,0.014374828,0.12279766,0.0062187784,0.003538509,0.0019674578,0.00638522,0.0022865096,0.0706683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9918516,0.0019473354,0.0002304688,0.0011639444,0.002215956,0.00259063],"domain_scores_gemma":[0.93823,0.05018081,0.0015624708,0.0041712862,0.003622468,0.0022330203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009451835,0.0046592015,0.0044330726,0.0053091473,0.0038055805,0.011359036,0.0055915685,0.003925621,0.029911272],"category_scores_gemma":[0.05259462,0.0015871456,0.0025857904,0.004681403,0.0050476287,0.013111434,0.0073413593,0.011446001,0.00890618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023312294,0.0006668573,0.0028276504,0.0022843196,0.00032314006,0.00041972214,0.0013322767,0.09976795,0.008902457,0.68762755,0.11029198,0.083224945],"study_design_scores_gemma":[0.00017119334,0.00028166367,0.0018892599,0.0007173565,0.000354154,0.0005056493,0.00053577014,0.28242934,0.0056313258,0.67858624,0.028751211,0.00014683412],"about_ca_topic_score_codex":0.006013136,"about_ca_topic_score_gemma":0.009384292,"teacher_disagreement_score":0.029911272,"about_ca_system_score_codex":0.010805185,"about_ca_system_score_gemma":0.0062882984,"threshold_uncertainty_score":0.100063205},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07266608,0.0008918447,0.8625694,0.003049981,0.00036665783,0.0009380207,0.006402806,0.012419694,0.040695548],"genre_scores_gemma":[0.32126802,0.0007332406,0.63233215,0.00057359546,0.00020602807,0.0006412359,0.014130135,0.0033226104,0.026792984],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819857,0.00031196422,0.00010111367,0.0006393226,0.00035510707,0.00039390905],"domain_scores_gemma":[0.99330044,0.0040374114,0.00041689986,0.0012506172,0.0005895954,0.00040509124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014410719,0.002106968,0.0014913767,0.0020491907,0.0019214053,0.004313889,0.0043615517,0.0020130053,0.034641355],"category_scores_gemma":[0.009546839,0.0013734193,0.0031072414,0.0032551945,0.0012555078,0.005921125,0.0028537416,0.0030616887,0.006074901],"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.0017230643,0.0011327793,0.0033021814,0.0021821028,0.00037324257,0.00027640493,0.0009848226,0.13511,0.013943838,0.20926543,0.12916231,0.5025439],"study_design_scores_gemma":[0.00067334756,0.00019522275,0.0012769694,0.00015046577,0.00020792097,0.00031549946,0.0004657766,0.41395697,0.009030973,0.55133635,0.022314738,0.000075825],"about_ca_topic_score_codex":0.009125499,"about_ca_topic_score_gemma":0.022655683,"teacher_disagreement_score":0.034641355,"about_ca_system_score_codex":0.004689092,"about_ca_system_score_gemma":0.0038592077,"threshold_uncertainty_score":0.11588687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46407184,0.0017289591,0.51213944,0.0019502195,0.00011171183,0.00015560913,0.0006030391,0.00051502493,0.018724134],"genre_scores_gemma":[0.7793918,0.0015625905,0.20733549,0.00027088626,0.000226837,0.00017940672,0.0010742893,0.00017941922,0.009779277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941003,0.00015783422,0.000028943368,0.00018226755,0.00013043752,0.00009049],"domain_scores_gemma":[0.99274915,0.005120422,0.0006276018,0.00053089095,0.00045145588,0.0005204927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013821516,0.0008652424,0.0014053729,0.0027170004,0.0011686394,0.0017973456,0.0019018052,0.0020535851,0.0052092765],"category_scores_gemma":[0.013938896,0.0007852789,0.00097302167,0.002911295,0.0018925105,0.004937899,0.0018501697,0.0022287895,0.0003237169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031071345,0.00028657055,0.0053214403,0.00038542863,0.00008951367,0.0003302492,0.00060668774,0.27371934,0.0033553932,0.60874677,0.0073918016,0.09945611],"study_design_scores_gemma":[0.000026059817,0.00008766466,0.00095637643,0.000065774555,0.00003793945,0.00031732008,0.0001377702,0.61553055,0.0011250377,0.37913275,0.0025645148,0.00001817082],"about_ca_topic_score_codex":0.0020956227,"about_ca_topic_score_gemma":0.0022004438,"teacher_disagreement_score":0.0052092765,"about_ca_system_score_codex":0.0011821222,"about_ca_system_score_gemma":0.00084208284,"threshold_uncertainty_score":0.01742673},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14944871,0.0030422453,0.76743585,0.0014710503,0.00019880003,0.00033550052,0.0011693519,0.0019647148,0.07493385],"genre_scores_gemma":[0.41947263,0.0015922918,0.5476708,0.00054771715,0.00014944044,0.00030416923,0.0017316312,0.0011546663,0.02737668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99829966,0.0006173871,0.0000884193,0.00020801705,0.0005201406,0.00026635104],"domain_scores_gemma":[0.9936465,0.00465286,0.0002744283,0.0007753451,0.00046530532,0.00018558554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013485606,0.000928772,0.0016821673,0.0028331762,0.0015203138,0.0028495425,0.0018449472,0.0017787693,0.011577308],"category_scores_gemma":[0.013695068,0.0008649856,0.00082123914,0.004425234,0.002004057,0.0044702217,0.0030501322,0.0018195092,0.0026556777],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018346336,0.0002574222,0.0019005768,0.0007454743,0.00010095481,0.00035661226,0.0008674075,0.12852131,0.0072382293,0.49038666,0.021250214,0.3465406],"study_design_scores_gemma":[0.00012139032,0.00009900609,0.00036260177,0.00017885932,0.000059698432,0.0001999894,0.00025659098,0.24930647,0.004601564,0.73588496,0.008897293,0.000031561936],"about_ca_topic_score_codex":0.0022730983,"about_ca_topic_score_gemma":0.0036709758,"teacher_disagreement_score":0.011577308,"about_ca_system_score_codex":0.001387668,"about_ca_system_score_gemma":0.0012506727,"threshold_uncertainty_score":0.038729966},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5898884,0.008626578,0.32745957,0.018395998,0.0007406167,0.00007554643,0.0020082183,0.0002513888,0.052553702],"genre_scores_gemma":[0.9619127,0.0027372064,0.028188802,0.0007716777,0.0010205439,0.0001189801,0.0004984978,0.00007533502,0.004676186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99776614,0.0009426908,0.00012016591,0.0004630861,0.00047417273,0.00023375842],"domain_scores_gemma":[0.98355377,0.0102299,0.0017379139,0.001530671,0.0009656781,0.0019821886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002688369,0.001043551,0.001781874,0.003822867,0.0027293323,0.006597327,0.0022690594,0.0018688287,0.00383732],"category_scores_gemma":[0.012504223,0.0011231374,0.0010102652,0.004286325,0.007526846,0.015475289,0.0048034065,0.0045544445,0.00028830834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003323353,0.000011603464,0.00055878394,0.000043454416,0.000013851523,0.00001730361,0.00013178166,0.0015166554,0.00018535892,0.9932892,0.0011439312,0.0030549373],"study_design_scores_gemma":[0.0000078431085,0.000008650916,0.00031856223,0.000010926756,0.000008701788,0.000041338928,0.0000601194,0.006273679,0.00009623375,0.991767,0.0013966666,0.000010291438],"about_ca_topic_score_codex":0.0011058289,"about_ca_topic_score_gemma":0.000948118,"teacher_disagreement_score":0.006597327,"about_ca_system_score_codex":0.0025291569,"about_ca_system_score_gemma":0.00084913964,"threshold_uncertainty_score":0.018350422},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10575629,0.001706378,0.8765018,0.00054637616,0.00017305382,0.00028056023,0.00037534747,0.00030939985,0.014350785],"genre_scores_gemma":[0.658499,0.0013535399,0.3209676,0.00027214666,0.00011627492,0.0005338622,0.0006137384,0.00037948962,0.017264383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989784,0.0004606919,0.000048396745,0.00015600491,0.00017514647,0.00018137785],"domain_scores_gemma":[0.9982509,0.0010897425,0.00021270581,0.0000966409,0.00022715107,0.00012292142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020148472,0.0011596803,0.001965474,0.0012376986,0.00087591115,0.0015679289,0.0015801017,0.0011466541,0.004768546],"category_scores_gemma":[0.0047167884,0.0005928947,0.0007244915,0.0025403872,0.00076082617,0.0013992031,0.0011322713,0.0012663589,0.00060027913],"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.0008264413,0.0003257456,0.0007374774,0.00038243478,0.000108574764,0.00015195819,0.0002506416,0.8408361,0.0035805784,0.07959206,0.005357488,0.0678505],"study_design_scores_gemma":[0.00008228973,0.00024523027,0.00048912904,0.00004369854,0.00003787987,0.00010871986,0.000107123364,0.9589895,0.0018048448,0.03526886,0.0027965317,0.000026098365],"about_ca_topic_score_codex":0.0027488715,"about_ca_topic_score_gemma":0.0031629198,"teacher_disagreement_score":0.004768546,"about_ca_system_score_codex":0.00095159956,"about_ca_system_score_gemma":0.0012659903,"threshold_uncertainty_score":0.015952408},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58118,0.00066782004,0.3022912,0.001960935,0.0002464299,0.00019348087,0.0021451232,0.0006636251,0.1106514],"genre_scores_gemma":[0.94515926,0.00029905982,0.038913224,0.0003672519,0.000065885084,0.00017292993,0.0010599432,0.00012342703,0.013839073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992893,0.00017969406,0.00004850058,0.00021945345,0.00011723342,0.00014581908],"domain_scores_gemma":[0.99637645,0.0019284373,0.00039614158,0.0004720823,0.0003226034,0.00050427887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058547547,0.00048193237,0.00080701895,0.0012645051,0.0024943538,0.0030280293,0.0013722616,0.001165962,0.00917827],"category_scores_gemma":[0.0038095668,0.0008224424,0.0007003176,0.0017082497,0.001675113,0.0037199482,0.0017438759,0.0027546973,0.0007437632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070236885,0.000041531795,0.00052929256,0.00006625442,0.000013035847,0.0002673141,0.00025850456,0.0019345575,0.0013056631,0.98673636,0.0019109218,0.0068661897],"study_design_scores_gemma":[0.000021646469,0.000010798753,0.00019895624,0.000011484408,0.000008045879,0.00029235944,0.00016122882,0.004696514,0.0005192315,0.9918065,0.0022636787,0.000009607275],"about_ca_topic_score_codex":0.0009658093,"about_ca_topic_score_gemma":0.0021345872,"teacher_disagreement_score":0.00917827,"about_ca_system_score_codex":0.001179996,"about_ca_system_score_gemma":0.0007296493,"threshold_uncertainty_score":0.03070438},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21296379,0.0044101444,0.6112233,0.004655272,0.0007459279,0.00007577449,0.00066977384,0.00026241026,0.16499366],"genre_scores_gemma":[0.9114398,0.0031431143,0.053720724,0.0008010999,0.00072064064,0.0001263613,0.0005553583,0.00022959548,0.029263351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985514,0.00056126446,0.00005419407,0.00023868712,0.00034693567,0.00024740084],"domain_scores_gemma":[0.99639255,0.0016836843,0.00058341434,0.00037871065,0.00037400489,0.0005875229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022542311,0.001262559,0.0016738581,0.0023456842,0.0026362238,0.0026725014,0.0024775278,0.0027225462,0.009853796],"category_scores_gemma":[0.0080089895,0.0010146637,0.0014136847,0.0019538251,0.0049376525,0.0049017016,0.0050202683,0.004039969,0.0010550547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019400442,0.000008774421,0.0000766699,0.000022925113,0.0000070056,0.000016021242,0.000047742637,0.012537785,0.00018020222,0.98451287,0.00058084086,0.0019896126],"study_design_scores_gemma":[0.000006043705,0.000018040213,0.0002067024,0.000020407799,0.0000053637377,0.000023905848,0.000058300753,0.036249183,0.000072121846,0.9614922,0.0018302979,0.000017422553],"about_ca_topic_score_codex":0.002765617,"about_ca_topic_score_gemma":0.0029568328,"teacher_disagreement_score":0.009853796,"about_ca_system_score_codex":0.0015573292,"about_ca_system_score_gemma":0.0011417158,"threshold_uncertainty_score":0.03296429},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5171248,0.0063960846,0.33589897,0.0071426393,0.00070756517,0.00009253184,0.00061492034,0.0005595481,0.13146289],"genre_scores_gemma":[0.9124778,0.002784758,0.05135643,0.0008360355,0.00068723987,0.0001387595,0.00037052107,0.00017935163,0.03116913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846727,0.00040257032,0.00009458437,0.00041394585,0.00043605635,0.00018545266],"domain_scores_gemma":[0.9931503,0.0042545726,0.00078081037,0.00066964567,0.0004784309,0.0006663337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015753882,0.00071358826,0.0014149265,0.003537671,0.0023401168,0.0039118924,0.0021612563,0.002214029,0.008892074],"category_scores_gemma":[0.011042773,0.0007696259,0.0008792229,0.005044476,0.0050168424,0.01093659,0.0038977966,0.0039240774,0.00078902644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021735334,0.000016224458,0.00017278678,0.00003182073,0.0000049169075,0.00002436095,0.0001526996,0.0007443511,0.00025532994,0.9921451,0.00061413296,0.005816469],"study_design_scores_gemma":[0.000005037022,0.000004192422,0.000072483796,0.000006502255,0.000004362831,0.00004510254,0.00003736405,0.0015499875,0.00011580026,0.996851,0.0013039575,0.0000041077906],"about_ca_topic_score_codex":0.0010789118,"about_ca_topic_score_gemma":0.00096208934,"teacher_disagreement_score":0.008892074,"about_ca_system_score_codex":0.001867486,"about_ca_system_score_gemma":0.00055886677,"threshold_uncertainty_score":0.02974701},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08932563,0.006449315,0.84020776,0.005404984,0.00073286484,0.00018235612,0.0008826369,0.0014860454,0.055328462],"genre_scores_gemma":[0.9065535,0.004921992,0.06401938,0.0017025002,0.0015299824,0.0007055829,0.00068487914,0.0011270897,0.01875504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9923989,0.0017232433,0.00038976135,0.0011525935,0.0022126436,0.0021228348],"domain_scores_gemma":[0.889226,0.09159986,0.004016983,0.006721636,0.0051784283,0.0032570094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008734995,0.0035523758,0.0042885356,0.0042118505,0.0034046455,0.009149347,0.0047234553,0.0032391578,0.01581586],"category_scores_gemma":[0.059871573,0.0020527167,0.00185747,0.0045241606,0.0064085857,0.016365862,0.007885263,0.007924877,0.0022757428],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011177062,0.00017961254,0.00055363745,0.0006085394,0.00012676623,0.00023655556,0.00089426985,0.14084247,0.0071496977,0.8111601,0.009361755,0.027769027],"study_design_scores_gemma":[0.00008983751,0.00015341143,0.00028077338,0.00013413646,0.00013956153,0.00013104355,0.00018124012,0.33581513,0.0033947947,0.65588653,0.0037172886,0.0000762345],"about_ca_topic_score_codex":0.0033216132,"about_ca_topic_score_gemma":0.0040487275,"teacher_disagreement_score":0.01581586,"about_ca_system_score_codex":0.006324911,"about_ca_system_score_gemma":0.0038994278,"threshold_uncertainty_score":0.052909315},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34817654,0.00048361544,0.5986447,0.0023363556,0.0001748329,0.0006927746,0.0067740413,0.0014907526,0.041226406],"genre_scores_gemma":[0.5172837,0.0004968355,0.43884432,0.0003627446,0.000082648745,0.00023758016,0.012394659,0.0007342724,0.029563276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960667,0.00006178032,0.000017030452,0.00015106525,0.00007877611,0.00008472643],"domain_scores_gemma":[0.99855644,0.0006918865,0.00015742022,0.00020814876,0.00021481508,0.00017133316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032501755,0.0006167855,0.00081872154,0.0012856298,0.0017099897,0.0012632994,0.0017231356,0.0011772335,0.013470051],"category_scores_gemma":[0.003277461,0.000566866,0.0011673528,0.0016576216,0.0008154662,0.0019883532,0.0011399639,0.0009841898,0.0029906258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011250048,0.0010333345,0.014122743,0.0031751182,0.00044172714,0.0021337706,0.0025566802,0.1650996,0.058733005,0.3239571,0.13114363,0.29647833],"study_design_scores_gemma":[0.00021199275,0.0003652567,0.004969488,0.00021763082,0.0002477293,0.0010918255,0.0020154403,0.35938457,0.036097053,0.5654508,0.029849462,0.00009861305],"about_ca_topic_score_codex":0.0050150743,"about_ca_topic_score_gemma":0.013213897,"teacher_disagreement_score":0.013470051,"about_ca_system_score_codex":0.0008818889,"about_ca_system_score_gemma":0.0012951092,"threshold_uncertainty_score":0.045061827},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01577791,0.0015121246,0.9630722,0.0015253933,0.00017697261,0.000054985085,0.0008115891,0.000086367174,0.01698247],"genre_scores_gemma":[0.7192736,0.005176799,0.23686348,0.0007119545,0.00060640945,0.00047734636,0.0018780136,0.00029128048,0.034721088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888295,0.00044924847,0.00005496997,0.00017184549,0.00032795675,0.000112994],"domain_scores_gemma":[0.99597555,0.0031342595,0.00025787114,0.00010987139,0.00040628604,0.00011614597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020845681,0.0013984458,0.0011149043,0.0009927787,0.0004473796,0.0018311467,0.0017173723,0.0016191608,0.0063855606],"category_scores_gemma":[0.0071012615,0.00068863074,0.001474831,0.0015906678,0.0010498511,0.002607346,0.0014565422,0.002655728,0.0005367003],"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.00007313719,0.00004910372,0.0004551869,0.00026764057,0.00007144665,0.00017569329,0.0000944808,0.6911745,0.0012011027,0.2833026,0.0049302774,0.018204832],"study_design_scores_gemma":[0.000011212699,0.000016455435,0.00016847263,0.000025558724,0.0000121039375,0.00003339022,0.000021310112,0.92605776,0.00015759697,0.07146164,0.0020244857,0.000009933219],"about_ca_topic_score_codex":0.0071170735,"about_ca_topic_score_gemma":0.006059641,"teacher_disagreement_score":0.0071170735,"about_ca_system_score_codex":0.0019980539,"about_ca_system_score_gemma":0.0015804063,"threshold_uncertainty_score":0.021361828},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53777254,0.00080675137,0.4265946,0.0009558475,0.000073339805,0.0001075652,0.00047088435,0.0007474898,0.032471012],"genre_scores_gemma":[0.89262056,0.000803101,0.095071144,0.00019569811,0.00017738524,0.00017178048,0.00068103714,0.00055287965,0.0097263865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982028,0.00055714574,0.00008706428,0.0005543899,0.00038997256,0.00020861288],"domain_scores_gemma":[0.9844751,0.01128416,0.0011476045,0.0015488332,0.0005918979,0.000952412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013328323,0.0005224743,0.0016309066,0.0019027268,0.001926986,0.002183264,0.002291011,0.0014935106,0.004195523],"category_scores_gemma":[0.012008154,0.00134366,0.00094579515,0.002090236,0.0019247395,0.0050207255,0.0031285537,0.0021645885,0.00079416257],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004522002,0.00010808732,0.0037894216,0.00035281936,0.00005178949,0.00044900933,0.0013241146,0.03306215,0.014805209,0.888597,0.007175597,0.0498326],"study_design_scores_gemma":[0.00006164243,0.00006152832,0.0017924334,0.00006178957,0.00004719151,0.0007373934,0.00039042108,0.116256796,0.006402258,0.8669243,0.0072239544,0.00004042999],"about_ca_topic_score_codex":0.0007474344,"about_ca_topic_score_gemma":0.0006743788,"teacher_disagreement_score":0.004195523,"about_ca_system_score_codex":0.0011525956,"about_ca_system_score_gemma":0.00039037084,"threshold_uncertainty_score":0.014035404},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11560105,0.0010844825,0.87009305,0.0029566234,0.00012303308,0.00014977559,0.001201628,0.0006100604,0.008180341],"genre_scores_gemma":[0.77181435,0.0009817478,0.21360835,0.00047746146,0.00039829494,0.0005153371,0.0016962392,0.0006711015,0.009837046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967416,0.0015546683,0.00015285968,0.00045888906,0.0007160855,0.00037593118],"domain_scores_gemma":[0.978152,0.019115748,0.00086211023,0.0007068835,0.0007113994,0.00045185778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058340672,0.0016135842,0.003446448,0.0011965232,0.00070519856,0.004614631,0.0026383258,0.0025259892,0.005553337],"category_scores_gemma":[0.023906799,0.0011888059,0.0014974525,0.0019461847,0.0012520833,0.004492247,0.0022775473,0.0027432276,0.0005028654],"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.0005525511,0.000081439764,0.0009892668,0.0002350706,0.000076575205,0.00011092815,0.000077877,0.9409972,0.0007191336,0.030329606,0.0026803978,0.023150004],"study_design_scores_gemma":[0.000022311171,0.000039772636,0.00022546381,0.000010013587,0.000011635089,0.000027597664,0.000016072876,0.97568476,0.00021041368,0.023566717,0.00017703189,0.000008185434],"about_ca_topic_score_codex":0.006706388,"about_ca_topic_score_gemma":0.0040663374,"teacher_disagreement_score":0.006706388,"about_ca_system_score_codex":0.003502094,"about_ca_system_score_gemma":0.0030236105,"threshold_uncertainty_score":0.030853868},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49968377,0.0027460244,0.39440152,0.010965964,0.00031278338,0.00013904784,0.0016461303,0.00049824687,0.089606516],"genre_scores_gemma":[0.92005605,0.0010602839,0.06420592,0.0008385513,0.000291196,0.00017798043,0.0011918388,0.00017520659,0.012002927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990362,0.00038450336,0.000029539671,0.0002477179,0.00014216862,0.00015993457],"domain_scores_gemma":[0.9875284,0.00989166,0.0006746079,0.0008683468,0.00035879645,0.0006782235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017083733,0.00039220345,0.0012740005,0.0012028477,0.0019718627,0.002505946,0.0022667958,0.001709429,0.009506389],"category_scores_gemma":[0.016231561,0.0006872532,0.00087368605,0.0017285075,0.0029485365,0.0064421725,0.0019484579,0.0028883175,0.00070812803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030182424,0.00012067989,0.0027932858,0.00023472247,0.000049646478,0.00007897371,0.00026087996,0.042111464,0.001281722,0.9192532,0.013459164,0.020054555],"study_design_scores_gemma":[0.00006724787,0.00003170711,0.0010072824,0.00003286197,0.000026060101,0.000078902325,0.000089322995,0.10348118,0.0007873392,0.8919864,0.0023912191,0.000020470596],"about_ca_topic_score_codex":0.0016068285,"about_ca_topic_score_gemma":0.0030822325,"teacher_disagreement_score":0.009506389,"about_ca_system_score_codex":0.0017569857,"about_ca_system_score_gemma":0.0008848023,"threshold_uncertainty_score":0.031802},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7391158,0.0010125194,0.21867219,0.0016390515,0.00021644303,0.00032974017,0.002193423,0.0009519262,0.035868935],"genre_scores_gemma":[0.910698,0.00047008225,0.07217315,0.00022941407,0.00016979419,0.0001242806,0.0025630936,0.00031018548,0.013261992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986796,0.00029429983,0.00006405857,0.00044250017,0.00027825934,0.00024130514],"domain_scores_gemma":[0.9902946,0.0057830582,0.00081121083,0.0009301217,0.0006127923,0.001568215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092828844,0.00069078535,0.0021265887,0.0042114784,0.0037730918,0.004164328,0.002821483,0.002408403,0.012191967],"category_scores_gemma":[0.0097888755,0.0009542147,0.0013998816,0.004281722,0.0027297644,0.006641157,0.0034319498,0.0030615283,0.0012612604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001029735,0.0007764242,0.030880619,0.0012724288,0.00024867227,0.0012090816,0.003403902,0.0222516,0.006450252,0.7588954,0.034985162,0.1385968],"study_design_scores_gemma":[0.000120792996,0.00007571896,0.003219898,0.0001221261,0.00011304926,0.0004845706,0.0016929904,0.055587538,0.0020768049,0.92573094,0.010748757,0.000026820304],"about_ca_topic_score_codex":0.0022552395,"about_ca_topic_score_gemma":0.003548071,"teacher_disagreement_score":0.012191967,"about_ca_system_score_codex":0.0011942829,"about_ca_system_score_gemma":0.00066356827,"threshold_uncertainty_score":0.040786266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008460116,0.0003148086,0.986686,0.00018422575,0.00016552597,0.000058031375,0.00007101723,0.00027716844,0.003783181],"genre_scores_gemma":[0.114695616,0.0006304202,0.87396955,0.00022932714,0.00017571672,0.0003319581,0.0004061884,0.00046424376,0.009096909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923396,0.00018161381,0.000050230876,0.00013712722,0.00029014333,0.0001068766],"domain_scores_gemma":[0.9979844,0.0011252728,0.0001254543,0.00031865126,0.00030117235,0.00014489156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006267,0.0010766463,0.0018539566,0.0019118421,0.0011851421,0.0026726439,0.0020416733,0.0013244351,0.008609131],"category_scores_gemma":[0.006109416,0.00062655297,0.0012966451,0.002008899,0.0018014191,0.0043836893,0.004094559,0.0036849717,0.002107255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002583167,0.00012429207,0.00053809234,0.00024871185,0.00006906221,0.00007046646,0.00019829831,0.1149572,0.0035855635,0.6278414,0.0076584243,0.24445008],"study_design_scores_gemma":[0.00005760849,0.000041388237,0.00011905163,0.000036675745,0.000013031873,0.000040472878,0.000054874607,0.4364182,0.0010003311,0.5572548,0.004937234,0.000026307487],"about_ca_topic_score_codex":0.001634808,"about_ca_topic_score_gemma":0.002983592,"teacher_disagreement_score":0.008609131,"about_ca_system_score_codex":0.0011628312,"about_ca_system_score_gemma":0.0012825998,"threshold_uncertainty_score":0.028800488},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002478718,0.00017465393,0.99420726,0.00013271709,0.000042293672,0.0001841398,0.00039987147,0.0018517672,0.0005286437],"genre_scores_gemma":[0.04406742,0.00018036888,0.95211583,0.000103043916,0.0000569624,0.00032426682,0.0020536056,0.0002097128,0.0008888025],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962243,0.00087866466,0.00039215002,0.0006611871,0.0016081707,0.0002355636],"domain_scores_gemma":[0.98556626,0.008901025,0.0004034775,0.0024351412,0.002399578,0.00029453944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004150406,0.00094729185,0.0017060839,0.0036629636,0.0011454026,0.002692923,0.005020171,0.0015354493,0.005477368],"category_scores_gemma":[0.026647225,0.0009812247,0.0024712991,0.004169076,0.0009784834,0.0044188756,0.003895953,0.0025134399,0.0019834416],"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.00047973928,0.00036686228,0.0021189114,0.000655048,0.00024175362,0.00074838335,0.00050393416,0.101477526,0.005603537,0.0809308,0.021043653,0.78582984],"study_design_scores_gemma":[0.00010904606,0.00012104891,0.0003121166,0.00008931897,0.00011086399,0.00048568597,0.000109713226,0.84139806,0.005080581,0.140273,0.011864605,0.000046003785],"about_ca_topic_score_codex":0.0031436621,"about_ca_topic_score_gemma":0.0057230056,"teacher_disagreement_score":0.005477368,"about_ca_system_score_codex":0.0008637987,"about_ca_system_score_gemma":0.0022379286,"threshold_uncertainty_score":0.021949708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47152495,0.0016587225,0.4009484,0.0011179156,0.0003456214,0.000125801,0.0010086469,0.0022652585,0.121004626],"genre_scores_gemma":[0.9636248,0.00040758975,0.019423926,0.00011666999,0.00006934244,0.000081622806,0.00022186701,0.00013737543,0.015916828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995602,0.000082054794,0.000026502075,0.00013774709,0.00012483363,0.00006872194],"domain_scores_gemma":[0.99864906,0.00055917125,0.00020895131,0.0002771124,0.0002176537,0.00008815953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030564747,0.0004615434,0.00090986537,0.00071795995,0.00075169845,0.0019995586,0.0009317141,0.0010977816,0.0054504327],"category_scores_gemma":[0.0020622527,0.0004071863,0.0007987444,0.00055079325,0.001792823,0.0013904659,0.00085120305,0.0010658528,0.0010904766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086272645,0.00003055915,0.00035460308,0.00010620373,0.00002668168,0.00020220442,0.00018023443,0.023306755,0.010222079,0.9536854,0.0013456128,0.010453401],"study_design_scores_gemma":[0.000041260577,0.000048564896,0.00041147906,0.000019274978,0.00003307991,0.00041511309,0.00011841682,0.17661716,0.0072849784,0.8089988,0.0059684943,0.000043374534],"about_ca_topic_score_codex":0.00083890493,"about_ca_topic_score_gemma":0.0008829672,"teacher_disagreement_score":0.0054504327,"about_ca_system_score_codex":0.00069604395,"about_ca_system_score_gemma":0.00038356445,"threshold_uncertainty_score":0.018233478},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09801888,0.0066981534,0.23984109,0.018519156,0.0061038528,0.000059218422,0.0005981043,0.00032904916,0.62983257],"genre_scores_gemma":[0.83704865,0.0040768157,0.029325962,0.005215324,0.004836516,0.00009778755,0.0004513247,0.000343718,0.11860391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893194,0.00026820184,0.000054248496,0.00023676609,0.00036504315,0.00014378567],"domain_scores_gemma":[0.9982351,0.0007430441,0.00012899013,0.00027091912,0.0004020643,0.00021979345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015539925,0.0006094838,0.001043384,0.0018426795,0.002053686,0.003406316,0.0013411734,0.0015891115,0.011377993],"category_scores_gemma":[0.005245732,0.00035145853,0.0008296102,0.0013130396,0.0055920035,0.00815186,0.0036102503,0.00450164,0.0015195112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005510273,0.0000027691597,0.000023637665,0.000009875312,0.0000015611844,0.000015362602,0.000056713816,0.00006097237,0.00006434005,0.997259,0.0010228109,0.001477498],"study_design_scores_gemma":[0.000004168195,0.0000041823864,0.000070404676,0.000007975395,0.0000017123834,0.000044049546,0.000023445373,0.0006647085,0.000070247734,0.99477214,0.004332405,0.000004691955],"about_ca_topic_score_codex":0.0015218795,"about_ca_topic_score_gemma":0.0007564563,"teacher_disagreement_score":0.011377993,"about_ca_system_score_codex":0.0015752383,"about_ca_system_score_gemma":0.00091005256,"threshold_uncertainty_score":0.03806317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19842012,0.017237786,0.4721415,0.021586556,0.0010083148,0.00037107713,0.0039877915,0.0013305591,0.28391618],"genre_scores_gemma":[0.8534454,0.014210482,0.0775249,0.003423565,0.0026502206,0.0010876011,0.002670702,0.0012520647,0.043735106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946234,0.0016158291,0.0003062443,0.0009854413,0.0012391674,0.001229852],"domain_scores_gemma":[0.87116563,0.104693525,0.0041188085,0.006008047,0.0038026802,0.010211294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009811132,0.0029439267,0.006344751,0.007925462,0.0062680994,0.012189177,0.008737802,0.005124908,0.031953685],"category_scores_gemma":[0.0560206,0.0028742726,0.004010128,0.013182664,0.00955795,0.038162816,0.013246312,0.01970248,0.0035322674],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001918997,0.00009732713,0.00072684773,0.00032507634,0.00006855889,0.00008205331,0.00089186896,0.008576219,0.00056012755,0.96814203,0.008295749,0.012042316],"study_design_scores_gemma":[0.000034276716,0.000037831134,0.00044021368,0.00010695086,0.00009025908,0.00010028226,0.00024300857,0.016311452,0.00023948147,0.97912735,0.0032390826,0.00002977632],"about_ca_topic_score_codex":0.0017678872,"about_ca_topic_score_gemma":0.0029352407,"teacher_disagreement_score":0.031953685,"about_ca_system_score_codex":0.005161638,"about_ca_system_score_gemma":0.0020102293,"threshold_uncertainty_score":0.106895745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061961494,0.00048915454,0.9290357,0.0003892152,0.00014654023,0.00012047357,0.00014572941,0.0014515012,0.0062601874],"genre_scores_gemma":[0.44812286,0.00031512868,0.54435474,0.00024434793,0.00008571573,0.00029092483,0.000344502,0.00020082288,0.006040819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996735,0.00006722712,0.000017328794,0.00008715854,0.000067384,0.00008747498],"domain_scores_gemma":[0.99917126,0.00042775035,0.00007567977,0.00014471388,0.00011745166,0.000063247164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213065,0.00058346835,0.0008220902,0.0006613677,0.00062591885,0.00088609953,0.0024637347,0.0010006402,0.004951779],"category_scores_gemma":[0.0025619501,0.00037209367,0.0005517724,0.0012416064,0.0005129681,0.001547623,0.0014301342,0.0011728102,0.0006015529],"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.0010710899,0.0003685692,0.0011439268,0.00027316736,0.00009554142,0.00007830594,0.00017412959,0.35004386,0.010632478,0.044220652,0.010481452,0.5814168],"study_design_scores_gemma":[0.00016146783,0.00009743018,0.0001880552,0.000013739327,0.000028583841,0.000042497697,0.000027858126,0.9702917,0.0022410417,0.025177043,0.001716802,0.000013821346],"about_ca_topic_score_codex":0.0055273613,"about_ca_topic_score_gemma":0.00690986,"teacher_disagreement_score":0.0055273613,"about_ca_system_score_codex":0.0009134959,"about_ca_system_score_gemma":0.0015505909,"threshold_uncertainty_score":0.016565323},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36321586,0.0009478929,0.60512346,0.0015409573,0.0001727478,0.0001844988,0.000550328,0.0019766376,0.026287643],"genre_scores_gemma":[0.74312,0.00044033577,0.24751124,0.00030064484,0.00014811692,0.00024601838,0.0010801493,0.00067612843,0.0064772847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981187,0.0006321793,0.000079193866,0.00032673002,0.000448069,0.00039505048],"domain_scores_gemma":[0.98902076,0.0084371315,0.00070071325,0.0010877812,0.00041474967,0.00033882115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020240934,0.0016270648,0.0017567739,0.0012539154,0.0008282425,0.0031635934,0.0024540375,0.0018944183,0.0068723937],"category_scores_gemma":[0.018130874,0.0011898244,0.0012051844,0.00298251,0.0012708422,0.005604995,0.0026281984,0.0027040925,0.0006933556],"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.0005141372,0.000234507,0.0024016541,0.0001934005,0.00005939628,0.00016715373,0.00021469781,0.83485234,0.0018061807,0.07497461,0.0054944926,0.07908741],"study_design_scores_gemma":[0.00002709739,0.000038800714,0.00011378851,0.000013490694,0.000015183134,0.000042619242,0.00004897928,0.9553906,0.00067110226,0.04282653,0.00080717914,0.000004758596],"about_ca_topic_score_codex":0.0035603768,"about_ca_topic_score_gemma":0.0045521082,"teacher_disagreement_score":0.0068723937,"about_ca_system_score_codex":0.002689035,"about_ca_system_score_gemma":0.001511086,"threshold_uncertainty_score":0.022990406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3533727,0.0030686336,0.62751174,0.0019098751,0.00028682148,0.00004499935,0.001437129,0.0007767549,0.011591317],"genre_scores_gemma":[0.95018774,0.0026707174,0.0399274,0.00020267555,0.0005964941,0.00010012635,0.00087213656,0.0002488515,0.0051938877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889743,0.00038042458,0.00004701881,0.00034681335,0.00022554805,0.00010267884],"domain_scores_gemma":[0.9856865,0.010266338,0.0012577978,0.00093120337,0.001258441,0.0005997852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015933871,0.0011787411,0.0015951496,0.0030390413,0.00058607926,0.002116663,0.0022311893,0.0014585763,0.0033110518],"category_scores_gemma":[0.014652276,0.00080438674,0.0009674371,0.0022043209,0.0016058626,0.004229958,0.0008481317,0.0016405478,0.0005381687],"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.00023684178,0.0000623768,0.0036103197,0.00054341584,0.00029759356,0.00032563013,0.0003918038,0.47205973,0.0077482187,0.46404555,0.0067005637,0.04397794],"study_design_scores_gemma":[0.000017559176,0.000084064726,0.0018712986,0.000040012834,0.00008491933,0.00024556796,0.000056526784,0.5705376,0.0009672991,0.4237763,0.0022837983,0.000035021443],"about_ca_topic_score_codex":0.0018823337,"about_ca_topic_score_gemma":0.0011598323,"teacher_disagreement_score":0.0033110518,"about_ca_system_score_codex":0.0012966847,"about_ca_system_score_gemma":0.0006945428,"threshold_uncertainty_score":0.01107651},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060447644,0.00037317342,0.92627096,0.00036736758,0.00005748615,0.00016821998,0.001050711,0.00022146925,0.011042932],"genre_scores_gemma":[0.45526537,0.00078068813,0.5194956,0.00024804575,0.00011002776,0.001002925,0.00447055,0.00082695246,0.017799813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991435,0.00020416197,0.00004619866,0.00019887245,0.00031367518,0.000093530296],"domain_scores_gemma":[0.9987404,0.00064509804,0.00011292348,0.00017892981,0.00020384346,0.00011894836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071988796,0.001215551,0.0025525473,0.0019819802,0.00092775346,0.002550848,0.0021438652,0.0020121778,0.008558622],"category_scores_gemma":[0.004342048,0.0011925362,0.0010191484,0.0017531468,0.0012668999,0.0024890217,0.003815438,0.0023906776,0.0012196661],"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.000828484,0.00024518752,0.0012078859,0.00097427814,0.00018393845,0.00035648322,0.0005966057,0.5006463,0.023450218,0.3334627,0.013278202,0.12476973],"study_design_scores_gemma":[0.00007627879,0.00013405294,0.0007745854,0.000103572085,0.00004143537,0.00018037746,0.00015773861,0.8054873,0.004450421,0.18204562,0.0065180124,0.000030645704],"about_ca_topic_score_codex":0.0017275311,"about_ca_topic_score_gemma":0.0018075109,"teacher_disagreement_score":0.008558622,"about_ca_system_score_codex":0.0010158235,"about_ca_system_score_gemma":0.0009224926,"threshold_uncertainty_score":0.028631449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0729774,0.0002971566,0.92340064,0.001029527,0.000026032942,0.00008982722,0.0006729827,0.00038011398,0.0011262975],"genre_scores_gemma":[0.45146018,0.0006705083,0.5392722,0.0004810561,0.00021101811,0.00028584775,0.003593639,0.00031112914,0.0037143952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973546,0.0012306343,0.000118593955,0.0008234796,0.0002656552,0.00020707665],"domain_scores_gemma":[0.9590911,0.03479876,0.0017278197,0.0027845548,0.000807929,0.0007898794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032829456,0.0010186057,0.0026944114,0.0025243617,0.0016334436,0.0024911442,0.0032513924,0.0035917556,0.004083481],"category_scores_gemma":[0.029251117,0.0019389163,0.0018979376,0.0034150046,0.0019439445,0.008379244,0.0029601017,0.0026781631,0.00060129096],"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.00043995006,0.00035107217,0.007084833,0.00033566906,0.0002998587,0.0006101543,0.00089554314,0.7859364,0.0024077476,0.08882588,0.0075180493,0.10529489],"study_design_scores_gemma":[0.000022725295,0.000016157148,0.00036142996,0.000013679427,0.00002718539,0.000066223336,0.000045352626,0.8888486,0.00033230806,0.109717846,0.00053702353,0.000011388809],"about_ca_topic_score_codex":0.0055685965,"about_ca_topic_score_gemma":0.0059032706,"teacher_disagreement_score":0.0055685965,"about_ca_system_score_codex":0.0012063702,"about_ca_system_score_gemma":0.0012330154,"threshold_uncertainty_score":0.017362118},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077809864,0.000154707,0.97022176,0.0009640328,0.00027815916,0.0001298835,0.00060270814,0.0007092801,0.019158546],"genre_scores_gemma":[0.09362739,0.00024050227,0.8816236,0.00040638074,0.00009463654,0.00029267825,0.0008559722,0.00063211995,0.022226753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926275,0.00016161683,0.000047191286,0.00020114366,0.00019583688,0.00013147214],"domain_scores_gemma":[0.9983286,0.00092070067,0.00009697905,0.00021084987,0.0003286512,0.00011416218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013942994,0.0010526492,0.0009285181,0.000871391,0.0008993989,0.0023168635,0.0022843806,0.0017507384,0.036312368],"category_scores_gemma":[0.00927816,0.00044059032,0.0008341729,0.0009790424,0.0008658923,0.002929033,0.0023305137,0.0022369332,0.006173247],"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.0007559051,0.00031767754,0.0012024654,0.00056936376,0.00006033642,0.00016745516,0.00028551754,0.18721612,0.0076507665,0.40746716,0.07019339,0.32411394],"study_design_scores_gemma":[0.00016625736,0.00018040373,0.00032372953,0.00012646071,0.000029995947,0.00020518222,0.00012680369,0.7207825,0.004653763,0.24095447,0.032395773,0.000054656095],"about_ca_topic_score_codex":0.0014269908,"about_ca_topic_score_gemma":0.0025236907,"teacher_disagreement_score":0.036312368,"about_ca_system_score_codex":0.0016354393,"about_ca_system_score_gemma":0.0021741022,"threshold_uncertainty_score":0.12147701},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08958797,0.0011656053,0.49877125,0.0030497354,0.0014704359,0.00040795104,0.02615917,0.0076017478,0.37178618],"genre_scores_gemma":[0.42861858,0.0021156175,0.24453764,0.0010338082,0.00036603393,0.00059884094,0.053709283,0.006143736,0.2628765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995183,0.00008752164,0.000038836417,0.00014413883,0.0001308466,0.000080363025],"domain_scores_gemma":[0.99867684,0.00036204595,0.00016174758,0.00028816864,0.00036269048,0.00014855269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023961946,0.00087833026,0.00030534426,0.0010490638,0.0008040541,0.0023550114,0.0010977926,0.00082160934,0.06842081],"category_scores_gemma":[0.0030636934,0.0005445643,0.00057962,0.0013420742,0.0006932235,0.0035108163,0.001464034,0.0014002702,0.019308366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038981476,0.00018069368,0.0008282624,0.0005466018,0.000043557266,0.00045727118,0.0010541492,0.008453191,0.009353815,0.73206466,0.14736173,0.09926617],"study_design_scores_gemma":[0.00008321316,0.00006754661,0.0014503384,0.00018846373,0.000047978185,0.0005102679,0.00080800353,0.016840506,0.009833398,0.53626084,0.4338352,0.000074111405],"about_ca_topic_score_codex":0.0022017374,"about_ca_topic_score_gemma":0.0036345273,"teacher_disagreement_score":0.06842081,"about_ca_system_score_codex":0.00096832827,"about_ca_system_score_gemma":0.00065924635,"threshold_uncertainty_score":0.22889042},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73203164,0.0033759447,0.13810547,0.0021421525,0.00040270548,0.000039108083,0.0002762289,0.00041220488,0.123214565],"genre_scores_gemma":[0.975223,0.0009657505,0.010690772,0.0001969313,0.00042160958,0.00004363725,0.000176103,0.00010107518,0.012181076],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993824,0.00013299406,0.000037057067,0.000117217285,0.0001862873,0.00014402856],"domain_scores_gemma":[0.9982876,0.00068487367,0.00025548137,0.00015884227,0.00026737273,0.00034579652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008293687,0.00075204845,0.000980835,0.0054235347,0.0019444932,0.0031983668,0.0013737608,0.0014299095,0.007196482],"category_scores_gemma":[0.0034254151,0.00045974084,0.0007368785,0.002848807,0.003349344,0.004082841,0.0031067408,0.0025452843,0.0011741224],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005703236,0.00002154565,0.00021112012,0.000023725497,0.000005837335,0.000070797425,0.00016532397,0.00078973564,0.00087723264,0.991918,0.00056142587,0.0052981954],"study_design_scores_gemma":[0.000014278933,0.000020272946,0.0002722577,0.000022939637,0.000007242024,0.00016620793,0.00011541426,0.0072114007,0.0006103423,0.98991525,0.0016260784,0.000018378663],"about_ca_topic_score_codex":0.00044657625,"about_ca_topic_score_gemma":0.0002598468,"teacher_disagreement_score":0.007196482,"about_ca_system_score_codex":0.0013632085,"about_ca_system_score_gemma":0.00053113437,"threshold_uncertainty_score":0.024074674},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035724245,0.00041956248,0.9387159,0.0011719543,0.0001412038,0.00045991477,0.00089645386,0.0031189213,0.01935188],"genre_scores_gemma":[0.14596507,0.00047256474,0.8398857,0.0002599546,0.000130818,0.00042325782,0.002889167,0.0010624932,0.00891093],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980312,0.00057935796,0.00013386691,0.000390774,0.00047394805,0.00039078965],"domain_scores_gemma":[0.9929986,0.0037989707,0.00033369384,0.0016550558,0.00078321685,0.00043049353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022083079,0.002173343,0.0016392111,0.0023195425,0.0018575637,0.003986929,0.003392602,0.0019397562,0.035509795],"category_scores_gemma":[0.012864329,0.0013553888,0.0022397735,0.0031299505,0.0015100489,0.0061619733,0.005886524,0.004713148,0.007645317],"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.0011409331,0.00066626945,0.0015777139,0.0009810263,0.0001268311,0.00015826289,0.0008058574,0.10490485,0.009202439,0.20322973,0.04198663,0.63521945],"study_design_scores_gemma":[0.0004034331,0.00013169185,0.00034054896,0.00011529565,0.00008951907,0.00014670314,0.00048381992,0.40374222,0.004566779,0.5781463,0.011801679,0.000031870066],"about_ca_topic_score_codex":0.0027146265,"about_ca_topic_score_gemma":0.0064774556,"teacher_disagreement_score":0.035509795,"about_ca_system_score_codex":0.002127456,"about_ca_system_score_gemma":0.0030778574,"threshold_uncertainty_score":0.11879212},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8275404,0.0015807723,0.07939577,0.0017869833,0.00018616708,0.000037091264,0.00057075557,0.000114015114,0.08878813],"genre_scores_gemma":[0.9775743,0.0012739293,0.0092422515,0.00016244006,0.00027178437,0.00005232497,0.00044853258,0.000061472,0.010912987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970335,0.000069932976,0.00001414728,0.000070417635,0.000072217044,0.00006988817],"domain_scores_gemma":[0.99735534,0.0015470552,0.00046456116,0.00011416819,0.00017329938,0.0003456252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004040381,0.0006681443,0.00073338416,0.002631396,0.0017754448,0.0035010923,0.0008451343,0.00082669663,0.0048934654],"category_scores_gemma":[0.0027426642,0.0006080916,0.0005278302,0.0025090193,0.0043659247,0.003389632,0.0013928376,0.0024329026,0.0004524543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000724345,0.000019933168,0.0015258455,0.00004916021,0.000009523173,0.00012209383,0.0002989786,0.0065285647,0.0007936035,0.980453,0.0018425818,0.0082841525],"study_design_scores_gemma":[0.000018609195,0.000017749111,0.0025386924,0.00002168065,0.000015330532,0.00014013222,0.00031142894,0.00911356,0.0005075869,0.9841666,0.003133066,0.00001557932],"about_ca_topic_score_codex":0.003987238,"about_ca_topic_score_gemma":0.004901183,"teacher_disagreement_score":0.0048934654,"about_ca_system_score_codex":0.0013770878,"about_ca_system_score_gemma":0.0004818846,"threshold_uncertainty_score":0.016370237},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93228334,0.0010078462,0.049896028,0.002469486,0.00012668643,0.000045604982,0.0013988243,0.00020394207,0.012568258],"genre_scores_gemma":[0.96306366,0.0008159216,0.030677032,0.0002202251,0.0001914046,0.00009282984,0.0010258472,0.0001686368,0.0037443605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991278,0.0002429037,0.00005085511,0.0002621903,0.00018912237,0.00012706341],"domain_scores_gemma":[0.98638713,0.008869245,0.0013491655,0.0010898558,0.0007232894,0.0015813528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096783484,0.00078946643,0.0015404562,0.0019294213,0.0014889417,0.0027956872,0.0024557002,0.0019551942,0.003421042],"category_scores_gemma":[0.012645901,0.0006769139,0.0006824242,0.0015784227,0.002015511,0.0045054276,0.0015302132,0.0019251755,0.00048365773],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002911401,0.00036529705,0.02272157,0.0015015161,0.00031573512,0.0005239775,0.0021874704,0.14153162,0.03227182,0.71045125,0.012767156,0.07245128],"study_design_scores_gemma":[0.00020579033,0.00031553025,0.009243074,0.00012656026,0.00013256398,0.0009778667,0.0008817666,0.12525283,0.01144943,0.8447803,0.006564786,0.00006941666],"about_ca_topic_score_codex":0.0008056904,"about_ca_topic_score_gemma":0.0013230294,"teacher_disagreement_score":0.003421042,"about_ca_system_score_codex":0.0017030588,"about_ca_system_score_gemma":0.0007955525,"threshold_uncertainty_score":0.012356579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4799707,0.001323345,0.3518762,0.0020521374,0.00057930493,0.00062817626,0.0021200697,0.0014791716,0.15997085],"genre_scores_gemma":[0.78673756,0.0009217061,0.14625151,0.0008061578,0.00031311373,0.00056973787,0.0023573227,0.001169276,0.06087358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760747,0.0005313318,0.00014465889,0.00068673404,0.00037824208,0.0006514827],"domain_scores_gemma":[0.98527205,0.0062719677,0.000963512,0.004170247,0.001515364,0.0018069072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013722426,0.0016662959,0.0024210059,0.0020522273,0.0043540853,0.0043352484,0.0045838095,0.003164133,0.01711656],"category_scores_gemma":[0.014578837,0.0013222377,0.0020226904,0.002526708,0.0024453553,0.005928899,0.0043844488,0.0034434227,0.0038516808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023143918,0.00029173042,0.0035730351,0.0008773264,0.00021188358,0.00097153324,0.0007318929,0.027102636,0.025000188,0.8557623,0.014057524,0.06910557],"study_design_scores_gemma":[0.00029822826,0.00025818986,0.0010206389,0.00016224569,0.00017686369,0.00089795486,0.00037396024,0.04643105,0.0125249,0.9159709,0.021820176,0.0000647179],"about_ca_topic_score_codex":0.0015264119,"about_ca_topic_score_gemma":0.0023946124,"teacher_disagreement_score":0.01711656,"about_ca_system_score_codex":0.001386159,"about_ca_system_score_gemma":0.0017694479,"threshold_uncertainty_score":0.057260573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7668735,0.0004346855,0.2210319,0.0007564525,0.000074657895,0.00033649494,0.0015791466,0.0010539758,0.007859282],"genre_scores_gemma":[0.7554616,0.0004678488,0.23499209,0.0001978887,0.000031878462,0.0002041038,0.0024856338,0.000273809,0.0058851726],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.000091652706,0.000029985105,0.00013450957,0.00006727515,0.00009364079],"domain_scores_gemma":[0.99339163,0.005202912,0.0005700132,0.00028444984,0.00025713982,0.0002939997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052692945,0.00080857036,0.00089168554,0.0016114694,0.0015331608,0.001431171,0.0014672385,0.0013772827,0.0044289986],"category_scores_gemma":[0.005622723,0.00091824646,0.0008987277,0.001795767,0.0011906384,0.002815262,0.0016761003,0.0017185246,0.00047451057],"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.0046311086,0.0012447876,0.022452414,0.0030549697,0.00044445178,0.0023156889,0.0028540534,0.28086343,0.04127188,0.24359055,0.015572598,0.38170415],"study_design_scores_gemma":[0.0003995111,0.00051752455,0.002916728,0.00023007859,0.00021758984,0.00075394113,0.0012945852,0.29889318,0.016095389,0.6729611,0.005666046,0.000054369455],"about_ca_topic_score_codex":0.0023179296,"about_ca_topic_score_gemma":0.0036659006,"teacher_disagreement_score":0.0044289986,"about_ca_system_score_codex":0.00067626487,"about_ca_system_score_gemma":0.0011488769,"threshold_uncertainty_score":0.014816523},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31350273,0.0018362154,0.6532893,0.003428682,0.00036037085,0.00016105472,0.00085951126,0.00023672676,0.026325336],"genre_scores_gemma":[0.8800143,0.0026914207,0.09105133,0.000475342,0.0008619362,0.00021328487,0.0011136623,0.0002193818,0.02335941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990753,0.00037753402,0.000043433512,0.0002280109,0.00012490808,0.000150751],"domain_scores_gemma":[0.99645376,0.0021934162,0.0005761102,0.00020228908,0.00022567106,0.0003486925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015334331,0.0015422798,0.0024672293,0.0014867838,0.0014656557,0.0023294883,0.0022620654,0.0028376698,0.0038608573],"category_scores_gemma":[0.0068140924,0.0013191818,0.0023907004,0.0022666103,0.0019008406,0.00405885,0.001675837,0.0028365366,0.00035885122],"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.00036053735,0.0001959614,0.001366675,0.00041768336,0.00019129139,0.00095694873,0.00022524796,0.45557302,0.0017302244,0.50391585,0.011154378,0.0239122],"study_design_scores_gemma":[0.000059910333,0.000063422915,0.0005335586,0.00002258461,0.00007106004,0.00033504807,0.0001328112,0.6348732,0.0005800761,0.36022115,0.0030743764,0.000032815977],"about_ca_topic_score_codex":0.003308552,"about_ca_topic_score_gemma":0.0028141232,"teacher_disagreement_score":0.0038608573,"about_ca_system_score_codex":0.0015957109,"about_ca_system_score_gemma":0.0010690464,"threshold_uncertainty_score":0.01291585},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027807195,0.00024361577,0.9300793,0.00031539274,0.00014705416,0.000066292436,0.00058459176,0.000559275,0.04019731],"genre_scores_gemma":[0.60367364,0.00040176505,0.3860706,0.00007934344,0.00008140974,0.0001431602,0.0008116737,0.00016125372,0.008577195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999546,0.00009082759,0.000040122337,0.0000435892,0.00023789081,0.000041567724],"domain_scores_gemma":[0.9991062,0.00026468816,0.000107761385,0.00015004509,0.0003179613,0.000053187665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060604163,0.000295028,0.0003309516,0.0009360223,0.0004183921,0.0023878282,0.00076581974,0.0004266221,0.010917955],"category_scores_gemma":[0.004286877,0.00015604543,0.00026921002,0.001512746,0.00065686565,0.001410961,0.0004965679,0.0010189712,0.0013858369],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012601454,0.00005101995,0.0005717673,0.00012325164,0.000007398082,0.00010973944,0.00020690786,0.16925944,0.003702484,0.7358121,0.0030649465,0.08696486],"study_design_scores_gemma":[0.00002326359,0.000048038062,0.00030318112,0.00003929643,0.000005136487,0.0001084821,0.00009783516,0.73768926,0.0018370812,0.24517073,0.014658013,0.000019736115],"about_ca_topic_score_codex":0.001626999,"about_ca_topic_score_gemma":0.0015067188,"teacher_disagreement_score":0.010917955,"about_ca_system_score_codex":0.00068770925,"about_ca_system_score_gemma":0.000586554,"threshold_uncertainty_score":0.036524236},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100324474,0.0006406212,0.87097615,0.00042759735,0.00028541783,0.00015360076,0.00046791937,0.00024058144,0.026483634],"genre_scores_gemma":[0.6552532,0.00188996,0.3061564,0.00038128224,0.00031502577,0.00036251155,0.0016517413,0.0006995174,0.03329045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989241,0.00026687654,0.000050088696,0.0001475866,0.0005114892,0.00009981011],"domain_scores_gemma":[0.99836487,0.00082388305,0.00022186665,0.00019389958,0.00021671533,0.00017876568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000646936,0.00096368365,0.0013293624,0.0021088498,0.0013011241,0.0024699818,0.0018286112,0.0012015881,0.0055667986],"category_scores_gemma":[0.0033700399,0.0009374625,0.0011429605,0.0020366926,0.002079957,0.0022349365,0.0040349374,0.003066924,0.001014111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010490772,0.00006638215,0.00051178556,0.00015259559,0.000025644955,0.00017099727,0.00038418433,0.09239478,0.0031051903,0.864295,0.0025950875,0.036193494],"study_design_scores_gemma":[0.000027184744,0.000054370557,0.0003450159,0.00005714975,0.000011263514,0.00013973218,0.00014044801,0.23199221,0.001139847,0.7594269,0.0066466313,0.000019344201],"about_ca_topic_score_codex":0.0016386104,"about_ca_topic_score_gemma":0.0016622206,"teacher_disagreement_score":0.0055667986,"about_ca_system_score_codex":0.0008783809,"about_ca_system_score_gemma":0.00044573567,"threshold_uncertainty_score":0.018622816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4795369,0.0015792978,0.40328673,0.008150618,0.00030677876,0.00014904351,0.0021662666,0.00070802274,0.104116194],"genre_scores_gemma":[0.875189,0.0011273526,0.09810476,0.0014076905,0.00033541993,0.00020618952,0.001906826,0.00032330595,0.021399429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985911,0.0005690404,0.000070300935,0.00027712013,0.00027113702,0.00022115634],"domain_scores_gemma":[0.9855299,0.009072763,0.0015604293,0.0017113547,0.0008277426,0.0012977098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009253,0.0008345632,0.0015201168,0.0020425012,0.003019202,0.00366421,0.0022731556,0.0026106578,0.008267636],"category_scores_gemma":[0.010608127,0.0011033088,0.0008346448,0.0027801543,0.0035473038,0.008526076,0.003248431,0.0034454293,0.00074559223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000665102,0.000027889655,0.000538828,0.00006271607,0.000008412687,0.000046238987,0.00016602763,0.004302644,0.00048258188,0.98618454,0.0031319915,0.0049816817],"study_design_scores_gemma":[0.0000124448625,0.000007157519,0.0002814719,0.000021387714,0.0000057989787,0.000052549356,0.00007906374,0.014156363,0.00019188624,0.9837271,0.0014567437,0.00000804826],"about_ca_topic_score_codex":0.0047319494,"about_ca_topic_score_gemma":0.0052245446,"teacher_disagreement_score":0.008267636,"about_ca_system_score_codex":0.0023665822,"about_ca_system_score_gemma":0.001110249,"threshold_uncertainty_score":0.027657986},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11872575,0.004540948,0.82523775,0.0018938173,0.00019576274,0.00006244262,0.0009879001,0.00019221504,0.048163317],"genre_scores_gemma":[0.7971663,0.0077473465,0.16151145,0.00057865935,0.00027979468,0.00024347637,0.001458062,0.00013313288,0.030881753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961925,0.00015092788,0.000015408745,0.00009770162,0.0000645573,0.00005209441],"domain_scores_gemma":[0.9986363,0.00062983466,0.0003241047,0.00011839401,0.00014111138,0.00015020883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006547705,0.0007111012,0.0005470787,0.0022362843,0.0008408389,0.00196526,0.0006906955,0.0009220255,0.0068645612],"category_scores_gemma":[0.0030888356,0.00051200675,0.0005936677,0.0028016581,0.0016396466,0.0025859037,0.0012481628,0.001109121,0.00059713045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001928562,0.000017790282,0.00051588047,0.000058951897,0.000019919933,0.000043670927,0.00008964145,0.026468491,0.00027104813,0.95693326,0.001834665,0.013727345],"study_design_scores_gemma":[0.0000070506903,0.0000046866508,0.00017608296,0.000018643927,0.0000113448605,0.000032928816,0.000073071446,0.020379394,0.000064146494,0.97516507,0.004063235,0.00000438129],"about_ca_topic_score_codex":0.0029321094,"about_ca_topic_score_gemma":0.004115038,"teacher_disagreement_score":0.0068645612,"about_ca_system_score_codex":0.00088529696,"about_ca_system_score_gemma":0.0006785389,"threshold_uncertainty_score":0.02296418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05551619,0.002904688,0.887333,0.0021155141,0.001697202,0.00017742772,0.0007416581,0.0035927715,0.045921586],"genre_scores_gemma":[0.44240683,0.0020923843,0.52305925,0.0011418144,0.002227821,0.00037406705,0.0015206118,0.0019936871,0.025183542],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99786025,0.0004325958,0.00018955389,0.000457317,0.00079724,0.000263023],"domain_scores_gemma":[0.9953106,0.0024923144,0.00013637404,0.0016215442,0.00024076054,0.0001984893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001429874,0.0017800456,0.0017978256,0.0018547924,0.0013556909,0.004415686,0.0027159553,0.0012039068,0.016677313],"category_scores_gemma":[0.008268407,0.0007485342,0.0018159524,0.0026021802,0.0023901365,0.009561107,0.006470978,0.0038581481,0.0043947767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008515462,0.00015904584,0.0011295063,0.0006312215,0.00016148422,0.0005211656,0.0007627316,0.011838878,0.019505667,0.64434505,0.028151656,0.29194197],"study_design_scores_gemma":[0.00012009634,0.000109126326,0.00047759563,0.00006297842,0.000080534184,0.00033834353,0.00014455746,0.044706028,0.0100392345,0.91794187,0.025884712,0.00009490432],"about_ca_topic_score_codex":0.0008950773,"about_ca_topic_score_gemma":0.0013289896,"teacher_disagreement_score":0.016677313,"about_ca_system_score_codex":0.0011898244,"about_ca_system_score_gemma":0.0010218862,"threshold_uncertainty_score":0.0557912},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011354031,0.0006953711,0.9850773,0.00021635837,0.000101961945,0.000055695673,0.000053125823,0.00035267213,0.0020934248],"genre_scores_gemma":[0.2690101,0.00084814336,0.7224017,0.00028412932,0.00031445568,0.00020439379,0.00046044248,0.00034214096,0.006134434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99718684,0.0010558629,0.00017046557,0.0004622711,0.0009745427,0.00015006193],"domain_scores_gemma":[0.98767275,0.007969343,0.00053889334,0.002373751,0.0010403234,0.0004048739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003113815,0.0008985958,0.0022874768,0.003116174,0.0012531684,0.0018898273,0.0026481536,0.0031155117,0.0061473926],"category_scores_gemma":[0.029361162,0.00088590157,0.0007806519,0.0046027987,0.0026584363,0.0058803298,0.004109342,0.002017531,0.0019776018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011353431,0.0001904674,0.0010166586,0.00027224075,0.00007719654,0.00025018744,0.00036533154,0.1922906,0.010817232,0.43861288,0.00857016,0.34640166],"study_design_scores_gemma":[0.00009602825,0.00012489282,0.00018109517,0.00004221769,0.00002048121,0.00019685592,0.000051764684,0.6872347,0.0028167951,0.30548888,0.0037204258,0.000025774738],"about_ca_topic_score_codex":0.0013531148,"about_ca_topic_score_gemma":0.0013770747,"teacher_disagreement_score":0.0061473926,"about_ca_system_score_codex":0.0009531021,"about_ca_system_score_gemma":0.0011217234,"threshold_uncertainty_score":0.020565033},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5915334,0.0046225665,0.30334595,0.01649197,0.00034265913,0.00029288398,0.002070631,0.0009757336,0.0803242],"genre_scores_gemma":[0.954481,0.0016812894,0.029021313,0.0006455954,0.00046253036,0.00027684506,0.0015697906,0.00035204925,0.011509603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99376136,0.0021693998,0.00029589844,0.0011172858,0.0014818263,0.0011742475],"domain_scores_gemma":[0.91556174,0.07548557,0.0027406104,0.0032588101,0.0013352752,0.001618057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005181745,0.0017444271,0.0040248744,0.0032079269,0.0033014053,0.012156901,0.0061365822,0.0043926826,0.012251028],"category_scores_gemma":[0.03726053,0.0017663757,0.0036780615,0.005962366,0.007936001,0.034172118,0.0048360215,0.012965173,0.00070692314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005015825,0.0002592842,0.0018998857,0.00037518676,0.00013162183,0.00021003062,0.0009234013,0.048807032,0.0009885556,0.92811245,0.0038303589,0.013960587],"study_design_scores_gemma":[0.00005300789,0.000028455592,0.00047666018,0.000027365058,0.000052267562,0.00005727695,0.00017211711,0.05129047,0.00038929514,0.9466656,0.0007561978,0.000031356398],"about_ca_topic_score_codex":0.0056383573,"about_ca_topic_score_gemma":0.0056739096,"teacher_disagreement_score":0.012251028,"about_ca_system_score_codex":0.008603261,"about_ca_system_score_gemma":0.0031439732,"threshold_uncertainty_score":0.062421322},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055385776,0.041104425,0.4068786,0.41286948,0.003996864,0.00012500925,0.001938484,0.00065954484,0.07704187],"genre_scores_gemma":[0.77791774,0.033369664,0.0981686,0.033574663,0.022023275,0.00038282358,0.0024709252,0.0012762957,0.030816056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99162966,0.0034890897,0.00030863946,0.00099367,0.003042675,0.0005362429],"domain_scores_gemma":[0.9028812,0.08478839,0.0017689145,0.0055512646,0.0036155868,0.0013945845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0091397,0.0007643415,0.0025103108,0.001655613,0.0022251066,0.007426088,0.0028559095,0.005131114,0.012413744],"category_scores_gemma":[0.0601624,0.00085999956,0.0019770619,0.0026509368,0.007528905,0.03050026,0.0042559,0.013658057,0.0015648983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012533397,0.0000925702,0.0006127308,0.000373593,0.00010919414,0.00009413778,0.0002747597,0.011078019,0.00038230847,0.913228,0.041835934,0.03179345],"study_design_scores_gemma":[0.000031777086,0.00000987097,0.00019176396,0.00004498059,0.000008900583,0.000058453585,0.00011010523,0.014346023,0.00012993279,0.97490746,0.010140623,0.00002005255],"about_ca_topic_score_codex":0.0019056286,"about_ca_topic_score_gemma":0.0012769927,"teacher_disagreement_score":0.012413744,"about_ca_system_score_codex":0.0024467688,"about_ca_system_score_gemma":0.001389477,"threshold_uncertainty_score":0.04833597},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0104724765,0.059009906,0.8542865,0.009132946,0.005340713,0.00009945143,0.00019494664,0.00032094528,0.061142158],"genre_scores_gemma":[0.34055787,0.1555443,0.3831294,0.0059934226,0.012231221,0.00061155064,0.0009500451,0.0009205712,0.10006162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860245,0.0005753408,0.00008673029,0.00019151335,0.000424611,0.00011932844],"domain_scores_gemma":[0.9979201,0.0014066761,0.00010892037,0.00026716036,0.00023228856,0.00006474963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015899453,0.0016165745,0.0015566546,0.0014840453,0.0007949788,0.0024143402,0.001710216,0.0022183615,0.0065669646],"category_scores_gemma":[0.0059593534,0.0007063931,0.00075519795,0.0031899924,0.002708235,0.005311933,0.0018221108,0.002858648,0.0017183495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062234285,0.000043926317,0.00022402284,0.00048988557,0.00004115527,0.0000897978,0.00015396098,0.040712006,0.001422611,0.82220054,0.01888852,0.11567143],"study_design_scores_gemma":[0.000021165293,0.000043251788,0.00017475162,0.00013322693,0.000034883757,0.00011758973,0.000053891206,0.07121565,0.00061037135,0.86855954,0.05901989,0.000015718184],"about_ca_topic_score_codex":0.0009916382,"about_ca_topic_score_gemma":0.0012079087,"teacher_disagreement_score":0.0065669646,"about_ca_system_score_codex":0.0014353455,"about_ca_system_score_gemma":0.00076668354,"threshold_uncertainty_score":0.021968722},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5781899,0.0015040832,0.40097642,0.0023796393,0.00015212163,0.00008155105,0.00025569764,0.00052013213,0.015940446],"genre_scores_gemma":[0.96643096,0.00058776437,0.024819063,0.00030515596,0.00018374612,0.00015818862,0.0003456116,0.00028619083,0.0068833046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987067,0.00052998605,0.000045307323,0.00021466902,0.00030236223,0.00020093647],"domain_scores_gemma":[0.9813322,0.014515503,0.001276801,0.000819794,0.0008182182,0.0012375906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004416449,0.0011070262,0.0020328755,0.0021743742,0.0012687637,0.0021202979,0.002887079,0.0028637894,0.004585681],"category_scores_gemma":[0.019403106,0.0012080525,0.0011031854,0.0009785146,0.003987126,0.004986832,0.0019813078,0.0021356368,0.00057634164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038113707,0.00015191978,0.002639078,0.00022976511,0.000074949356,0.0003741024,0.0002547239,0.31027117,0.007020997,0.6717092,0.001927342,0.004965637],"study_design_scores_gemma":[0.00003169928,0.00003576757,0.0006741139,0.000023446299,0.000013217025,0.000113633556,0.000044909673,0.7597878,0.0010599649,0.23797262,0.00020603104,0.000036761958],"about_ca_topic_score_codex":0.0011175197,"about_ca_topic_score_gemma":0.0010766494,"teacher_disagreement_score":0.004585681,"about_ca_system_score_codex":0.0028982123,"about_ca_system_score_gemma":0.0014054518,"threshold_uncertainty_score":0.023356676},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79723215,0.008660658,0.100644976,0.0059272265,0.0006934129,0.00006509983,0.00026661798,0.00023059172,0.086279355],"genre_scores_gemma":[0.96809083,0.0025045143,0.009350336,0.00044512295,0.00020337665,0.00007777833,0.00015217137,0.00009122566,0.019084673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998549,0.000046601708,0.000006136171,0.0000264397,0.000031498632,0.000034501038],"domain_scores_gemma":[0.99928963,0.00041728592,0.00009502696,0.000055891822,0.000041489744,0.00010066132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060781173,0.00042857495,0.00053841114,0.001152487,0.0013057212,0.0014201751,0.0006458609,0.0013822807,0.006917262],"category_scores_gemma":[0.0019853078,0.0003230645,0.00023366215,0.0007950606,0.0020138926,0.0034188954,0.00090036256,0.0012362589,0.00037989957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028514238,0.000023169401,0.000078070065,0.000031584186,0.000002842853,0.000029770194,0.00005556588,0.0025193105,0.00089866965,0.99348676,0.00060140487,0.002244328],"study_design_scores_gemma":[0.000014707475,0.000007853964,0.0001504528,0.000007607156,0.0000020390885,0.00003553045,0.000035211888,0.012253793,0.00033407053,0.98626477,0.0008858512,0.000008039188],"about_ca_topic_score_codex":0.0008867152,"about_ca_topic_score_gemma":0.0011163444,"teacher_disagreement_score":0.006917262,"about_ca_system_score_codex":0.0006006993,"about_ca_system_score_gemma":0.00046526897,"threshold_uncertainty_score":0.02314055},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7269457,0.0023822754,0.1849272,0.0026443044,0.00045767677,0.00013408948,0.00063765096,0.00040816682,0.081462994],"genre_scores_gemma":[0.98452735,0.00065703626,0.0070702047,0.0000854203,0.00006248505,0.000045227196,0.000086300126,0.00005688705,0.0074091298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963284,0.000098274104,0.0000313688,0.0000654914,0.00007027588,0.0001017218],"domain_scores_gemma":[0.9979753,0.0010709298,0.00020711069,0.00024271538,0.00018668256,0.0003172983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008600254,0.0003800372,0.0009659523,0.0006825611,0.0011983385,0.0022840493,0.0010953774,0.00087314175,0.006668669],"category_scores_gemma":[0.0043470995,0.00042174474,0.0005739995,0.0005390042,0.0019165785,0.0032252162,0.0016182238,0.001317863,0.00031111788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095357296,0.0000314101,0.00015439671,0.00007460884,0.000010653718,0.00003517456,0.000050723975,0.033085667,0.0014494613,0.9596847,0.0008620588,0.004465728],"study_design_scores_gemma":[0.00004111266,0.000034554654,0.00016729624,0.00001677051,0.000010973433,0.000037681573,0.00008424233,0.12405516,0.0011138095,0.8729271,0.0014962117,0.000015126076],"about_ca_topic_score_codex":0.0011313467,"about_ca_topic_score_gemma":0.0017714512,"teacher_disagreement_score":0.006668669,"about_ca_system_score_codex":0.0021292365,"about_ca_system_score_gemma":0.0011740213,"threshold_uncertainty_score":0.022308886},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20412007,0.00034382148,0.74244523,0.007491579,0.00065608555,0.0011154603,0.0058082263,0.015114748,0.022904746],"genre_scores_gemma":[0.70363617,0.00019155981,0.2758969,0.0007763198,0.0003456904,0.0005335039,0.013118154,0.0016987493,0.0038030169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98822045,0.0041203755,0.0006682078,0.002581394,0.0032172806,0.0011923834],"domain_scores_gemma":[0.8870575,0.085489035,0.0035483458,0.01332691,0.0092937285,0.0012844672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005961592,0.0018245121,0.0019962082,0.003387532,0.0019422272,0.0040727886,0.003727337,0.002535491,0.022785742],"category_scores_gemma":[0.07308869,0.0014953065,0.003634819,0.0022933816,0.0033828137,0.008843964,0.0075234133,0.004385856,0.003863883],"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.003876663,0.0020973077,0.022375753,0.0023732542,0.00052543567,0.002731862,0.0032271023,0.14629096,0.025599597,0.34826478,0.10457531,0.33806187],"study_design_scores_gemma":[0.00036341127,0.0001757106,0.0011580929,0.00020190574,0.0001408124,0.0003321116,0.00092241884,0.45665598,0.012806423,0.5168406,0.010331805,0.00007084788],"about_ca_topic_score_codex":0.0021103525,"about_ca_topic_score_gemma":0.003944734,"teacher_disagreement_score":0.022785742,"about_ca_system_score_codex":0.0022242079,"about_ca_system_score_gemma":0.0036512946,"threshold_uncertainty_score":0.07622594},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6030818,0.002091523,0.38060245,0.0008695552,0.00015194328,0.00010906411,0.001899892,0.0003194834,0.010874205],"genre_scores_gemma":[0.97536147,0.00051513663,0.021828396,0.000039196613,0.00012685853,0.00007104253,0.00062665134,0.000042377036,0.0013889138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994941,0.00013122134,0.000030929645,0.00014244975,0.00014728574,0.000053985023],"domain_scores_gemma":[0.9936579,0.0042432197,0.000978453,0.0003236839,0.000541576,0.00025516623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014431799,0.0003963178,0.00074738025,0.005161317,0.0005113242,0.0017929944,0.00077374384,0.0006673078,0.002189617],"category_scores_gemma":[0.008846962,0.00020044723,0.00033813316,0.0038103198,0.0012631225,0.002908369,0.0007099146,0.0008976224,0.00023277936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053511094,0.0002678428,0.020822795,0.0003845514,0.00022112663,0.00024306054,0.0005093172,0.14644095,0.008923221,0.6564385,0.0052991146,0.15991445],"study_design_scores_gemma":[0.000040957435,0.00011129777,0.017279413,0.00008431335,0.00008757157,0.00039748056,0.00027409542,0.58566254,0.0017055715,0.3913159,0.0029586076,0.00008222055],"about_ca_topic_score_codex":0.00061365316,"about_ca_topic_score_gemma":0.0006578348,"teacher_disagreement_score":0.005161317,"about_ca_system_score_codex":0.0010078556,"about_ca_system_score_gemma":0.00033376622,"threshold_uncertainty_score":0.007632315},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7716526,0.00052194024,0.15742505,0.00082030526,0.00021211672,0.0001223648,0.0008201098,0.00044052527,0.06798499],"genre_scores_gemma":[0.9385304,0.00031696793,0.031286474,0.0002858186,0.00018322455,0.00016424722,0.0012959285,0.0003110614,0.027625876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996018,0.000100080244,0.000017226286,0.00007667413,0.00010861246,0.000095645984],"domain_scores_gemma":[0.9987997,0.00041304933,0.00018458383,0.0001576479,0.0001761842,0.00026886616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039167493,0.00051841786,0.00052642566,0.001805291,0.0011206644,0.0024059743,0.00084291375,0.00084972644,0.012393942],"category_scores_gemma":[0.0019148298,0.00049966434,0.00050360884,0.00095702946,0.0011643609,0.0022077647,0.0012855864,0.0011142598,0.0014441842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020970657,0.000053929674,0.00041591693,0.0000627621,0.000018081588,0.00014996318,0.00047283957,0.004436384,0.006169106,0.9730376,0.0045052385,0.010468444],"study_design_scores_gemma":[0.000038211365,0.0000329065,0.000594045,0.000018833338,0.000013574451,0.00013652873,0.0002977379,0.02413988,0.0014549365,0.96961975,0.0036402908,0.000013376035],"about_ca_topic_score_codex":0.0006294178,"about_ca_topic_score_gemma":0.0013684501,"teacher_disagreement_score":0.012393942,"about_ca_system_score_codex":0.00065318897,"about_ca_system_score_gemma":0.00032147637,"threshold_uncertainty_score":0.041461885},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02340347,0.012836283,0.68598604,0.023030002,0.00544707,0.00026877958,0.00035051323,0.00053566543,0.24814223],"genre_scores_gemma":[0.6511883,0.029847844,0.17904772,0.01045812,0.012285268,0.0009038491,0.0008860564,0.0013433621,0.11403939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9885069,0.0050913137,0.00067053264,0.0015809728,0.003106527,0.0010438247],"domain_scores_gemma":[0.98206836,0.0070411884,0.001030926,0.007308322,0.0020062402,0.0005449663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008951223,0.0019728183,0.0017280336,0.002565645,0.0042723324,0.0078664245,0.0037139056,0.005285153,0.011000594],"category_scores_gemma":[0.020528056,0.0013142552,0.001680529,0.0030672024,0.014385729,0.03724733,0.0111094965,0.0113935,0.006385627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030655272,0.000010625586,0.000034726938,0.000042973254,0.000006630641,0.00004499819,0.000085543004,0.000627133,0.00030619232,0.9902631,0.0027161685,0.005831329],"study_design_scores_gemma":[0.00001190448,0.000023928498,0.000043806478,0.00006653927,0.000009671225,0.00013238192,0.00004659308,0.0037344345,0.00068036444,0.97763807,0.017587366,0.000024876861],"about_ca_topic_score_codex":0.0009437401,"about_ca_topic_score_gemma":0.0006553355,"teacher_disagreement_score":0.011000594,"about_ca_system_score_codex":0.0029707048,"about_ca_system_score_gemma":0.002243581,"threshold_uncertainty_score":0.04733914},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23340939,0.0013968224,0.58170176,0.0049690898,0.0003190584,0.00032534506,0.005565271,0.0007620775,0.17155115],"genre_scores_gemma":[0.76337874,0.0012888152,0.15277591,0.001356638,0.0003545121,0.0004145214,0.0077944226,0.0005223412,0.07211406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935156,0.00017952797,0.000024331528,0.00023504173,0.00012617128,0.00008339643],"domain_scores_gemma":[0.99736625,0.0012025427,0.00024775445,0.00063385593,0.00030784152,0.00024182558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043693543,0.0005817406,0.00076520693,0.0010744869,0.0013441811,0.0020187476,0.001330754,0.0011386203,0.01847664],"category_scores_gemma":[0.003734205,0.0005433648,0.0006426735,0.0016470811,0.0009429052,0.0033276505,0.0016682295,0.002091995,0.001780509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008947089,0.00006560842,0.0010487578,0.00015850317,0.000028438386,0.0001003614,0.00015641771,0.0080955895,0.0033617439,0.93553025,0.015057141,0.036307752],"study_design_scores_gemma":[0.000019113311,0.000012176349,0.000737582,0.0000281642,0.00002143118,0.00018055567,0.00010600632,0.026254121,0.0019595467,0.9514608,0.019211192,0.000009433736],"about_ca_topic_score_codex":0.0010928379,"about_ca_topic_score_gemma":0.001879528,"teacher_disagreement_score":0.01847664,"about_ca_system_score_codex":0.0009268753,"about_ca_system_score_gemma":0.00064848515,"threshold_uncertainty_score":0.061810493},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50148,0.00053327804,0.4590633,0.0017174598,0.00024087475,0.00025373962,0.00082460785,0.0009090727,0.034977797],"genre_scores_gemma":[0.8556976,0.0004967493,0.11962135,0.00038449524,0.00014123075,0.00028999842,0.00062428013,0.0003994284,0.022344708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992173,0.00024204806,0.000044562294,0.00018064691,0.00016362072,0.00015176117],"domain_scores_gemma":[0.9936598,0.0033579427,0.00042033766,0.0010349343,0.00052914297,0.000997877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008908776,0.00057178986,0.0011585883,0.0014353525,0.0016201502,0.0025798168,0.0017671552,0.0014533057,0.009091496],"category_scores_gemma":[0.006699594,0.0008556728,0.0009046225,0.0016864184,0.0014279649,0.0043180343,0.0028203202,0.0032287808,0.0009008376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018737673,0.00014258378,0.0004962156,0.00018895678,0.000031422864,0.00012114611,0.00046258248,0.02144909,0.003468563,0.9370085,0.0037954643,0.03264809],"study_design_scores_gemma":[0.000037279944,0.000042361073,0.00022119941,0.00002202094,0.000017726026,0.000111890775,0.00014140867,0.0553377,0.001500622,0.94013983,0.0024142228,0.000013877114],"about_ca_topic_score_codex":0.0006303561,"about_ca_topic_score_gemma":0.0013132147,"teacher_disagreement_score":0.009091496,"about_ca_system_score_codex":0.0014117756,"about_ca_system_score_gemma":0.00083410926,"threshold_uncertainty_score":0.030414104},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1778417,0.00039780987,0.6898603,0.0014150388,0.00035733965,0.00020868857,0.00060659804,0.001355082,0.12795745],"genre_scores_gemma":[0.8085682,0.00044478793,0.14920321,0.0005751248,0.0001496987,0.0002362012,0.00051945914,0.000520228,0.039783053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982666,0.00033799917,0.00012328544,0.00032704402,0.0005257202,0.00041931297],"domain_scores_gemma":[0.99742365,0.0008557776,0.00014260736,0.0010413487,0.00029784552,0.00023880441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015255335,0.0006571104,0.00093456666,0.0010997395,0.0027879118,0.0032138834,0.0012508032,0.0012515003,0.012477538],"category_scores_gemma":[0.0033989842,0.00062883645,0.001018448,0.0017362839,0.0026803368,0.0059579215,0.004193565,0.0035913172,0.0018759114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007339293,0.0000140631,0.00004306347,0.000023737084,0.0000033122121,0.000025399402,0.00011555779,0.0009755301,0.0010465585,0.99154156,0.0006606076,0.0054772086],"study_design_scores_gemma":[0.000020134987,0.000014545848,0.00004678646,0.000012177318,0.000010252942,0.000042337233,0.000049294675,0.005683195,0.0026458665,0.9863193,0.005143528,0.0000126337245],"about_ca_topic_score_codex":0.001328629,"about_ca_topic_score_gemma":0.0014822001,"teacher_disagreement_score":0.012477538,"about_ca_system_score_codex":0.0015358581,"about_ca_system_score_gemma":0.0012637947,"threshold_uncertainty_score":0.04174155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028216352,0.00024723163,0.9949151,0.00014544812,0.00004668701,0.00003528119,0.000040268915,0.00006251966,0.0016858294],"genre_scores_gemma":[0.32186323,0.0011515452,0.66643506,0.00025378077,0.0002652988,0.0007240384,0.00037935778,0.00042871275,0.008499011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988697,0.00070161157,0.00003052461,0.000098226716,0.00019592459,0.00010410221],"domain_scores_gemma":[0.99648225,0.0026485343,0.00019573423,0.00011585429,0.00039800556,0.00015958324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003758928,0.0017153968,0.00233182,0.0011683778,0.0006986118,0.0012923792,0.002326682,0.0022698466,0.0070929155],"category_scores_gemma":[0.0070719565,0.0015860987,0.0013211324,0.0021461707,0.001110239,0.002383635,0.0018360522,0.0023064043,0.0006592112],"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.00005670904,0.000057391244,0.00011921755,0.000098673954,0.00003150478,0.00001674461,0.00004152774,0.9629907,0.00020749023,0.01625207,0.001904705,0.018223267],"study_design_scores_gemma":[0.000011316636,0.00002027256,0.000019959427,0.0000064079763,0.000005040574,0.000003132185,0.000005580497,0.9925575,0.00004458324,0.0068551903,0.00046778593,0.000003243353],"about_ca_topic_score_codex":0.0058553265,"about_ca_topic_score_gemma":0.004246667,"teacher_disagreement_score":0.0070929155,"about_ca_system_score_codex":0.0014283389,"about_ca_system_score_gemma":0.0016530323,"threshold_uncertainty_score":0.023728192},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5795324,0.00087887095,0.38265243,0.0005325997,0.00021494835,0.000108486165,0.00063575123,0.0012049405,0.0342397],"genre_scores_gemma":[0.87091476,0.00038333857,0.11784975,0.00011650457,0.000039669772,0.00004593706,0.0013730533,0.00019229123,0.009084789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957997,0.000057920683,0.000031519834,0.00013882012,0.000109811364,0.000081847116],"domain_scores_gemma":[0.9987999,0.00035133684,0.0001414815,0.00035744725,0.00020549896,0.00014427004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022837469,0.00030183315,0.00062031293,0.0008318539,0.0007453315,0.002269678,0.0009412272,0.0008071712,0.0046406076],"category_scores_gemma":[0.0019412495,0.00036448528,0.00053652487,0.00116799,0.0010294375,0.0022097267,0.0011835361,0.0011217517,0.001162834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008433737,0.00015360762,0.0065635704,0.00028420435,0.00004968211,0.00082336407,0.002066176,0.051734574,0.065680146,0.5563067,0.008263565,0.30723104],"study_design_scores_gemma":[0.000026840042,0.000079849975,0.002233933,0.00006585454,0.000027086484,0.00061920064,0.0010339615,0.17764018,0.016390216,0.78715414,0.014685711,0.000042923653],"about_ca_topic_score_codex":0.0019677484,"about_ca_topic_score_gemma":0.0020780615,"teacher_disagreement_score":0.0046406076,"about_ca_system_score_codex":0.0005163183,"about_ca_system_score_gemma":0.00046020915,"threshold_uncertainty_score":0.015524387},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75142056,0.00024575985,0.23735972,0.0006109159,0.0001035944,0.00024013552,0.0006871667,0.00071801175,0.008614186],"genre_scores_gemma":[0.7831916,0.00014248383,0.20807579,0.00018035878,0.000022993265,0.00013593878,0.0013724369,0.00032602026,0.0065523284],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999785,0.000026411491,0.000012155074,0.00008968245,0.000031165637,0.000055631866],"domain_scores_gemma":[0.99900573,0.00045445602,0.00011245176,0.00016719603,0.00009112181,0.00016911961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027496854,0.00097214733,0.0011204308,0.0009395409,0.0013251108,0.0009409215,0.0013273958,0.0012516481,0.0044034543],"category_scores_gemma":[0.0015317219,0.0005362255,0.00088909594,0.0007512953,0.0011905658,0.0030053372,0.0020682751,0.0011368986,0.0006486202],"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.0029740976,0.0010835857,0.023036826,0.0029600135,0.00036582164,0.0044953814,0.0042495467,0.09239277,0.21307859,0.28837925,0.028092653,0.3388915],"study_design_scores_gemma":[0.0004950866,0.0012920601,0.006219379,0.0003045478,0.0003987581,0.0017437548,0.0042344136,0.23537202,0.057384986,0.67496634,0.017436098,0.00015256753],"about_ca_topic_score_codex":0.0011395562,"about_ca_topic_score_gemma":0.0023565835,"teacher_disagreement_score":0.0044034543,"about_ca_system_score_codex":0.00039108357,"about_ca_system_score_gemma":0.00072119327,"threshold_uncertainty_score":0.01473099},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011030785,0.00015653769,0.97917145,0.000088477624,0.00002670393,0.000063409825,0.000065356195,0.00046252797,0.008934718],"genre_scores_gemma":[0.25670013,0.0004534001,0.7292804,0.00008875048,0.000046085624,0.00014345262,0.00035880343,0.0009592263,0.011969753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942684,0.00011050033,0.000021340578,0.00006746355,0.00033046427,0.000043386353],"domain_scores_gemma":[0.99887174,0.00070533605,0.00005731334,0.00016208431,0.00014301734,0.000060580922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064843224,0.0007499312,0.0011197072,0.0011819674,0.00051496545,0.0014371203,0.0010335457,0.0011140221,0.0073457365],"category_scores_gemma":[0.003736155,0.0008112306,0.00091430347,0.0008267156,0.0010132486,0.0011824364,0.0031005263,0.0026426958,0.0013748189],"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.00034580808,0.00011210888,0.00081620977,0.0005599951,0.00009548718,0.0004909873,0.00083729904,0.51554924,0.025976568,0.1963397,0.0071385014,0.25173813],"study_design_scores_gemma":[0.000034846184,0.00006164391,0.00015825826,0.000051523883,0.000013728902,0.0002111313,0.00010601879,0.91031545,0.009837338,0.072146,0.0070450935,0.000018879833],"about_ca_topic_score_codex":0.0012901274,"about_ca_topic_score_gemma":0.001376241,"teacher_disagreement_score":0.0073457365,"about_ca_system_score_codex":0.00047510373,"about_ca_system_score_gemma":0.00041649883,"threshold_uncertainty_score":0.024573922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061670285,0.0063192905,0.7744578,0.010001966,0.0010263073,0.00014014872,0.001613875,0.0003727795,0.14439754],"genre_scores_gemma":[0.6213217,0.0096535785,0.2892361,0.0016363087,0.0029563494,0.00039275212,0.0047249175,0.00043104784,0.06964729],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865556,0.00039390865,0.000090366346,0.00033620108,0.00039447594,0.00012945985],"domain_scores_gemma":[0.99606425,0.0026254721,0.000248196,0.00051645545,0.00031239667,0.00023322443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012265168,0.00067611405,0.0012008237,0.0011534056,0.0010886374,0.0037969023,0.001301822,0.0016544154,0.015345068],"category_scores_gemma":[0.008873162,0.0005428414,0.0008283818,0.0029325946,0.0017720197,0.0068383445,0.0018256457,0.004245119,0.0016933172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009876545,0.000058309637,0.00028311714,0.00013779277,0.000021614787,0.00008186343,0.00012746848,0.010642877,0.0005258428,0.9208474,0.011975201,0.055199765],"study_design_scores_gemma":[0.000019463032,0.000014052574,0.00011036374,0.000025042727,0.000008677212,0.00008024693,0.00006186831,0.021245504,0.00027434074,0.96774787,0.010404278,0.000008256749],"about_ca_topic_score_codex":0.0009185672,"about_ca_topic_score_gemma":0.00065284077,"teacher_disagreement_score":0.015345068,"about_ca_system_score_codex":0.0011437769,"about_ca_system_score_gemma":0.0012068794,"threshold_uncertainty_score":0.05133438},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045368094,0.00073646737,0.988581,0.0003349174,0.000081069025,0.000030740208,0.000043682772,0.00008093067,0.005574368],"genre_scores_gemma":[0.22434431,0.0028193304,0.75298,0.00034896669,0.00045692542,0.00043459618,0.00044286685,0.0003895723,0.017783524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993893,0.00024997228,0.000019530462,0.00007363778,0.00020822544,0.0000593155],"domain_scores_gemma":[0.9985139,0.0010972073,0.00008197804,0.00011600539,0.0001360082,0.000054779295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012532538,0.0009009389,0.000965376,0.0010732204,0.0005465457,0.0010359802,0.0013275899,0.0011117841,0.005111013],"category_scores_gemma":[0.005321723,0.00058282196,0.001196097,0.0015524974,0.0007144133,0.0016314152,0.0019025519,0.0025479004,0.0007512029],"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.00007444869,0.00010282564,0.00038879964,0.00038026684,0.000099431716,0.00012089736,0.00025720743,0.43433082,0.0035147993,0.34149188,0.014132349,0.2051063],"study_design_scores_gemma":[0.00002029615,0.000026999625,0.00012143155,0.000030506715,0.000018156466,0.00006621312,0.000038564798,0.8263542,0.00049933715,0.16484919,0.007966783,0.000008427998],"about_ca_topic_score_codex":0.0021973148,"about_ca_topic_score_gemma":0.0018566409,"teacher_disagreement_score":0.005111013,"about_ca_system_score_codex":0.0008821279,"about_ca_system_score_gemma":0.00075661554,"threshold_uncertainty_score":0.01709801},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5826954,0.0006319536,0.35845327,0.0006892356,0.00031506986,0.00010768243,0.00030393392,0.00066781597,0.056135654],"genre_scores_gemma":[0.96606886,0.00017821569,0.022417884,0.00014142136,0.00015298412,0.00008257095,0.00020713246,0.00009468918,0.010656232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868375,0.00026596256,0.00008892087,0.00021076342,0.00040935713,0.0003413324],"domain_scores_gemma":[0.9978467,0.0006688937,0.0003264719,0.00030633388,0.0004260232,0.00042560656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244,0.0005110995,0.00084243965,0.0015593813,0.001544718,0.0031177609,0.0007916726,0.0010863878,0.006153272],"category_scores_gemma":[0.0047155465,0.00031666175,0.00043549231,0.001024407,0.0018328067,0.0033252335,0.0017582765,0.0009886897,0.0012864107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034624452,0.00004078172,0.0004342117,0.00003856234,0.000009568563,0.00018506516,0.00017292761,0.0036048258,0.008871719,0.9758838,0.0009643363,0.009447932],"study_design_scores_gemma":[0.00006026309,0.00014081341,0.00049359334,0.000026319165,0.000016014523,0.000295774,0.00012209569,0.059534922,0.010548169,0.9248529,0.003865272,0.00004394083],"about_ca_topic_score_codex":0.00037632274,"about_ca_topic_score_gemma":0.00024337784,"teacher_disagreement_score":0.006153272,"about_ca_system_score_codex":0.0010691335,"about_ca_system_score_gemma":0.00089387863,"threshold_uncertainty_score":0.020584762},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20608316,0.00075152924,0.698744,0.0038096912,0.00028768086,0.00038075662,0.0031244217,0.002102045,0.08471672],"genre_scores_gemma":[0.64758396,0.0007766387,0.30611548,0.0009013769,0.00012383476,0.00036388138,0.0029954328,0.00076443685,0.040374964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932647,0.00018135818,0.00003654057,0.00015058655,0.00015130344,0.00015379637],"domain_scores_gemma":[0.9957747,0.0017878035,0.00034355547,0.0009244382,0.0006073575,0.0005621811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084898714,0.0008354313,0.000991604,0.0011968954,0.001947985,0.0024727855,0.002332579,0.002002182,0.018906958],"category_scores_gemma":[0.00571579,0.00061092386,0.0014303487,0.0015677282,0.0018604038,0.0040839757,0.0021731341,0.0030510197,0.002285297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053025474,0.00014190616,0.00065179204,0.00036473846,0.00006151394,0.00030859496,0.00031160566,0.046724964,0.0061761853,0.8836957,0.015797349,0.045235354],"study_design_scores_gemma":[0.00013048969,0.000053691965,0.00040082767,0.00003620556,0.000039452778,0.00020742377,0.00015216648,0.081467204,0.0025455754,0.90532875,0.009610406,0.000027802951],"about_ca_topic_score_codex":0.0038231835,"about_ca_topic_score_gemma":0.0059054145,"teacher_disagreement_score":0.018906958,"about_ca_system_score_codex":0.0018625967,"about_ca_system_score_gemma":0.0017227886,"threshold_uncertainty_score":0.063250065},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52348036,0.012079714,0.3334017,0.007863392,0.0010095519,0.00024575775,0.0009182972,0.0006186771,0.12038261],"genre_scores_gemma":[0.94715756,0.0024687117,0.044440206,0.0005595143,0.00024301652,0.00012825137,0.00038145605,0.00041187828,0.004209376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972218,0.0013638882,0.00008809695,0.00018772556,0.00058706803,0.00055141305],"domain_scores_gemma":[0.9496109,0.045199025,0.0014264545,0.0013910248,0.001429105,0.0009435449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060331393,0.00130436,0.0023588233,0.0017969444,0.0016179465,0.0028999187,0.0025136815,0.0021313122,0.00949984],"category_scores_gemma":[0.05306771,0.000944926,0.00076249003,0.0032236436,0.0024791912,0.00516854,0.0023361903,0.0029248525,0.0007036441],"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.0007566102,0.00015508509,0.0010655748,0.00027437357,0.000052501975,0.00009190504,0.000121223864,0.8815097,0.0012282665,0.08276378,0.0073789447,0.024601985],"study_design_scores_gemma":[0.00003136436,0.000068723704,0.00027902678,0.00003124274,0.000018904155,0.000020265017,0.00006254202,0.95719934,0.00044224193,0.041402265,0.00042876886,0.00001531003],"about_ca_topic_score_codex":0.008109698,"about_ca_topic_score_gemma":0.00700226,"teacher_disagreement_score":0.00949984,"about_ca_system_score_codex":0.0020718272,"about_ca_system_score_gemma":0.0025606942,"threshold_uncertainty_score":0.031906664},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61246103,0.0006034856,0.346184,0.00046008267,0.00015127836,0.00015042553,0.00037986698,0.00028368074,0.039326135],"genre_scores_gemma":[0.94873846,0.0004649341,0.043781426,0.00013303166,0.000048389666,0.00010224201,0.0002811702,0.000138537,0.006311741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995541,0.00011975628,0.000027787755,0.000072079114,0.000108107444,0.00011817035],"domain_scores_gemma":[0.9954106,0.0029464152,0.0004327655,0.00038644907,0.00041154475,0.00041221367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008840574,0.00032535923,0.0006024127,0.0011488873,0.0013656359,0.0020480528,0.0009876394,0.0009776996,0.0068768086],"category_scores_gemma":[0.00630558,0.00052790245,0.00055468845,0.0008428399,0.0022545455,0.0026433973,0.0015657546,0.0013527161,0.00041147196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018441952,0.00006635735,0.0010778662,0.00013095699,0.000024833867,0.00018319371,0.00044722366,0.035675187,0.0027222943,0.9382624,0.0012604663,0.01996489],"study_design_scores_gemma":[0.000044765606,0.00006783182,0.00047350064,0.000046061345,0.000015628688,0.00006938288,0.0002179469,0.08288744,0.0012677881,0.9133875,0.0014961426,0.000026071633],"about_ca_topic_score_codex":0.0013966052,"about_ca_topic_score_gemma":0.0021518418,"teacher_disagreement_score":0.0068768086,"about_ca_system_score_codex":0.0007140304,"about_ca_system_score_gemma":0.0007591213,"threshold_uncertainty_score":0.023005188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42058066,0.0049173534,0.46190894,0.018549474,0.0030277285,0.000133134,0.0037435032,0.0029715877,0.084167644],"genre_scores_gemma":[0.8021005,0.002303482,0.15989184,0.0015393374,0.00071208173,0.00013276891,0.0028761309,0.0011138752,0.029330114],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864036,0.00019699577,0.00014216772,0.0004060923,0.00046819853,0.00014614261],"domain_scores_gemma":[0.99155504,0.0037406797,0.0007219658,0.0020558555,0.0014852721,0.0004412127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007686664,0.00062542356,0.0012570873,0.0013050155,0.0013092727,0.0028204622,0.00095112313,0.0023680632,0.013208259],"category_scores_gemma":[0.020134348,0.00060186005,0.00051997305,0.0029901252,0.0017696316,0.010151444,0.0019467542,0.0016637937,0.0073651457],"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.0017906425,0.00022374015,0.015592274,0.00079847913,0.000117761294,0.0015727703,0.00077407935,0.019882401,0.026452234,0.1888186,0.03615367,0.7078234],"study_design_scores_gemma":[0.0000768639,0.0002402564,0.0046680775,0.0003810851,0.00012979699,0.004381754,0.0031662683,0.09070622,0.045184664,0.75545126,0.09543385,0.00017991249],"about_ca_topic_score_codex":0.00056023296,"about_ca_topic_score_gemma":0.00052275375,"teacher_disagreement_score":0.013208259,"about_ca_system_score_codex":0.00045568906,"about_ca_system_score_gemma":0.0006150189,"threshold_uncertainty_score":0.044186056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1991555,0.0041485997,0.56382555,0.018375719,0.0023403806,0.00016060604,0.00059756584,0.0005637176,0.21083234],"genre_scores_gemma":[0.80455405,0.0036984903,0.10706252,0.0028435357,0.0021363434,0.00030112677,0.0012869394,0.00071828335,0.07739869],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994018,0.00020016884,0.000036053334,0.00014804721,0.00010358679,0.00011036908],"domain_scores_gemma":[0.9971944,0.0019354892,0.00016422664,0.0003460179,0.00018160454,0.00017818919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010278274,0.00056925206,0.0013178951,0.0007520868,0.0017262824,0.0024249433,0.0013331668,0.0028369413,0.022078937],"category_scores_gemma":[0.0073966887,0.0004365316,0.0011686728,0.0013850769,0.002911994,0.0056679193,0.0026429787,0.0028755192,0.0018443756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045721787,0.000017834034,0.000119952565,0.00006227967,0.000008646927,0.000086963526,0.00010419682,0.0072489786,0.00029817194,0.97369194,0.0060852137,0.012230093],"study_design_scores_gemma":[0.000015434749,0.000006734261,0.000035118293,0.000009297349,0.000003417708,0.000028566003,0.000038757393,0.015749482,0.00013472929,0.9815377,0.0024360833,0.0000045423158],"about_ca_topic_score_codex":0.001453932,"about_ca_topic_score_gemma":0.0008124123,"teacher_disagreement_score":0.022078937,"about_ca_system_score_codex":0.0009799886,"about_ca_system_score_gemma":0.00086822547,"threshold_uncertainty_score":0.07386136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100523524,0.0070630605,0.8260198,0.0028950677,0.0014123885,0.00015489834,0.0007775215,0.0020985084,0.05905521],"genre_scores_gemma":[0.75436133,0.0032964356,0.20466472,0.0015897657,0.000753856,0.00019852245,0.00042764336,0.00054494094,0.0341628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995214,0.00011833101,0.000028978273,0.00007400898,0.00018207573,0.00007523772],"domain_scores_gemma":[0.99859387,0.0007241733,0.000119801414,0.00033998338,0.00014222403,0.0000799985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077552773,0.0003155154,0.0008766062,0.0016034937,0.0011500261,0.0023523073,0.00079367316,0.0008908279,0.0051285443],"category_scores_gemma":[0.0059184427,0.0002493504,0.00046498337,0.0015971586,0.0027353482,0.004403609,0.0015760642,0.0012336634,0.00093287416],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020023959,0.000012281565,0.00047533392,0.00008858833,0.000022354974,0.000064440595,0.00013792695,0.008021933,0.0015743742,0.92606866,0.004306662,0.05902714],"study_design_scores_gemma":[0.000028144477,0.000050229253,0.00019373056,0.000048538386,0.0000137700235,0.00023906928,0.00006496269,0.04720279,0.0021960975,0.92891634,0.021019233,0.000027071519],"about_ca_topic_score_codex":0.0010071013,"about_ca_topic_score_gemma":0.0010532581,"teacher_disagreement_score":0.0051285443,"about_ca_system_score_codex":0.0008394047,"about_ca_system_score_gemma":0.0010003372,"threshold_uncertainty_score":0.01715666},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7767086,0.00030422054,0.18915837,0.0004135766,0.0001661071,0.000055816097,0.00017123843,0.0002651017,0.032756995],"genre_scores_gemma":[0.96072084,0.00031499524,0.023623519,0.00009447929,0.00012174183,0.00009804019,0.00026012713,0.000077319484,0.014688824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996939,0.0000545153,0.000017637767,0.00007769704,0.00009006751,0.00006621298],"domain_scores_gemma":[0.9987685,0.00040339943,0.00024922256,0.00018600072,0.00012230467,0.0002705946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029540458,0.00038397658,0.00061999966,0.0012591725,0.0013201206,0.0016623385,0.00089174166,0.0009067528,0.0063306703],"category_scores_gemma":[0.0016489123,0.00030259407,0.0005398317,0.0010507721,0.0010057229,0.0020535209,0.0016031777,0.0009780485,0.00058122986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777546,0.00005343282,0.0007695457,0.000074142474,0.000024327066,0.0002493323,0.00048582035,0.013592833,0.0052826963,0.9623103,0.0015165035,0.015573265],"study_design_scores_gemma":[0.000019184583,0.00005605244,0.0007641755,0.00001743268,0.000029498857,0.00023468853,0.0004064639,0.048803072,0.0024815085,0.9432202,0.0039505633,0.000017148408],"about_ca_topic_score_codex":0.00034892495,"about_ca_topic_score_gemma":0.00076142844,"teacher_disagreement_score":0.0063306703,"about_ca_system_score_codex":0.00035238807,"about_ca_system_score_gemma":0.00025183137,"threshold_uncertainty_score":0.021178186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033419698,0.001418549,0.99168676,0.00023998918,0.00011050505,0.000010844755,0.000014848234,0.000061840925,0.0031146188],"genre_scores_gemma":[0.16173473,0.009242021,0.7963011,0.0005346925,0.0007086829,0.00008058258,0.0001609995,0.00029372534,0.030943343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970883,0.00009248686,0.000018598408,0.00005136062,0.000106113184,0.000022640403],"domain_scores_gemma":[0.99942565,0.00030458046,0.000028835928,0.000056394187,0.00015896451,0.000025694993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008671056,0.0006084666,0.0006214606,0.0010974988,0.0003253884,0.0009844458,0.0008875445,0.0009181022,0.0025211987],"category_scores_gemma":[0.0019817557,0.0002635618,0.00056835805,0.00095894985,0.0010992431,0.0019178878,0.0012600704,0.0016204925,0.0008781219],"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.00016275642,0.0000652994,0.00028708906,0.00024728113,0.00004771737,0.00013461517,0.00015278751,0.06130089,0.031801667,0.62085575,0.004233997,0.28071016],"study_design_scores_gemma":[0.000019954998,0.000104085135,0.000393254,0.00004122326,0.00003402747,0.00032522526,0.00004116166,0.6121267,0.013871432,0.3468668,0.026125995,0.000050182745],"about_ca_topic_score_codex":0.0011694423,"about_ca_topic_score_gemma":0.00090244703,"teacher_disagreement_score":0.0025211987,"about_ca_system_score_codex":0.00045925053,"about_ca_system_score_gemma":0.0003272581,"threshold_uncertainty_score":0.008434236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04358098,0.0005477968,0.90320784,0.0030604568,0.0007146361,0.00017551701,0.00054051424,0.000426568,0.047745664],"genre_scores_gemma":[0.48180935,0.0012529707,0.4691376,0.0015679925,0.0014770981,0.0006648318,0.00118865,0.00051078264,0.042390727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985663,0.00047550825,0.00005883887,0.00022765079,0.00043458628,0.00023711387],"domain_scores_gemma":[0.99770504,0.0010208988,0.00018504317,0.00048341468,0.0003086055,0.00029697752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025456536,0.00161871,0.0013028124,0.0010563929,0.0009165621,0.0025353525,0.0023276117,0.0015396886,0.0110426685],"category_scores_gemma":[0.006216742,0.00073934393,0.0018642179,0.0011671692,0.0015454965,0.00409636,0.0049013337,0.008867021,0.0015753913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036628725,0.00034194774,0.00022920531,0.00044269074,0.000061483384,0.00021454389,0.0003371474,0.059343275,0.0068344204,0.8352473,0.019656947,0.07692476],"study_design_scores_gemma":[0.000121541,0.00019810024,0.0002677859,0.00009899285,0.000044514334,0.00022129227,0.00012269968,0.26684815,0.002585382,0.71581644,0.013631762,0.00004325016],"about_ca_topic_score_codex":0.0006722791,"about_ca_topic_score_gemma":0.00080538035,"teacher_disagreement_score":0.0110426685,"about_ca_system_score_codex":0.0010449104,"about_ca_system_score_gemma":0.0013792404,"threshold_uncertainty_score":0.03694135},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027598492,0.0015535698,0.1080794,0.011857993,0.0029237615,0.00032537116,0.08262676,0.016703125,0.7731702],"genre_scores_gemma":[0.05334409,0.0058441455,0.08885058,0.004158741,0.0025072298,0.00069357804,0.105061196,0.024758784,0.7147817],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99958855,0.00008518321,0.000026650285,0.000068202426,0.00019284611,0.000038524482],"domain_scores_gemma":[0.99883586,0.00055926095,0.000062136816,0.00018859853,0.00027376437,0.00008037129],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006611037,0.0011795576,0.001194507,0.0017660478,0.00069977547,0.0035085664,0.0019862254,0.0011692139,0.6562909],"category_scores_gemma":[0.004054159,0.00049268414,0.0009842541,0.0045141084,0.00060207833,0.0035374877,0.0018679099,0.0024116451,0.33532965],"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.000095720236,0.000054158627,0.00016052533,0.00028742987,0.000014423849,0.00006490352,0.00008572936,0.0014976877,0.0008355367,0.061188754,0.87184125,0.06387381],"study_design_scores_gemma":[0.00008980555,0.000026739985,0.0014444935,0.00020604546,0.000016784566,0.00014040283,0.0001186845,0.0104037365,0.0021686195,0.11878778,0.8665558,0.00004108164],"about_ca_topic_score_codex":0.010195682,"about_ca_topic_score_gemma":0.0122940205,"teacher_disagreement_score":0.6562909,"about_ca_system_score_codex":0.0017650813,"about_ca_system_score_gemma":0.0008178498,"threshold_uncertainty_score":0.4902593},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003397173,0.046699386,0.9398813,0.00039346443,0.00027799673,0.00007981484,0.0000755027,0.0003281831,0.008867119],"genre_scores_gemma":[0.11161461,0.062751964,0.81514585,0.00046344323,0.00087120186,0.00039480207,0.0006096577,0.00033043436,0.0078179985],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894327,0.00031818604,0.000083221435,0.00014034133,0.00047861843,0.000036408383],"domain_scores_gemma":[0.99898285,0.00054192205,0.000061502404,0.00016008917,0.0002244348,0.000029155013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013282248,0.0008437841,0.0023027062,0.0013653797,0.0006839976,0.0015966721,0.0020673817,0.0011792352,0.0033027425],"category_scores_gemma":[0.0034664597,0.0004796176,0.0009951688,0.0045848256,0.00053646276,0.0023119464,0.0013583843,0.0011303035,0.0013886939],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092163165,0.00014156051,0.0006670111,0.0014244029,0.00016968804,0.00005558025,0.000083491635,0.10438571,0.0019624692,0.074503906,0.009366123,0.80714786],"study_design_scores_gemma":[0.000071563125,0.0002091713,0.0007582846,0.00032953083,0.00013249283,0.00037343727,0.000086154236,0.80446786,0.0020980882,0.106306754,0.085119784,0.000046820478],"about_ca_topic_score_codex":0.0013990785,"about_ca_topic_score_gemma":0.0017450382,"teacher_disagreement_score":0.0033027425,"about_ca_system_score_codex":0.0004738735,"about_ca_system_score_gemma":0.0006907508,"threshold_uncertainty_score":0.011048794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27137607,0.021602662,0.4559497,0.007640447,0.0025507144,0.00037165338,0.0023170868,0.00036614662,0.23782551],"genre_scores_gemma":[0.77751154,0.023189718,0.09518559,0.0020536042,0.0039333953,0.0005038973,0.0034119259,0.0007663122,0.09344396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877053,0.0003059833,0.00007473086,0.00024327578,0.00040224925,0.00020327672],"domain_scores_gemma":[0.9972625,0.0013893106,0.00039270511,0.00033191327,0.0003363104,0.00028729494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011177799,0.0014237623,0.0012590812,0.0039035548,0.001495125,0.0027660734,0.0019653572,0.0019319472,0.014416178],"category_scores_gemma":[0.005971714,0.0010883885,0.0016737578,0.003835037,0.003482529,0.0063974406,0.0047890726,0.0045791753,0.0022896337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077390934,0.00004743481,0.0008080726,0.00039448735,0.000039183662,0.00023534652,0.0006180532,0.0072958837,0.0024092325,0.9513777,0.008742757,0.027954541],"study_design_scores_gemma":[0.000015487169,0.000044599114,0.00096341985,0.000111172616,0.000025989882,0.00031546454,0.0003057619,0.011211671,0.0005879018,0.9740229,0.012372066,0.000023583763],"about_ca_topic_score_codex":0.001687104,"about_ca_topic_score_gemma":0.0013763221,"teacher_disagreement_score":0.014416178,"about_ca_system_score_codex":0.0014207906,"about_ca_system_score_gemma":0.00051089743,"threshold_uncertainty_score":0.048226953},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7516237,0.0016059855,0.14891334,0.0019909632,0.0003275723,0.0001849252,0.003186132,0.00057311176,0.09159433],"genre_scores_gemma":[0.89781415,0.0017716627,0.06309373,0.0005238224,0.00030324695,0.00023218842,0.0040773274,0.00030641406,0.031877477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888986,0.000280622,0.00009579687,0.0001896847,0.00030264043,0.00024141556],"domain_scores_gemma":[0.99456525,0.0022006077,0.00086856075,0.0005554676,0.00084370864,0.0009663674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001068575,0.0008647969,0.00081319496,0.0036235165,0.0019968941,0.005013644,0.0012518729,0.0012163144,0.00837785],"category_scores_gemma":[0.005410199,0.00082812645,0.00051990687,0.0036021257,0.0014814888,0.0047296057,0.0010810096,0.0015507672,0.0012221333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027216872,0.00008494047,0.0015953738,0.000113891845,0.000021474181,0.00018745313,0.00047856607,0.003398996,0.005438886,0.96006685,0.0038844359,0.024456948],"study_design_scores_gemma":[0.00004707038,0.000030785577,0.00073284603,0.000030944702,0.000015577685,0.00012842269,0.00021124915,0.0062577124,0.0011231413,0.98589236,0.005517429,0.000012418324],"about_ca_topic_score_codex":0.0020378772,"about_ca_topic_score_gemma":0.003969505,"teacher_disagreement_score":0.00837785,"about_ca_system_score_codex":0.0018455785,"about_ca_system_score_gemma":0.0009922392,"threshold_uncertainty_score":0.0280267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064683,0.0019912375,0.88275874,0.0018364164,0.0007796794,0.0005947325,0.0062386105,0.02535287,0.015764708],"genre_scores_gemma":[0.38752466,0.0011399795,0.56408685,0.0011690051,0.00048577721,0.0013653112,0.01647097,0.0034697338,0.024287635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986255,0.00020812325,0.00022850827,0.00020074986,0.00055072206,0.00018639989],"domain_scores_gemma":[0.99387217,0.0013618974,0.0003725366,0.0032653743,0.0008381282,0.00028998186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014150088,0.00096245226,0.0013130571,0.0022517487,0.0013733179,0.002726507,0.002864398,0.0010739788,0.01391497],"category_scores_gemma":[0.007925829,0.00069430313,0.00063349906,0.0049239686,0.0011054687,0.0058236797,0.0054665287,0.0017957108,0.004135741],"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.0031534946,0.00044808997,0.0032075932,0.00075138983,0.00011210018,0.00036922516,0.0006244819,0.019951684,0.025822727,0.14735568,0.10237594,0.69582766],"study_design_scores_gemma":[0.0012282628,0.0012091914,0.0019144033,0.00042229448,0.000300088,0.001046002,0.00069872034,0.32481185,0.090010755,0.3553251,0.22278081,0.00025255102],"about_ca_topic_score_codex":0.0013921394,"about_ca_topic_score_gemma":0.0018726508,"teacher_disagreement_score":0.01391497,"about_ca_system_score_codex":0.0012982003,"about_ca_system_score_gemma":0.0015453722,"threshold_uncertainty_score":0.046550214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35741466,0.0015314819,0.6051566,0.00092442875,0.00018455763,0.00068875257,0.0017589792,0.0005845278,0.031755976],"genre_scores_gemma":[0.66384673,0.0008662466,0.3212363,0.00020521448,0.00018548423,0.00021597919,0.0025052282,0.00028216292,0.010656723],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896264,0.00018413005,0.000059072318,0.00035327493,0.00023063258,0.00021018187],"domain_scores_gemma":[0.99618053,0.0017412915,0.00033104702,0.00087435805,0.00048094967,0.00039177955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056781934,0.00062736444,0.0010972797,0.0017904778,0.0015734822,0.002582116,0.0025231685,0.0009910658,0.00559503],"category_scores_gemma":[0.0046941037,0.0007833943,0.0010214609,0.0026665118,0.0014913732,0.0037407365,0.0021469267,0.0015189723,0.0009552553],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002229963,0.00062695105,0.011140823,0.0014591166,0.00031518226,0.00051655754,0.0021232977,0.13090618,0.050061435,0.51981556,0.0152459005,0.2655591],"study_design_scores_gemma":[0.00031924815,0.0002750947,0.0064128237,0.000116437666,0.00024937137,0.00059606787,0.0017290897,0.225414,0.014468397,0.725387,0.024956163,0.000076309705],"about_ca_topic_score_codex":0.0026367402,"about_ca_topic_score_gemma":0.004678031,"teacher_disagreement_score":0.00559503,"about_ca_system_score_codex":0.0011553653,"about_ca_system_score_gemma":0.0010103914,"threshold_uncertainty_score":0.01871723},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109235734,0.0016774349,0.8727265,0.002190763,0.0005820398,0.00012834376,0.0004920687,0.00069065666,0.01227642],"genre_scores_gemma":[0.38360503,0.0011039535,0.6040021,0.00064849074,0.0004611817,0.00023629634,0.0013504208,0.0005478617,0.008044675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99427223,0.0021834231,0.0004296023,0.0013080637,0.0014753286,0.00033138736],"domain_scores_gemma":[0.98969144,0.005599836,0.00070450065,0.0017735204,0.0014818627,0.0007489281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032840148,0.0012927116,0.0024154705,0.0046375543,0.0019846815,0.0040038074,0.0028432398,0.0027203592,0.008409604],"category_scores_gemma":[0.039290406,0.0012580401,0.0021058654,0.0030327803,0.0027284368,0.008961555,0.008397386,0.00561134,0.0020635447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006412717,0.00035658447,0.00649875,0.00084100466,0.0003712575,0.0004188957,0.0012910127,0.04267306,0.008950814,0.53571916,0.018371329,0.38386682],"study_design_scores_gemma":[0.00004763496,0.0003505975,0.0010599735,0.00017055677,0.000079333586,0.000823544,0.0007649392,0.14631042,0.005023136,0.8263752,0.01891983,0.0000748274],"about_ca_topic_score_codex":0.00048241546,"about_ca_topic_score_gemma":0.0005361851,"teacher_disagreement_score":0.008409604,"about_ca_system_score_codex":0.0012140314,"about_ca_system_score_gemma":0.0011490685,"threshold_uncertainty_score":0.028132856},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71377605,0.0006035701,0.20631997,0.0025412848,0.00017026781,0.00016992813,0.0015858215,0.0017729779,0.07306006],"genre_scores_gemma":[0.95208776,0.00032174628,0.03558125,0.00037407782,0.0000987299,0.00021948935,0.0012454703,0.0003772835,0.009694175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991007,0.00015856905,0.000034052384,0.0001812937,0.0002974057,0.00022797169],"domain_scores_gemma":[0.99320555,0.003549051,0.0006900757,0.00097281835,0.00043887852,0.0011436135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007250002,0.0006476939,0.0017968392,0.0020931521,0.0023792305,0.0036684792,0.001649359,0.0022870088,0.011273857],"category_scores_gemma":[0.006177964,0.0009798169,0.001127949,0.0022565115,0.0022553317,0.005256442,0.0032253023,0.003668205,0.0014547256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037186145,0.00016201405,0.0017703326,0.00014544897,0.00003375238,0.00034825804,0.00049290183,0.008574443,0.0096108,0.958471,0.005572955,0.014446333],"study_design_scores_gemma":[0.00009008035,0.00010645485,0.0022883588,0.00003222072,0.000053394717,0.0005889649,0.00047315593,0.055073094,0.004465189,0.92996305,0.0068233907,0.00004268385],"about_ca_topic_score_codex":0.000471015,"about_ca_topic_score_gemma":0.0006664822,"teacher_disagreement_score":0.011273857,"about_ca_system_score_codex":0.0009269132,"about_ca_system_score_gemma":0.0005755899,"threshold_uncertainty_score":0.03771484},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8108715,0.0019500456,0.12745371,0.010050906,0.00021444875,0.00012923908,0.0026772104,0.0011914024,0.045461573],"genre_scores_gemma":[0.97493297,0.0008535083,0.01636239,0.00037688712,0.00039657464,0.00015520758,0.0009775192,0.0005058157,0.005439108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945733,0.0012614023,0.00026472847,0.0011683316,0.001742062,0.0009902375],"domain_scores_gemma":[0.91232395,0.06990938,0.0051919227,0.007396013,0.00189783,0.003280872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035483676,0.0011419246,0.002515026,0.0023138511,0.0022020661,0.011330318,0.005557836,0.0033151568,0.012545032],"category_scores_gemma":[0.042429116,0.0018048107,0.002071563,0.0035585219,0.0050996756,0.025244243,0.0039511523,0.0053453953,0.0010422519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011222244,0.00025952936,0.0076168273,0.00040572433,0.00015423074,0.00032174966,0.0010768268,0.101888455,0.009175621,0.8436405,0.009525207,0.024813091],"study_design_scores_gemma":[0.000074849864,0.000053666263,0.0016460071,0.00003115779,0.00005537351,0.00029722252,0.00019278156,0.12809733,0.0023557297,0.8654803,0.0016650674,0.00005050829],"about_ca_topic_score_codex":0.0015868222,"about_ca_topic_score_gemma":0.0017157666,"teacher_disagreement_score":0.012545032,"about_ca_system_score_codex":0.0045176195,"about_ca_system_score_gemma":0.0022876184,"threshold_uncertainty_score":0.041967273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00278419,0.00007024684,0.99285346,0.00008030279,0.000040881332,0.000044432963,0.00007166779,0.0011031262,0.0029515487],"genre_scores_gemma":[0.07303513,0.00027632157,0.9196541,0.00012416719,0.000038246606,0.00022428049,0.0005504156,0.0005946459,0.0055026263],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989938,0.00022265353,0.00006783099,0.00018067267,0.00043560323,0.00009939608],"domain_scores_gemma":[0.9982339,0.00057640125,0.00011990131,0.00049627945,0.0004619181,0.00011148194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000906517,0.0010170203,0.0011916041,0.002110248,0.00085410103,0.0021925974,0.0022774118,0.0011997792,0.015901333],"category_scores_gemma":[0.005037263,0.00075856125,0.001203623,0.0031243481,0.00087531505,0.0022866684,0.0035832808,0.0020714288,0.0036605857],"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.00016048632,0.00015649083,0.00070304755,0.00020421077,0.00006450176,0.00006261982,0.00015375201,0.093144625,0.005009534,0.12779224,0.01316505,0.75938344],"study_design_scores_gemma":[0.000062227526,0.00004558837,0.00018047717,0.000027677755,0.000029264249,0.000097661534,0.00006404036,0.9039912,0.0056221103,0.07441945,0.015433528,0.000026890495],"about_ca_topic_score_codex":0.0026197485,"about_ca_topic_score_gemma":0.004839699,"teacher_disagreement_score":0.015901333,"about_ca_system_score_codex":0.00065100327,"about_ca_system_score_gemma":0.0011679884,"threshold_uncertainty_score":0.053195238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6420146,0.0017866982,0.26461512,0.0091454005,0.00031071043,0.00015583413,0.0021693867,0.0007121507,0.07909003],"genre_scores_gemma":[0.9680448,0.0010420819,0.02119866,0.00032711664,0.0004791499,0.00019288898,0.0007682137,0.0002584428,0.007688609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974245,0.00068258046,0.00013283317,0.0004987678,0.0008290787,0.00043224898],"domain_scores_gemma":[0.9799605,0.014084029,0.0016665251,0.0024794838,0.0007412873,0.0010680418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017448132,0.00082086667,0.0018456595,0.0015891425,0.0019210322,0.006938362,0.004300237,0.0023306145,0.012388457],"category_scores_gemma":[0.021176893,0.0010553529,0.0014904566,0.0030835734,0.0042573796,0.017582713,0.004815517,0.0044399705,0.0009451323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026572717,0.00008147742,0.0024619144,0.00016746453,0.00002857896,0.0001716148,0.00054317294,0.04170179,0.001775131,0.9291342,0.0048803817,0.018788557],"study_design_scores_gemma":[0.000028283555,0.000028107163,0.0008236603,0.000019898904,0.0000264257,0.00019911215,0.00013772196,0.073195316,0.0006209143,0.9229144,0.0019810894,0.000025061952],"about_ca_topic_score_codex":0.0018646314,"about_ca_topic_score_gemma":0.0014016185,"teacher_disagreement_score":0.012388457,"about_ca_system_score_codex":0.0027772249,"about_ca_system_score_gemma":0.0016376807,"threshold_uncertainty_score":0.041443527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023245063,0.0008799695,0.89337844,0.0014533788,0.0003046408,0.00009570273,0.00033484836,0.000075099386,0.08023297],"genre_scores_gemma":[0.62309587,0.0016788598,0.3165219,0.0008604049,0.00071121537,0.00035464772,0.0006981347,0.00020655882,0.055872355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992447,0.000372721,0.000024644294,0.000117892465,0.00015614356,0.00008388449],"domain_scores_gemma":[0.9989537,0.00059351226,0.00013223059,0.000070253256,0.00020040487,0.00004991708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016388724,0.0009252602,0.00053526246,0.00069787714,0.00042195688,0.0012332881,0.0012470945,0.0013048036,0.009070038],"category_scores_gemma":[0.0047195205,0.00032586613,0.00059140194,0.00068949815,0.0007646155,0.0019052958,0.0011757128,0.0014441395,0.000740277],"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.000052200157,0.00007277166,0.00024048694,0.00014553049,0.000017003507,0.00007122991,0.00006970712,0.3267262,0.00064724986,0.6276638,0.008195543,0.036098193],"study_design_scores_gemma":[0.000014096297,0.00005280627,0.00015434735,0.000027545855,0.000009362313,0.00005274562,0.000027871913,0.7290061,0.00037308448,0.26108688,0.009182948,0.000012182169],"about_ca_topic_score_codex":0.0020920478,"about_ca_topic_score_gemma":0.0027061752,"teacher_disagreement_score":0.009070038,"about_ca_system_score_codex":0.0010955161,"about_ca_system_score_gemma":0.0008365911,"threshold_uncertainty_score":0.03034228},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55494106,0.0009009398,0.31198868,0.0048140823,0.00017326357,0.00021044441,0.0017808097,0.0004584983,0.124732204],"genre_scores_gemma":[0.89944565,0.0007540293,0.07265756,0.00039655317,0.00017491917,0.00028509233,0.0016985013,0.00017179034,0.024415899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993274,0.00021944947,0.000029892313,0.00016564126,0.00013101603,0.00012661784],"domain_scores_gemma":[0.9950759,0.003392229,0.00042508479,0.00045120507,0.00023356655,0.00042200045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091211306,0.00078940357,0.0009907845,0.0010940686,0.002303789,0.002501693,0.00193195,0.001963762,0.014381423],"category_scores_gemma":[0.0051175486,0.0006847421,0.0010127318,0.0018512283,0.0017315381,0.004648685,0.0026118648,0.0027528035,0.0010205883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024313846,0.00010124235,0.0006769942,0.00014863098,0.000032307507,0.00022143965,0.0003388516,0.024414726,0.0018639709,0.9427958,0.006949489,0.022213409],"study_design_scores_gemma":[0.000036276124,0.000020242836,0.00022476623,0.000017810215,0.000013084498,0.00009269495,0.00009823984,0.03182398,0.0006878283,0.96362334,0.0033546444,0.000007188432],"about_ca_topic_score_codex":0.001110789,"about_ca_topic_score_gemma":0.0016057693,"teacher_disagreement_score":0.014381423,"about_ca_system_score_codex":0.0009486909,"about_ca_system_score_gemma":0.00079194113,"threshold_uncertainty_score":0.048110604},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015116888,0.0003030519,0.97990006,0.00019859642,0.00008834061,0.00015009556,0.00009582856,0.00093375007,0.0032133956],"genre_scores_gemma":[0.17941153,0.00020100709,0.8168587,0.00021353042,0.00010550651,0.00032066114,0.00026541186,0.00033184708,0.002291709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998061,0.00081568223,0.00008491995,0.0004263358,0.000349168,0.00026276798],"domain_scores_gemma":[0.98644835,0.010866019,0.0004711739,0.0010531525,0.00086684467,0.00029439764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034128292,0.0022013087,0.002729849,0.0025762806,0.001298094,0.0018137047,0.0035151162,0.0023480789,0.008078421],"category_scores_gemma":[0.019720359,0.0015043627,0.0015336155,0.0028528436,0.0016940638,0.0037355071,0.0023693363,0.0024556888,0.0014831468],"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.0002524123,0.000255357,0.00066945946,0.000215058,0.00009135032,0.00007177591,0.00012467582,0.82899135,0.0015835583,0.024856672,0.005024024,0.13786438],"study_design_scores_gemma":[0.00005156466,0.00002226247,0.000072387644,0.000008623132,0.000014953486,0.000015278782,0.0000124193475,0.98252124,0.00026247976,0.016727611,0.0002849346,0.000006227343],"about_ca_topic_score_codex":0.0087239025,"about_ca_topic_score_gemma":0.011886768,"teacher_disagreement_score":0.0087239025,"about_ca_system_score_codex":0.0024521449,"about_ca_system_score_gemma":0.0033491692,"threshold_uncertainty_score":0.027025044},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32339087,0.0016628978,0.61677307,0.0028313133,0.0005489238,0.00010401519,0.0012090203,0.00031722675,0.053162705],"genre_scores_gemma":[0.88337725,0.0021300719,0.0997777,0.0007955673,0.00083219033,0.00016762591,0.0020109059,0.00035427773,0.01055438],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998716,0.00043615833,0.00007103222,0.0002840511,0.00028774882,0.0002049777],"domain_scores_gemma":[0.9923955,0.0054196357,0.0006515588,0.0005099975,0.0006913543,0.00033187532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016011845,0.00095264777,0.0010312407,0.0014852104,0.0010653513,0.0032942772,0.0019851339,0.0012484643,0.009484647],"category_scores_gemma":[0.012419409,0.00069068203,0.0016239617,0.0025093942,0.0017400682,0.0062711537,0.0012286238,0.003552315,0.00047201524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002717168,0.000104954546,0.00060794293,0.00022154556,0.00006644864,0.000109232715,0.00047479873,0.06473231,0.0013790826,0.90245026,0.0039876658,0.025594005],"study_design_scores_gemma":[0.000028075681,0.000019346915,0.00017820131,0.000023195453,0.000023960327,0.00003434362,0.00008121791,0.055669107,0.00027894054,0.94230443,0.0013493175,0.000009859431],"about_ca_topic_score_codex":0.003345464,"about_ca_topic_score_gemma":0.0023713354,"teacher_disagreement_score":0.009484647,"about_ca_system_score_codex":0.0016524704,"about_ca_system_score_gemma":0.0006830225,"threshold_uncertainty_score":0.03172934},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24693725,0.0005662224,0.46976766,0.0012673248,0.0003378371,0.00041274016,0.02102823,0.003769492,0.2559132],"genre_scores_gemma":[0.67205244,0.0007336295,0.21648607,0.00043643016,0.000057101755,0.0004218303,0.025703074,0.0014838051,0.08262555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996561,0.000056507335,0.000018659715,0.00009976863,0.000079757534,0.000089179324],"domain_scores_gemma":[0.99874264,0.00045988927,0.0001424476,0.00021104618,0.0003102737,0.00013373728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019577082,0.0003907221,0.00033718336,0.0010193479,0.00088019733,0.0017087294,0.00090983586,0.0006438911,0.04685326],"category_scores_gemma":[0.0020375883,0.0003589354,0.0004391929,0.0017553419,0.00060366647,0.0021481449,0.0011280349,0.00096810237,0.00529671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053145096,0.00014138149,0.0034357158,0.0003926915,0.00004354007,0.00075624004,0.0006857272,0.021806888,0.0070747826,0.82428813,0.05610154,0.08474189],"study_design_scores_gemma":[0.00010539096,0.000102905215,0.0051881587,0.0002024799,0.000051394913,0.00076054945,0.0010629806,0.06309215,0.014589776,0.74401516,0.1707703,0.000058796228],"about_ca_topic_score_codex":0.002934984,"about_ca_topic_score_gemma":0.0038998225,"teacher_disagreement_score":0.04685326,"about_ca_system_score_codex":0.00068302115,"about_ca_system_score_gemma":0.00063478184,"threshold_uncertainty_score":0.15673983},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15713765,0.0022181326,0.7565204,0.0073993583,0.0011611383,0.0002024302,0.00073582557,0.0010014421,0.07362361],"genre_scores_gemma":[0.69089806,0.0017803832,0.2673426,0.0029286447,0.0012114043,0.00049989286,0.0011953862,0.0010108046,0.033132866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985448,0.0004914301,0.00006184479,0.00036660506,0.0003482622,0.00018694022],"domain_scores_gemma":[0.9888681,0.008175487,0.00043922765,0.0011933708,0.00093212584,0.00039171104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002303023,0.0011056572,0.001685834,0.0011318082,0.0021358787,0.0028767788,0.0034220745,0.0033127596,0.012161505],"category_scores_gemma":[0.024079155,0.0005506602,0.0013617383,0.0018886368,0.002685849,0.0055677835,0.0024761658,0.0043877866,0.0015485995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007117767,0.00011852371,0.0009418325,0.00032022927,0.00007535694,0.00006385076,0.000193075,0.08370795,0.003069221,0.82789874,0.017615447,0.065283984],"study_design_scores_gemma":[0.000108698885,0.000057104873,0.00022697655,0.000034875367,0.000032910182,0.00006911753,0.00003255712,0.1705115,0.0012544027,0.8250409,0.0026014678,0.000029528926],"about_ca_topic_score_codex":0.002089324,"about_ca_topic_score_gemma":0.0015984747,"teacher_disagreement_score":0.012161505,"about_ca_system_score_codex":0.0017115794,"about_ca_system_score_gemma":0.0028741483,"threshold_uncertainty_score":0.040684223},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9581467,0.008086776,0.014476814,0.0008260066,0.0001592618,0.00021779619,0.0021320705,0.0010866347,0.0148680555],"genre_scores_gemma":[0.9815547,0.00073552656,0.013470941,0.00009824863,0.00007219275,0.000060518436,0.0011525735,0.00032416655,0.0025311136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98984325,0.0037132625,0.00071817014,0.0014243909,0.0033894174,0.0009115223],"domain_scores_gemma":[0.65485376,0.29484504,0.011214819,0.023351004,0.011041318,0.004694001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017616319,0.0008676432,0.0019695584,0.0044637523,0.001327844,0.0020481737,0.0022489897,0.0019209974,0.005765733],"category_scores_gemma":[0.10546029,0.0004904683,0.0018015852,0.003129821,0.001010893,0.0043678926,0.001226549,0.0035414165,0.0015073539],"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.013998849,0.0061579775,0.26219645,0.0021841743,0.0016814987,0.00046938178,0.0015141125,0.10982406,0.00425588,0.010375346,0.02041923,0.5669231],"study_design_scores_gemma":[0.0015699165,0.0236206,0.39294955,0.0006710176,0.00351511,0.0054318435,0.0030455778,0.4978823,0.02111485,0.028115047,0.021731162,0.00035301413],"about_ca_topic_score_codex":0.0022160364,"about_ca_topic_score_gemma":0.0031180216,"teacher_disagreement_score":0.017616319,"about_ca_system_score_codex":0.0016804058,"about_ca_system_score_gemma":0.001479418,"threshold_uncertainty_score":0.0931651},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077622175,0.0007085828,0.90077406,0.0018268527,0.00013532164,0.00022300491,0.00088725105,0.0004561899,0.017366502],"genre_scores_gemma":[0.62866056,0.0007507705,0.34548533,0.00032989657,0.00026172635,0.00049005175,0.00087334856,0.00030525608,0.022843122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861765,0.0005799998,0.000055059503,0.0003738211,0.00021396398,0.0001595217],"domain_scores_gemma":[0.9970553,0.0021907722,0.00025122994,0.00014792953,0.0001301127,0.00022463605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016283488,0.0011998301,0.0026745764,0.0011468328,0.0009072765,0.0029688273,0.0032416559,0.0035645321,0.00869057],"category_scores_gemma":[0.0059482832,0.0014852117,0.0014720663,0.0027944485,0.0014182464,0.004416866,0.002072052,0.0028324353,0.0006503484],"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.00023400075,0.00016404843,0.0003670733,0.0003312748,0.00009878391,0.00023192259,0.00014813192,0.78075397,0.0009126958,0.1893675,0.0050504655,0.022340128],"study_design_scores_gemma":[0.000048091068,0.00006002132,0.00010244566,0.000021721495,0.000027610293,0.0000463643,0.000038295424,0.8599496,0.00026415352,0.13818596,0.001240243,0.000015458487],"about_ca_topic_score_codex":0.0034129298,"about_ca_topic_score_gemma":0.0048194947,"teacher_disagreement_score":0.00869057,"about_ca_system_score_codex":0.0019704998,"about_ca_system_score_gemma":0.001957984,"threshold_uncertainty_score":0.029072821},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76648,0.00075807015,0.14946255,0.0021595748,0.00013101356,0.000101743906,0.00051401905,0.00011911959,0.08027391],"genre_scores_gemma":[0.97490025,0.00063398405,0.012336738,0.0003837382,0.00012913627,0.00007154021,0.0004097511,0.000064551845,0.011070336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995347,0.00014478211,0.000018750488,0.0001484267,0.000061907034,0.00009137078],"domain_scores_gemma":[0.995745,0.002714747,0.00056443457,0.0002693243,0.00037866962,0.00032781065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010210294,0.00043612937,0.00086447847,0.0013625622,0.002042238,0.0021618507,0.0012282401,0.0011581866,0.008358505],"category_scores_gemma":[0.006157405,0.00036863025,0.00073108316,0.0017113229,0.0026026927,0.0053801844,0.0012909312,0.0018304957,0.00042471554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037012152,0.00001558972,0.0005152513,0.000028543305,0.000009789088,0.00006738058,0.0003026676,0.003023057,0.0002803714,0.99066013,0.0009339927,0.0041261893],"study_design_scores_gemma":[0.000022568916,0.000018628567,0.0007360476,0.000013797313,0.000024799354,0.00007126201,0.00020874776,0.02472152,0.00021724455,0.9721767,0.0017759787,0.00001276688],"about_ca_topic_score_codex":0.004113663,"about_ca_topic_score_gemma":0.0030003195,"teacher_disagreement_score":0.008358505,"about_ca_system_score_codex":0.0011583974,"about_ca_system_score_gemma":0.00092822296,"threshold_uncertainty_score":0.02796197},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32969487,0.00178266,0.6338381,0.0042990535,0.00015593179,0.00012619652,0.0011241595,0.00020914948,0.028769895],"genre_scores_gemma":[0.89827514,0.0019034779,0.08432833,0.0001908057,0.00022881338,0.00015775669,0.0008680037,0.000092530376,0.013955139],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986319,0.000710674,0.00005501394,0.00023040388,0.00018621345,0.00018577922],"domain_scores_gemma":[0.9938512,0.004541821,0.00055714726,0.00028946844,0.00023838175,0.00052192394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016013158,0.0009440783,0.0015944175,0.0010051276,0.00088376476,0.002868135,0.0023721105,0.002752073,0.005647545],"category_scores_gemma":[0.009550645,0.0009640675,0.0008466065,0.0023312478,0.0022456336,0.005585175,0.0026263476,0.0019326049,0.00030960146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023713076,0.000060473503,0.0008340557,0.00023956745,0.000076299264,0.00034384217,0.0002569615,0.31202728,0.0007000123,0.6679294,0.0043652058,0.012929916],"study_design_scores_gemma":[0.0000919692,0.00006897009,0.00040342973,0.000040888925,0.00003320054,0.00017816441,0.00020436704,0.5179099,0.00027179008,0.47680452,0.003965297,0.000027465456],"about_ca_topic_score_codex":0.003992115,"about_ca_topic_score_gemma":0.0027870717,"teacher_disagreement_score":0.005647545,"about_ca_system_score_codex":0.0020112905,"about_ca_system_score_gemma":0.00092547573,"threshold_uncertainty_score":0.018892884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31984705,0.0075228754,0.5427045,0.022335831,0.0005696719,0.00020086969,0.0017053842,0.00045954148,0.10465435],"genre_scores_gemma":[0.85863245,0.0043538855,0.110487394,0.0010876661,0.0010171434,0.00028441873,0.0018899408,0.00029507114,0.021952119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959609,0.0013545252,0.00021353421,0.00050153246,0.0015444274,0.00042505],"domain_scores_gemma":[0.96564454,0.028705476,0.0014696436,0.0019230897,0.0013054637,0.00095178385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039027578,0.0010368881,0.0019488537,0.002443833,0.0019911428,0.0058937524,0.002901484,0.0022158024,0.011533471],"category_scores_gemma":[0.031206839,0.00085499056,0.0014937595,0.0031183357,0.005459513,0.014688313,0.0046636793,0.007726382,0.0007935113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013001001,0.00007738533,0.000662442,0.00018414448,0.00003451015,0.00008366152,0.0002676296,0.038395535,0.00027267684,0.9385156,0.004439658,0.016936792],"study_design_scores_gemma":[0.000015097656,0.000007832786,0.00013059622,0.000013394777,0.000006745782,0.00002403131,0.00004385658,0.04939287,0.00008867498,0.94904846,0.0012201172,0.000008474495],"about_ca_topic_score_codex":0.0027439035,"about_ca_topic_score_gemma":0.0027159024,"teacher_disagreement_score":0.011533471,"about_ca_system_score_codex":0.0028748468,"about_ca_system_score_gemma":0.0015530356,"threshold_uncertainty_score":0.03858328},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028832488,0.034145694,0.79969245,0.008158802,0.0042135036,0.00012467279,0.00043798363,0.002333777,0.12206074],"genre_scores_gemma":[0.39190337,0.048616197,0.4649043,0.005232795,0.0058288453,0.00029195606,0.0014203681,0.0012326293,0.08056947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99845254,0.00040454505,0.00009906917,0.00030874545,0.000565473,0.00016961827],"domain_scores_gemma":[0.99701405,0.0014182221,0.00013972087,0.00088869146,0.00042615816,0.00011309008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018960716,0.0012461666,0.0016213306,0.0024947145,0.0011498011,0.0031388288,0.0024647722,0.0015863813,0.009910595],"category_scores_gemma":[0.005179696,0.00060195354,0.0011968035,0.0045558237,0.0031958504,0.007733061,0.0026942769,0.004402081,0.003542421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068622685,0.000052451014,0.00015617922,0.00021626649,0.000014577155,0.000019407338,0.0000546283,0.008222477,0.0015325919,0.8285976,0.008648503,0.15241675],"study_design_scores_gemma":[0.0000369527,0.00004909585,0.0001411575,0.000072998795,0.000021540633,0.00010312414,0.00004071629,0.037846982,0.0036623161,0.8398595,0.118133426,0.00003220835],"about_ca_topic_score_codex":0.0012532144,"about_ca_topic_score_gemma":0.0011873771,"teacher_disagreement_score":0.009910595,"about_ca_system_score_codex":0.0020829719,"about_ca_system_score_gemma":0.0018980027,"threshold_uncertainty_score":0.03315419},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025323,0.00086695334,0.92372346,0.0010307723,0.00009797358,0.00016481603,0.0006278734,0.00056211423,0.0026728325],"genre_scores_gemma":[0.5919121,0.001010685,0.39978617,0.0002651053,0.0002704364,0.00027882628,0.0014841415,0.00046038642,0.0045320773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981713,0.0008736916,0.00006568128,0.00044656027,0.0002816404,0.00016109335],"domain_scores_gemma":[0.96469784,0.03105746,0.0014148102,0.0010922624,0.0010547722,0.00068284903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038922874,0.002497095,0.003102536,0.0021414715,0.0012706666,0.0022111507,0.0036006612,0.0032580965,0.003712918],"category_scores_gemma":[0.026000144,0.0015557655,0.0014424243,0.004276917,0.002174398,0.0035359215,0.0017768473,0.0032380647,0.00038382527],"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.00014732723,0.00018588862,0.001365457,0.00013717265,0.000052175306,0.00009543401,0.00006831133,0.9550313,0.00031913645,0.017903576,0.002384268,0.022309875],"study_design_scores_gemma":[0.000019676017,0.000010351589,0.000092338756,0.00000566249,0.0000063285593,0.000012398177,0.000011937739,0.9834869,0.00014700912,0.016038079,0.00016297757,0.000006430305],"about_ca_topic_score_codex":0.02912396,"about_ca_topic_score_gemma":0.022366313,"teacher_disagreement_score":0.02912396,"about_ca_system_score_codex":0.0027588631,"about_ca_system_score_gemma":0.0031154763,"threshold_uncertainty_score":0.057908893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38102424,0.0031144337,0.5735638,0.0044912216,0.00035462578,0.00012333087,0.00087499275,0.0020421955,0.034411147],"genre_scores_gemma":[0.9530954,0.0008623288,0.038929492,0.00032980475,0.00016778434,0.00010888333,0.00021959384,0.00014137187,0.006145411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838114,0.00044191716,0.000072065566,0.00022597735,0.0004831231,0.00039576006],"domain_scores_gemma":[0.98925054,0.0075868894,0.00069948914,0.0012920856,0.000864596,0.00030633024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014077586,0.00083595933,0.0010490388,0.0009701461,0.0009411384,0.0015808264,0.0011204894,0.0014619164,0.00410161],"category_scores_gemma":[0.017822651,0.0005715905,0.00034206655,0.0010575171,0.0017077797,0.0027960779,0.0025196415,0.0017033817,0.0008364461],"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.0011200189,0.00016129033,0.00094640447,0.0002991901,0.000075381,0.00020303398,0.0002801011,0.6158384,0.014819685,0.31120846,0.009883186,0.045164708],"study_design_scores_gemma":[0.00007208145,0.000091526905,0.00034492978,0.0000463823,0.0000263358,0.000147647,0.00009448949,0.75799435,0.006317417,0.23326968,0.0015576336,0.00003755021],"about_ca_topic_score_codex":0.0012498338,"about_ca_topic_score_gemma":0.002038784,"teacher_disagreement_score":0.00410161,"about_ca_system_score_codex":0.0015909986,"about_ca_system_score_gemma":0.0019373889,"threshold_uncertainty_score":0.013721228},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025253303,0.0007227792,0.958538,0.00060171547,0.00017173651,0.00004989036,0.00005769616,0.00020787612,0.014396962],"genre_scores_gemma":[0.7752602,0.0009747666,0.21529002,0.00052242493,0.00018003964,0.00014099487,0.00009430385,0.00023597591,0.0073013026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991841,0.00045258334,0.00003791874,0.000081848644,0.00017424181,0.00006931522],"domain_scores_gemma":[0.9955243,0.0034173399,0.00019617572,0.00044791386,0.00030612788,0.00010810713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018571765,0.00077441556,0.0005489154,0.00045632463,0.0006591487,0.0012308916,0.00075087085,0.0012537566,0.0033757524],"category_scores_gemma":[0.011516478,0.00039931567,0.00026670078,0.0006048679,0.0014251256,0.0019416118,0.00145315,0.0018113479,0.00057652546],"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.00038174636,0.000105457286,0.00035520794,0.00022484384,0.000028957114,0.00010042509,0.0001275594,0.18068925,0.012728872,0.7199139,0.0038112996,0.08153253],"study_design_scores_gemma":[0.00005064886,0.00008781929,0.000107698026,0.000073292256,0.00002011004,0.000058004385,0.000028784332,0.69223315,0.0064469553,0.2985352,0.0023308923,0.000027362095],"about_ca_topic_score_codex":0.00040510565,"about_ca_topic_score_gemma":0.0011077963,"teacher_disagreement_score":0.0033757524,"about_ca_system_score_codex":0.00040652117,"about_ca_system_score_gemma":0.00052686763,"threshold_uncertainty_score":0.011292994},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31335288,0.0014591867,0.37655562,0.003156917,0.0013520308,0.00038626674,0.0010743875,0.002521155,0.3001415],"genre_scores_gemma":[0.9118381,0.00087634544,0.04932578,0.00078486616,0.0006558037,0.00022774057,0.0009902028,0.0005192179,0.034782015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972976,0.0006150723,0.00021100749,0.00072839245,0.0006918708,0.00045601613],"domain_scores_gemma":[0.9958931,0.0019314784,0.00025279357,0.00054688036,0.00090325205,0.00047248736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025768578,0.0006922286,0.00081918313,0.0022378347,0.002886357,0.0056220754,0.0014557685,0.0011232793,0.012676754],"category_scores_gemma":[0.0066612633,0.0010272465,0.0014391472,0.0018865492,0.0042951913,0.0152174495,0.0036423025,0.0038212913,0.001910395],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060655024,0.000050076564,0.00034339694,0.000044179345,0.0000141543005,0.00022699423,0.00089820876,0.0001310771,0.0011380668,0.9870188,0.0015951876,0.00847918],"study_design_scores_gemma":[0.0000319885,0.000023976107,0.00031376144,0.000015051443,0.000031823758,0.00050603814,0.00045449584,0.0017034058,0.0016847955,0.9866317,0.008578865,0.000024090361],"about_ca_topic_score_codex":0.0015378601,"about_ca_topic_score_gemma":0.0011155492,"teacher_disagreement_score":0.012676754,"about_ca_system_score_codex":0.0018856236,"about_ca_system_score_gemma":0.00079242775,"threshold_uncertainty_score":0.04240793},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007217564,0.00832014,0.9331797,0.008570056,0.0067844493,0.00010347566,0.0003421704,0.0026338336,0.032848623],"genre_scores_gemma":[0.15008935,0.01671851,0.7438818,0.005922902,0.009909455,0.000233377,0.0015970559,0.002231562,0.06941596],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806243,0.00024773594,0.00018560796,0.00059032236,0.0007459143,0.00016803996],"domain_scores_gemma":[0.9928294,0.0033876076,0.0001729335,0.002492559,0.0007880016,0.00032956482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012183737,0.0010063761,0.002017551,0.0021467071,0.002019009,0.0042033414,0.0036099385,0.0028776845,0.016330535],"category_scores_gemma":[0.0072263638,0.0007775938,0.0017814958,0.003272463,0.0029911618,0.011605268,0.004158366,0.0056703114,0.0062777093],"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.00030171798,0.000117961936,0.00081505853,0.000654519,0.000071326795,0.00048361666,0.00023594445,0.016856184,0.0111496495,0.32673416,0.08409388,0.5584859],"study_design_scores_gemma":[0.00003164821,0.00013126078,0.000870455,0.00019015622,0.00008093825,0.0013896272,0.00024949538,0.070106804,0.015546183,0.7076979,0.2035903,0.00011520475],"about_ca_topic_score_codex":0.003256516,"about_ca_topic_score_gemma":0.003567674,"teacher_disagreement_score":0.016330535,"about_ca_system_score_codex":0.0010969667,"about_ca_system_score_gemma":0.0007394461,"threshold_uncertainty_score":0},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19454162,0.0013372279,0.7556452,0.014422727,0.0002703282,0.00018975476,0.00038298595,0.00019738413,0.033012707],"genre_scores_gemma":[0.9203405,0.00030712198,0.07351161,0.0007305387,0.00029341443,0.0001997755,0.00020879267,0.00010990562,0.00429833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.978819,0.014066148,0.0011854201,0.0024806876,0.0024033654,0.001045391],"domain_scores_gemma":[0.90275025,0.07802841,0.0038198535,0.009297433,0.0041679475,0.0019360973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023601996,0.0006699427,0.0034780542,0.002333024,0.005139238,0.0069787824,0.0030351272,0.0053237802,0.0071301125],"category_scores_gemma":[0.11850842,0.0012768783,0.0018254234,0.0034730448,0.008927954,0.01189196,0.006149852,0.005441783,0.00046124603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011515178,0.0000360069,0.0009101453,0.00006098355,0.000080155936,0.00009922917,0.0010537802,0.005049272,0.00020195758,0.9750538,0.0023008676,0.015038588],"study_design_scores_gemma":[0.000016882092,0.0000074953778,0.0002000498,0.000012031261,0.000009414031,0.000025784253,0.000117084965,0.0126704,0.00005832851,0.9863457,0.0005269997,0.000009812055],"about_ca_topic_score_codex":0.0047848267,"about_ca_topic_score_gemma":0.005684991,"teacher_disagreement_score":0.023601996,"about_ca_system_score_codex":0.0025863561,"about_ca_system_score_gemma":0.0021505614,"threshold_uncertainty_score":0.12482077},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29237252,0.011495012,0.53973395,0.040122736,0.0009203076,0.00011701681,0.0019050485,0.0011929388,0.11214049],"genre_scores_gemma":[0.8923995,0.0032467088,0.09179549,0.003348148,0.0017210809,0.00016532502,0.0006384357,0.0007528227,0.005932485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99577516,0.001542093,0.00023583269,0.0010906805,0.00094444875,0.00041184117],"domain_scores_gemma":[0.93591774,0.053062685,0.0017609311,0.0050772163,0.0022378035,0.0019436701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076487763,0.00073405186,0.001873291,0.0023302962,0.002946363,0.0055584135,0.004910233,0.0034308021,0.013942974],"category_scores_gemma":[0.04720848,0.0012576616,0.0011360532,0.004560296,0.006828138,0.036438107,0.0060382024,0.0069547766,0.001121537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023375713,0.00006986926,0.0009844847,0.00019667474,0.00002362086,0.000035486544,0.00059181376,0.0044766995,0.0009201583,0.96312624,0.004004798,0.025336362],"study_design_scores_gemma":[0.000037721547,0.000039287548,0.00072508684,0.00007149681,0.000033222168,0.00018079339,0.00030965032,0.01655357,0.0006398884,0.9768787,0.00450862,0.000021836637],"about_ca_topic_score_codex":0.0015451801,"about_ca_topic_score_gemma":0.0018401037,"teacher_disagreement_score":0.013942974,"about_ca_system_score_codex":0.0021365138,"about_ca_system_score_gemma":0.0011240521,"threshold_uncertainty_score":0.046643913},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20425381,0.0006372764,0.7747877,0.0007793403,0.00024673517,0.00022976895,0.00042884916,0.00062777667,0.018008808],"genre_scores_gemma":[0.5604654,0.0004793921,0.40797213,0.00048414178,0.00011345413,0.0004342974,0.0010863385,0.0006638245,0.02830112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940777,0.00018524464,0.000027431912,0.00015294821,0.00011268363,0.00011398222],"domain_scores_gemma":[0.9971846,0.0016043608,0.00017685488,0.0005511439,0.00020099158,0.00028198064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010681103,0.000947081,0.0015764972,0.00086895126,0.0011162333,0.0012378544,0.0022312966,0.0018543802,0.012490905],"category_scores_gemma":[0.0082864715,0.0008820154,0.0012118194,0.001218585,0.0017930296,0.0024492051,0.003173601,0.0020388549,0.0012258972],"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.0010107101,0.00015183953,0.0015871122,0.00031152376,0.00012664632,0.00045998424,0.00036201082,0.5972049,0.011291106,0.2683901,0.012807797,0.106296174],"study_design_scores_gemma":[0.00008254104,0.00011747904,0.00028981827,0.000034513687,0.000025662828,0.0001039294,0.000082460705,0.78236365,0.0016234603,0.21207768,0.003178648,0.000020162319],"about_ca_topic_score_codex":0.0018498527,"about_ca_topic_score_gemma":0.002543613,"teacher_disagreement_score":0.012490905,"about_ca_system_score_codex":0.00077771983,"about_ca_system_score_gemma":0.0007460322,"threshold_uncertainty_score":0.041786194},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015307755,0.75535524,0.16593553,0.009431123,0.002445153,0.00008091297,0.0011631446,0.00042424328,0.049856912],"genre_scores_gemma":[0.07231773,0.838323,0.063714646,0.0028311913,0.0088938875,0.00012023236,0.002098131,0.00022862879,0.011472582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990902,0.00019738187,0.00008208874,0.00026945554,0.0002675221,0.000093460134],"domain_scores_gemma":[0.9971976,0.0019345885,0.00014105772,0.00024760087,0.0003157629,0.00016336008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014859317,0.0010954322,0.0019012005,0.005130101,0.0011886673,0.0042699454,0.0015278006,0.0016590932,0.0081889015],"category_scores_gemma":[0.003996277,0.0010047776,0.0009747402,0.012648575,0.0017314176,0.010368431,0.0018601968,0.0026789936,0.0021909415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009067697,0.0002066719,0.0023387594,0.003928133,0.000092995215,0.0001485375,0.0003148309,0.00821147,0.0010940488,0.4785775,0.045676902,0.45931935],"study_design_scores_gemma":[0.000023348974,0.000090072805,0.0014202213,0.0011926894,0.0000743688,0.0007027217,0.00028152406,0.011837733,0.0006645357,0.57024574,0.41341624,0.00005085237],"about_ca_topic_score_codex":0.0015157112,"about_ca_topic_score_gemma":0.0014367116,"teacher_disagreement_score":0.0081889015,"about_ca_system_score_codex":0.0017274291,"about_ca_system_score_gemma":0.0015938893,"threshold_uncertainty_score":0.027394593},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004022987,0.00009014179,0.9934189,0.00008912049,0.000033960274,0.00005135703,0.000034629848,0.0001839096,0.0020751394],"genre_scores_gemma":[0.113963485,0.00015926504,0.87880576,0.00013395099,0.00006479708,0.00036726383,0.00017141679,0.00017353204,0.006160597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999516,0.00012168184,0.000025264198,0.000087117645,0.00020158663,0.00004835445],"domain_scores_gemma":[0.99930406,0.00034235267,0.00006304508,0.000049853883,0.0002014426,0.00003929268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012401874,0.00089972967,0.0011608845,0.0013813331,0.0005912867,0.0011371353,0.0013641929,0.0015282771,0.007197157],"category_scores_gemma":[0.0028274218,0.00049705047,0.0008981589,0.0015272486,0.00065971515,0.001096857,0.0017571277,0.0011235506,0.0010501532],"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.00008466721,0.00007779265,0.0003309921,0.00012287819,0.00004574201,0.000055425382,0.000050523315,0.8059119,0.003041778,0.017291158,0.0025726585,0.17041449],"study_design_scores_gemma":[0.000010046875,0.000018907313,0.000030444988,0.0000072774633,0.0000047614294,0.000012308679,0.000004986948,0.99693054,0.0003271029,0.0020508014,0.00059938023,0.0000033936494],"about_ca_topic_score_codex":0.005268124,"about_ca_topic_score_gemma":0.004648328,"teacher_disagreement_score":0.007197157,"about_ca_system_score_codex":0.0012204825,"about_ca_system_score_gemma":0.0017008756,"threshold_uncertainty_score":0.024076939},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061808308,0.007320568,0.122862,0.057175104,0.7655267,0.00032789755,0.0063422304,0.001951175,0.03231352],"genre_scores_gemma":[0.1834695,0.018253218,0.20299557,0.09773679,0.10458387,0.000985846,0.025345534,0.0049853753,0.36164436],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962496,0.0011202057,0.000368929,0.00039355937,0.0016715644,0.00019613544],"domain_scores_gemma":[0.97477174,0.009882296,0.00066056655,0.0019043583,0.012450272,0.00033063372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035675752,0.0018746501,0.002033455,0.0021467847,0.0017562673,0.0026559036,0.00305261,0.0027727806,0.052764505],"category_scores_gemma":[0.044458654,0.0006156687,0.0014390684,0.0029928815,0.001240644,0.0023948653,0.0011084087,0.0031733252,0.012043988],"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.0005756782,0.00005184225,0.00020145543,0.00036843104,0.00008152695,0.00019384165,0.000033838467,0.008669818,0.00055953383,0.0132000195,0.9372392,0.038824786],"study_design_scores_gemma":[0.00066244724,0.0006601315,0.003032348,0.001005442,0.0005228703,0.0011195041,0.0003661849,0.1443408,0.010875075,0.06729209,0.76972604,0.0003971448],"about_ca_topic_score_codex":0.008904421,"about_ca_topic_score_gemma":0.010152723,"teacher_disagreement_score":0.052764505,"about_ca_system_score_codex":0.0023022,"about_ca_system_score_gemma":0.0021738922,"threshold_uncertainty_score":0.17651486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77967525,0.0010254369,0.16201223,0.00833548,0.00027972198,0.0002879349,0.005000081,0.0011724369,0.04221139],"genre_scores_gemma":[0.94024926,0.0008481009,0.03920521,0.00076746783,0.0004033323,0.00022758923,0.004399693,0.0005873655,0.013312036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760073,0.00064115,0.00010526638,0.0005709751,0.0005490347,0.0005327799],"domain_scores_gemma":[0.9673457,0.026076084,0.0016841894,0.002255464,0.00092206086,0.0017164901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402234,0.0015340961,0.0019065402,0.0013992931,0.0018999631,0.0066181007,0.0041984883,0.0028803195,0.018311895],"category_scores_gemma":[0.016339224,0.0013135731,0.002040609,0.0028117155,0.002651638,0.011682016,0.0026873131,0.0037268694,0.0010319331],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021057962,0.00078046724,0.01210626,0.0011097749,0.0003475911,0.0006446191,0.0015289495,0.3191553,0.009848688,0.55804944,0.034830097,0.059492998],"study_design_scores_gemma":[0.00024557646,0.00006591635,0.001541654,0.000035113033,0.00009825394,0.00023621836,0.00030722126,0.22426869,0.0017375633,0.76929516,0.002130978,0.000037580507],"about_ca_topic_score_codex":0.006842099,"about_ca_topic_score_gemma":0.0077170474,"teacher_disagreement_score":0.018311895,"about_ca_system_score_codex":0.004170286,"about_ca_system_score_gemma":0.003338387,"threshold_uncertainty_score":0.06125939},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5984554,0.0009990963,0.3260276,0.001301444,0.00026885414,0.00009368502,0.00047533415,0.0002833263,0.0720952],"genre_scores_gemma":[0.98302174,0.00037966308,0.009835884,0.0001727914,0.00012242082,0.0000723161,0.00018381872,0.000039681996,0.006171691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99975103,0.00006487344,0.000013160384,0.000065730164,0.000064305146,0.000040904477],"domain_scores_gemma":[0.99900097,0.00039238232,0.00016471931,0.00014724958,0.00017119852,0.00012340296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029538825,0.0002832926,0.00031371423,0.00055062,0.00062128174,0.0011008983,0.00052205287,0.0005501988,0.0045389747],"category_scores_gemma":[0.0019430917,0.0002053148,0.0003072605,0.00057956035,0.00092229224,0.0018062898,0.0009561313,0.0009315308,0.00031414223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012618389,0.000017505696,0.00058588164,0.000119330725,0.000021261025,0.0003641402,0.0002112161,0.010227448,0.01361006,0.9631533,0.0018104543,0.009753228],"study_design_scores_gemma":[0.00006868308,0.00015429956,0.0013830215,0.000040231986,0.000036672638,0.0007987238,0.00025437586,0.084031545,0.007450006,0.8965383,0.009213708,0.000030435496],"about_ca_topic_score_codex":0.0003489451,"about_ca_topic_score_gemma":0.00032690697,"teacher_disagreement_score":0.0045389747,"about_ca_system_score_codex":0.00028913192,"about_ca_system_score_gemma":0.00033961135,"threshold_uncertainty_score":0.0151844025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17112681,0.0026327295,0.8152438,0.00073904527,0.001018374,0.0005642794,0.0007338249,0.0026276123,0.005313565],"genre_scores_gemma":[0.6536655,0.00051414565,0.33737245,0.00027691573,0.00036505912,0.00017713901,0.0010805322,0.00020424637,0.0063439915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830556,0.00032769903,0.00021699032,0.00028859937,0.00072500616,0.00013613683],"domain_scores_gemma":[0.9908592,0.0024401902,0.00042803618,0.004679808,0.0013691881,0.00022354964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019495052,0.00060044625,0.0012119255,0.0011958759,0.0012017974,0.0016013507,0.0012699565,0.00093726773,0.0029007446],"category_scores_gemma":[0.009563007,0.0004257405,0.0005620107,0.0019597842,0.0006842489,0.0036162075,0.002328293,0.00085972593,0.00090227986],"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.00404319,0.0006069197,0.0066878446,0.00083129684,0.00029588523,0.0012560362,0.00078565814,0.098183885,0.07402565,0.038825296,0.023794627,0.7506637],"study_design_scores_gemma":[0.00024560714,0.0008556886,0.0027097308,0.00010287307,0.00017565745,0.002127808,0.0006760257,0.7980712,0.120621756,0.057023045,0.01728363,0.000106946885],"about_ca_topic_score_codex":0.0004598051,"about_ca_topic_score_gemma":0.00087484356,"teacher_disagreement_score":0.0029007446,"about_ca_system_score_codex":0.00043187663,"about_ca_system_score_gemma":0.0011180755,"threshold_uncertainty_score":0.010310113},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74143547,0.00064979016,0.17911622,0.0016196953,0.0001381379,0.000065517044,0.0005475073,0.00036534178,0.07606238],"genre_scores_gemma":[0.9829297,0.0001730092,0.0062454706,0.000118789154,0.0001684015,0.00005100957,0.0003441856,0.00008669022,0.009882864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981438,0.0003750154,0.0001407788,0.00044870714,0.000582026,0.00030972032],"domain_scores_gemma":[0.98874515,0.007159706,0.0008691245,0.001060406,0.00127904,0.000886602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091974245,0.0005850259,0.0008523604,0.0021536066,0.0016893084,0.005806968,0.0017555635,0.0013422909,0.010193137],"category_scores_gemma":[0.01035514,0.0005434176,0.0010568127,0.00134602,0.0036646274,0.009653462,0.002831241,0.002978398,0.0009270492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005925784,0.000029412999,0.0006085342,0.000057516885,0.000008608108,0.00018556023,0.00073093007,0.0018221351,0.0013834913,0.9909561,0.00044479658,0.0037135768],"study_design_scores_gemma":[0.000007024901,0.000010071136,0.00023956614,0.00000783579,0.000005570074,0.00008287021,0.00009953884,0.0065623038,0.00065888895,0.99182105,0.00049486256,0.000010478789],"about_ca_topic_score_codex":0.00081268675,"about_ca_topic_score_gemma":0.0007439031,"teacher_disagreement_score":0.010193137,"about_ca_system_score_codex":0.0019205249,"about_ca_system_score_gemma":0.0008472295,"threshold_uncertainty_score":0.03409946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43593803,0.008530366,0.31973115,0.028677147,0.0019482234,0.00040890317,0.011668784,0.0026385798,0.19045879],"genre_scores_gemma":[0.8504336,0.0036699013,0.093081795,0.0036448895,0.0021948828,0.00069832936,0.009609885,0.0012913883,0.035375386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99263644,0.002023205,0.00032069194,0.0021310973,0.001417472,0.0014710582],"domain_scores_gemma":[0.93716353,0.046931498,0.0027190153,0.006412242,0.0022332196,0.0045404867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004870363,0.0035697983,0.003358648,0.0033903795,0.0040159575,0.007942385,0.007315063,0.0036852905,0.02502659],"category_scores_gemma":[0.032586858,0.002167762,0.0033244449,0.002990809,0.006065379,0.012523083,0.0055711637,0.008808777,0.0044264803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035658362,0.00064544106,0.012159389,0.0025554677,0.00060416025,0.00064120686,0.0012509774,0.075770095,0.016975807,0.7379406,0.079623885,0.06826715],"study_design_scores_gemma":[0.00030658994,0.0002762157,0.004145378,0.00020799886,0.00031850467,0.0011085103,0.0003214192,0.12093232,0.005209308,0.8531391,0.013916975,0.00011759942],"about_ca_topic_score_codex":0.002115803,"about_ca_topic_score_gemma":0.0033958748,"teacher_disagreement_score":0.02502659,"about_ca_system_score_codex":0.0047984654,"about_ca_system_score_gemma":0.0023956536,"threshold_uncertainty_score":0.08372229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4552414,0.003165598,0.19187894,0.011627372,0.0012801014,0.000117950294,0.0013517297,0.0013119398,0.33402494],"genre_scores_gemma":[0.94805235,0.0016911653,0.013588525,0.0012377397,0.0013500464,0.00014713618,0.00075850176,0.0003148574,0.032859568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981103,0.0004891853,0.00008466489,0.0006154989,0.0004890316,0.00021122092],"domain_scores_gemma":[0.9957088,0.0017376028,0.00050830876,0.0005870724,0.00081355346,0.00064470223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011856316,0.0012580635,0.0013233708,0.0033521818,0.002135669,0.0048887846,0.0012104143,0.0017283018,0.007662552],"category_scores_gemma":[0.0064754826,0.00077916787,0.0009817292,0.0020724246,0.007143739,0.009249546,0.0031011323,0.0039705667,0.0012690532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021019865,0.000013503588,0.0001425036,0.00002598475,0.000006104739,0.00003344408,0.00018105168,0.00018996594,0.0002700249,0.99537766,0.0011303435,0.0026084038],"study_design_scores_gemma":[0.0000050348735,0.00000320225,0.000059460082,0.000004202856,0.0000030796266,0.000053718377,0.00004187271,0.0005553551,0.000104461345,0.99790347,0.0012632124,0.0000029099203],"about_ca_topic_score_codex":0.0009654744,"about_ca_topic_score_gemma":0.0008232182,"teacher_disagreement_score":0.007662552,"about_ca_system_score_codex":0.0014886439,"about_ca_system_score_gemma":0.0006820149,"threshold_uncertainty_score":0.025633812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94197756,0.00021388628,0.04310745,0.00023830972,0.000013944822,0.00003239561,0.0002055926,0.0001511706,0.014059684],"genre_scores_gemma":[0.99181026,0.00014658757,0.0032770073,0.000044534598,0.00002701026,0.00004515135,0.00024155415,0.00009013738,0.004317732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997732,0.000040327734,0.000011112244,0.00007092989,0.000057636564,0.00004681357],"domain_scores_gemma":[0.99714404,0.0013813606,0.0005159774,0.00022319237,0.00028120144,0.00045410602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031742163,0.0005096678,0.0006302482,0.0017304296,0.0010991425,0.002026094,0.0011317785,0.00082392886,0.0078161545],"category_scores_gemma":[0.0030676255,0.00042618086,0.00046931618,0.0011343532,0.0022292582,0.0027700502,0.0011187174,0.0011581205,0.00037942833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033911847,0.00014033052,0.0062387628,0.00022134095,0.00006265653,0.000906032,0.002562171,0.031922497,0.015519077,0.9215064,0.0017098399,0.018871803],"study_design_scores_gemma":[0.00004463011,0.00006798948,0.0022698317,0.000024918838,0.00003545618,0.00022901982,0.00071802404,0.05594176,0.0022074848,0.9374527,0.0009865762,0.000021687596],"about_ca_topic_score_codex":0.0020610471,"about_ca_topic_score_gemma":0.0023737215,"teacher_disagreement_score":0.0078161545,"about_ca_system_score_codex":0.00074440165,"about_ca_system_score_gemma":0.00042165047,"threshold_uncertainty_score":0.026147664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82606816,0.0005063884,0.1582005,0.00089229044,0.000078189216,0.000038822553,0.0001937741,0.00013493403,0.013886963],"genre_scores_gemma":[0.98199815,0.00021388325,0.014351926,0.000067694076,0.00013343572,0.000050352617,0.0001032047,0.000027177219,0.0030541238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902356,0.00029544244,0.000040681156,0.00027548822,0.0002902754,0.00007455372],"domain_scores_gemma":[0.99316734,0.0045782295,0.0009190131,0.0003497249,0.00035169016,0.0006341233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091170636,0.0004247884,0.00073528057,0.002947177,0.0012607313,0.002128563,0.00095929665,0.0011363042,0.003713029],"category_scores_gemma":[0.0077274353,0.00031522466,0.00035810278,0.0012551042,0.0028001706,0.0034314364,0.0019011943,0.0013029731,0.0003867001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033861047,0.00016597478,0.0038638094,0.00016661453,0.00005708932,0.00047102215,0.0015263876,0.02728816,0.012568369,0.93096507,0.0013041601,0.021284744],"study_design_scores_gemma":[0.00003378816,0.000097891134,0.0027945908,0.0000178764,0.000021897778,0.0004630853,0.0004604514,0.079179086,0.0010791121,0.9143065,0.0015099334,0.000035747875],"about_ca_topic_score_codex":0.00046361206,"about_ca_topic_score_gemma":0.0003795544,"teacher_disagreement_score":0.003713029,"about_ca_system_score_codex":0.0005177591,"about_ca_system_score_gemma":0.00028204618,"threshold_uncertainty_score":0.01242137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08812095,0.0013302536,0.86499906,0.00083269115,0.0004420045,0.00006659417,0.00022123834,0.00035496044,0.043632198],"genre_scores_gemma":[0.72892725,0.0011611903,0.25850132,0.0002845953,0.00013540346,0.00013616022,0.00035119714,0.0020841316,0.008418746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802065,0.0009139204,0.00008524407,0.0002611458,0.0005267157,0.00019243255],"domain_scores_gemma":[0.99085134,0.0057803886,0.0003385747,0.0012665417,0.0013908348,0.00037231532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004488913,0.0009897669,0.0015877034,0.001124496,0.0010155172,0.0037228563,0.0013704781,0.0009992046,0.006788389],"category_scores_gemma":[0.030864995,0.00063948665,0.0007194778,0.0014800634,0.0018962917,0.0032290984,0.0028218117,0.0021572064,0.0010390838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080168055,0.00013495532,0.0019630408,0.00044106646,0.000105842926,0.00026424282,0.00031622194,0.36569577,0.013417676,0.5069854,0.0071937433,0.10268032],"study_design_scores_gemma":[0.000026804695,0.000040690924,0.000558216,0.00010617479,0.00003264351,0.00010852476,0.000096689386,0.92124164,0.004253881,0.07034915,0.0031566983,0.000028897504],"about_ca_topic_score_codex":0.0049366667,"about_ca_topic_score_gemma":0.0049412264,"teacher_disagreement_score":0.006788389,"about_ca_system_score_codex":0.0013128058,"about_ca_system_score_gemma":0.0021813866,"threshold_uncertainty_score":0.023739934},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70581186,0.0008210927,0.14932309,0.0011302668,0.0002839953,0.00014729175,0.0015064419,0.00029515478,0.1406808],"genre_scores_gemma":[0.95372343,0.00051711476,0.01754384,0.00031335774,0.00008769192,0.00006275282,0.0009465969,0.00007064694,0.026734646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996791,0.000041673768,0.000025254782,0.00008801613,0.00008500386,0.00008098133],"domain_scores_gemma":[0.9975999,0.00077243993,0.00023450001,0.00032888015,0.00036468275,0.0006995538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033469123,0.0003644217,0.0005888683,0.001208216,0.001885821,0.0024031526,0.001028987,0.0007294807,0.009735525],"category_scores_gemma":[0.0031960253,0.00044192816,0.0004718794,0.001274489,0.0015333476,0.0033174704,0.0020906865,0.0017178074,0.0009292552],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105756495,0.000025346459,0.0009667328,0.00007770453,0.000012288289,0.00020916754,0.00048918446,0.001352031,0.0013821664,0.98372126,0.0014774974,0.010180974],"study_design_scores_gemma":[0.000022863418,0.00002538947,0.00072451273,0.000017339942,0.00001642054,0.00024534494,0.00037782986,0.005626061,0.00054931705,0.9869047,0.0054800557,0.000010224391],"about_ca_topic_score_codex":0.0016951695,"about_ca_topic_score_gemma":0.0035541353,"teacher_disagreement_score":0.009735525,"about_ca_system_score_codex":0.00084071915,"about_ca_system_score_gemma":0.0006505672,"threshold_uncertainty_score":0.032568574},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013056437,0.00051343045,0.42572582,0.0038894785,0.00161491,0.00024994975,0.028971514,0.027953934,0.4980245],"genre_scores_gemma":[0.18120322,0.0016135328,0.29190195,0.0017738565,0.0008106875,0.00045664774,0.06856641,0.03141626,0.4222575],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963605,0.000051999392,0.000020487529,0.00009391972,0.00014312023,0.00005437637],"domain_scores_gemma":[0.9986695,0.0004325137,0.00006728294,0.00036100295,0.0003617332,0.00010803268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048498678,0.0007269408,0.00053511397,0.0013716468,0.00071455183,0.0024861607,0.0014782457,0.00085010874,0.29752174],"category_scores_gemma":[0.0030040916,0.00043791908,0.00069049175,0.002581205,0.0004499236,0.0032844343,0.0015371763,0.0018433268,0.09389829],"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.00025274922,0.00011816375,0.0007165173,0.0004958292,0.000024388768,0.00017781551,0.00024475387,0.0039883973,0.006397407,0.28996238,0.5748559,0.122765705],"study_design_scores_gemma":[0.000078753794,0.00004122417,0.0013528763,0.000106326595,0.000021024605,0.00039920246,0.00012753242,0.034735925,0.011723476,0.21581058,0.73555607,0.00004701823],"about_ca_topic_score_codex":0.003959302,"about_ca_topic_score_gemma":0.004954921,"teacher_disagreement_score":0.29752174,"about_ca_system_score_codex":0.0013159247,"about_ca_system_score_gemma":0.00077067345,"threshold_uncertainty_score":0.99530935},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058182552,0.001592035,0.7504842,0.0039174347,0.00061450695,0.00045004443,0.02181925,0.006407958,0.15653196],"genre_scores_gemma":[0.46569285,0.0019976613,0.3751878,0.001367565,0.00043918611,0.0008757379,0.022992432,0.0036330917,0.12781379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936897,0.000097323165,0.00005954326,0.00012607063,0.00023941236,0.000108586646],"domain_scores_gemma":[0.99597675,0.0021917808,0.00027385348,0.0006282417,0.0007090271,0.00022023809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006203023,0.00037585184,0.0006180774,0.0011986191,0.0013081596,0.0022520795,0.0009545034,0.00085325097,0.031474136],"category_scores_gemma":[0.0061220787,0.00046069044,0.0005665756,0.002167299,0.0007872585,0.003713359,0.0014741276,0.0014680234,0.0077477507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021255674,0.000086756474,0.001896381,0.00049495255,0.00003587056,0.0006137853,0.00066454615,0.005316291,0.010262892,0.81064075,0.08873099,0.08104414],"study_design_scores_gemma":[0.00006035006,0.000031692223,0.0015276815,0.00014768114,0.000037749105,0.00095114304,0.00024362998,0.019624012,0.0072617517,0.6845606,0.28550258,0.000051245443],"about_ca_topic_score_codex":0.0017264081,"about_ca_topic_score_gemma":0.0041810647,"teacher_disagreement_score":0.031474136,"about_ca_system_score_codex":0.0009111506,"about_ca_system_score_gemma":0.0009076258,"threshold_uncertainty_score":0.105291486},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009341815,0.00036227313,0.9308964,0.009438476,0.000573935,0.000118142285,0.00059879967,0.00032279413,0.048347376],"genre_scores_gemma":[0.2556267,0.0010930495,0.70378494,0.00446848,0.0014786201,0.0006531679,0.0020495062,0.0007775743,0.030067826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99139345,0.0041531334,0.0004297296,0.0015267045,0.0020264066,0.00047067468],"domain_scores_gemma":[0.92634,0.05925674,0.0010459647,0.0075284755,0.0049661864,0.00086259755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009830826,0.0016334793,0.0015657612,0.0020876683,0.0035188259,0.0052473224,0.006666945,0.0038690087,0.0323938],"category_scores_gemma":[0.07377249,0.0011297727,0.003064151,0.0024629883,0.009814747,0.013298918,0.010644659,0.011413458,0.0065432475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011240045,0.000097135795,0.00034974542,0.00020014532,0.00003513127,0.00010643017,0.00018729772,0.014629239,0.0005210237,0.9576795,0.011496959,0.014584927],"study_design_scores_gemma":[0.0000364722,0.00004690874,0.00015831308,0.00005893558,0.000015340695,0.00008029706,0.0000710526,0.08195092,0.0010358273,0.90956926,0.0069506955,0.000025882227],"about_ca_topic_score_codex":0.0026627167,"about_ca_topic_score_gemma":0.005756133,"teacher_disagreement_score":0.0323938,"about_ca_system_score_codex":0.0027266587,"about_ca_system_score_gemma":0.0048954906,"threshold_uncertainty_score":0.10836798},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06300995,0.013077389,0.4001429,0.05378717,0.011283095,0.00008465913,0.000661273,0.00071012566,0.45724353],"genre_scores_gemma":[0.78854835,0.00719516,0.077780634,0.013368348,0.012208843,0.00027355534,0.000420461,0.0006071435,0.09959761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988018,0.0003219863,0.00008756832,0.00036776267,0.00029189026,0.00012904884],"domain_scores_gemma":[0.9975587,0.0012491067,0.00015318269,0.0006444411,0.00028437018,0.000110195586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023981347,0.0004138176,0.00093679945,0.0011483314,0.001455126,0.002600123,0.0013995584,0.0020540007,0.01311621],"category_scores_gemma":[0.0058267065,0.0004975681,0.0009572738,0.0010413447,0.004896141,0.009500393,0.0024435346,0.0040225107,0.0021000376],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012204179,0.0000048764255,0.00007334102,0.000026745503,0.000004713578,0.00006542162,0.00007318452,0.00008552294,0.0003457472,0.99134225,0.0034701515,0.0044958307],"study_design_scores_gemma":[0.000015758307,0.000013150847,0.00020650779,0.000016208152,0.000007949236,0.00023716797,0.000051951585,0.0014465947,0.00044469,0.9771955,0.020351991,0.00001248186],"about_ca_topic_score_codex":0.00044894835,"about_ca_topic_score_gemma":0.00033465802,"teacher_disagreement_score":0.01311621,"about_ca_system_score_codex":0.0007575351,"about_ca_system_score_gemma":0.00065712427,"threshold_uncertainty_score":0.04387808},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028266277,0.0010712256,0.6244399,0.0027667945,0.0011423415,0.00034971157,0.00589066,0.006540389,0.32953268],"genre_scores_gemma":[0.33843288,0.004229765,0.285533,0.003065284,0.0015220816,0.0005976703,0.018745914,0.012281335,0.33559212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993086,0.00013499035,0.00002463203,0.00016619416,0.00025413922,0.00011141171],"domain_scores_gemma":[0.99750465,0.0010025242,0.00015160858,0.00051711424,0.0006508424,0.00017326897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077539467,0.0010000732,0.00062946754,0.0026365872,0.0015777015,0.0024805546,0.0013413471,0.000753946,0.090300776],"category_scores_gemma":[0.004644239,0.00067571504,0.000951824,0.0021673094,0.0015639821,0.0042346367,0.0025912812,0.0019031125,0.022723623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015477839,0.00006653889,0.0006237242,0.00037532303,0.000031829943,0.00029952955,0.000564719,0.0056110453,0.004559642,0.7219479,0.18316114,0.082603835],"study_design_scores_gemma":[0.00003262749,0.000018409144,0.00050084095,0.00008719611,0.00001803116,0.00023345306,0.00014702835,0.008661885,0.002945792,0.8675295,0.119803056,0.00002221092],"about_ca_topic_score_codex":0.0056252936,"about_ca_topic_score_gemma":0.01034608,"teacher_disagreement_score":0.090300776,"about_ca_system_score_codex":0.0018764462,"about_ca_system_score_gemma":0.001098042,"threshold_uncertainty_score":0.30208617},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06384278,0.00051929714,0.91979635,0.0013555025,0.00028527086,0.00026134023,0.00044135988,0.00074068684,0.012757447],"genre_scores_gemma":[0.47572604,0.0007623575,0.5023074,0.00029474552,0.00019281187,0.0002369906,0.0004747478,0.00028858412,0.019716231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997187,0.0000854538,0.000010462885,0.000066743494,0.00006573794,0.000052827665],"domain_scores_gemma":[0.99954754,0.00024188275,0.00003603106,0.00004557829,0.000076690005,0.000052307423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045084002,0.00066003844,0.0006423955,0.00055101956,0.0008323491,0.0009862887,0.0011428044,0.000955997,0.005395992],"category_scores_gemma":[0.0013836458,0.0002658574,0.00081812695,0.001031567,0.00042365835,0.0007295096,0.0006800642,0.00113592,0.0006404848],"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.00024536712,0.00027935117,0.00091013015,0.00050158636,0.00007077465,0.00042755544,0.00015521003,0.78567266,0.0152336415,0.1027579,0.0090197725,0.084726125],"study_design_scores_gemma":[0.00001820582,0.000046408328,0.00027227402,0.00001443477,0.000018776482,0.000068918904,0.00003389825,0.94884515,0.0013562664,0.046123687,0.0031920003,0.000009950122],"about_ca_topic_score_codex":0.0063964077,"about_ca_topic_score_gemma":0.009526768,"teacher_disagreement_score":0.0063964077,"about_ca_system_score_codex":0.0011350645,"about_ca_system_score_gemma":0.0019406889,"threshold_uncertainty_score":0.018051326},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019029065,0.0051161773,0.0038779513,0.0385399,0.93175906,0.00009138032,0.0019932243,0.0007508935,0.017681172],"genre_scores_gemma":[0.01349302,0.02614756,0.015556309,0.08108272,0.2869693,0.0005967776,0.009220436,0.003012163,0.56392175],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948689,0.0009887589,0.0006290807,0.00088664825,0.002196556,0.0004301029],"domain_scores_gemma":[0.9821898,0.0038341363,0.00056330714,0.0014598304,0.011336761,0.0006161477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033172718,0.0032842315,0.0042865938,0.006662323,0.003447596,0.0040377956,0.0061548846,0.0054508382,0.15121278],"category_scores_gemma":[0.035387415,0.0015537218,0.0035907335,0.0058571333,0.0024714533,0.004789729,0.0029057858,0.006468103,0.07589788],"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.00002829731,0.000010904872,0.000035366207,0.00016553038,0.000017108898,0.00007216213,0.000012199561,0.00016107869,0.00005006592,0.0016551261,0.9919268,0.005865375],"study_design_scores_gemma":[0.00007751345,0.000061337596,0.0013290752,0.00039696402,0.00008946707,0.0003614795,0.000063354775,0.0017950484,0.0006265063,0.013275571,0.9818188,0.00010480759],"about_ca_topic_score_codex":0.036178473,"about_ca_topic_score_gemma":0.040902574,"teacher_disagreement_score":0.15121278,"about_ca_system_score_codex":0.0067861127,"about_ca_system_score_gemma":0.003328261,"threshold_uncertainty_score":0.5058571},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028925156,0.00032099106,0.96267045,0.00022801719,0.00023511458,0.00023174933,0.00026174777,0.00095209427,0.0061747157],"genre_scores_gemma":[0.39515188,0.00023909188,0.5979539,0.00023214899,0.000102378304,0.00034412195,0.000585286,0.00027770994,0.005113429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955183,0.00014210017,0.000017380904,0.00007063266,0.00011800566,0.000100052246],"domain_scores_gemma":[0.9986094,0.0008346884,0.00009542546,0.00013529065,0.00024057613,0.000084516316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006614875,0.0011475387,0.0013186202,0.0015214825,0.00085688726,0.0011330335,0.001624462,0.0010150718,0.008644203],"category_scores_gemma":[0.002315852,0.00066921464,0.0009274278,0.0022262956,0.00072168384,0.0009801917,0.0010261808,0.001171419,0.0007656847],"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.00009402286,0.000099967474,0.0003459038,0.00008317033,0.000034851782,0.00006320016,0.00003380013,0.89613616,0.0016803071,0.009460584,0.003939841,0.08802818],"study_design_scores_gemma":[0.000015754347,0.000032942302,0.00006694956,0.0000062982626,0.000011553783,0.000013774144,0.000008689059,0.99586797,0.000492912,0.0028145344,0.0006607936,0.000007987487],"about_ca_topic_score_codex":0.016507454,"about_ca_topic_score_gemma":0.019656189,"teacher_disagreement_score":0.016507454,"about_ca_system_score_codex":0.0015342063,"about_ca_system_score_gemma":0.0020769048,"threshold_uncertainty_score":0.03282273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18018055,0.00232944,0.7569029,0.004295673,0.0005111133,0.00024485253,0.0020285528,0.0006617294,0.052845217],"genre_scores_gemma":[0.704725,0.0018482697,0.23179163,0.00060530804,0.00040197157,0.00043175192,0.002244206,0.0008263845,0.05712539],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953043,0.00016231296,0.000020021322,0.0001381574,0.000080987586,0.00006801528],"domain_scores_gemma":[0.9979085,0.0014764946,0.00021958578,0.00019063031,0.00006779155,0.00013696829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056813576,0.0010041298,0.0015228977,0.0007596619,0.0008089434,0.0016667625,0.0022742709,0.0029965022,0.016310953],"category_scores_gemma":[0.0051926905,0.0009253544,0.00072752085,0.0011458058,0.0014821804,0.004673018,0.0033775433,0.0030675263,0.0009851017],"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.0003269172,0.00011021576,0.0004255115,0.00037258994,0.000050436014,0.00048974855,0.00015973551,0.42192706,0.0013149056,0.5428072,0.0116263935,0.020389214],"study_design_scores_gemma":[0.000102544545,0.000057149693,0.00022004684,0.000030932082,0.000015000318,0.00016582561,0.000091149006,0.58766335,0.00047254667,0.40770778,0.003448836,0.000024759423],"about_ca_topic_score_codex":0.0026080208,"about_ca_topic_score_gemma":0.0021881016,"teacher_disagreement_score":0.016310953,"about_ca_system_score_codex":0.00068274717,"about_ca_system_score_gemma":0.00079020584,"threshold_uncertainty_score":0.05456561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03890323,0.00045669838,0.92681867,0.0003678203,0.00045683692,0.00017457879,0.0004150475,0.0028192226,0.029587895],"genre_scores_gemma":[0.357542,0.0004186134,0.61047906,0.00041100694,0.00024142378,0.0002511763,0.0011428718,0.00085119053,0.028662704],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893147,0.00020051474,0.000044457487,0.00016481408,0.00046339375,0.00019547217],"domain_scores_gemma":[0.9994747,0.00011879437,0.000025474412,0.0002320807,0.00010514496,0.000043904485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003187064,0.00079166243,0.0015238922,0.00085301965,0.0009415025,0.001107213,0.0011209261,0.0005111142,0.010783057],"category_scores_gemma":[0.0010753471,0.00035400782,0.0011623362,0.0011187478,0.0008477774,0.001660479,0.002281125,0.0016725018,0.0035854436],"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.00082939066,0.0005369405,0.00067270466,0.0006014693,0.00014513254,0.000531341,0.00033672494,0.036162794,0.07661165,0.30380672,0.03165525,0.54810995],"study_design_scores_gemma":[0.00025832534,0.0005189553,0.00066497264,0.00008532683,0.00018602094,0.0007835416,0.00023313436,0.47200894,0.06664203,0.4052272,0.053243406,0.00014814158],"about_ca_topic_score_codex":0.0013885272,"about_ca_topic_score_gemma":0.0025555138,"teacher_disagreement_score":0.010783057,"about_ca_system_score_codex":0.00041021142,"about_ca_system_score_gemma":0.0012780762,"threshold_uncertainty_score":0.03607291},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5050995,0.0008141977,0.37877607,0.0024703618,0.00092492206,0.00018848975,0.0011966516,0.0012865978,0.10924325],"genre_scores_gemma":[0.8908199,0.00042313247,0.082618155,0.0007184028,0.00014187497,0.00013248564,0.00060320215,0.00030856865,0.024234219],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986833,0.00023712129,0.000083319836,0.00041754785,0.00023637261,0.00034242187],"domain_scores_gemma":[0.99762183,0.0007650399,0.00038354803,0.0005469198,0.00027743418,0.00040518335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087072916,0.0007503562,0.0013039011,0.0009881986,0.0033256698,0.0028301158,0.002200177,0.0021981772,0.012586246],"category_scores_gemma":[0.0046939324,0.0010547643,0.0011697136,0.0013899243,0.0022818218,0.004981856,0.0038498442,0.0031280052,0.0019036136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019330888,0.00008447447,0.00069583463,0.00014021162,0.000029471064,0.00040843364,0.00040182928,0.006002452,0.0047814455,0.9667635,0.0045641153,0.015934939],"study_design_scores_gemma":[0.000042061896,0.000028274322,0.00035371617,0.000025571777,0.00002315551,0.00049630005,0.00017909179,0.012111002,0.0031708684,0.97948533,0.0040527023,0.000032019056],"about_ca_topic_score_codex":0.0014419861,"about_ca_topic_score_gemma":0.0020959168,"teacher_disagreement_score":0.012586246,"about_ca_system_score_codex":0.001257256,"about_ca_system_score_gemma":0.0015568302,"threshold_uncertainty_score":0.04210514},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29021403,0.0014991994,0.58424234,0.014841008,0.00057204405,0.0003985301,0.0027012832,0.0007381595,0.10479347],"genre_scores_gemma":[0.8104496,0.0015973609,0.13595551,0.0011496329,0.0005827028,0.0005509784,0.003118652,0.0004822279,0.04611347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800354,0.00069864246,0.000097108015,0.00041783167,0.00052875245,0.0002541353],"domain_scores_gemma":[0.991991,0.005758816,0.00047116683,0.0006021906,0.00037952838,0.00079745386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021580965,0.0014594364,0.0027700816,0.0022031886,0.0025537359,0.0062254295,0.004633974,0.0039937687,0.01502557],"category_scores_gemma":[0.009801308,0.0012874538,0.0018653142,0.0030071137,0.004338238,0.010903453,0.005091418,0.0063988864,0.00095298456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016025384,0.0001271313,0.00024395836,0.00020261423,0.00006260347,0.00013154895,0.00039402748,0.03681831,0.00053795753,0.9370893,0.0069357865,0.017296467],"study_design_scores_gemma":[0.000026113294,0.000011788146,0.000043564494,0.000019369902,0.000010969532,0.000025809926,0.00010505147,0.02234802,0.00027256907,0.9759033,0.0012264708,0.0000069180605],"about_ca_topic_score_codex":0.002940062,"about_ca_topic_score_gemma":0.002466502,"teacher_disagreement_score":0.01502557,"about_ca_system_score_codex":0.0030182896,"about_ca_system_score_gemma":0.001991392,"threshold_uncertainty_score":0.05026549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67618686,0.00074572425,0.19272113,0.0049170977,0.00046183862,0.00018855672,0.0017620099,0.0010187001,0.12199803],"genre_scores_gemma":[0.95098215,0.00041021715,0.01826739,0.0004077922,0.00019131675,0.000081234815,0.0005854794,0.00021461757,0.02885977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994118,0.000107017106,0.000024488832,0.00016222965,0.00011013718,0.00018434993],"domain_scores_gemma":[0.99767405,0.0009587342,0.0004879403,0.00033241813,0.00025019547,0.00029655002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004640956,0.00076124637,0.0009147292,0.001757612,0.0014819716,0.0028845556,0.0012518442,0.0011687819,0.014157663],"category_scores_gemma":[0.0053489916,0.00054296694,0.00053347135,0.0019108107,0.0018512214,0.0042813113,0.0021796809,0.0021452173,0.0020890862],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038384603,0.00006701103,0.0005828661,0.00018099691,0.000022465114,0.00029256265,0.00029228852,0.0037048925,0.0047679157,0.9677856,0.0056256517,0.016293894],"study_design_scores_gemma":[0.00008459963,0.00004002783,0.00045962172,0.00003503875,0.000033652534,0.00030809038,0.00020167406,0.011676124,0.0035889652,0.97579974,0.0077455314,0.00002690116],"about_ca_topic_score_codex":0.00086399843,"about_ca_topic_score_gemma":0.0010249428,"teacher_disagreement_score":0.014157663,"about_ca_system_score_codex":0.0012968546,"about_ca_system_score_gemma":0.0006432088,"threshold_uncertainty_score":0.04736209},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85002106,0.0017463142,0.06518941,0.0044630687,0.0003060275,0.000040017963,0.0007408904,0.0002146888,0.077278554],"genre_scores_gemma":[0.9826341,0.00067997683,0.0096860435,0.00020253572,0.0003339297,0.00004514384,0.00037785515,0.00008344104,0.005956925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934417,0.00020133027,0.000027588547,0.00017210757,0.00013768199,0.00011703811],"domain_scores_gemma":[0.9945945,0.0030201399,0.0010166372,0.00044366135,0.0003326751,0.0005923187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010394373,0.00064019253,0.00072331633,0.0036583268,0.0019463402,0.003988251,0.002248904,0.0014312201,0.007148371],"category_scores_gemma":[0.0066963322,0.0005395465,0.00048692888,0.0030232568,0.005058954,0.006786492,0.0018263193,0.002223936,0.0005502722],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019835046,0.000044122353,0.0026141193,0.00007624706,0.000022842882,0.000037685542,0.0002514998,0.012375536,0.0020184934,0.9680633,0.0030613686,0.0112365],"study_design_scores_gemma":[0.000023193996,0.000016115822,0.001723754,0.00002441224,0.000016727274,0.00007144519,0.00013867604,0.025714064,0.000827626,0.9690063,0.0024153765,0.000022287586],"about_ca_topic_score_codex":0.00208113,"about_ca_topic_score_gemma":0.002284612,"teacher_disagreement_score":0.007148371,"about_ca_system_score_codex":0.0027801262,"about_ca_system_score_gemma":0.0008989842,"threshold_uncertainty_score":0.023913741},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.359918,0.0006932797,0.5200625,0.00588314,0.00031847967,0.0004028195,0.001739899,0.00044932193,0.110532485],"genre_scores_gemma":[0.9182219,0.00046154225,0.041823827,0.0005248904,0.00015273318,0.00022303543,0.00044317628,0.00013980061,0.038009115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799854,0.00076294935,0.00009132558,0.00040230036,0.00029961587,0.000445266],"domain_scores_gemma":[0.9950742,0.0026849005,0.00043564092,0.00078430964,0.0003611976,0.00065963727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016140084,0.00074096624,0.0015251893,0.0008564538,0.0015881365,0.0036735055,0.003650046,0.0029825936,0.015383994],"category_scores_gemma":[0.009166552,0.0007825762,0.0011833181,0.001208701,0.0033698475,0.0050959224,0.0026424709,0.002893308,0.00068803737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070951864,0.000027128955,0.00025156443,0.00005638372,0.000024336938,0.000067879366,0.00017921955,0.029320419,0.00060751784,0.96410197,0.0023037323,0.0029887964],"study_design_scores_gemma":[0.00007341792,0.00002724166,0.0002123701,0.000015418085,0.000016841685,0.000070504466,0.000120619334,0.10360078,0.00019936953,0.89205694,0.0035786075,0.000027941718],"about_ca_topic_score_codex":0.010525242,"about_ca_topic_score_gemma":0.009364406,"teacher_disagreement_score":0.015383994,"about_ca_system_score_codex":0.0023774519,"about_ca_system_score_gemma":0.0021593117,"threshold_uncertainty_score":0.051464558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31082356,0.0007324221,0.62470144,0.0027585295,0.00022214769,0.0002764174,0.0020664295,0.0011881312,0.057231005],"genre_scores_gemma":[0.84754926,0.0006797757,0.1149406,0.0004461704,0.00014547634,0.00035685155,0.0015587885,0.00040592637,0.03391711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924076,0.0002587062,0.00003824926,0.00017893719,0.00014221155,0.0001411031],"domain_scores_gemma":[0.9940019,0.0034149885,0.0006626195,0.0006939304,0.0007709686,0.0004555598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535201,0.0007163809,0.0013408037,0.0009624656,0.0013312242,0.0018908926,0.0023799457,0.0014910409,0.011358844],"category_scores_gemma":[0.00530197,0.00080761174,0.0005526535,0.001256661,0.0006837907,0.0026791121,0.0017262166,0.0021495197,0.0014559604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019688443,0.00023764867,0.001814787,0.0010674988,0.00021734557,0.00055426656,0.0009903776,0.08533954,0.0296824,0.7600702,0.027833957,0.090223186],"study_design_scores_gemma":[0.000616307,0.00033482988,0.00146838,0.0001751622,0.0002496035,0.00066115113,0.00056211936,0.32994658,0.015756907,0.62995714,0.02020149,0.00007029884],"about_ca_topic_score_codex":0.000832196,"about_ca_topic_score_gemma":0.0019826188,"teacher_disagreement_score":0.011358844,"about_ca_system_score_codex":0.0013676962,"about_ca_system_score_gemma":0.0010054326,"threshold_uncertainty_score":0.037999153},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26455075,0.0123616755,0.34661922,0.004672469,0.0022159012,0.00037992463,0.003392182,0.0005413361,0.36526656],"genre_scores_gemma":[0.8021124,0.009604863,0.06999086,0.0014032291,0.0016434959,0.00034593418,0.004019282,0.0009207693,0.10995904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916196,0.00017715455,0.000057412064,0.00017141008,0.00028167618,0.00015037738],"domain_scores_gemma":[0.998486,0.0006804242,0.00022440664,0.00022324095,0.00020259264,0.0001834121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006132141,0.0009726797,0.00081904425,0.0027146162,0.0011048197,0.0025429754,0.0014226347,0.001476871,0.01881361],"category_scores_gemma":[0.0038457774,0.00075372047,0.0011520288,0.002370485,0.0020930734,0.0038490067,0.0029751118,0.0031323603,0.0032521759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006524411,0.000038010632,0.00077366736,0.00027196298,0.000032083615,0.00022727737,0.00048348287,0.0046108854,0.0034145638,0.9529446,0.009880066,0.027258094],"study_design_scores_gemma":[0.000014875891,0.000034390923,0.0010134063,0.000090433714,0.000024029692,0.000473863,0.00035197067,0.009532049,0.0012943079,0.9682196,0.018930236,0.00002078732],"about_ca_topic_score_codex":0.0013174013,"about_ca_topic_score_gemma":0.0011536002,"teacher_disagreement_score":0.01881361,"about_ca_system_score_codex":0.0009137157,"about_ca_system_score_gemma":0.00047140213,"threshold_uncertainty_score":0.062937796},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817946,0.0013477793,0.10393216,0.007651431,0.00022629161,0.00006287841,0.0010057668,0.000292146,0.067535475],"genre_scores_gemma":[0.9840958,0.0007235687,0.0069437167,0.00026809794,0.00038009437,0.00007164577,0.0005089854,0.000109397304,0.0068987464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99779737,0.0005959839,0.00010543603,0.0004112453,0.0006509285,0.00043920978],"domain_scores_gemma":[0.98188156,0.013449326,0.001297818,0.0013473075,0.00074940734,0.0012746244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016807393,0.00063972257,0.0013837084,0.0023345782,0.0020775986,0.006340883,0.002264755,0.0017544993,0.011711561],"category_scores_gemma":[0.012743394,0.0007146727,0.0011518697,0.0024882297,0.0049607456,0.018514555,0.004109547,0.0042677843,0.00078450225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106779684,0.000043687978,0.0010624975,0.00007464682,0.00001703568,0.00007939257,0.0004704476,0.0054349885,0.00063637353,0.9853881,0.0016098147,0.005076134],"study_design_scores_gemma":[0.000019145793,0.000012159864,0.0003921571,0.00000948707,0.000011699695,0.00008185509,0.00010001302,0.011300787,0.0002673176,0.9869855,0.00080731127,0.000012555472],"about_ca_topic_score_codex":0.0014090261,"about_ca_topic_score_gemma":0.0010981576,"teacher_disagreement_score":0.011711561,"about_ca_system_score_codex":0.0022755684,"about_ca_system_score_gemma":0.0010381655,"threshold_uncertainty_score":0.039179087},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5526076,0.0043303696,0.34031,0.021172572,0.00084433716,0.00016930701,0.0010726248,0.0004757761,0.07901741],"genre_scores_gemma":[0.9556782,0.001744264,0.01944821,0.0012876272,0.00076909806,0.00015313695,0.0005220391,0.0001500543,0.020247301],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980982,0.000849424,0.00006248499,0.00036550712,0.00033676653,0.000287686],"domain_scores_gemma":[0.9871946,0.0078492705,0.001482587,0.0011906992,0.0007846,0.0014983297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016515173,0.0006237476,0.0012906989,0.001992118,0.0021981073,0.006264474,0.0013538555,0.0034251558,0.007246198],"category_scores_gemma":[0.013656529,0.00078757555,0.00087493064,0.0017886457,0.0042323773,0.007920571,0.0035980702,0.004509613,0.0006812912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000448177,0.000030728377,0.00059706636,0.000055236174,0.000012386885,0.000044217395,0.00019932006,0.0043462655,0.00056362554,0.9860146,0.0035087154,0.0045830677],"study_design_scores_gemma":[0.000015164971,0.000008270678,0.00021075441,0.000016627848,0.0000075553553,0.00008336488,0.00009385255,0.0254286,0.00021700322,0.9719445,0.0019642953,0.000010011054],"about_ca_topic_score_codex":0.0014687071,"about_ca_topic_score_gemma":0.0008697399,"teacher_disagreement_score":0.007246198,"about_ca_system_score_codex":0.0024270192,"about_ca_system_score_gemma":0.0009827468,"threshold_uncertainty_score":0.02424097},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65685797,0.0028196275,0.26549718,0.005593614,0.00033868573,0.00022524667,0.0013831635,0.0006177795,0.066666715],"genre_scores_gemma":[0.9482405,0.0013630884,0.027204098,0.0006354481,0.00042992548,0.00016695754,0.0006950752,0.00023577143,0.02102909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696594,0.0009294188,0.00018046726,0.0007080993,0.00063943415,0.0005767699],"domain_scores_gemma":[0.96179837,0.027794853,0.0028332367,0.0028397534,0.0021531037,0.002580703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030645865,0.00093487656,0.0019868407,0.0027322478,0.0030879066,0.0057723434,0.003165526,0.0023465601,0.005888031],"category_scores_gemma":[0.022910636,0.0015974247,0.0012727531,0.0029927748,0.004271823,0.0068080607,0.0030154253,0.0036914602,0.00080126576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051908416,0.00013571275,0.0016093289,0.0002876211,0.000055055603,0.00032469042,0.0019417045,0.018223012,0.0029532486,0.95362467,0.004423336,0.015902469],"study_design_scores_gemma":[0.00008517912,0.000050670424,0.00054416276,0.00004726752,0.00007230395,0.0002879273,0.00045292964,0.04372291,0.0013507184,0.9505057,0.0028555116,0.000024802464],"about_ca_topic_score_codex":0.0025287287,"about_ca_topic_score_gemma":0.0033651472,"teacher_disagreement_score":0.005888031,"about_ca_system_score_codex":0.0030396278,"about_ca_system_score_gemma":0.0015934675,"threshold_uncertainty_score":0.022054136},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034539066,0.00047611326,0.5318243,0.0026699705,0.0011131355,0.0002823976,0.038834948,0.08281118,0.33853403],"genre_scores_gemma":[0.06956385,0.0010810626,0.47917116,0.0012892816,0.00083387445,0.0005857714,0.06338998,0.08126017,0.30282488],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993641,0.000094029216,0.000057210385,0.00011563298,0.0003118719,0.000057172645],"domain_scores_gemma":[0.99796283,0.00066276395,0.00010759013,0.0005282282,0.00061563426,0.00012299653],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007803244,0.0010259316,0.00078569993,0.0022364852,0.0007616716,0.0037975933,0.0022383162,0.0010025353,0.3616515],"category_scores_gemma":[0.005189363,0.00065324845,0.0006087863,0.0034555343,0.0006842183,0.0052482956,0.0015775416,0.0015985089,0.21247806],"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.00023412942,0.00006170415,0.00027905803,0.00040974145,0.000019555577,0.00008070473,0.00011560507,0.0016844574,0.0055305366,0.124078214,0.67138225,0.19612406],"study_design_scores_gemma":[0.00009870833,0.00004062329,0.0005895058,0.00007792039,0.000013041777,0.00022455491,0.00006024639,0.015598407,0.021163328,0.098577656,0.8634921,0.00006387778],"about_ca_topic_score_codex":0.0023308885,"about_ca_topic_score_gemma":0.0040548174,"teacher_disagreement_score":0.3616515,"about_ca_system_score_codex":0.001405715,"about_ca_system_score_gemma":0.0010107538,"threshold_uncertainty_score":0.91052663},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52618724,0.0019398795,0.3815762,0.002274525,0.00021685337,0.00006519156,0.0005918008,0.00048891315,0.08665938],"genre_scores_gemma":[0.97250956,0.00075402,0.018855931,0.00029979946,0.00018184191,0.00006743497,0.0003160995,0.00012396285,0.006891233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882764,0.00030489505,0.000042923482,0.0002851675,0.00027596953,0.00026345253],"domain_scores_gemma":[0.9963709,0.0016713813,0.0007730711,0.0003365947,0.0003350475,0.0005129349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096968963,0.00076563295,0.0010955731,0.002960615,0.0023834195,0.0025044468,0.0020203672,0.001998442,0.00961139],"category_scores_gemma":[0.006208375,0.00082155457,0.0010197437,0.0017728388,0.0044186846,0.004295805,0.0034395517,0.0025105055,0.00064026966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024083058,0.000010584632,0.00014972083,0.000026595759,0.000007064852,0.000027051885,0.000093346855,0.0060655074,0.0003298396,0.9903866,0.0004419771,0.002437647],"study_design_scores_gemma":[0.000008552555,0.000014199493,0.00027792127,0.000015320156,0.000007494155,0.000036581758,0.00007662577,0.013541832,0.00014507648,0.98490095,0.00096328784,0.000012137747],"about_ca_topic_score_codex":0.0028656675,"about_ca_topic_score_gemma":0.0033358622,"teacher_disagreement_score":0.00961139,"about_ca_system_score_codex":0.0009679588,"about_ca_system_score_gemma":0.00072832697,"threshold_uncertainty_score":0.03215331},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02058837,0.0008153377,0.95705545,0.003965441,0.0003127177,0.00008803195,0.0003730797,0.0003309967,0.016470628],"genre_scores_gemma":[0.51900965,0.002002054,0.4499548,0.0031197558,0.001341352,0.00042985057,0.0023482197,0.0009856349,0.020808708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955096,0.0022437691,0.00016253143,0.0008269825,0.001025,0.00023201892],"domain_scores_gemma":[0.97062194,0.024878249,0.0009911906,0.001700074,0.0015056175,0.0003029841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047393325,0.0018253113,0.0018274949,0.0013215044,0.0012759647,0.0024617948,0.0029825184,0.002229167,0.011762179],"category_scores_gemma":[0.03480344,0.0016723529,0.0017790123,0.0027450586,0.0050530415,0.0076854653,0.004011606,0.0076088174,0.001178512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023210743,0.00019293411,0.00090631744,0.00041772847,0.00011655001,0.00021299397,0.00045165207,0.15571919,0.0011577768,0.75384384,0.021306712,0.06544211],"study_design_scores_gemma":[0.000020221143,0.00002050001,0.0000941877,0.000026654898,0.000010097385,0.00004328787,0.00004967207,0.11864979,0.0002444572,0.87964416,0.0011848599,0.000012086129],"about_ca_topic_score_codex":0.002682988,"about_ca_topic_score_gemma":0.0033212109,"teacher_disagreement_score":0.011762179,"about_ca_system_score_codex":0.0015304185,"about_ca_system_score_gemma":0.0016047744,"threshold_uncertainty_score":0.039348364},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21100825,0.009499044,0.6692438,0.013211664,0.0014161796,0.000080507234,0.00057972426,0.0003705645,0.094590224],"genre_scores_gemma":[0.8251431,0.0064544366,0.119145304,0.0016422028,0.0027399352,0.00012444075,0.00092070963,0.00033532514,0.0434944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989784,0.0003616843,0.00004475579,0.00030537293,0.00021912527,0.00009066596],"domain_scores_gemma":[0.99714017,0.0015315857,0.000347294,0.00036568983,0.0003219851,0.00029317357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010420687,0.001059749,0.0011966976,0.0017407393,0.0018356956,0.003734283,0.0017604504,0.0025365672,0.0084008295],"category_scores_gemma":[0.0063924687,0.00052192697,0.00072465243,0.0027978083,0.0031917868,0.008836231,0.004610909,0.0040339297,0.0013158502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014962455,0.000018505543,0.00013439498,0.000071277595,0.000005945453,0.000038540555,0.0001818855,0.0013247698,0.0003217785,0.9889058,0.0018639253,0.007118155],"study_design_scores_gemma":[0.0000025680927,0.0000034263858,0.000027265773,0.0000065373606,0.0000027243589,0.00003777591,0.000055340948,0.0025063062,0.00009722694,0.9946555,0.002602458,0.0000028110537],"about_ca_topic_score_codex":0.00082561694,"about_ca_topic_score_gemma":0.0008235148,"teacher_disagreement_score":0.0084008295,"about_ca_system_score_codex":0.0012892633,"about_ca_system_score_gemma":0.000641664,"threshold_uncertainty_score":0.02810359},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23708473,0.0026494393,0.6654269,0.002921151,0.0005061515,0.00012136937,0.00035237416,0.00043708956,0.09050071],"genre_scores_gemma":[0.86841947,0.002006962,0.09386134,0.0009053341,0.0006089869,0.00017336868,0.00046389364,0.00028867554,0.033271857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768746,0.0006539291,0.00017008498,0.0004830769,0.00071639253,0.00028908436],"domain_scores_gemma":[0.99543023,0.0027669668,0.000374639,0.0006738356,0.0004852225,0.00026911646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022955397,0.00086541637,0.001037688,0.0022870295,0.0021548078,0.004186285,0.00095410243,0.0018710811,0.005796407],"category_scores_gemma":[0.008142743,0.0009248053,0.001811734,0.0018341264,0.005927424,0.013383748,0.0042407494,0.00452482,0.0008414756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001593803,0.000008426978,0.000041140465,0.00001874225,0.0000032958908,0.00003605205,0.00014588582,0.0003696981,0.00020721943,0.996512,0.0001483922,0.0024932795],"study_design_scores_gemma":[0.000005210545,0.0000060945454,0.000024813522,0.000006803731,0.0000036699842,0.000052244803,0.000044323904,0.0011149539,0.0003012149,0.997329,0.0011066145,0.0000051355883],"about_ca_topic_score_codex":0.00074782263,"about_ca_topic_score_gemma":0.0006037431,"teacher_disagreement_score":0.005796407,"about_ca_system_score_codex":0.0014151225,"about_ca_system_score_gemma":0.0009681045,"threshold_uncertainty_score":0.019390881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09766738,0.0005557669,0.88564473,0.0006600006,0.00014755232,0.00023598818,0.001033277,0.0011645348,0.012890803],"genre_scores_gemma":[0.58388704,0.0009325598,0.38513368,0.0002596339,0.00014653249,0.0004100085,0.0019661966,0.00059603766,0.026668292],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993248,0.00013521015,0.000037813134,0.00011825461,0.00021683723,0.00016722169],"domain_scores_gemma":[0.9977996,0.0011246343,0.0001554428,0.00046374043,0.00032179087,0.00013478316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059865194,0.00064031366,0.0011817056,0.00089039386,0.00086704694,0.0018374142,0.0015011173,0.0008500224,0.006926272],"category_scores_gemma":[0.005031041,0.0005557699,0.00058805756,0.0018329463,0.00059046247,0.0025034847,0.0015753837,0.001515445,0.0013784459],"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.0010573661,0.0003090265,0.00094737543,0.0007302073,0.00012628738,0.00025008575,0.00051059306,0.28563547,0.028906086,0.32633525,0.02798459,0.3272076],"study_design_scores_gemma":[0.00014007166,0.0001084775,0.00030029964,0.000055706987,0.00007733663,0.000098695025,0.00014172358,0.62545675,0.007313912,0.3581156,0.008171255,0.000020124962],"about_ca_topic_score_codex":0.002484625,"about_ca_topic_score_gemma":0.0067653116,"teacher_disagreement_score":0.006926272,"about_ca_system_score_codex":0.001383099,"about_ca_system_score_gemma":0.001360093,"threshold_uncertainty_score":0.02317065},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043047085,0.002876691,0.3082298,0.029849285,0.007208939,0.00033821192,0.0034536393,0.00320307,0.6017932],"genre_scores_gemma":[0.46503004,0.0027509055,0.1718532,0.014436984,0.0027810624,0.0008152572,0.0047741225,0.002756499,0.33480206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99687934,0.000696369,0.00018985379,0.00075958396,0.0009912872,0.00048346646],"domain_scores_gemma":[0.992833,0.0028092128,0.00021274628,0.0022558293,0.0015038388,0.00038531274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023788195,0.0019497242,0.002097493,0.0036772734,0.0039231405,0.0038146714,0.0031762468,0.0034225043,0.055370003],"category_scores_gemma":[0.012121596,0.00079870864,0.0028933135,0.002036547,0.003330712,0.007903186,0.0060341284,0.007613903,0.021321313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023901169,0.00018035443,0.0018839425,0.0004144472,0.00017279433,0.00031146462,0.0006097397,0.0018016634,0.0023695896,0.8349879,0.11480113,0.0422279],"study_design_scores_gemma":[0.00010085834,0.000072395174,0.0013748788,0.00018203999,0.00014271378,0.0005109076,0.0003019564,0.013882467,0.00520962,0.87059015,0.107526615,0.00010537013],"about_ca_topic_score_codex":0.002629637,"about_ca_topic_score_gemma":0.0056277723,"teacher_disagreement_score":0.055370003,"about_ca_system_score_codex":0.002039408,"about_ca_system_score_gemma":0.0022553136,"threshold_uncertainty_score":0.18523109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55203086,0.0030843953,0.35313228,0.008303588,0.0003133502,0.00020120418,0.001580295,0.0005476688,0.08080629],"genre_scores_gemma":[0.90095556,0.002098322,0.07365698,0.0010989457,0.00062326196,0.00017153098,0.0012152949,0.00036495132,0.019815141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99799395,0.0005304671,0.00009341138,0.0004256381,0.0004415996,0.00051500415],"domain_scores_gemma":[0.9887229,0.0077652344,0.0009435623,0.0010491452,0.0004952527,0.0010239347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027688488,0.0013787453,0.0014357215,0.0018039305,0.0022555464,0.005389882,0.0031142624,0.0025032798,0.008941976],"category_scores_gemma":[0.013216123,0.0011941958,0.0019116475,0.004281403,0.005194365,0.009514142,0.003420527,0.0065905214,0.0009565677],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003766314,0.00026747974,0.0014811194,0.00022815305,0.000034269255,0.0002750865,0.00060807343,0.009617166,0.0016550366,0.95682967,0.008751754,0.019875469],"study_design_scores_gemma":[0.00008602674,0.000024967876,0.00047251626,0.00002216808,0.000036101825,0.000189649,0.00015868376,0.027721548,0.00066081993,0.9688053,0.0018021037,0.000020072815],"about_ca_topic_score_codex":0.003721576,"about_ca_topic_score_gemma":0.0054802,"teacher_disagreement_score":0.008941976,"about_ca_system_score_codex":0.0027281372,"about_ca_system_score_gemma":0.0014886686,"threshold_uncertainty_score":0.029913902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6324516,0.0005187405,0.1966278,0.0052726814,0.0014502777,0.00056406786,0.0031536068,0.0044140145,0.1555472],"genre_scores_gemma":[0.9464671,0.0002741034,0.036487438,0.00083575334,0.0002676744,0.0003309416,0.0011099658,0.001399003,0.012828072],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9949868,0.0010451139,0.00039395475,0.0010078732,0.00089179986,0.0016744857],"domain_scores_gemma":[0.9506542,0.021459432,0.0021036833,0.01669255,0.003916716,0.005173415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035653724,0.0012705909,0.0022633902,0.0020436808,0.00640919,0.0048316973,0.004282706,0.0040013385,0.03010883],"category_scores_gemma":[0.032115526,0.0015490596,0.0020441087,0.002229294,0.004886099,0.0076749194,0.0054622893,0.006835975,0.0048143608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002429814,0.0006080688,0.0055542965,0.0006640953,0.00017200017,0.0011557235,0.0013666592,0.013241745,0.04277175,0.87468153,0.016897148,0.04045703],"study_design_scores_gemma":[0.00021150926,0.00016060512,0.001333136,0.00009244253,0.00009078829,0.0004521959,0.00076377625,0.015124776,0.0155588,0.95635307,0.009724523,0.00013436758],"about_ca_topic_score_codex":0.0021127095,"about_ca_topic_score_gemma":0.00381461,"teacher_disagreement_score":0.03010883,"about_ca_system_score_codex":0.0013645068,"about_ca_system_score_gemma":0.0029573867,"threshold_uncertainty_score":0.1007241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03773987,0.00058030605,0.95440555,0.0004448177,0.0001051417,0.00019302405,0.00050004566,0.00077580585,0.005255381],"genre_scores_gemma":[0.32952574,0.0007352552,0.6656051,0.00013679043,0.00013855383,0.00023295525,0.0019147061,0.00014180085,0.0015690963],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99708027,0.00065407756,0.0003772596,0.0005379872,0.0011841607,0.00016618088],"domain_scores_gemma":[0.99438745,0.0035323787,0.00036693047,0.0007090903,0.0008013221,0.00020279986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024748787,0.0006051949,0.0009885173,0.003703776,0.00096711674,0.003679421,0.0009596307,0.00072822283,0.0023821862],"category_scores_gemma":[0.015858922,0.00058383105,0.0015947608,0.002796827,0.0016378079,0.006510931,0.0031468302,0.0018436181,0.0011175424],"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.00055242423,0.00029183595,0.00437452,0.0007215167,0.00022068211,0.00094594614,0.002368345,0.019897351,0.02204826,0.35494772,0.004927649,0.5887038],"study_design_scores_gemma":[0.00011143901,0.00014733398,0.002218123,0.00021714909,0.00016507263,0.000429025,0.00090732396,0.2530011,0.018724104,0.7057011,0.01829055,0.00008759605],"about_ca_topic_score_codex":0.0024628686,"about_ca_topic_score_gemma":0.002374609,"teacher_disagreement_score":0.003703776,"about_ca_system_score_codex":0.0007531794,"about_ca_system_score_gemma":0.0019812002,"threshold_uncertainty_score":0.013088524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7717477,0.0020866585,0.1642537,0.012700918,0.0003596801,0.00022440005,0.0030930548,0.000828606,0.044705298],"genre_scores_gemma":[0.9453797,0.00088149356,0.04243636,0.0006707313,0.000462933,0.00022772404,0.0021765886,0.00030932596,0.0074551073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99529004,0.0015777808,0.00020869305,0.0011590846,0.00092801964,0.00083633634],"domain_scores_gemma":[0.9429084,0.048349597,0.0023726798,0.0029891224,0.0013191474,0.0020610096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034450707,0.0013782609,0.0020775236,0.0024896564,0.0030536347,0.009905562,0.006461123,0.0030730302,0.013450731],"category_scores_gemma":[0.028494693,0.0013690132,0.0019537115,0.003797687,0.0055258074,0.014976179,0.004871454,0.0066590738,0.000947601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017514713,0.00068965025,0.015538504,0.00079399755,0.00020556437,0.00026411467,0.0015416491,0.15933214,0.005427966,0.74790376,0.018522497,0.048028804],"study_design_scores_gemma":[0.00014361521,0.00007016823,0.0021454662,0.00004423531,0.000086364635,0.00016276466,0.0003641516,0.23782973,0.0012634029,0.75598395,0.0018619588,0.000044213542],"about_ca_topic_score_codex":0.004163256,"about_ca_topic_score_gemma":0.0053291004,"teacher_disagreement_score":0.013450731,"about_ca_system_score_codex":0.0061447774,"about_ca_system_score_gemma":0.0037772788,"threshold_uncertainty_score":0.044997215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8007098,0.0026416478,0.17113541,0.0049171536,0.00022677437,0.000045787776,0.0008330164,0.00013536889,0.019355072],"genre_scores_gemma":[0.9733061,0.0008318616,0.022821635,0.00023337864,0.00026419328,0.000050940347,0.000550453,0.00006166364,0.001879852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971648,0.0015637673,0.000121902005,0.00043411538,0.00046014987,0.00025529577],"domain_scores_gemma":[0.95900625,0.028791798,0.0040958542,0.003236845,0.0021423434,0.0027269276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003880414,0.0007869022,0.001149709,0.0032974351,0.0016869699,0.004675563,0.001742297,0.0016434501,0.003396246],"category_scores_gemma":[0.03269999,0.00058728794,0.00060559413,0.0031592667,0.0043984125,0.009858515,0.004152797,0.0021898898,0.00022220629],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002167991,0.000057037494,0.0061855162,0.00013244023,0.000051868443,0.00003421664,0.00036522487,0.0149022965,0.00073717564,0.9597742,0.002491936,0.015051195],"study_design_scores_gemma":[0.000022773502,0.000052083844,0.0023837914,0.000030026526,0.000021275191,0.00007014505,0.00031463164,0.040535286,0.00046238507,0.95396465,0.002116605,0.000026363086],"about_ca_topic_score_codex":0.0012476251,"about_ca_topic_score_gemma":0.0014154265,"teacher_disagreement_score":0.004675563,"about_ca_system_score_codex":0.002149796,"about_ca_system_score_gemma":0.0008692113,"threshold_uncertainty_score":0.02052182},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030783491,0.0013072899,0.58689004,0.0041789776,0.0010038378,0.00068394834,0.031181287,0.019329727,0.32464138],"genre_scores_gemma":[0.31523597,0.002973349,0.25960317,0.003292144,0.0012071114,0.0022649989,0.09553509,0.015280733,0.30460748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964025,0.00040581299,0.00044254656,0.00096320256,0.0011415352,0.0006443754],"domain_scores_gemma":[0.99333125,0.0015133374,0.00082049053,0.0013223868,0.0025503032,0.00046226554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019127548,0.0016868125,0.00084239466,0.004267067,0.0021170308,0.008721677,0.0021858322,0.0021664237,0.0931231],"category_scores_gemma":[0.009572835,0.00077834143,0.0018269193,0.004501413,0.0020861528,0.010171329,0.0034701878,0.0026906496,0.05768543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036840752,0.00023131567,0.0029096352,0.0008010953,0.000072265335,0.0007405328,0.0020541206,0.006747022,0.011371498,0.65597355,0.20750251,0.111228056],"study_design_scores_gemma":[0.0000580004,0.000099316974,0.002638662,0.00033917802,0.00006843451,0.0010031089,0.0012308194,0.03163157,0.014314735,0.27555007,0.6729263,0.00013976038],"about_ca_topic_score_codex":0.009027785,"about_ca_topic_score_gemma":0.009519855,"teacher_disagreement_score":0.0931231,"about_ca_system_score_codex":0.0032924067,"about_ca_system_score_gemma":0.0025181512,"threshold_uncertainty_score":0.31152785},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05087213,0.000243091,0.9178138,0.0019388346,0.0002574401,0.0007491566,0.0030326133,0.0042892997,0.020803582],"genre_scores_gemma":[0.353509,0.00028203463,0.61168367,0.00051187904,0.00009963567,0.0009045707,0.0077317003,0.0015001529,0.02377736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99709344,0.0006784554,0.00017856288,0.0008905635,0.000695444,0.00046358773],"domain_scores_gemma":[0.9910581,0.0041154614,0.00030565303,0.0025143374,0.001183958,0.0008225928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021957136,0.0008722583,0.00113367,0.0011742561,0.0020917372,0.0028937098,0.0030595455,0.0012373585,0.017067414],"category_scores_gemma":[0.010269286,0.0008044005,0.0020734111,0.001909576,0.0013330404,0.0035033089,0.0048710243,0.0019837588,0.003945349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016186985,0.00087332056,0.004403489,0.0017180566,0.0002549986,0.00047752724,0.0012259277,0.19426179,0.032375854,0.4107764,0.09986723,0.2521467],"study_design_scores_gemma":[0.0003805345,0.00029860137,0.0016163511,0.00011619241,0.00017584983,0.00034944245,0.0005324409,0.50730807,0.025277536,0.42231634,0.041534528,0.0000940997],"about_ca_topic_score_codex":0.0033671614,"about_ca_topic_score_gemma":0.0070619495,"teacher_disagreement_score":0.017067414,"about_ca_system_score_codex":0.0028074353,"about_ca_system_score_gemma":0.003907892,"threshold_uncertainty_score":0.057096124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890269,0.0016377915,0.09752042,0.0011692406,0.00008282421,0.00003034469,0.00024267595,0.00013073992,0.010159068],"genre_scores_gemma":[0.9858709,0.0007309477,0.010561926,0.00007657654,0.00023328204,0.000040997147,0.00017789847,0.000032635504,0.002274843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980477,0.00070668367,0.0001006379,0.00054723106,0.00041404154,0.00018367953],"domain_scores_gemma":[0.97204566,0.021193424,0.0029642154,0.0014025596,0.0006349435,0.0017592667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016068041,0.00062587525,0.0015553093,0.0035111848,0.0019842272,0.0036369057,0.0019764174,0.0017781603,0.0041438737],"category_scores_gemma":[0.017711336,0.0008370034,0.0006827224,0.0037263243,0.0067810114,0.008438506,0.0048309113,0.0029136408,0.00042051147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052193046,0.00021613507,0.012122738,0.00040183082,0.000112761445,0.00042939812,0.0031707417,0.027918031,0.0045285216,0.9171465,0.0013458402,0.032085564],"study_design_scores_gemma":[0.00003368688,0.00010131449,0.0024252532,0.000030853855,0.000052668845,0.00043785726,0.00043879234,0.015469624,0.0006440444,0.9792086,0.0011310756,0.000026228265],"about_ca_topic_score_codex":0.0005454578,"about_ca_topic_score_gemma":0.00051135174,"teacher_disagreement_score":0.0041438737,"about_ca_system_score_codex":0.0007296761,"about_ca_system_score_gemma":0.00045153953,"threshold_uncertainty_score":0.01386261},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9178699,0.00037285866,0.049675323,0.0007938548,0.00008505033,0.000058907135,0.00078571844,0.00026900848,0.030089308],"genre_scores_gemma":[0.9813774,0.00028597986,0.010565904,0.00023713878,0.00013850318,0.000057285277,0.0012846176,0.00011571723,0.0059374827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994399,0.00008220602,0.000034908415,0.00018669925,0.00011085327,0.0001455214],"domain_scores_gemma":[0.9962614,0.0013475821,0.0007132313,0.00046630835,0.00026766956,0.00094377523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005175829,0.0006797843,0.0008415619,0.0020834703,0.0021259382,0.0032753279,0.0014368062,0.0010294945,0.005983576],"category_scores_gemma":[0.0026899583,0.0006337596,0.00086818787,0.0019958273,0.0023402793,0.0033940452,0.0013979066,0.0019210642,0.00043730292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021794447,0.00019513047,0.0083695585,0.00015795472,0.000034126988,0.00049357367,0.0010437884,0.0031711352,0.0059928787,0.95905507,0.003320122,0.017948773],"study_design_scores_gemma":[0.00004410039,0.000057565605,0.0065752994,0.000036708538,0.000038377068,0.0005492187,0.0005782496,0.018682048,0.0014751554,0.96751595,0.0044162725,0.000031131945],"about_ca_topic_score_codex":0.001592873,"about_ca_topic_score_gemma":0.0020777767,"teacher_disagreement_score":0.005983576,"about_ca_system_score_codex":0.0012388416,"about_ca_system_score_gemma":0.00070826133,"threshold_uncertainty_score":0.020017028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36242366,0.0015433186,0.6097702,0.0015172416,0.00022772703,0.0001391421,0.0008465734,0.0009672967,0.022564927],"genre_scores_gemma":[0.6184156,0.0006710362,0.37026197,0.00021962317,0.00009663331,0.00016257023,0.00073529413,0.0003892882,0.00904808],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874073,0.00047263943,0.000059795842,0.0003039816,0.00030686485,0.00011608907],"domain_scores_gemma":[0.9884272,0.008461231,0.00056927965,0.0012743594,0.00083194417,0.00043592276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017798541,0.00068930304,0.0010489203,0.0012603542,0.0007452179,0.0019466013,0.0015098613,0.0010759364,0.0065771104],"category_scores_gemma":[0.015621767,0.00074357283,0.0007672244,0.0013638339,0.0016926498,0.0051659956,0.0016616439,0.0016205482,0.001033057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001421182,0.00016350615,0.004921721,0.0008545494,0.00013159895,0.0003006782,0.0006359587,0.19952214,0.016236002,0.5895054,0.019788478,0.16651884],"study_design_scores_gemma":[0.00007947671,0.00024413453,0.0011752995,0.000072555784,0.00006080745,0.0003810753,0.00012220883,0.5205624,0.0055319844,0.46594095,0.005795414,0.00003365557],"about_ca_topic_score_codex":0.0016362766,"about_ca_topic_score_gemma":0.001903543,"teacher_disagreement_score":0.0065771104,"about_ca_system_score_codex":0.00095246756,"about_ca_system_score_gemma":0.0013826025,"threshold_uncertainty_score":0.022002578},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68555886,0.0009958145,0.124181144,0.001633539,0.0003074463,0.000095778996,0.0009394027,0.000285061,0.186003],"genre_scores_gemma":[0.9574286,0.0009642165,0.017386867,0.00029621177,0.00022170579,0.000069470436,0.00075720943,0.00016587872,0.02270998],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992506,0.00021945019,0.000030265199,0.000120202,0.00019656087,0.00018298576],"domain_scores_gemma":[0.99876344,0.0005357496,0.0002040127,0.00014720894,0.00014347202,0.00020606116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039708742,0.0008188336,0.00069482805,0.0017590574,0.0012901772,0.0034055598,0.0008640473,0.00083979557,0.009024466],"category_scores_gemma":[0.0020940157,0.000604929,0.00061638973,0.0009848455,0.0019240882,0.0025996964,0.0020964574,0.002279914,0.0012242671],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104425264,0.000019180414,0.00026434928,0.000035538396,0.000010991457,0.000102964375,0.00017148696,0.005554983,0.0014131507,0.98671573,0.001978988,0.0036282227],"study_design_scores_gemma":[0.000027955237,0.000031780073,0.0005270296,0.000024596644,0.000012119201,0.00020452442,0.00043019786,0.03075869,0.0009091287,0.9627875,0.0042668465,0.000019571182],"about_ca_topic_score_codex":0.0014538856,"about_ca_topic_score_gemma":0.0011562487,"teacher_disagreement_score":0.009024466,"about_ca_system_score_codex":0.00078634446,"about_ca_system_score_gemma":0.0003373885,"threshold_uncertainty_score":0.030189872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55545247,0.00086231675,0.16124007,0.004578114,0.0011228769,0.0001998012,0.001380692,0.0014904174,0.27367318],"genre_scores_gemma":[0.9149232,0.00060755503,0.020824103,0.00075453875,0.00040956205,0.00017492988,0.001356225,0.0006480185,0.06030178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903935,0.00017604305,0.00004543753,0.0001990897,0.00022524217,0.00031473913],"domain_scores_gemma":[0.9981997,0.00082082645,0.00016939963,0.00016774426,0.00016040576,0.00048181036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005291475,0.0010129123,0.0011943608,0.002814348,0.0040697493,0.0052437643,0.0012178081,0.002183991,0.019757403],"category_scores_gemma":[0.0025879398,0.001141021,0.001297678,0.0020503718,0.0038968376,0.0055546667,0.0064399173,0.0054030907,0.0026280007],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007589527,0.000036594585,0.00021939755,0.000052672338,0.0000076050933,0.00021413626,0.0005214609,0.00046706182,0.0007770289,0.99263096,0.0021152708,0.00288187],"study_design_scores_gemma":[0.00003768881,0.000012533061,0.00026917655,0.000019560865,0.00001233606,0.00014136438,0.00031540354,0.0013195844,0.00058236474,0.99057794,0.00669861,0.000013580942],"about_ca_topic_score_codex":0.0013684833,"about_ca_topic_score_gemma":0.0019338285,"teacher_disagreement_score":0.019757403,"about_ca_system_score_codex":0.001276905,"about_ca_system_score_gemma":0.0006935516,"threshold_uncertainty_score":0.066095054},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47994587,0.0009970971,0.29897952,0.008188661,0.00053806975,0.00045065736,0.000937202,0.0005411982,0.20942165],"genre_scores_gemma":[0.9303758,0.00047611658,0.027335588,0.0005767913,0.00019328897,0.00022787652,0.00031850647,0.00018739338,0.040308595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99715424,0.0014201079,0.00007293289,0.00035029094,0.00038672247,0.0006156833],"domain_scores_gemma":[0.99223834,0.0051489575,0.0004099313,0.00061773113,0.00037255854,0.0012123944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002018104,0.0013097404,0.0022727328,0.0010967839,0.0027165185,0.005080608,0.002943886,0.005152664,0.0124557875],"category_scores_gemma":[0.01405861,0.0008988707,0.0009752812,0.0012380955,0.0038056383,0.0063571753,0.002761579,0.0032082943,0.0010383748],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000275892,0.00006943783,0.00019746448,0.00008670323,0.000032177693,0.0001573749,0.00022069781,0.0323252,0.0008712683,0.95299834,0.007296299,0.0054692356],"study_design_scores_gemma":[0.00008035185,0.000047795504,0.00013963463,0.000021226,0.000017639986,0.00007289911,0.00015340297,0.15708381,0.00033174755,0.83827114,0.0037524959,0.000027827497],"about_ca_topic_score_codex":0.008600654,"about_ca_topic_score_gemma":0.007601897,"teacher_disagreement_score":0.0124557875,"about_ca_system_score_codex":0.002982307,"about_ca_system_score_gemma":0.0027177073,"threshold_uncertainty_score":0.041668773},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2962575,0.0012346009,0.52908486,0.0109256115,0.0006395558,0.0011192764,0.016417667,0.003935816,0.1403851],"genre_scores_gemma":[0.5569058,0.0008015745,0.3569371,0.0011958733,0.00037898653,0.00046907566,0.017088331,0.0014543529,0.064768896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998914,0.00030265583,0.000027840602,0.00032887052,0.00018957535,0.0002369918],"domain_scores_gemma":[0.99485296,0.0039746393,0.00018338217,0.0004696343,0.00027868678,0.00024068149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011750126,0.001110239,0.001018567,0.00088780536,0.0018989433,0.0024510263,0.0016594059,0.0018881848,0.031071698],"category_scores_gemma":[0.008117534,0.00053629454,0.0013930034,0.0016409813,0.0010251235,0.0032698633,0.0017001032,0.0020195981,0.0031632865],"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.0012239781,0.0007986415,0.003937584,0.0017608133,0.0004239438,0.0009727594,0.0010524628,0.25647065,0.008235151,0.24897721,0.25455955,0.22158736],"study_design_scores_gemma":[0.00035280717,0.00021682859,0.0018476723,0.00013310277,0.00016127752,0.00043553655,0.0005758894,0.355859,0.005902455,0.59488547,0.039586566,0.000043289892],"about_ca_topic_score_codex":0.008383053,"about_ca_topic_score_gemma":0.019961962,"teacher_disagreement_score":0.031071698,"about_ca_system_score_codex":0.0015508832,"about_ca_system_score_gemma":0.0025335527,"threshold_uncertainty_score":0.103945196},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010908525,0.06520163,0.003930503,0.120975755,0.5915327,0.00014414966,0.0077300454,0.00040642745,0.20898797],"genre_scores_gemma":[0.035979796,0.020676203,0.0020185565,0.017938716,0.17144604,0.00023733391,0.0038327961,0.00079966016,0.7470709],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860746,0.00036522138,0.00010312895,0.00028032207,0.0005488167,0.0000950926],"domain_scores_gemma":[0.99575835,0.0008283488,0.00022109566,0.00029633587,0.002410737,0.00048504228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002034488,0.0013347758,0.00097124936,0.0046043745,0.0029584623,0.004734697,0.0012053112,0.002359682,0.13320336],"category_scores_gemma":[0.014020927,0.00034054506,0.000551875,0.0029368545,0.0014110612,0.002890077,0.0021917524,0.0030228128,0.057492036],"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.000014006863,0.0000051781876,0.000030341249,0.000049988063,0.0000019069844,0.000011485922,0.000030041518,0.00006123965,0.000019484269,0.007440405,0.98725444,0.005081465],"study_design_scores_gemma":[0.0000065021377,0.0000068920003,0.00032081484,0.00022715075,0.0000030253987,0.000021105476,0.00004820028,0.0000882192,0.00004893463,0.004460819,0.9947608,0.000007680798],"about_ca_topic_score_codex":0.013498461,"about_ca_topic_score_gemma":0.016589263,"teacher_disagreement_score":0.13320336,"about_ca_system_score_codex":0.008054361,"about_ca_system_score_gemma":0.002676121,"threshold_uncertainty_score":0.44560963},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28433728,0.0016353464,0.61290747,0.0069824043,0.00042853883,0.000090065005,0.0011158774,0.0012682906,0.09123471],"genre_scores_gemma":[0.96792555,0.00061246974,0.021292482,0.00027737807,0.00020594832,0.00008914497,0.0002256307,0.00039061706,0.008980663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867517,0.00053562154,0.00003674498,0.00027226345,0.0003431492,0.0001370163],"domain_scores_gemma":[0.9777926,0.014406797,0.0014324704,0.0026234284,0.0027779972,0.0009666972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026060543,0.00052332506,0.0007779296,0.0018399031,0.0006843429,0.0025361064,0.0019176825,0.0018801687,0.007843975],"category_scores_gemma":[0.038776174,0.00074563385,0.0004929183,0.001295947,0.0026178914,0.0050207833,0.0012516046,0.0023667656,0.001321936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016496041,0.000027623415,0.0019866747,0.00014379557,0.000023944955,0.00019252839,0.000667534,0.07533772,0.00426154,0.88199085,0.0064167813,0.028785992],"study_design_scores_gemma":[0.000029757211,0.00008123621,0.0020640113,0.000057754394,0.000024826972,0.0004600763,0.00037273928,0.26537603,0.0014006934,0.7247301,0.0053544804,0.000048256432],"about_ca_topic_score_codex":0.0010492072,"about_ca_topic_score_gemma":0.00063085946,"teacher_disagreement_score":0.007843975,"about_ca_system_score_codex":0.0012442797,"about_ca_system_score_gemma":0.00059543346,"threshold_uncertainty_score":0.026240706},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001898876,0.00037254865,0.1923111,0.004172431,0.0014171917,0.00034280884,0.15456532,0.15946801,0.48545167],"genre_scores_gemma":[0.028501237,0.0010956284,0.12878314,0.0018058347,0.000758044,0.00076697563,0.22562443,0.13008024,0.48258445],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941516,0.00010441744,0.00008060034,0.0001051401,0.00023948417,0.000055113618],"domain_scores_gemma":[0.9978599,0.00066652923,0.00012284493,0.0005096634,0.000661854,0.00017918172],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007428196,0.0014271709,0.0008950846,0.0021042698,0.00091018097,0.0058868397,0.0022099854,0.0014577335,0.57106245],"category_scores_gemma":[0.0044123456,0.0009369088,0.0007980593,0.002870573,0.0006097218,0.006375409,0.002002063,0.0021495845,0.50232023],"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.000068187954,0.000024281579,0.0001226777,0.00027667446,0.000006568151,0.00004517185,0.0001480103,0.0002533671,0.002146936,0.041770253,0.911128,0.044009868],"study_design_scores_gemma":[0.000028201604,0.000009880265,0.00032371265,0.00005673653,0.0000044700505,0.00010297867,0.000053802483,0.0014880659,0.0043632165,0.017680837,0.97586274,0.00002542938],"about_ca_topic_score_codex":0.0046724263,"about_ca_topic_score_gemma":0.005296609,"teacher_disagreement_score":0.57106245,"about_ca_system_score_codex":0.0017272038,"about_ca_system_score_gemma":0.0011184264,"threshold_uncertainty_score":0.6118274},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7050993,0.000877326,0.06674884,0.0022777414,0.00017884737,0.00006652471,0.0003932881,0.00027580958,0.22408226],"genre_scores_gemma":[0.9774383,0.00029755657,0.0053524235,0.00021153172,0.000100291785,0.000032888034,0.00017565284,0.00006579692,0.016325597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985781,0.00047691577,0.000050759554,0.00019537356,0.0003300668,0.0003688727],"domain_scores_gemma":[0.9957202,0.0024695809,0.00048538906,0.00037090268,0.00040617606,0.00054781896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010947259,0.0002931964,0.00090063974,0.0015742539,0.0029383656,0.0045445906,0.0008832806,0.0011253646,0.008464111],"category_scores_gemma":[0.007653935,0.0005342514,0.0005024792,0.0020417026,0.003478958,0.0037958187,0.0020974204,0.0017839278,0.0009059082],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042993317,0.000009713992,0.00034919335,0.000023129607,0.000005577867,0.00006469387,0.00031325634,0.0010217145,0.00033509647,0.9935582,0.0011205834,0.0031558818],"study_design_scores_gemma":[0.000022100463,0.000007276729,0.00025695667,0.000011092343,0.0000080226355,0.00011843099,0.00014034242,0.0047383355,0.00028830388,0.99193656,0.0024649652,0.0000076141446],"about_ca_topic_score_codex":0.0014962472,"about_ca_topic_score_gemma":0.0018368267,"teacher_disagreement_score":0.008464111,"about_ca_system_score_codex":0.0012083098,"about_ca_system_score_gemma":0.00080693397,"threshold_uncertainty_score":0.028315246},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5161257,0.0065800934,0.33999562,0.009704756,0.0013532276,0.0000629813,0.00045333628,0.0001753344,0.12554902],"genre_scores_gemma":[0.9464717,0.0029130431,0.02083379,0.0011689331,0.001284918,0.00007741351,0.0003151414,0.00016111482,0.026773863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933356,0.00022981741,0.000027632728,0.00012271677,0.00020974422,0.00007640687],"domain_scores_gemma":[0.9964774,0.0020146726,0.00034689857,0.0002662696,0.00042484887,0.00046995794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012568868,0.0007727668,0.00079400826,0.0027836056,0.0010224242,0.0020803628,0.0016751185,0.0020743574,0.0070626917],"category_scores_gemma":[0.008243786,0.00032099863,0.00056239276,0.001748345,0.0039449944,0.0055058105,0.002739076,0.0022277345,0.0006587294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002295094,0.000021089749,0.00027825212,0.00005874079,0.000007460949,0.000052916777,0.0001331028,0.003505702,0.00070427096,0.98964393,0.0010452168,0.0045263222],"study_design_scores_gemma":[0.0000040677473,0.000010642532,0.00023968465,0.000012698086,0.0000035821104,0.000063842774,0.00006972355,0.01248528,0.000106269086,0.9861936,0.00080218486,0.000008384906],"about_ca_topic_score_codex":0.0004945101,"about_ca_topic_score_gemma":0.00046360344,"teacher_disagreement_score":0.0070626917,"about_ca_system_score_codex":0.0009180199,"about_ca_system_score_gemma":0.0003484639,"threshold_uncertainty_score":0.023627102},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045297217,0.00022666158,0.91023713,0.0007804354,0.0006353991,0.00013970556,0.0041591935,0.0181092,0.020415202],"genre_scores_gemma":[0.426474,0.00025017792,0.5138638,0.00041948934,0.00011457831,0.00027102706,0.011737671,0.007850565,0.039018665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935836,0.00007003215,0.000035998208,0.00015519468,0.00027605507,0.00010445255],"domain_scores_gemma":[0.9982772,0.0006229178,0.0000786516,0.00028263708,0.00066279154,0.000075849355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010423259,0.0011961175,0.00070059655,0.0011271633,0.0006936107,0.0016089771,0.0017533922,0.0022655483,0.051330496],"category_scores_gemma":[0.0071741575,0.00052611186,0.0010339525,0.0011766539,0.0004453033,0.0012549171,0.0010896081,0.0019346642,0.01076405],"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.0007216877,0.00046245335,0.006287404,0.00080217695,0.00014591016,0.00044742838,0.0006016078,0.5444207,0.030988775,0.024106288,0.10883243,0.28218305],"study_design_scores_gemma":[0.000016961243,0.000041001786,0.00084157445,0.000030349815,0.0000082160595,0.00007595182,0.000100954894,0.97604305,0.010096886,0.0023291893,0.010388332,0.000027615382],"about_ca_topic_score_codex":0.015270863,"about_ca_topic_score_gemma":0.019317776,"teacher_disagreement_score":0.051330496,"about_ca_system_score_codex":0.0011505203,"about_ca_system_score_gemma":0.002331503,"threshold_uncertainty_score":0.17171758},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72030663,0.0028062663,0.08674942,0.0047323583,0.0006042898,0.00007059314,0.0010242321,0.00033825007,0.18336804],"genre_scores_gemma":[0.96040493,0.0016073702,0.019181082,0.0006910214,0.00048386754,0.00013857937,0.00065812765,0.00021244082,0.01662262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999127,0.00024499896,0.00003489459,0.00023866532,0.000178852,0.00017554831],"domain_scores_gemma":[0.9929762,0.00440592,0.0007701918,0.00036579155,0.0005569036,0.00092496816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014185166,0.00081519893,0.00092893036,0.0047105425,0.0026473526,0.004419404,0.0017469259,0.0016742145,0.016039379],"category_scores_gemma":[0.0064801904,0.0007237555,0.0005333369,0.004383444,0.0059072957,0.0061023403,0.0025450895,0.0033776043,0.0014174377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023631472,0.00003775724,0.0012682044,0.00009432206,0.000015633717,0.00004746988,0.00042998613,0.0029707323,0.0016208467,0.9785568,0.004439879,0.010281931],"study_design_scores_gemma":[0.00004451155,0.000040278082,0.0016581044,0.000056416928,0.000021506816,0.000109298664,0.00023591137,0.009845426,0.0006805677,0.98221415,0.005060305,0.000033487697],"about_ca_topic_score_codex":0.00438279,"about_ca_topic_score_gemma":0.0030542326,"teacher_disagreement_score":0.016039379,"about_ca_system_score_codex":0.0025092796,"about_ca_system_score_gemma":0.000954804,"threshold_uncertainty_score":0.053657055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018668596,0.0012716181,0.9673178,0.0015866028,0.00027039723,0.000092198716,0.0003931796,0.00030567637,0.010093842],"genre_scores_gemma":[0.63381004,0.0026192202,0.33432654,0.0009936652,0.0011800438,0.00067371276,0.0018024553,0.0010336436,0.023560675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996867,0.0010412396,0.00016314372,0.00059248885,0.00093781255,0.0003982519],"domain_scores_gemma":[0.9718989,0.022948558,0.001304347,0.0015021297,0.0017336853,0.00061237375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037322417,0.0028304819,0.0027439282,0.0019426275,0.0009870413,0.0041177277,0.003951363,0.0028868318,0.010908824],"category_scores_gemma":[0.027555432,0.0010857627,0.0023207068,0.0022866281,0.0021944572,0.007959585,0.0043423967,0.0064281784,0.0011340912],"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.00026401936,0.00014452834,0.00070801884,0.00033108436,0.000108090855,0.0001429983,0.00010740568,0.8180492,0.001605562,0.14479594,0.0057957685,0.027947323],"study_design_scores_gemma":[0.0000173047,0.00002905624,0.000115103925,0.000015143919,0.00001653361,0.00002159643,0.000017773687,0.9187921,0.0002752912,0.08020116,0.000487394,0.000011558039],"about_ca_topic_score_codex":0.0050549814,"about_ca_topic_score_gemma":0.0045488533,"teacher_disagreement_score":0.010908824,"about_ca_system_score_codex":0.0033227946,"about_ca_system_score_gemma":0.0025977213,"threshold_uncertainty_score":0.0364936},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012969966,0.101208836,0.048698105,0.101153664,0.52164096,0.00021456406,0.0036866404,0.00091936014,0.22118092],"genre_scores_gemma":[0.025057392,0.052406777,0.015703557,0.02494662,0.43989083,0.00030979296,0.0035793388,0.0022403726,0.4358654],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986975,0.00035114476,0.00009244601,0.00029447468,0.0005001446,0.000064199594],"domain_scores_gemma":[0.9933077,0.0021847805,0.00021863324,0.00060147163,0.0030743515,0.0006130973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021677478,0.002500551,0.0017296927,0.00323764,0.0016837503,0.0030632638,0.0014453379,0.0023200025,0.11080101],"category_scores_gemma":[0.014447825,0.0005718251,0.0011562989,0.003209874,0.0012032974,0.0037017602,0.001819,0.0068570464,0.08606704],"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.0000230596,0.000038672737,0.00006204292,0.00030886734,0.000012816828,0.00003019022,0.000028408731,0.0008900329,0.00017343939,0.0156020215,0.94252425,0.0403062],"study_design_scores_gemma":[0.000028410737,0.000087716864,0.000966753,0.0007499291,0.000034032757,0.00013324477,0.000074891526,0.0026112215,0.0004890098,0.0687367,0.9260403,0.000047909278],"about_ca_topic_score_codex":0.0025878365,"about_ca_topic_score_gemma":0.003178381,"teacher_disagreement_score":0.11080101,"about_ca_system_score_codex":0.0028817824,"about_ca_system_score_gemma":0.0019714555,"threshold_uncertainty_score":0.37066633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32424027,0.00094427285,0.57174414,0.0024706717,0.0009384125,0.00018540236,0.0007377248,0.0011836326,0.09755555],"genre_scores_gemma":[0.9050543,0.00041979746,0.078590825,0.00032808864,0.00018236866,0.000102624355,0.00032824263,0.00027446524,0.014719338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924755,0.00020950187,0.000043846478,0.00013677162,0.00013817138,0.00022415756],"domain_scores_gemma":[0.9974196,0.0010723999,0.00017318927,0.00067649875,0.00024716233,0.00041108785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013594726,0.0007715189,0.0012563313,0.0007191426,0.0010803425,0.0017815102,0.0013281216,0.00092574157,0.008439695],"category_scores_gemma":[0.007325583,0.00038030432,0.00048883306,0.00072891894,0.0013300616,0.0028654689,0.002695589,0.0016290434,0.0005680169],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014499987,0.00013784131,0.000683746,0.00024609434,0.000042171538,0.00008728317,0.00017795632,0.07551576,0.007819863,0.84217745,0.012364315,0.059297524],"study_design_scores_gemma":[0.0001107502,0.00010667445,0.0003188485,0.00003093731,0.000040366525,0.00007450757,0.000078750476,0.32399464,0.0028661648,0.66806,0.0042918078,0.000026654145],"about_ca_topic_score_codex":0.0006947708,"about_ca_topic_score_gemma":0.0013515281,"teacher_disagreement_score":0.008439695,"about_ca_system_score_codex":0.0010426397,"about_ca_system_score_gemma":0.0014903807,"threshold_uncertainty_score":0.028233588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3789588,0.0016590629,0.52924186,0.002452812,0.00018600975,0.00015047706,0.00065153965,0.000364572,0.08633486],"genre_scores_gemma":[0.8952252,0.0009604591,0.08841645,0.00025544452,0.00022342443,0.00013002226,0.0007275099,0.00018782295,0.01387358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893695,0.00031411558,0.000036997797,0.00027796792,0.0002776762,0.00015620598],"domain_scores_gemma":[0.99573106,0.0026084257,0.00046382888,0.0004682489,0.00028209054,0.0004462956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009675191,0.00051807356,0.0009846541,0.0017959046,0.0019327225,0.0037529331,0.0018567647,0.0012823762,0.0064668804],"category_scores_gemma":[0.0063445857,0.00100674,0.00090163614,0.0021831868,0.003929813,0.0047321115,0.0027443902,0.0029712599,0.0004857794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006992656,0.00003688886,0.00083701307,0.00007632368,0.000014654775,0.00016136967,0.0005895217,0.00998543,0.000799788,0.969245,0.0021734345,0.01601065],"study_design_scores_gemma":[0.000019293411,0.000015170458,0.0005923548,0.000031563537,0.000022144995,0.00014406334,0.0003505124,0.0427049,0.0007549877,0.94918793,0.0061637256,0.0000134362945],"about_ca_topic_score_codex":0.0017807828,"about_ca_topic_score_gemma":0.0021180573,"teacher_disagreement_score":0.0064668804,"about_ca_system_score_codex":0.00088548847,"about_ca_system_score_gemma":0.0006408946,"threshold_uncertainty_score":0.021633923},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013022267,0.00037261308,0.15486509,0.006503401,0.0023243874,0.0006004029,0.15797648,0.11693919,0.5591162],"genre_scores_gemma":[0.022367349,0.0019288922,0.10291673,0.0035218992,0.0011875867,0.00088157045,0.26684278,0.13278033,0.4675728],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987684,0.00022323425,0.00012177395,0.00019281656,0.00052130624,0.00017242543],"domain_scores_gemma":[0.9959078,0.0011020985,0.00021535148,0.0011484409,0.0012064643,0.00041991923],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017423292,0.0017635882,0.001485257,0.0020679377,0.0013252092,0.0065961895,0.0039743776,0.002462591,0.6096722],"category_scores_gemma":[0.0081991125,0.0012954132,0.0014793475,0.0042432835,0.0009929253,0.007491185,0.0029123486,0.0030874722,0.4865179],"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.000098073586,0.000038245053,0.00013533173,0.00023079815,0.000009057369,0.000045527533,0.00010050748,0.00039732095,0.0013115037,0.026157988,0.9414607,0.030014846],"study_design_scores_gemma":[0.000050076644,0.000011858771,0.00030246688,0.00006038524,0.000006055586,0.00007997602,0.000063534506,0.0013439851,0.001987711,0.01707345,0.9789883,0.00003219711],"about_ca_topic_score_codex":0.012135651,"about_ca_topic_score_gemma":0.015024094,"teacher_disagreement_score":0.6096722,"about_ca_system_score_codex":0.0033293336,"about_ca_system_score_gemma":0.0022338533,"threshold_uncertainty_score":0.55675524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8292243,0.0028046153,0.07927759,0.040457558,0.00060502515,0.00015179154,0.001221483,0.00023866275,0.046018917],"genre_scores_gemma":[0.98709106,0.00048688453,0.0058996216,0.0006625937,0.00012683251,0.00005721142,0.00025438442,0.000030936677,0.0053903176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998613,0.00046381715,0.000063977684,0.00028816317,0.000250155,0.00032095338],"domain_scores_gemma":[0.9821744,0.010393375,0.0020293533,0.00079731835,0.0016814907,0.0029241976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026016939,0.00022213427,0.000760046,0.00043089275,0.0015123477,0.0025771346,0.0012432946,0.0023911973,0.009781294],"category_scores_gemma":[0.02889333,0.00024035029,0.0005415322,0.0005503624,0.0015351746,0.0055890027,0.0011607402,0.0020704188,0.0014433167],"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.0024667108,0.0012461236,0.16558053,0.0009955616,0.0014128573,0.0010101425,0.0034918066,0.047903653,0.0132825505,0.27038416,0.03416449,0.4580615],"study_design_scores_gemma":[0.00029259984,0.0010021894,0.07970706,0.00026003085,0.0008794578,0.0025722687,0.019810384,0.17893362,0.0038912392,0.68137777,0.031067707,0.00020565014],"about_ca_topic_score_codex":0.007897721,"about_ca_topic_score_gemma":0.008255544,"teacher_disagreement_score":0.009781294,"about_ca_system_score_codex":0.0014534744,"about_ca_system_score_gemma":0.0013231869,"threshold_uncertainty_score":0.0327217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23134187,0.00052743027,0.38625497,0.000748715,0.0011973279,0.00060317025,0.003867123,0.0030153685,0.37244403],"genre_scores_gemma":[0.7146168,0.00069528376,0.15268837,0.0005618467,0.00018756115,0.00040133356,0.0039973515,0.0005075305,0.12634392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959034,0.00006779638,0.000031634867,0.0001390951,0.00007101234,0.000100225334],"domain_scores_gemma":[0.99880743,0.000251639,0.00015159365,0.0003104584,0.00025842388,0.00022057963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034229507,0.00051543344,0.00041294494,0.0010361248,0.0014216047,0.0016044658,0.0010352427,0.0006122242,0.030080665],"category_scores_gemma":[0.0015408164,0.00048474714,0.0005702649,0.0013629522,0.0008540404,0.0020264767,0.00091999886,0.0011344482,0.004786346],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030352405,0.00014055498,0.0006365933,0.00028145962,0.00004263299,0.0010673373,0.0003305853,0.005143325,0.012589124,0.933042,0.010419168,0.036003657],"study_design_scores_gemma":[0.00016273331,0.00023843288,0.0015313316,0.00013314116,0.00014216625,0.0017820525,0.00076092733,0.029460376,0.020497141,0.75493497,0.19026154,0.00009517204],"about_ca_topic_score_codex":0.0013564593,"about_ca_topic_score_gemma":0.0028501237,"teacher_disagreement_score":0.030080665,"about_ca_system_score_codex":0.0007422047,"about_ca_system_score_gemma":0.0008790043,"threshold_uncertainty_score":0.100629866},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16894217,0.0002679764,0.78790045,0.00059833465,0.00021494104,0.00016270248,0.00028157007,0.0015158692,0.04011592],"genre_scores_gemma":[0.78068346,0.0003021889,0.19557488,0.00024332514,0.000112460526,0.00011141341,0.00057977485,0.00046802952,0.021924423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988213,0.0001930647,0.0000882136,0.00042061563,0.00023498402,0.00024168141],"domain_scores_gemma":[0.99864644,0.00047882908,0.00010735993,0.0004434144,0.00017329534,0.0001506324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042934474,0.0005911444,0.0010662057,0.0009462941,0.0012486933,0.0043023587,0.0016935356,0.0015508869,0.008949518],"category_scores_gemma":[0.003181502,0.0005181827,0.001684241,0.0012385,0.0022260593,0.0046237293,0.002215485,0.0023533078,0.0025882525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014579807,0.00011924118,0.00044497914,0.00009582138,0.000019703606,0.00015426365,0.00045868277,0.009472884,0.00872455,0.9154615,0.0036731933,0.06122932],"study_design_scores_gemma":[0.00003560783,0.00010131198,0.00025140302,0.000030130248,0.000033193253,0.00021754004,0.00024046923,0.096717834,0.0073464075,0.88720727,0.007762758,0.000056109988],"about_ca_topic_score_codex":0.0019528191,"about_ca_topic_score_gemma":0.0016557329,"teacher_disagreement_score":0.008949518,"about_ca_system_score_codex":0.0009150878,"about_ca_system_score_gemma":0.00091957214,"threshold_uncertainty_score":0.029939115},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12446008,0.0012482195,0.84386915,0.0043753176,0.000261805,0.00021097239,0.0012130553,0.00072850334,0.023632789],"genre_scores_gemma":[0.8486568,0.0019646282,0.06293102,0.0006375994,0.00031785964,0.0004093436,0.0012318747,0.00038912456,0.08346175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930537,0.00021463635,0.000020287367,0.00024341788,0.00013021704,0.00008614121],"domain_scores_gemma":[0.9963198,0.0022311541,0.00045959465,0.00025797109,0.00039041316,0.0003410563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011286195,0.00094705226,0.00171185,0.0026345367,0.0008354469,0.0020983736,0.0024792368,0.004025836,0.011730794],"category_scores_gemma":[0.00743873,0.00071555324,0.0011475978,0.0015889027,0.0025059949,0.0037660347,0.002164773,0.0024098654,0.00180445],"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.00017855837,0.000076746626,0.0016480777,0.00025997614,0.000096567106,0.0004459711,0.00026003056,0.38273373,0.00243496,0.5804201,0.0075884555,0.023856958],"study_design_scores_gemma":[0.00003598718,0.000041440348,0.00060423114,0.000027072661,0.000027586566,0.000107562235,0.0000680249,0.8596253,0.00046784477,0.13649024,0.002465029,0.00003965085],"about_ca_topic_score_codex":0.008313364,"about_ca_topic_score_gemma":0.005910483,"teacher_disagreement_score":0.011730794,"about_ca_system_score_codex":0.0015474499,"about_ca_system_score_gemma":0.0012402649,"threshold_uncertainty_score":0.0392434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41970128,0.0017321124,0.5320291,0.0014925057,0.00033544938,0.00011657211,0.0012643717,0.0004840937,0.04284443],"genre_scores_gemma":[0.86128116,0.0013908871,0.108891174,0.0005073556,0.00042196576,0.00015354667,0.0011953188,0.00039643847,0.025762143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992472,0.00020880807,0.000048291724,0.00014976844,0.00024081979,0.00010511992],"domain_scores_gemma":[0.9970241,0.0014505873,0.00030823168,0.0003002067,0.0004405453,0.00047625037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007274366,0.00045539142,0.0007466054,0.002593598,0.0009571849,0.002259068,0.00089907245,0.0012061169,0.006351747],"category_scores_gemma":[0.0043367865,0.00047056284,0.0007406033,0.0016559999,0.0013650527,0.0027129464,0.0014152526,0.0014859453,0.001138725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035800742,0.00001755382,0.0005904245,0.000050378967,0.000013815677,0.00014869892,0.00014413081,0.0037388683,0.0018944961,0.9859719,0.0012122485,0.0061817095],"study_design_scores_gemma":[0.0000073884944,0.000013543682,0.00053119875,0.000018621267,0.000011855659,0.00025253903,0.000039242448,0.040025145,0.00046628437,0.95450664,0.004119392,0.000008251183],"about_ca_topic_score_codex":0.0005945454,"about_ca_topic_score_gemma":0.0006583359,"teacher_disagreement_score":0.006351747,"about_ca_system_score_codex":0.00067588536,"about_ca_system_score_gemma":0.00038445863,"threshold_uncertainty_score":0.021248698},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002377503,0.0004032593,0.9879121,0.00078207045,0.00018104026,0.00004451301,0.000100451194,0.000058975616,0.008140058],"genre_scores_gemma":[0.25888756,0.0018968895,0.71740144,0.0010903573,0.00070177455,0.00059273647,0.0005672744,0.0005073639,0.018354598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830496,0.0010411607,0.000050793024,0.00019713459,0.00028249162,0.0001233791],"domain_scores_gemma":[0.9921111,0.006616104,0.00024831112,0.0002968731,0.0005406097,0.00018697447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042034653,0.0017030298,0.0020296925,0.0009916528,0.0007007725,0.0020837232,0.0023085393,0.0022706103,0.009336451],"category_scores_gemma":[0.017907027,0.0010986761,0.0013249549,0.0014464526,0.0019633071,0.0028363278,0.0023844026,0.0040185144,0.0009851091],"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.00004363138,0.00006003098,0.00020427872,0.0002249858,0.000029998619,0.00005142857,0.00007247363,0.8430631,0.00024477378,0.13256727,0.004558729,0.018879231],"study_design_scores_gemma":[0.000017736327,0.000016770748,0.00003232899,0.000030945095,0.000007218162,0.000007791294,0.000015246178,0.93134284,0.00006737163,0.06636712,0.0020897705,0.0000047743456],"about_ca_topic_score_codex":0.0077355676,"about_ca_topic_score_gemma":0.0065270746,"teacher_disagreement_score":0.009336451,"about_ca_system_score_codex":0.0018045651,"about_ca_system_score_gemma":0.002798238,"threshold_uncertainty_score":0.03123349},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008073147,0.04694974,0.12256733,0.091215625,0.57589436,0.0006886011,0.010742967,0.0028356228,0.14103256],"genre_scores_gemma":[0.051450986,0.024956347,0.04653658,0.011904182,0.18210278,0.00057286624,0.020456422,0.0036051094,0.6584147],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988231,0.00027793174,0.000053970656,0.0003560012,0.00036658137,0.00012244919],"domain_scores_gemma":[0.99572134,0.00073957193,0.00011324555,0.00035233927,0.002018908,0.0010544704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025193514,0.0019240772,0.0015080501,0.0018758579,0.0019624766,0.0047096326,0.0018711952,0.0015581985,0.121883504],"category_scores_gemma":[0.007067298,0.0005885056,0.0015413985,0.0016229723,0.00068358216,0.0042790296,0.0027023403,0.0042905784,0.044074025],"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.000100893354,0.000050653707,0.00016450381,0.00015998878,0.000015011783,0.00003737418,0.000048852064,0.00072304474,0.00056950573,0.0058785705,0.9492873,0.042964246],"study_design_scores_gemma":[0.00006990749,0.000139443,0.0018591221,0.00044085502,0.000047839138,0.00016371794,0.0003075006,0.002848227,0.0013579484,0.039417785,0.95328873,0.000058858015],"about_ca_topic_score_codex":0.0033581739,"about_ca_topic_score_gemma":0.0062252823,"teacher_disagreement_score":0.121883504,"about_ca_system_score_codex":0.003604656,"about_ca_system_score_gemma":0.0019137256,"threshold_uncertainty_score":0.40774095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8521197,0.0006916641,0.13519852,0.00048008098,0.000044547516,0.00002819739,0.0011135552,0.00020639876,0.01011725],"genre_scores_gemma":[0.9868732,0.00042141712,0.010492203,0.00007947327,0.00008223252,0.000051459596,0.0006409985,0.000052946216,0.0013061052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995529,0.000105996114,0.000022373122,0.00014667846,0.00009296957,0.000079096244],"domain_scores_gemma":[0.99464333,0.003412506,0.0006894598,0.00026646932,0.00052969856,0.00045856324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053824746,0.0005653549,0.00082588964,0.001956501,0.0007500559,0.0016173974,0.0017218809,0.0007697491,0.003944459],"category_scores_gemma":[0.006365042,0.0003476067,0.0004717966,0.0021033199,0.0008081998,0.002995458,0.00083030533,0.00076495326,0.00019756913],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078746834,0.00020197692,0.025193788,0.0006373747,0.0003202239,0.0007954778,0.0011685165,0.23396724,0.025375124,0.65453863,0.007144197,0.049869917],"study_design_scores_gemma":[0.000035750007,0.00008890325,0.0111448,0.000032768872,0.000085504355,0.0005999619,0.00030872689,0.33700258,0.003351977,0.6452898,0.0020227276,0.00003644694],"about_ca_topic_score_codex":0.00087675866,"about_ca_topic_score_gemma":0.0010296474,"teacher_disagreement_score":0.003944459,"about_ca_system_score_codex":0.0006589922,"about_ca_system_score_gemma":0.000275615,"threshold_uncertainty_score":0.013195515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7818784,0.00079314504,0.18976125,0.0014269239,0.00014358576,0.00017258726,0.0004371435,0.00025839818,0.025128499],"genre_scores_gemma":[0.97057915,0.0005455832,0.01741423,0.00018060385,0.00012816189,0.00010349786,0.00036755187,0.00009101916,0.010590114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859494,0.00030898358,0.00008484699,0.00030316395,0.00031558203,0.00039247677],"domain_scores_gemma":[0.98435175,0.010309449,0.0017186931,0.0013092434,0.0009513292,0.001359484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011821662,0.00062916556,0.0012359828,0.0013701251,0.0027156284,0.0035379652,0.0023162146,0.0014614613,0.0048599676],"category_scores_gemma":[0.014910355,0.000886164,0.0007656552,0.0021251936,0.0026548656,0.005044182,0.00323758,0.002306378,0.000409014],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009961871,0.00022137562,0.0055362303,0.00043208327,0.00009217129,0.0007240637,0.0028450864,0.0419362,0.010721384,0.896648,0.0040182536,0.035829004],"study_design_scores_gemma":[0.00016130945,0.00009343358,0.0013754182,0.000054872104,0.00008049401,0.0005228466,0.0010379676,0.119781114,0.0037382736,0.8693003,0.0038140314,0.00003992312],"about_ca_topic_score_codex":0.0031809243,"about_ca_topic_score_gemma":0.0034346664,"teacher_disagreement_score":0.0048599676,"about_ca_system_score_codex":0.0018300776,"about_ca_system_score_gemma":0.0013143796,"threshold_uncertainty_score":0.01625818},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072331615,0.0019944722,0.89649254,0.001168391,0.0003944435,0.00020471773,0.00045181438,0.000366395,0.026595619],"genre_scores_gemma":[0.61740905,0.0039114277,0.36418173,0.0006168372,0.00027103175,0.00046909918,0.0009471,0.0005917905,0.011601933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974178,0.0015839528,0.00007563007,0.00021292918,0.00046320635,0.0002464666],"domain_scores_gemma":[0.9917291,0.006313505,0.00042584733,0.00053974567,0.0006808458,0.00031093086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051587056,0.0013288251,0.001448454,0.001388136,0.00053669774,0.0029477654,0.0026333868,0.0012434372,0.006161392],"category_scores_gemma":[0.010767814,0.0006666937,0.0016947913,0.0023500524,0.0007835448,0.0040625753,0.001254797,0.0022554563,0.00045891074],"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.00033809358,0.000316659,0.00064641685,0.00023570168,0.00008351701,0.000030584888,0.000086288754,0.8343415,0.0004390986,0.115713954,0.0033675644,0.04440071],"study_design_scores_gemma":[0.000016514838,0.00006412573,0.00011478754,0.000023936316,0.000021727503,0.000010957161,0.000034205314,0.9779407,0.00012513167,0.020730438,0.0009094573,0.000008055831],"about_ca_topic_score_codex":0.005270641,"about_ca_topic_score_gemma":0.006288826,"teacher_disagreement_score":0.006161392,"about_ca_system_score_codex":0.003084771,"about_ca_system_score_gemma":0.0034992958,"threshold_uncertainty_score":0.027282178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17181578,0.0022338566,0.7813057,0.0025103174,0.00034778213,0.0005354858,0.002533826,0.0100286845,0.028688593],"genre_scores_gemma":[0.42931435,0.0006751156,0.5498824,0.0005187794,0.00014133968,0.00038800124,0.005427449,0.00087990816,0.012772628],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891865,0.00015804468,0.000047296933,0.0002973986,0.00025013371,0.00032843862],"domain_scores_gemma":[0.9982681,0.000713894,0.00012825863,0.00045170943,0.00024262736,0.00019533471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073087105,0.0021183447,0.002099657,0.0014634612,0.0011101834,0.0024323945,0.0030795187,0.0016015094,0.020682262],"category_scores_gemma":[0.0036123577,0.00063809496,0.001356206,0.0026855066,0.00074471807,0.0043557617,0.002367332,0.0024252338,0.0047144587],"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.0030302736,0.0013197783,0.0031184384,0.0012323074,0.00023461036,0.00031976396,0.0005578392,0.20758317,0.023696067,0.042141728,0.0682582,0.6485079],"study_design_scores_gemma":[0.0004958536,0.00021636391,0.000676304,0.000051665484,0.000120505414,0.00019247622,0.00027940058,0.9214605,0.0053640413,0.065195166,0.005920611,0.000027103417],"about_ca_topic_score_codex":0.0073539848,"about_ca_topic_score_gemma":0.012396983,"teacher_disagreement_score":0.020682262,"about_ca_system_score_codex":0.0022716129,"about_ca_system_score_gemma":0.0034596943,"threshold_uncertainty_score":0.06918913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04084651,0.000400096,0.89731485,0.0012287978,0.0004714501,0.00012281317,0.00040453958,0.0008340538,0.058376882],"genre_scores_gemma":[0.4028199,0.0013568203,0.5212109,0.0008898933,0.00060703047,0.0005279039,0.001261477,0.0010766477,0.0702495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933845,0.00019300518,0.000028839242,0.0001480203,0.00019566952,0.00009602196],"domain_scores_gemma":[0.99825066,0.0006203817,0.00010860912,0.00044135633,0.00031836232,0.00026056884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006445749,0.0005462398,0.0006228948,0.0013475611,0.0015686787,0.0016440785,0.0012928094,0.00086758245,0.0081247855],"category_scores_gemma":[0.0024628548,0.00066706684,0.0008730028,0.0011452896,0.0015134347,0.0023116064,0.002871946,0.0024477968,0.0016505318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057526715,0.00002964626,0.00015742872,0.00009101757,0.000012560693,0.00007533118,0.00027178708,0.002773302,0.0046847565,0.9607654,0.006153573,0.024927652],"study_design_scores_gemma":[0.00007306525,0.000070403265,0.00025640207,0.00005804197,0.00006208245,0.0002705559,0.00016143495,0.036103427,0.005465601,0.9034513,0.053991824,0.000035752244],"about_ca_topic_score_codex":0.0010104323,"about_ca_topic_score_gemma":0.0013610143,"teacher_disagreement_score":0.0081247855,"about_ca_system_score_codex":0.0011258916,"about_ca_system_score_gemma":0.00080137234,"threshold_uncertainty_score":0.027180135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27298412,0.0045992285,0.5229224,0.006646953,0.00088637025,0.00011223651,0.0006072878,0.00052922184,0.1907122],"genre_scores_gemma":[0.8583754,0.0020705613,0.08031432,0.0011576832,0.00090374635,0.00020090905,0.0007149492,0.00036987066,0.055892605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999196,0.00028914784,0.00003410458,0.00013320736,0.00020271775,0.00014491122],"domain_scores_gemma":[0.9977863,0.001307692,0.00025159473,0.00022435484,0.0002366511,0.00019333753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016431279,0.00075434137,0.0010936117,0.002951559,0.0021461616,0.0033970904,0.0018692075,0.0017902205,0.0076832254],"category_scores_gemma":[0.007948696,0.0005106783,0.0010546447,0.0025628887,0.003644918,0.0054636025,0.002410693,0.0038564168,0.0009622111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012024939,0.000007277549,0.000093099334,0.000011390121,0.000001943831,0.000010486108,0.000046724035,0.00044490476,0.000096481344,0.99552274,0.0006792348,0.0030738637],"study_design_scores_gemma":[0.000007235164,0.0000038550243,0.00007553096,0.0000068736213,0.0000029830196,0.000022832955,0.000018426404,0.0041027097,0.000101191865,0.9944858,0.0011660727,0.0000064260116],"about_ca_topic_score_codex":0.0014822602,"about_ca_topic_score_gemma":0.0013238456,"teacher_disagreement_score":0.0076832254,"about_ca_system_score_codex":0.0020206326,"about_ca_system_score_gemma":0.00080942875,"threshold_uncertainty_score":0.025702894},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37139034,0.014557384,0.36190873,0.014583952,0.0010011155,0.0001917057,0.001346757,0.00027504528,0.23474489],"genre_scores_gemma":[0.86411595,0.011078513,0.054222804,0.0017054877,0.0026812237,0.00037751737,0.0017318382,0.00024395308,0.063842565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856806,0.0005865787,0.00005175465,0.00024875137,0.00034473513,0.00020007168],"domain_scores_gemma":[0.98956686,0.008614485,0.0005298583,0.0003853946,0.00037021175,0.0005331177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001652414,0.0012636182,0.0016621645,0.002732961,0.0020948988,0.003442806,0.0019835143,0.0029287615,0.00882583],"category_scores_gemma":[0.012318846,0.00084512663,0.001377892,0.0056195995,0.003250932,0.00821151,0.003296437,0.0039974465,0.0005980264],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009338743,0.00007839853,0.0006905433,0.00018067287,0.00003368835,0.00017929831,0.0004002703,0.013787548,0.00040035736,0.9602697,0.006638298,0.017247802],"study_design_scores_gemma":[0.000019128016,0.000008953663,0.00022596218,0.000024941857,0.000012458773,0.00011728925,0.00008689223,0.020510618,0.00007549515,0.9753184,0.0035921962,0.0000076645965],"about_ca_topic_score_codex":0.0021338481,"about_ca_topic_score_gemma":0.0014762981,"teacher_disagreement_score":0.00882583,"about_ca_system_score_codex":0.0021453756,"about_ca_system_score_gemma":0.000835292,"threshold_uncertainty_score":0.0295254},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07593587,0.0004510472,0.9045248,0.0013782841,0.00013413701,0.00006305561,0.0005440134,0.00025264398,0.016716242],"genre_scores_gemma":[0.93526447,0.0004307758,0.049942214,0.00019899875,0.00013274886,0.00018739219,0.00047990767,0.00010320946,0.013260246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994825,0.00024103044,0.000021123666,0.00009531917,0.000092400514,0.00006757819],"domain_scores_gemma":[0.99720436,0.0018023254,0.00030440124,0.00013694022,0.00033782708,0.00021400643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011146262,0.00069491414,0.0010561218,0.0011649544,0.0006231516,0.0018781689,0.0017691245,0.0016216934,0.009805288],"category_scores_gemma":[0.0056291437,0.00029085882,0.00062673003,0.0011024504,0.0012619633,0.0022969302,0.00090437825,0.0013017774,0.00088504684],"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.00008568413,0.000041589086,0.00029009933,0.00008220758,0.000039076185,0.000094679206,0.00020726434,0.333981,0.0011282156,0.65347886,0.0026198297,0.007951585],"study_design_scores_gemma":[0.000009253643,0.000010109267,0.000059886836,0.0000053725817,0.000004732703,0.000009341798,0.000028963328,0.84079975,0.000074329335,0.15856457,0.0004249343,0.0000087541075],"about_ca_topic_score_codex":0.0062805386,"about_ca_topic_score_gemma":0.0048941644,"teacher_disagreement_score":0.009805288,"about_ca_system_score_codex":0.0011848204,"about_ca_system_score_gemma":0.0010680575,"threshold_uncertainty_score":0.032801986},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65487313,0.0006695648,0.2651136,0.0013440205,0.00018922127,0.00008396299,0.0008530319,0.00040735988,0.076466024],"genre_scores_gemma":[0.92099756,0.0006006003,0.044445176,0.00034581087,0.00016815378,0.00010927845,0.00077467976,0.00016869155,0.032389976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984933,0.00037142893,0.00008824513,0.0003125081,0.00044415597,0.00029040588],"domain_scores_gemma":[0.9928116,0.004303769,0.00081123115,0.00062135037,0.0007013751,0.00075075065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011828176,0.0005834356,0.00076192425,0.0018212107,0.001492897,0.0029980668,0.0015156103,0.0009882743,0.008105694],"category_scores_gemma":[0.0061870995,0.0008231916,0.0009859232,0.0015432715,0.0025826145,0.0041163964,0.0028089988,0.0026212176,0.0005954269],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017388891,0.000052844247,0.001336059,0.000100629295,0.000034141656,0.0002646328,0.00057672436,0.00828773,0.0035192529,0.9722569,0.0016938809,0.011703343],"study_design_scores_gemma":[0.00004350923,0.00003081914,0.00081349775,0.000023025788,0.000020759378,0.00025998653,0.00022957128,0.03542552,0.0015613168,0.9579343,0.0036413944,0.000016248137],"about_ca_topic_score_codex":0.0022960706,"about_ca_topic_score_gemma":0.002578297,"teacher_disagreement_score":0.008105694,"about_ca_system_score_codex":0.0010677237,"about_ca_system_score_gemma":0.0006342932,"threshold_uncertainty_score":0.02711624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029469315,0.0010604309,0.9624441,0.0014694543,0.00015490445,0.000095926414,0.0002770677,0.0005516942,0.0044771167],"genre_scores_gemma":[0.62909,0.0010902111,0.36014,0.00045230583,0.00025196976,0.00033946772,0.0010250394,0.0003488602,0.0072620665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998221,0.00073837774,0.00008256865,0.00028362373,0.0003251365,0.00034928194],"domain_scores_gemma":[0.9900663,0.007826393,0.00058771216,0.0005982011,0.00050212233,0.00041929414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031956893,0.0015394151,0.0026005225,0.0011726499,0.000969941,0.0025875028,0.003932597,0.002701143,0.0050563053],"category_scores_gemma":[0.016082784,0.00086806,0.0010838798,0.0026068091,0.0013299298,0.0043562166,0.0022959493,0.0035114868,0.0007075193],"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.00036843424,0.00014647281,0.0006458198,0.00015826375,0.000051333696,0.000044849305,0.000082372186,0.9181224,0.00029373047,0.035784066,0.0044206167,0.03988169],"study_design_scores_gemma":[0.00004321331,0.000027052078,0.00006727001,0.000011570388,0.0000095247515,0.000018080233,0.000021335927,0.9746987,0.00010316234,0.024615424,0.0003799092,0.0000047488584],"about_ca_topic_score_codex":0.008566313,"about_ca_topic_score_gemma":0.00705231,"teacher_disagreement_score":0.008566313,"about_ca_system_score_codex":0.00333044,"about_ca_system_score_gemma":0.0030274305,"threshold_uncertainty_score":0.02416414},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24690825,0.0010098352,0.5389485,0.003708871,0.0010092497,0.00025050534,0.0009699595,0.0013817989,0.20581311],"genre_scores_gemma":[0.8829018,0.0006649334,0.05860464,0.00083971367,0.00045833632,0.00024584454,0.0007447086,0.00047879564,0.055061188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925464,0.00017188385,0.00004364866,0.00015845982,0.00018462281,0.0001867307],"domain_scores_gemma":[0.99576205,0.0019194242,0.0003044951,0.0009291037,0.00041579956,0.0006691681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009573291,0.0006978365,0.0010486277,0.0011112812,0.0017111999,0.0024433963,0.0011559889,0.00093757367,0.01387544],"category_scores_gemma":[0.007490766,0.00031736627,0.0006370731,0.0010433164,0.0018884742,0.004008012,0.003097134,0.0026360494,0.0014696459],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022228842,0.000030772364,0.00025380083,0.000071051785,0.00001445964,0.000064406086,0.00016750049,0.0046662046,0.0015983626,0.9693151,0.0066120704,0.016984077],"study_design_scores_gemma":[0.000025316724,0.000027261203,0.00011355857,0.000011147484,0.000013021696,0.00006529284,0.00005276448,0.026820691,0.00086691225,0.9667704,0.0052210526,0.000012459302],"about_ca_topic_score_codex":0.0004765824,"about_ca_topic_score_gemma":0.00054614816,"teacher_disagreement_score":0.01387544,"about_ca_system_score_codex":0.0008266719,"about_ca_system_score_gemma":0.00085621304,"threshold_uncertainty_score":0.04641801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37621906,0.0020381978,0.5599117,0.0033479382,0.00061313575,0.00014596274,0.0008647619,0.00040695744,0.05645223],"genre_scores_gemma":[0.88896894,0.0024351391,0.08136045,0.0010720486,0.0007000708,0.00016939177,0.0009093113,0.0003600667,0.024024563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864966,0.0006625041,0.0000344446,0.00021693452,0.00017693864,0.00025963588],"domain_scores_gemma":[0.9896595,0.0069921664,0.000846756,0.00065171043,0.00082858256,0.0010214441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019060094,0.0019768623,0.0013686038,0.0017642858,0.0016587039,0.0023008226,0.0021654386,0.0013023037,0.007149911],"category_scores_gemma":[0.008747339,0.001096213,0.0012151992,0.002356542,0.0026825848,0.0036363115,0.0026865387,0.0025653474,0.0007945146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063321105,0.00016053075,0.0024501523,0.00047042384,0.00010736204,0.00034428187,0.00061249395,0.10659544,0.0054428335,0.8483534,0.012090544,0.022739356],"study_design_scores_gemma":[0.000067485664,0.000083738145,0.0009890161,0.00007546275,0.00004871888,0.00017078638,0.00022554232,0.18757041,0.0010464977,0.8059574,0.0037373859,0.000027503631],"about_ca_topic_score_codex":0.0029074342,"about_ca_topic_score_gemma":0.004223841,"teacher_disagreement_score":0.007149911,"about_ca_system_score_codex":0.0018277481,"about_ca_system_score_gemma":0.001271241,"threshold_uncertainty_score":0.023918808},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010152973,0.053426076,0.00993562,0.038649246,0.8284637,0.00012447935,0.0027684816,0.0005130001,0.06510423],"genre_scores_gemma":[0.016848614,0.049075328,0.004891424,0.008439296,0.3227687,0.00023672008,0.0053870617,0.0018452867,0.5905076],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882084,0.00022639146,0.000081226855,0.00028812807,0.0004562249,0.00012718947],"domain_scores_gemma":[0.99552935,0.00071414385,0.00022482937,0.00040573953,0.002041041,0.0010850591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019121186,0.0023801993,0.0018315389,0.0039986903,0.0018433619,0.004870044,0.0014704325,0.0017701978,0.1402796],"category_scores_gemma":[0.0074614417,0.00048461393,0.001226007,0.0031733087,0.00080718094,0.003019096,0.003232199,0.0040239017,0.07699511],"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.00004008115,0.00002048893,0.000088290326,0.00017434901,0.000008141753,0.000021789272,0.000017173626,0.00035116353,0.0001313565,0.002656585,0.9672442,0.029246353],"study_design_scores_gemma":[0.00002063051,0.0000781569,0.0010332643,0.00054898474,0.0000213338,0.00007934909,0.00007192067,0.0010072767,0.00029703017,0.011350012,0.98546845,0.000023613262],"about_ca_topic_score_codex":0.0030227508,"about_ca_topic_score_gemma":0.0058263396,"teacher_disagreement_score":0.1402796,"about_ca_system_score_codex":0.003501811,"about_ca_system_score_gemma":0.0023138677,"threshold_uncertainty_score":0.46928203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10580294,0.0015916822,0.86306345,0.0042215497,0.0001783846,0.00009734008,0.0006084252,0.00042030588,0.02401599],"genre_scores_gemma":[0.9127923,0.0022721281,0.039205566,0.0005133117,0.0005455864,0.0004186686,0.00048132724,0.00025279695,0.043518256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986645,0.00063442497,0.00004229893,0.00024886223,0.00025133035,0.00015864347],"domain_scores_gemma":[0.9926883,0.004481774,0.0010366761,0.0005956225,0.00055960525,0.0006380384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023384744,0.0011395394,0.0021693304,0.0020386183,0.0012164066,0.0035805968,0.0037733964,0.0029979197,0.007100475],"category_scores_gemma":[0.012185956,0.0008246027,0.0014571921,0.0016193197,0.003524577,0.007188565,0.0024190592,0.0027127347,0.0010617063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025754445,0.000031865824,0.0004200362,0.00006864748,0.000043213167,0.00012981067,0.00021038907,0.06734701,0.00042259225,0.9265764,0.0020006148,0.0027237472],"study_design_scores_gemma":[0.000017457187,0.000013816556,0.00015120456,0.000015860078,0.000016894239,0.00005631075,0.00004728898,0.4544323,0.000070613605,0.5440687,0.0010912949,0.000018203345],"about_ca_topic_score_codex":0.0061218906,"about_ca_topic_score_gemma":0.0044803913,"teacher_disagreement_score":0.007100475,"about_ca_system_score_codex":0.0026647623,"about_ca_system_score_gemma":0.001347336,"threshold_uncertainty_score":0.023753405},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025887895,0.0010877817,0.5614155,0.011685766,0.0011843441,0.00012996656,0.0026178523,0.0016357109,0.39435515],"genre_scores_gemma":[0.70893353,0.0018455065,0.155721,0.005280287,0.0013926895,0.0005605967,0.0030595562,0.0018889834,0.12131784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99844366,0.00039356976,0.00010389241,0.0003403669,0.0005090263,0.00020949509],"domain_scores_gemma":[0.99586725,0.002284797,0.0002617018,0.0005681836,0.00083681504,0.0001813568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020481434,0.00061057834,0.00060380343,0.0019342335,0.0024098183,0.0045585,0.0013008589,0.0012883248,0.027517023],"category_scores_gemma":[0.0066335234,0.0005239914,0.0015336447,0.0011219756,0.004465655,0.00947668,0.0017772552,0.0051486986,0.0057192137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022153895,0.0000048273046,0.000029433866,0.000008433409,0.0000013135929,0.000011214629,0.000052524305,0.00007351756,0.00005377573,0.99548054,0.0031290052,0.0011530189],"study_design_scores_gemma":[0.0000042317743,0.000002378857,0.00005469331,0.000012185028,0.0000023859388,0.0000296417,0.00003004186,0.0010832251,0.00019882486,0.9896582,0.00891756,0.000006775886],"about_ca_topic_score_codex":0.002992644,"about_ca_topic_score_gemma":0.003925375,"teacher_disagreement_score":0.027517023,"about_ca_system_score_codex":0.002415187,"about_ca_system_score_gemma":0.0011802398,"threshold_uncertainty_score":0.09205359},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015321658,0.00046419032,0.97979444,0.0005015769,0.000114790135,0.00009779496,0.00025608123,0.0004977002,0.0029518458],"genre_scores_gemma":[0.31117275,0.00055476226,0.67893976,0.00035152189,0.00016201926,0.00044610552,0.0013377009,0.0002396989,0.0067957193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988098,0.00036059704,0.00006378703,0.0002905941,0.00026684068,0.00020831078],"domain_scores_gemma":[0.9967625,0.0021382167,0.00019776364,0.000307264,0.0004162221,0.00017799178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001836803,0.0013693627,0.0024324304,0.0011531865,0.00069445535,0.0017636527,0.0038124868,0.0022714378,0.008124417],"category_scores_gemma":[0.0074051693,0.0008242151,0.0010880791,0.0026836046,0.0010182604,0.003282936,0.0025134005,0.002412383,0.0010540782],"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.00046766235,0.00017221244,0.00098183,0.0002714439,0.00006295615,0.000076192126,0.00009720997,0.8771109,0.0011698636,0.03134888,0.00795547,0.08028534],"study_design_scores_gemma":[0.000036735823,0.000024315495,0.000056888606,0.000007003316,0.000006888936,0.000020655016,0.000013306116,0.9918628,0.00015036929,0.0074366364,0.00038056442,0.000003915473],"about_ca_topic_score_codex":0.011200226,"about_ca_topic_score_gemma":0.00788936,"teacher_disagreement_score":0.011200226,"about_ca_system_score_codex":0.0023919768,"about_ca_system_score_gemma":0.0031531174,"threshold_uncertainty_score":0.027178884},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20000917,0.0054050684,0.71514356,0.018882008,0.0007097754,0.00021516542,0.0013374668,0.0007927252,0.05750514],"genre_scores_gemma":[0.76659334,0.0034424083,0.20824964,0.0014690626,0.0012408777,0.0004127657,0.0018937391,0.00061412057,0.016083922],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951036,0.0022899648,0.00022176259,0.00075284205,0.0010976024,0.0005342514],"domain_scores_gemma":[0.9281779,0.06563224,0.0014380183,0.0024131197,0.0012601943,0.0010786767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004624542,0.0013512205,0.0029736864,0.0021793284,0.0022086136,0.0059327087,0.004666795,0.0030826572,0.014509953],"category_scores_gemma":[0.05163339,0.00091366126,0.002003155,0.0039597265,0.0049745245,0.013573133,0.0060869977,0.0072015366,0.0011302566],"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.00059969653,0.00031865336,0.0021810713,0.00047707697,0.000111686975,0.0001524232,0.0004888101,0.26607043,0.0007516126,0.6630565,0.012891619,0.052900534],"study_design_scores_gemma":[0.00006706547,0.00002733079,0.0002588569,0.000028876151,0.000019157931,0.000051858693,0.000099528384,0.31443286,0.000222569,0.68325,0.00152714,0.000014667603],"about_ca_topic_score_codex":0.004248083,"about_ca_topic_score_gemma":0.0036887375,"teacher_disagreement_score":0.014509953,"about_ca_system_score_codex":0.0029644829,"about_ca_system_score_gemma":0.0024795756,"threshold_uncertainty_score":0.048540592},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06718592,0.000800984,0.90273285,0.00085886754,0.00018277208,0.00023751854,0.0060379766,0.016866107,0.0050969827],"genre_scores_gemma":[0.5367213,0.0006366976,0.44801158,0.00043027487,0.00009603825,0.00018464764,0.009308462,0.0014101886,0.0032008279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707234,0.0005604219,0.0003472651,0.0007876286,0.00096606463,0.00026619338],"domain_scores_gemma":[0.99104184,0.0040560053,0.0006810969,0.0029187435,0.0009131641,0.00038920814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017906893,0.00091325486,0.0016699503,0.0031904958,0.0011046655,0.0050837523,0.0028563873,0.001443567,0.004687216],"category_scores_gemma":[0.012007124,0.0007691614,0.0013993857,0.0054174857,0.0011151764,0.009564656,0.0040428615,0.0015845562,0.0013107993],"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.0022537848,0.00097310956,0.014570143,0.0012903693,0.00044350207,0.0015533275,0.001518125,0.19007505,0.04252799,0.34176534,0.038590424,0.36443883],"study_design_scores_gemma":[0.00015484629,0.00016854603,0.0013322037,0.00011908162,0.00013494321,0.00055670366,0.0007439991,0.64474124,0.031287093,0.2991899,0.021448543,0.00012283614],"about_ca_topic_score_codex":0.005014636,"about_ca_topic_score_gemma":0.006521227,"teacher_disagreement_score":0.0050837523,"about_ca_system_score_codex":0.0013529378,"about_ca_system_score_gemma":0.0012276979,"threshold_uncertainty_score":0.015680313},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018591879,0.00014293555,0.980565,0.000047703124,0.000020016527,0.000012860666,0.00001036637,0.00008308527,0.0005261126],"genre_scores_gemma":[0.73404384,0.0003185191,0.26352334,0.000049694125,0.000091454676,0.0000914969,0.00009584239,0.00012445536,0.0016613391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983972,0.0006649759,0.00006735074,0.00022739917,0.000530972,0.00011208078],"domain_scores_gemma":[0.9935675,0.0047424864,0.00033348595,0.00048144322,0.0007835333,0.0000915572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033508104,0.00073683955,0.0014373391,0.0016219211,0.00053839805,0.0014477479,0.0010563799,0.0008409571,0.0011813157],"category_scores_gemma":[0.0125011895,0.00063017616,0.0014125085,0.0012436848,0.0011275171,0.0020592932,0.0016578757,0.0018216115,0.000298639],"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.0004492853,0.00011847542,0.0017210018,0.00015776887,0.00024323215,0.0001684386,0.00026670017,0.6983169,0.012521103,0.11223713,0.0012282219,0.17257172],"study_design_scores_gemma":[0.0000038889248,0.000022896666,0.00012020724,0.0000035090675,0.000009587345,0.000014602651,0.000007707646,0.98683757,0.0008366854,0.012024439,0.00011286816,0.0000060174966],"about_ca_topic_score_codex":0.0014638382,"about_ca_topic_score_gemma":0.0011356209,"teacher_disagreement_score":0.0033508104,"about_ca_system_score_codex":0.0008027894,"about_ca_system_score_gemma":0.0005912041,"threshold_uncertainty_score":0.017720997},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022591467,0.0006714165,0.1310109,0.006978126,0.0021197738,0.0003374982,0.09640576,0.038088366,0.72212905],"genre_scores_gemma":[0.029354503,0.0020995466,0.08322265,0.0026841434,0.0008247296,0.00054395257,0.13910243,0.03876606,0.703402],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941564,0.00011368198,0.000042528944,0.00011937847,0.00024875673,0.000060051425],"domain_scores_gemma":[0.99852186,0.0005854193,0.000082663435,0.00030311747,0.0003829207,0.00012411749],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00071989174,0.0010966804,0.0010751581,0.0019776686,0.0011046965,0.00452158,0.0024649573,0.0013461072,0.62477905],"category_scores_gemma":[0.0037646517,0.00073982886,0.0011269351,0.0048294626,0.00066158175,0.0044992873,0.0019670462,0.0020174724,0.41340542],"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.00007331271,0.000043311673,0.00013056285,0.00020042896,0.000008863207,0.000048594746,0.00010272704,0.000560542,0.000960333,0.053057075,0.8977154,0.047098827],"study_design_scores_gemma":[0.000047648744,0.000013510845,0.0005976449,0.000091759204,0.0000067024644,0.000088388246,0.00008577494,0.0025735232,0.0017346756,0.06027666,0.9344551,0.000028676697],"about_ca_topic_score_codex":0.011246035,"about_ca_topic_score_gemma":0.018590648,"teacher_disagreement_score":0.62477905,"about_ca_system_score_codex":0.002811169,"about_ca_system_score_gemma":0.0010841107,"threshold_uncertainty_score":0.53520715},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8572538,0.0018984815,0.08724758,0.009328031,0.00036196926,0.000111769215,0.0013439943,0.000587375,0.041867014],"genre_scores_gemma":[0.9830692,0.0008109523,0.009258134,0.00023872918,0.00021163249,0.000056531666,0.0003380228,0.00015960619,0.0058572222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979311,0.0006320184,0.00012767238,0.00027841193,0.0005591618,0.0004717024],"domain_scores_gemma":[0.9674897,0.02398656,0.002146792,0.0029365532,0.0014434453,0.001996893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021957052,0.0006481764,0.0019097705,0.0020460638,0.0014577701,0.004197005,0.0027553209,0.0032590756,0.016486559],"category_scores_gemma":[0.036268707,0.0010482436,0.0008608519,0.0028986547,0.0029699367,0.012986488,0.0025952032,0.0023277316,0.0008078499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014870518,0.00017679237,0.0045152167,0.00053927395,0.00012717991,0.0003297176,0.00045451624,0.101322,0.0033795973,0.82073295,0.013439982,0.05349572],"study_design_scores_gemma":[0.00010170936,0.00013005105,0.0013982299,0.000064938606,0.000102915634,0.00028396116,0.00030479842,0.17114574,0.0015658969,0.8222111,0.0026495191,0.00004111174],"about_ca_topic_score_codex":0.001644527,"about_ca_topic_score_gemma":0.0017883333,"teacher_disagreement_score":0.016486559,"about_ca_system_score_codex":0.0025871966,"about_ca_system_score_gemma":0.0012324061,"threshold_uncertainty_score":0.055153012},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20432785,0.0014974244,0.7674158,0.002841413,0.0002607921,0.00014019269,0.002222751,0.0016314264,0.019662358],"genre_scores_gemma":[0.7249575,0.00044588468,0.26895118,0.00017677025,0.00022226409,0.00014951291,0.0016823924,0.00042354077,0.0029909743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985208,0.00042390142,0.00006575605,0.0004949896,0.00031139574,0.00018320698],"domain_scores_gemma":[0.9804791,0.016309904,0.0006441859,0.0011077472,0.00069956126,0.00075947447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021771984,0.0010001007,0.0024743725,0.0021091748,0.0011071555,0.0060395193,0.003195565,0.0018561746,0.013087256],"category_scores_gemma":[0.021660153,0.00088346,0.0013226942,0.0015889109,0.0022878337,0.005938338,0.0034734642,0.003447252,0.0013524571],"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.0012241525,0.0003790561,0.008612662,0.0014002832,0.00020198192,0.000260827,0.00054080854,0.45508632,0.0062606777,0.3739114,0.019811088,0.13231076],"study_design_scores_gemma":[0.000058308444,0.00004305874,0.0004731805,0.00004123917,0.000018955796,0.000064847765,0.00013482169,0.8141153,0.001430008,0.18222824,0.0013744464,0.000017576176],"about_ca_topic_score_codex":0.0020787348,"about_ca_topic_score_gemma":0.0032123623,"teacher_disagreement_score":0.013087256,"about_ca_system_score_codex":0.001486253,"about_ca_system_score_gemma":0.002047028,"threshold_uncertainty_score":0.04378116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04783006,0.0010596246,0.9171583,0.0011735415,0.00014686688,0.000117057774,0.0004554228,0.0005612732,0.03149788],"genre_scores_gemma":[0.73510337,0.0021084915,0.24814151,0.0010810312,0.0004068532,0.0006553506,0.00097579375,0.000979718,0.010547828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746466,0.0007784521,0.00009155465,0.00034504768,0.00093577063,0.00038453317],"domain_scores_gemma":[0.9735286,0.020675704,0.0011384051,0.0020641868,0.0016719163,0.00092126336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033464693,0.002035739,0.0015291652,0.0026555085,0.0013782824,0.00338651,0.00276542,0.001964167,0.009229087],"category_scores_gemma":[0.028106013,0.0009264678,0.0010473222,0.0026699696,0.0033233438,0.005137086,0.004343547,0.003410725,0.0015710635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039361388,0.0001330081,0.0005530748,0.00047954003,0.000059075715,0.000100068944,0.00038568003,0.26412642,0.009115175,0.6817645,0.0070018065,0.035888065],"study_design_scores_gemma":[0.000028840124,0.000056517194,0.00027380892,0.000090832305,0.000026655238,0.00007126573,0.0000886212,0.51603395,0.0027817013,0.47846034,0.0020663512,0.000021130094],"about_ca_topic_score_codex":0.0015982031,"about_ca_topic_score_gemma":0.0025021287,"teacher_disagreement_score":0.009229087,"about_ca_system_score_codex":0.0025190196,"about_ca_system_score_gemma":0.0013605995,"threshold_uncertainty_score":0.030874372},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010575356,0.0002061698,0.9299612,0.0013535764,0.0003586239,0.0006248404,0.0044736494,0.014385069,0.0380615],"genre_scores_gemma":[0.06460612,0.0003420792,0.8764686,0.00041621886,0.00013316888,0.0006614568,0.0091349045,0.0040397486,0.04419779],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990435,0.0001459968,0.000062500294,0.00031729977,0.00025450374,0.00017611281],"domain_scores_gemma":[0.99720985,0.0011620793,0.00012221924,0.00074638316,0.00056019565,0.00019929637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009504918,0.0019588086,0.0009928232,0.0016098522,0.002075888,0.0031647077,0.0029484592,0.0017887879,0.055515748],"category_scores_gemma":[0.004247962,0.0010467436,0.0020651675,0.0027372246,0.00086841785,0.003161433,0.0022085148,0.0027401352,0.021122884],"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.00049192907,0.0007039489,0.0012440791,0.00066410546,0.00012397417,0.00028187575,0.00050197,0.03950705,0.015165807,0.15599175,0.28295574,0.50236785],"study_design_scores_gemma":[0.00055318937,0.000239282,0.0012848796,0.00020956228,0.00014629023,0.0007309435,0.0004447257,0.35895264,0.022407725,0.43603685,0.17883535,0.00015853613],"about_ca_topic_score_codex":0.009212878,"about_ca_topic_score_gemma":0.014648381,"teacher_disagreement_score":0.055515748,"about_ca_system_score_codex":0.0029311085,"about_ca_system_score_gemma":0.0034317789,"threshold_uncertainty_score":0.18571872},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6651061,0.0014359975,0.08265548,0.010503807,0.0017350732,0.00015539426,0.0003499637,0.0009055457,0.23715271],"genre_scores_gemma":[0.96667236,0.00047532155,0.007535612,0.0008982016,0.0005709894,0.000070172,0.00013742379,0.00022843987,0.023411503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994479,0.0001540113,0.000018160792,0.000069836,0.00014949041,0.00016068661],"domain_scores_gemma":[0.99825925,0.00064505544,0.00015638774,0.00039030195,0.00021060051,0.00033837726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007505678,0.0004984715,0.0013609346,0.0025735963,0.003126545,0.0030511154,0.0014390313,0.0021036842,0.01259684],"category_scores_gemma":[0.0048289425,0.00042799197,0.0009689628,0.0011816117,0.0044483566,0.0048288098,0.0025106382,0.0026945933,0.0007743318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002113943,0.000010065212,0.000030278323,0.000015958933,0.000003068229,0.000022932085,0.0000690977,0.00061206694,0.0002990533,0.9971245,0.0006982768,0.0010935467],"study_design_scores_gemma":[0.000011048466,0.0000054801903,0.000057414843,0.0000064743476,0.00000215512,0.000026655347,0.000049508097,0.003824544,0.00015801397,0.9950111,0.00084277894,0.0000048522033],"about_ca_topic_score_codex":0.0021013762,"about_ca_topic_score_gemma":0.0014412071,"teacher_disagreement_score":0.01259684,"about_ca_system_score_codex":0.0020755562,"about_ca_system_score_gemma":0.00095765834,"threshold_uncertainty_score":0.042140663},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7241265,0.00037923743,0.1832369,0.00056879764,0.00017161766,0.00012155909,0.0024062241,0.0012477464,0.08774147],"genre_scores_gemma":[0.92820907,0.00019867501,0.033897076,0.00017117648,0.00007329723,0.00012407867,0.002043061,0.00030000778,0.034983583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953747,0.000056885365,0.00002174325,0.000093915834,0.00011342303,0.00017657685],"domain_scores_gemma":[0.99800235,0.00066621124,0.00018299681,0.0002648338,0.0003306021,0.00055299484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003182255,0.00049724145,0.00070432003,0.0017688745,0.0020630173,0.0026356908,0.0011793026,0.0012902397,0.012178789],"category_scores_gemma":[0.002228411,0.0005024581,0.00064598874,0.0011536254,0.001468233,0.0025273534,0.0017730894,0.0013772157,0.0017973876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005977839,0.00016844166,0.0037132504,0.000280409,0.00004283218,0.00073107396,0.0012911897,0.011986703,0.008612476,0.93169904,0.005285322,0.035591535],"study_design_scores_gemma":[0.000045532666,0.000053988733,0.0021126966,0.000080387916,0.000040109084,0.00029300962,0.0007490063,0.022969028,0.004958206,0.956566,0.012099883,0.00003215475],"about_ca_topic_score_codex":0.0036089763,"about_ca_topic_score_gemma":0.004798602,"teacher_disagreement_score":0.012178789,"about_ca_system_score_codex":0.00090699556,"about_ca_system_score_gemma":0.0006123681,"threshold_uncertainty_score":0.0407421},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4315379,0.0029344528,0.34573707,0.033329427,0.0023862575,0.00031953357,0.002604126,0.0010230312,0.18012825],"genre_scores_gemma":[0.86316985,0.001733282,0.049755927,0.0040764855,0.001303716,0.0004054082,0.0017802826,0.0008096979,0.076965444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980375,0.00044073872,0.00010970331,0.00074878574,0.00038607867,0.00027725718],"domain_scores_gemma":[0.9852813,0.009843955,0.0011313219,0.0017230401,0.0007885068,0.001231972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013516672,0.0013129152,0.0023479604,0.0017491857,0.0031597516,0.006046903,0.0026606205,0.0048865112,0.018234424],"category_scores_gemma":[0.014985722,0.0014622436,0.0019836691,0.0022002638,0.0058629643,0.014020729,0.004483238,0.008857207,0.0019122335],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002000255,0.00012136811,0.00069503393,0.0003734802,0.00009470818,0.0002686385,0.00037695045,0.013659183,0.001302227,0.95190114,0.016459895,0.0145472875],"study_design_scores_gemma":[0.000015083714,0.000009601315,0.00011364885,0.000017500548,0.000009340589,0.000081541155,0.00009928324,0.010569775,0.0001731121,0.98730904,0.0015934994,0.000008476153],"about_ca_topic_score_codex":0.0010690205,"about_ca_topic_score_gemma":0.001134612,"teacher_disagreement_score":0.018234424,"about_ca_system_score_codex":0.0012056936,"about_ca_system_score_gemma":0.0008439927,"threshold_uncertainty_score":0.061000228},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15235017,0.0022431633,0.6915571,0.025451116,0.00055405207,0.00090460974,0.0039822194,0.0025876344,0.12036999],"genre_scores_gemma":[0.6714418,0.002259411,0.24410228,0.0021854357,0.0013477864,0.0012140186,0.0042651356,0.0012595374,0.071924575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749136,0.00057275227,0.00010972383,0.00076829037,0.00058839656,0.00046946245],"domain_scores_gemma":[0.98551697,0.012111098,0.0006576691,0.00077117217,0.0005154673,0.00042763297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016957775,0.0016081011,0.0014319031,0.0011796987,0.0017611679,0.0056230295,0.0027432302,0.0023163059,0.01975081],"category_scores_gemma":[0.015892664,0.0011078491,0.0019457485,0.0026838048,0.0023266189,0.010816979,0.0031704651,0.008074791,0.0023885735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007990942,0.0007015872,0.0015527459,0.0014045165,0.00012316556,0.0001846992,0.0007541284,0.06346587,0.0040893825,0.80151874,0.03663112,0.08877495],"study_design_scores_gemma":[0.00017469765,0.000068754,0.00043011433,0.000058943733,0.00005687115,0.00012512626,0.00015630851,0.11898835,0.0022675162,0.86783683,0.009813585,0.00002287386],"about_ca_topic_score_codex":0.0038313894,"about_ca_topic_score_gemma":0.006284131,"teacher_disagreement_score":0.01975081,"about_ca_system_score_codex":0.0041140164,"about_ca_system_score_gemma":0.0027137063,"threshold_uncertainty_score":0.066073},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84585434,0.00023572505,0.046849117,0.00079846656,0.00029733233,0.00009564019,0.0003140845,0.0002224732,0.10533283],"genre_scores_gemma":[0.95976543,0.0001501422,0.008413449,0.000117837284,0.000102311555,0.000042294258,0.00027677047,0.000059181206,0.03107262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985325,0.000028055092,0.0000058392507,0.000030492662,0.00003797063,0.00004435907],"domain_scores_gemma":[0.99981445,0.000042029427,0.000034005938,0.000024046536,0.000018580622,0.00006699651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010429564,0.00032756463,0.00061044976,0.00079077535,0.0012971287,0.0014818163,0.00062373566,0.0007054204,0.01026167],"category_scores_gemma":[0.0005054154,0.00018247498,0.00047622097,0.00039586396,0.0014362213,0.00080962555,0.0012070857,0.000757686,0.000997444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034753405,0.000035214514,0.000643577,0.00006363664,0.000027519538,0.00093660934,0.0006662124,0.0055196043,0.015536529,0.95458984,0.0028406866,0.018793134],"study_design_scores_gemma":[0.00014091753,0.00022918549,0.0015926994,0.00002857292,0.000027674629,0.00083586684,0.0007752898,0.02343332,0.0065017873,0.93875104,0.027631862,0.000051807954],"about_ca_topic_score_codex":0.0015460455,"about_ca_topic_score_gemma":0.00090205116,"teacher_disagreement_score":0.01026167,"about_ca_system_score_codex":0.00048822927,"about_ca_system_score_gemma":0.00037610848,"threshold_uncertainty_score":0.03432876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7784556,0.0025464725,0.07290309,0.017325383,0.0007242118,0.000041561318,0.00038250015,0.00034427329,0.12727688],"genre_scores_gemma":[0.98368937,0.0007437724,0.0047893883,0.0005808465,0.0006191156,0.000035022505,0.00017562466,0.00004471069,0.009322122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880755,0.0004117926,0.00005583162,0.00022633166,0.0002921905,0.0002062948],"domain_scores_gemma":[0.9950854,0.0027376513,0.0004682848,0.0006251817,0.00051897886,0.00056438276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082827,0.0005918158,0.0013292714,0.0022606752,0.0022627306,0.0032559605,0.0011241693,0.0021803842,0.005394539],"category_scores_gemma":[0.008407228,0.00045367694,0.0007929051,0.0016731874,0.0072634825,0.011146731,0.0037749796,0.002972441,0.0005617713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035395606,0.000010587031,0.00022470094,0.000018244576,0.0000036694626,0.000028023976,0.00014048263,0.0007097447,0.00017200147,0.99646,0.00075444113,0.0014427159],"study_design_scores_gemma":[0.00000982977,0.0000035507073,0.00008112422,0.000005977496,0.0000019083684,0.000016682041,0.00005063854,0.0015722045,0.00008073186,0.99741995,0.0007534511,0.0000039344263],"about_ca_topic_score_codex":0.0017160353,"about_ca_topic_score_gemma":0.0010254581,"teacher_disagreement_score":0.005394539,"about_ca_system_score_codex":0.0015595922,"about_ca_system_score_gemma":0.00083502743,"threshold_uncertainty_score":0.018046558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027860213,0.004692354,0.80976546,0.004736586,0.0008896658,0.00019197867,0.0023699005,0.0017887692,0.14770511],"genre_scores_gemma":[0.6313563,0.0069929464,0.2776285,0.0058173737,0.004176675,0.0018493722,0.0062220255,0.003581088,0.062375735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99476504,0.0011485144,0.00019973174,0.001480059,0.0016784784,0.00072822947],"domain_scores_gemma":[0.9626253,0.028765002,0.0014802782,0.002745947,0.0029100035,0.0014732884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060794293,0.0029424909,0.0019208275,0.006044883,0.0025196297,0.007900461,0.005425394,0.0034698958,0.030350748],"category_scores_gemma":[0.039380115,0.0010846484,0.0023181315,0.004889573,0.003479391,0.011670878,0.0052150544,0.008865575,0.0062198625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020369576,0.00011892828,0.00083521946,0.0004077289,0.0000664783,0.00007213998,0.00019951489,0.010428611,0.0013949688,0.9093313,0.02907201,0.047869436],"study_design_scores_gemma":[0.000030577867,0.00008637432,0.0006937755,0.00023419176,0.00005908648,0.0002484374,0.000115968054,0.06714678,0.0016144583,0.9133656,0.016362417,0.000042371943],"about_ca_topic_score_codex":0.001650457,"about_ca_topic_score_gemma":0.0017724734,"teacher_disagreement_score":0.030350748,"about_ca_system_score_codex":0.0041661095,"about_ca_system_score_gemma":0.0023365794,"threshold_uncertainty_score":0.10153335},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25941178,0.0015460186,0.48277974,0.01905266,0.00076508074,0.00045488682,0.013542722,0.0021305636,0.22031648],"genre_scores_gemma":[0.8317277,0.0012684471,0.09179776,0.0015054343,0.0009271476,0.00048218018,0.01000392,0.0011384973,0.06114897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99447787,0.0012727627,0.0004618208,0.0014465364,0.0017639193,0.0005769711],"domain_scores_gemma":[0.97202,0.019293733,0.0017278077,0.0033833107,0.002380712,0.0011944292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018365724,0.00071432546,0.0014522695,0.002649461,0.0035226033,0.011560444,0.0025204674,0.0024422458,0.044242986],"category_scores_gemma":[0.020275103,0.00084447494,0.0025690629,0.0039538615,0.0029377746,0.015770225,0.00498589,0.0038023242,0.0057710134],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001917607,0.000080039514,0.0020072318,0.0003281665,0.000067488145,0.00026117632,0.000538231,0.009180209,0.0010624897,0.9369928,0.027114423,0.022175914],"study_design_scores_gemma":[0.000025558265,0.000013340796,0.0004353493,0.000023929098,0.000021424228,0.00022102652,0.00011175865,0.016976174,0.00086249487,0.9734072,0.007878449,0.000023276325],"about_ca_topic_score_codex":0.003737529,"about_ca_topic_score_gemma":0.0031470545,"teacher_disagreement_score":0.044242986,"about_ca_system_score_codex":0.0041541266,"about_ca_system_score_gemma":0.002150679,"threshold_uncertainty_score":0.14800751},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002140127,0.0005082081,0.05794683,0.005607678,0.0032967834,0.00035372542,0.137315,0.04608259,0.74674916],"genre_scores_gemma":[0.019302042,0.0017023209,0.03956797,0.0025167044,0.0013835579,0.00046974127,0.14254598,0.047791783,0.74471986],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925524,0.00010322183,0.00005135578,0.000115507864,0.00039827966,0.00007631699],"domain_scores_gemma":[0.9980805,0.0007028891,0.00009993842,0.00033658752,0.0006117319,0.00016844412],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00066211063,0.0012215902,0.0011651303,0.0032533957,0.0010090057,0.004072831,0.002194993,0.0011741152,0.7181351],"category_scores_gemma":[0.004524442,0.0007340057,0.001071372,0.0053191665,0.00062356243,0.0036767004,0.0022497291,0.0019806628,0.5286246],"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.00004787977,0.000027732762,0.00009469848,0.00013592553,0.000004858687,0.000035965608,0.000056255303,0.00024812412,0.00074608624,0.013820741,0.95607674,0.028704895],"study_design_scores_gemma":[0.00004587431,0.000019540455,0.0010662653,0.00009499243,0.000006238522,0.00010813686,0.00007166002,0.0017759281,0.0020152642,0.024698956,0.97006524,0.00003193162],"about_ca_topic_score_codex":0.009266398,"about_ca_topic_score_gemma":0.012351878,"teacher_disagreement_score":0.7181351,"about_ca_system_score_codex":0.002297692,"about_ca_system_score_gemma":0.0010110394,"threshold_uncertainty_score":0.40204602},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26065868,0.0067233476,0.55463314,0.006336637,0.000724892,0.00014506094,0.00040277155,0.00025870223,0.17011674],"genre_scores_gemma":[0.93554354,0.001605274,0.021273836,0.00036256725,0.0003095789,0.00010231089,0.00011969136,0.00010122188,0.040581986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862754,0.0005172588,0.000051494033,0.00029210522,0.000259806,0.00025177852],"domain_scores_gemma":[0.9945545,0.0033318957,0.00073396636,0.0004789854,0.00037038827,0.00053022034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014160344,0.0009723161,0.002186883,0.0012747851,0.0013381464,0.0029488842,0.00197781,0.0027040914,0.013777886],"category_scores_gemma":[0.011050191,0.0008308126,0.00092091446,0.0012006344,0.004295038,0.005704925,0.003089846,0.0025296165,0.00078890694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009040569,0.000046926638,0.00028920607,0.00015964045,0.00004492888,0.00017200987,0.00017966307,0.029316317,0.00046102525,0.9581119,0.0034442337,0.0076837107],"study_design_scores_gemma":[0.000030952666,0.000060280858,0.00050986523,0.000051364248,0.000020413094,0.00016207091,0.00014846218,0.08565563,0.00020951625,0.9087265,0.0043996284,0.000025434469],"about_ca_topic_score_codex":0.002781163,"about_ca_topic_score_gemma":0.0015652821,"teacher_disagreement_score":0.013777886,"about_ca_system_score_codex":0.0011154131,"about_ca_system_score_gemma":0.0009985579,"threshold_uncertainty_score":0.046091616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13656756,0.005562385,0.79857224,0.008945878,0.0002891325,0.00020757085,0.0008929389,0.0010266867,0.04793564],"genre_scores_gemma":[0.8582605,0.0036607813,0.12838452,0.00085671357,0.0010139446,0.00037906738,0.00089903106,0.0003744904,0.0061710323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98441136,0.0043862066,0.0011423994,0.0026825848,0.0058544083,0.0015230225],"domain_scores_gemma":[0.8887868,0.093912974,0.0037364273,0.00757627,0.0039251084,0.0020624665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00700694,0.00078299624,0.0022160627,0.0028079038,0.0016377837,0.008595724,0.0034641458,0.002611373,0.009760234],"category_scores_gemma":[0.07611279,0.0010157155,0.0025576537,0.0045204065,0.0054055126,0.017387083,0.003779783,0.005777082,0.0008508818],"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.00013770242,0.00008879906,0.0021971997,0.00038350053,0.00010056649,0.00022439344,0.00032548138,0.024083985,0.0010072099,0.94461966,0.0047081895,0.022123322],"study_design_scores_gemma":[0.000015619207,0.000015853786,0.00035180256,0.000023428433,0.000022249536,0.00024305964,0.000052399355,0.049711492,0.0004576091,0.9471376,0.0019527817,0.000016121561],"about_ca_topic_score_codex":0.0010810673,"about_ca_topic_score_gemma":0.0008265411,"teacher_disagreement_score":0.009760234,"about_ca_system_score_codex":0.0033403025,"about_ca_system_score_gemma":0.0015367072,"threshold_uncertainty_score":0.037056684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72457725,0.0040891045,0.19284861,0.013596282,0.0005718497,0.00007069841,0.0021818895,0.00042561765,0.06163878],"genre_scores_gemma":[0.97553295,0.001243433,0.015692323,0.0004900422,0.0005603138,0.000101014106,0.00047861,0.00011411966,0.005787198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998664,0.00038666715,0.00006902563,0.00037364257,0.00028687486,0.00021967871],"domain_scores_gemma":[0.98783094,0.008242835,0.000955009,0.0010078145,0.00058737164,0.0013760375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014659432,0.00058725214,0.0013376112,0.0033572593,0.0016006426,0.0064726025,0.0018911456,0.0021581035,0.0051966603],"category_scores_gemma":[0.01022322,0.0007832081,0.0006817566,0.0027556103,0.005331988,0.0106081925,0.0030544621,0.0037599942,0.00043350874],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007952979,0.000024294617,0.0011826922,0.00008110223,0.000017468743,0.000033710694,0.00021134409,0.0032375387,0.0013890482,0.9865546,0.0025098608,0.0046787206],"study_design_scores_gemma":[0.000014502868,0.000010208986,0.00066164427,0.000024418441,0.000013439619,0.00008784618,0.00010157763,0.02322762,0.00059537985,0.9734061,0.0018417073,0.000015614185],"about_ca_topic_score_codex":0.0010080967,"about_ca_topic_score_gemma":0.0006349721,"teacher_disagreement_score":0.0064726025,"about_ca_system_score_codex":0.0024515525,"about_ca_system_score_gemma":0.0008162456,"threshold_uncertainty_score":0.017787337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2770498,0.0056634964,0.6409112,0.012583232,0.0006523025,0.00012921498,0.0008911659,0.00031277825,0.061806787],"genre_scores_gemma":[0.92546374,0.0039106365,0.027741298,0.0007353638,0.0007510742,0.0002085101,0.000453248,0.00029141604,0.040444665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889624,0.0005568022,0.000044792887,0.00013423809,0.00016809022,0.00019975472],"domain_scores_gemma":[0.9853904,0.011207227,0.0013459064,0.00043716546,0.0007308287,0.0008883918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031055193,0.0010997693,0.001797036,0.0017751905,0.001336154,0.0029776546,0.003477297,0.0038053598,0.010123514],"category_scores_gemma":[0.021830563,0.0008500321,0.001349667,0.0018387379,0.0032435253,0.006094898,0.0021103013,0.0030352888,0.0009043222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010647923,0.000030420699,0.00046707835,0.000111622045,0.00003918385,0.000114686794,0.00027154197,0.08435768,0.0006979916,0.9092708,0.0022567476,0.0022757666],"study_design_scores_gemma":[0.000054719756,0.000031069594,0.00027582792,0.000032497308,0.000043722608,0.000071185576,0.00012685517,0.514569,0.00016608839,0.48304787,0.001545991,0.000035141857],"about_ca_topic_score_codex":0.010730788,"about_ca_topic_score_gemma":0.00537201,"teacher_disagreement_score":0.010730788,"about_ca_system_score_codex":0.0031052257,"about_ca_system_score_gemma":0.0018448225,"threshold_uncertainty_score":0.033866525},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90715986,0.00027194124,0.08376743,0.0002093486,0.00001671965,0.0000746323,0.0002041709,0.00013910054,0.00815669],"genre_scores_gemma":[0.9780462,0.00019990971,0.019205026,0.00005546313,0.000015563024,0.000051153635,0.0003581483,0.000030298655,0.0020384316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99968326,0.00010105838,0.000019158782,0.000074595984,0.000060172082,0.00006168208],"domain_scores_gemma":[0.9987394,0.0006967225,0.00025319375,0.00010590278,0.000107400134,0.00009736497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002069086,0.00021640163,0.00031555814,0.0005465413,0.0005564385,0.00084059895,0.00032430227,0.00043385438,0.002064579],"category_scores_gemma":[0.0022938945,0.0003135172,0.00032280068,0.0006728163,0.0007693354,0.0009757027,0.00053811155,0.000280277,0.00017489669],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036230544,0.00009025823,0.009832765,0.00033692413,0.000091776164,0.0018621541,0.0020062244,0.141097,0.03907956,0.71518457,0.0036095565,0.08644688],"study_design_scores_gemma":[0.000063467916,0.000113171205,0.0036005476,0.000042907286,0.000044387598,0.000857596,0.00059669494,0.22569919,0.00928025,0.75202024,0.007651346,0.000030349547],"about_ca_topic_score_codex":0.0021431064,"about_ca_topic_score_gemma":0.001870392,"teacher_disagreement_score":0.0021431064,"about_ca_system_score_codex":0.0005384024,"about_ca_system_score_gemma":0.0003694364,"threshold_uncertainty_score":0.006906748},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06794317,0.00024651556,0.8817289,0.00029921706,0.0000658362,0.00009532188,0.00050937216,0.00066447514,0.048447195],"genre_scores_gemma":[0.32789063,0.00038857354,0.645722,0.0001188344,0.000049895185,0.00019983253,0.0028799868,0.0005057607,0.02224451],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923253,0.00018258502,0.000047878624,0.00015086129,0.0002958663,0.000090232315],"domain_scores_gemma":[0.9987111,0.00061077514,0.00007860756,0.00031413173,0.00021552661,0.000069960035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041200768,0.0005471647,0.00072322466,0.0012910229,0.0008959229,0.002579168,0.0017178628,0.0007622641,0.010263466],"category_scores_gemma":[0.0041010897,0.0006173077,0.00078744674,0.0017121214,0.0009014394,0.0022777943,0.0030868894,0.0015734942,0.0022019865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019928823,0.00011757323,0.0021419744,0.00034272324,0.000031895695,0.0002682549,0.00052042236,0.08098035,0.0070396527,0.6555918,0.010119341,0.24264686],"study_design_scores_gemma":[0.00003728292,0.000056284094,0.0006272352,0.00008973902,0.000035003493,0.00035184677,0.00032121732,0.43497902,0.0058011436,0.5276462,0.030036397,0.000018596174],"about_ca_topic_score_codex":0.00094000436,"about_ca_topic_score_gemma":0.0021564993,"teacher_disagreement_score":0.010263466,"about_ca_system_score_codex":0.00044750585,"about_ca_system_score_gemma":0.0005312291,"threshold_uncertainty_score":0.03433472},"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":"other","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049414877,0.104887284,0.03012042,0.14077125,0.2373978,0.0007302757,0.022505192,0.0018483051,0.456798],"genre_scores_gemma":[0.010421656,0.0274137,0.0064824084,0.003159266,0.01368627,0.0001229131,0.0061915745,0.000743829,0.9317784],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925464,0.00004650405,0.000028705506,0.00013564661,0.00039186658,0.00014256877],"domain_scores_gemma":[0.9976439,0.00016128592,0.00003833201,0.00011489008,0.0015310879,0.00051053375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011592348,0.0016639782,0.0013928933,0.0024082186,0.003705552,0.005036527,0.0019102014,0.0017391938,0.20826882],"category_scores_gemma":[0.0022041458,0.0006400278,0.00096136174,0.004258894,0.0011677798,0.0030085808,0.0013682806,0.003004817,0.046590567],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023204935,0.0000075517387,0.00007551491,0.000099692894,0.000003653322,0.000015987885,0.000031793825,0.00019110073,0.00017365669,0.0036740503,0.9794255,0.016278384],"study_design_scores_gemma":[0.000012388845,0.00001258789,0.0007479111,0.00018335762,0.000014322205,0.000033289296,0.00016957647,0.00041572258,0.0002685246,0.004449179,0.99367493,0.000018212473],"about_ca_topic_score_codex":0.57267696,"about_ca_topic_score_gemma":0.8432338,"teacher_disagreement_score":0.57267696,"about_ca_system_score_codex":0.023111064,"about_ca_system_score_gemma":0.019755892,"threshold_uncertainty_score":0.8596793},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21085055,0.0026518665,0.7216163,0.0048985644,0.00036347378,0.00021869993,0.0013216402,0.0023022222,0.055776633],"genre_scores_gemma":[0.77998525,0.0022224435,0.20075433,0.0017409779,0.0005145026,0.00030579147,0.0009913963,0.0009788297,0.012506461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981199,0.00038599828,0.00010304174,0.00052977947,0.0005270404,0.00033428374],"domain_scores_gemma":[0.985871,0.008118149,0.0013975563,0.0032019974,0.00071129337,0.0006999737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013118796,0.0012561267,0.0009208802,0.0021943913,0.0014255362,0.0022770262,0.0026625493,0.0013484907,0.008243938],"category_scores_gemma":[0.013186549,0.0010130005,0.0028596774,0.002525511,0.0036679667,0.0085128,0.0061785067,0.0054989043,0.001357881],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030876396,0.000114319126,0.0029402256,0.00043269675,0.00007451015,0.0005571823,0.0010534269,0.06833246,0.00947041,0.83021796,0.008273665,0.07822438],"study_design_scores_gemma":[0.000048250145,0.00014185415,0.001029787,0.000103123566,0.000071026676,0.00066997285,0.00027397738,0.07178474,0.004658066,0.8938964,0.02723105,0.00009183641],"about_ca_topic_score_codex":0.002111443,"about_ca_topic_score_gemma":0.0016872399,"teacher_disagreement_score":0.008243938,"about_ca_system_score_codex":0.0017029746,"about_ca_system_score_gemma":0.00075866893,"threshold_uncertainty_score":0.027578771},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10825709,0.0014411821,0.8566075,0.0029141775,0.00018440411,0.00013272656,0.0009524088,0.0001425288,0.02936795],"genre_scores_gemma":[0.74589366,0.0017716398,0.22612873,0.0004612473,0.00052207534,0.00022287556,0.0009210661,0.00020217677,0.023876622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989538,0.00055294845,0.000032216973,0.0001647879,0.00017451312,0.00012169287],"domain_scores_gemma":[0.99771833,0.001572911,0.0001939232,0.00017725662,0.00016519296,0.0001724213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018978185,0.0008754765,0.0014198453,0.00085279456,0.0005410882,0.0019934704,0.001384165,0.0018719283,0.0036000467],"category_scores_gemma":[0.005970638,0.0005277301,0.00079511554,0.0017785515,0.0011531942,0.0030869818,0.001524392,0.0026311786,0.00047572618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019378979,0.0002169604,0.0007656777,0.0003827435,0.00007673454,0.00020564938,0.00009194035,0.29267222,0.003693374,0.6519362,0.008512261,0.04125244],"study_design_scores_gemma":[0.000035334215,0.00008535453,0.00028748286,0.000036688685,0.000028284494,0.00013621182,0.000046446126,0.7364621,0.0013343567,0.25800318,0.0035242478,0.000020172649],"about_ca_topic_score_codex":0.0014039074,"about_ca_topic_score_gemma":0.0020547193,"teacher_disagreement_score":0.0036000467,"about_ca_system_score_codex":0.0016081356,"about_ca_system_score_gemma":0.0009891584,"threshold_uncertainty_score":0.0120434165},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091969,0.0379089,0.0025668675,0.053076,0.693748,0.00016527051,0.006012485,0.0004767482,0.20512608],"genre_scores_gemma":[0.012966128,0.012523778,0.0010341951,0.00517507,0.1344714,0.00012095301,0.0029028582,0.0006476421,0.830158],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988167,0.00019357227,0.000078741636,0.00026172624,0.00054942514,0.00009986488],"domain_scores_gemma":[0.99529415,0.0005833712,0.00023826137,0.00032325546,0.0025943597,0.00096661464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016602885,0.0014764203,0.0010332691,0.0031642353,0.0022854568,0.005222533,0.0012165995,0.0019323013,0.24549292],"category_scores_gemma":[0.010689188,0.00036554193,0.000652819,0.0020207998,0.00084606773,0.0021734494,0.0022342082,0.0027254103,0.13161574],"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.0000348434,0.000008859897,0.00004605816,0.00007747756,0.000002808888,0.000025027039,0.000017016853,0.000112692534,0.000044251603,0.002546005,0.9851414,0.01194365],"study_design_scores_gemma":[0.000011402902,0.000016609156,0.0003706329,0.00022334541,0.000003681444,0.000035828794,0.000029162768,0.0001397296,0.00010605825,0.0025890588,0.9964669,0.0000075851112],"about_ca_topic_score_codex":0.005776296,"about_ca_topic_score_gemma":0.010701444,"teacher_disagreement_score":0.24549292,"about_ca_system_score_codex":0.005209865,"about_ca_system_score_gemma":0.002319378,"threshold_uncertainty_score":0.8212556},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042605028,0.009964438,0.39664587,0.049601514,0.030395161,0.00014603352,0.0006724676,0.000816876,0.46915266],"genre_scores_gemma":[0.61325127,0.013786238,0.21112275,0.023218723,0.021202676,0.0007518846,0.00079236156,0.0012406262,0.11463355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986135,0.00046656016,0.00004785266,0.00036742975,0.00038366282,0.000120975885],"domain_scores_gemma":[0.9931791,0.005223256,0.00018272392,0.0004900828,0.0004979932,0.00042693102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014648241,0.0010756089,0.0012117791,0.0019742495,0.0030360695,0.0030261327,0.00287355,0.0025453677,0.012196511],"category_scores_gemma":[0.010645347,0.0004923912,0.0010571174,0.0032575224,0.0061349887,0.0074824537,0.003093347,0.009145241,0.0020608676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034591143,0.000013764209,0.00008869607,0.00006219996,0.0000058737255,0.000043983553,0.00007524444,0.0014160987,0.00032906633,0.97706956,0.012880655,0.00798023],"study_design_scores_gemma":[0.000009952301,0.000010839002,0.00007751263,0.000022040636,0.000007763088,0.000039785864,0.00002255873,0.0030945898,0.00017488444,0.97590226,0.020626454,0.000011381037],"about_ca_topic_score_codex":0.0034809986,"about_ca_topic_score_gemma":0.0030479755,"teacher_disagreement_score":0.012196511,"about_ca_system_score_codex":0.002330639,"about_ca_system_score_gemma":0.0014805031,"threshold_uncertainty_score":0.040801406},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025822414,0.031968422,0.45749834,0.06393802,0.038639117,0.0001306133,0.0018391768,0.001502326,0.3786616],"genre_scores_gemma":[0.41980848,0.03476352,0.2783339,0.029983228,0.041557282,0.0004875102,0.0037000119,0.0027863125,0.18857978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811125,0.0005382621,0.00019103616,0.0006148545,0.00040647056,0.00013806061],"domain_scores_gemma":[0.97967553,0.01614617,0.00055159244,0.0016115381,0.0013981145,0.000617012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025225026,0.0012484085,0.0009702316,0.0019950096,0.0037911371,0.003746186,0.0019289146,0.0022673737,0.012185233],"category_scores_gemma":[0.014420712,0.00074570096,0.0017177353,0.0020170126,0.0044825464,0.01045519,0.003435184,0.008722139,0.0034520223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012975019,0.000030775784,0.0005211792,0.00049558555,0.000040691506,0.00097518513,0.00082327606,0.0008699754,0.0028339238,0.899081,0.06558185,0.028616818],"study_design_scores_gemma":[0.00001005671,0.00004908975,0.00059578504,0.00012899158,0.000038097307,0.0009856499,0.00014343276,0.0019500771,0.0017648429,0.8586959,0.13558558,0.000052496627],"about_ca_topic_score_codex":0.0011373374,"about_ca_topic_score_gemma":0.0013822491,"teacher_disagreement_score":0.012185233,"about_ca_system_score_codex":0.0015698053,"about_ca_system_score_gemma":0.00069469534,"threshold_uncertainty_score":0.040763736},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020116532,0.0001794307,0.9764574,0.00013870368,0.00005061968,0.00005076065,0.0000340932,0.0005531875,0.002419342],"genre_scores_gemma":[0.74004775,0.00013774923,0.25526386,0.00007429561,0.000057460547,0.00016531358,0.000106393716,0.00017887722,0.003968362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994161,0.00018476645,0.000025353775,0.00010961498,0.00013004929,0.0001340267],"domain_scores_gemma":[0.99734205,0.0017517238,0.00024051039,0.00025077714,0.00025905075,0.00015590989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223838,0.0009292556,0.0014256998,0.0005749305,0.0005578189,0.0009916859,0.0015890683,0.0013743241,0.004246311],"category_scores_gemma":[0.004789268,0.0004856525,0.00047515336,0.00044665247,0.0009950977,0.0013728328,0.0017756401,0.0013970189,0.0005086884],"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.00045410887,0.00017257905,0.0003151706,0.00011410032,0.000024437775,0.0000497686,0.00011314838,0.8794527,0.0029614135,0.0116021065,0.0022734469,0.102466986],"study_design_scores_gemma":[0.00002560058,0.00003218301,0.000049326558,0.000004144257,0.0000034231448,0.00001257149,0.000012073141,0.99616843,0.0005236288,0.002987338,0.00017709334,0.000004198743],"about_ca_topic_score_codex":0.0046412623,"about_ca_topic_score_gemma":0.0040772934,"teacher_disagreement_score":0.0046412623,"about_ca_system_score_codex":0.00093750574,"about_ca_system_score_gemma":0.0020254084,"threshold_uncertainty_score":0.014205396},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7878892,0.0007978697,0.12420733,0.001648322,0.00010767893,0.00025368738,0.0013762818,0.000565013,0.08315471],"genre_scores_gemma":[0.9594361,0.00052916206,0.017709684,0.00052058423,0.00012141867,0.00021868285,0.0009460009,0.00017354461,0.020344697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989526,0.0002685857,0.00004772082,0.00019752528,0.00024537518,0.0002880268],"domain_scores_gemma":[0.9917229,0.0050610523,0.0007741246,0.00075981405,0.0007481302,0.0009339667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008430756,0.00065871625,0.0013160293,0.0017060726,0.0020969373,0.0028564013,0.0019092053,0.0011568998,0.00851381],"category_scores_gemma":[0.006073923,0.0007539744,0.0006675941,0.0019266686,0.001374173,0.0029081812,0.002207647,0.0018916442,0.00092560047],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009845935,0.00021707297,0.0037956801,0.00052932586,0.000110681765,0.0010796987,0.0016300421,0.02953157,0.013871508,0.9044877,0.012434304,0.031327743],"study_design_scores_gemma":[0.00017169828,0.00006892165,0.0015876885,0.0000854285,0.00008491409,0.0007936281,0.00070570654,0.120110795,0.005370845,0.8648128,0.00617029,0.000037245816],"about_ca_topic_score_codex":0.0027202156,"about_ca_topic_score_gemma":0.0040215594,"teacher_disagreement_score":0.00851381,"about_ca_system_score_codex":0.0014362555,"about_ca_system_score_gemma":0.001098492,"threshold_uncertainty_score":0.028481543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5815115,0.0018485585,0.20988826,0.0030943227,0.00073441997,0.00008410475,0.00091923214,0.0003574791,0.20156209],"genre_scores_gemma":[0.95746416,0.0017604001,0.016113028,0.00031598046,0.0002244675,0.00005557889,0.00040425846,0.00013644225,0.023525676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998173,0.000035078876,0.000008605349,0.000043686774,0.00004573412,0.00004964297],"domain_scores_gemma":[0.99912494,0.00033544246,0.0001739992,0.00006691271,0.00013648174,0.00016221618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026683227,0.0005209034,0.0003526544,0.0014461103,0.00094801374,0.0020405469,0.000559179,0.00063291425,0.009059227],"category_scores_gemma":[0.0020053936,0.00033839743,0.00025039937,0.0011952023,0.0018291526,0.0031686467,0.001281197,0.0015848095,0.0009473148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020791558,0.000010164548,0.00034456968,0.000018118744,0.000002296451,0.00005103173,0.000119904624,0.0013388369,0.0005458181,0.98970264,0.00086067937,0.0069850096],"study_design_scores_gemma":[0.0000057141374,0.0000046170508,0.00025436695,0.000010705224,0.0000032775656,0.00006487486,0.00010570435,0.0030016762,0.0003549945,0.9932355,0.0029532588,0.0000052192854],"about_ca_topic_score_codex":0.0012277494,"about_ca_topic_score_gemma":0.0015221614,"teacher_disagreement_score":0.009059227,"about_ca_system_score_codex":0.00061955187,"about_ca_system_score_gemma":0.00045207058,"threshold_uncertainty_score":0.0303061},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19219951,0.004859093,0.54697603,0.010347559,0.0008725397,0.00026262508,0.0038178302,0.0012545211,0.23941025],"genre_scores_gemma":[0.8073248,0.004471168,0.12428659,0.0018144143,0.0017178037,0.0007619873,0.0056673605,0.00094723655,0.053008527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975406,0.00041065295,0.00008139249,0.00057977333,0.00090175675,0.00048589145],"domain_scores_gemma":[0.98479617,0.010934348,0.0006914808,0.0015279031,0.0008535453,0.0011965533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016101617,0.001950023,0.0019389783,0.0028490087,0.0016454259,0.005665141,0.0033409914,0.001992064,0.029412497],"category_scores_gemma":[0.012440429,0.0007986782,0.0019759077,0.003020536,0.0033817915,0.010340189,0.004872855,0.008315543,0.0047378438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049298105,0.0002964844,0.0024331976,0.0006153378,0.00011731704,0.0002694834,0.0004052099,0.09412631,0.004956358,0.7951101,0.040045533,0.061131656],"study_design_scores_gemma":[0.00005257093,0.00017847755,0.0019365124,0.00013594935,0.000060723407,0.00038903143,0.00015062635,0.1818386,0.0020993818,0.7962548,0.016831014,0.00007239162],"about_ca_topic_score_codex":0.0017592357,"about_ca_topic_score_gemma":0.0027147182,"teacher_disagreement_score":0.029412497,"about_ca_system_score_codex":0.0032451565,"about_ca_system_score_gemma":0.0015001628,"threshold_uncertainty_score":0.09839463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026230209,0.0047646803,0.86343485,0.011404938,0.002724536,0.00014377238,0.00060282316,0.00087810133,0.08981606],"genre_scores_gemma":[0.31315026,0.009648682,0.62046283,0.0072871987,0.0028994104,0.00049929495,0.0010306546,0.0011920327,0.043829735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809676,0.0007508454,0.00006708666,0.00045367828,0.0004732624,0.0001582993],"domain_scores_gemma":[0.99282116,0.00513417,0.00022027871,0.0010958151,0.00037520056,0.0003533836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017842522,0.0014912509,0.0017457079,0.0016089351,0.0021928842,0.0030787005,0.0035926022,0.0035529968,0.011269898],"category_scores_gemma":[0.010317475,0.0008133166,0.0014584048,0.004176802,0.0050240974,0.007269684,0.0058235554,0.008022893,0.0016105484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009204209,0.000048650505,0.00022636836,0.00018806297,0.000021623251,0.0000704896,0.00012727623,0.01169301,0.0012552374,0.9333993,0.01608908,0.03678882],"study_design_scores_gemma":[0.000017052742,0.000013521913,0.000102109414,0.00003449739,0.000014225222,0.000050070823,0.000028911303,0.019489637,0.00048917136,0.96637106,0.013375077,0.0000146750435],"about_ca_topic_score_codex":0.002895451,"about_ca_topic_score_gemma":0.0027928676,"teacher_disagreement_score":0.011269898,"about_ca_system_score_codex":0.002244405,"about_ca_system_score_gemma":0.0011922943,"threshold_uncertainty_score":0.037701547},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.606996,0.0036479475,0.29400852,0.025991369,0.0004190553,0.0002091508,0.0031546322,0.0011401983,0.0644332],"genre_scores_gemma":[0.9752789,0.0011889029,0.014886494,0.0007400453,0.0005387575,0.00017463962,0.0008791038,0.00027309466,0.0060400506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99378586,0.002433519,0.00023606651,0.0011730356,0.0013962963,0.0009751772],"domain_scores_gemma":[0.921007,0.06341964,0.0036907245,0.0066374973,0.0021620186,0.0030831483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044310275,0.0010790665,0.0032911208,0.0024938234,0.0028467556,0.009442759,0.0068015116,0.0046509164,0.0166645],"category_scores_gemma":[0.048693113,0.0014933172,0.0019712518,0.00415608,0.007633619,0.022191765,0.0048805955,0.008049592,0.001260254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031654813,0.00007849827,0.0011958106,0.00021613836,0.000065523294,0.00010997865,0.00035517596,0.039279994,0.0009708132,0.9421519,0.005908824,0.00935082],"study_design_scores_gemma":[0.000058144025,0.000016449461,0.0003846945,0.000019723546,0.000025930265,0.000082196886,0.00007795772,0.07566284,0.0003511081,0.92258745,0.0007037652,0.000029643046],"about_ca_topic_score_codex":0.0034689724,"about_ca_topic_score_gemma":0.0019497445,"teacher_disagreement_score":0.0166645,"about_ca_system_score_codex":0.005095364,"about_ca_system_score_gemma":0.0025419535,"threshold_uncertainty_score":0.055748343},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.798931,0.0010584624,0.1799232,0.002010432,0.00016292857,0.00004290118,0.00031948154,0.00030425002,0.017247275],"genre_scores_gemma":[0.9833235,0.00025058558,0.014154564,0.00010394585,0.00019121284,0.00003504088,0.00009894302,0.000036497997,0.0018056415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989851,0.00032052476,0.000041533585,0.00034933168,0.00020789601,0.0000955036],"domain_scores_gemma":[0.9609679,0.029910842,0.0043643857,0.0012717121,0.0014389663,0.002046196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009665949,0.0004232004,0.0008955346,0.0025564583,0.0013479077,0.00196967,0.0010696083,0.0012420228,0.004883797],"category_scores_gemma":[0.019770706,0.00044852291,0.00043733648,0.0019779275,0.0029385944,0.0038204852,0.0016762648,0.0017523309,0.00055052456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006246341,0.0003646563,0.022662524,0.00042178648,0.00016366849,0.0010801184,0.0024051252,0.030190596,0.022191122,0.8782462,0.0048760907,0.03677349],"study_design_scores_gemma":[0.000056347213,0.00023307366,0.013407905,0.000048139642,0.00007737796,0.0014527178,0.00084119523,0.102643736,0.0027780114,0.87619716,0.0021568118,0.00010755382],"about_ca_topic_score_codex":0.00064890645,"about_ca_topic_score_gemma":0.0005920037,"teacher_disagreement_score":0.004883797,"about_ca_system_score_codex":0.0006586883,"about_ca_system_score_gemma":0.00037860486,"threshold_uncertainty_score":0.016337931},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19907239,0.0006228331,0.7690703,0.0016373895,0.00006908274,0.00007199874,0.00043342315,0.0003245951,0.02869786],"genre_scores_gemma":[0.9504739,0.0008134816,0.022665035,0.00023395044,0.00020217436,0.00014556518,0.00027581115,0.00015719247,0.025032956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993094,0.00025933955,0.000024071916,0.00018133709,0.00012198735,0.00010385386],"domain_scores_gemma":[0.992489,0.0048120623,0.0009654667,0.0006468042,0.00050887367,0.00057783443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017054653,0.0006487024,0.0012154406,0.00163424,0.0009589791,0.0029073323,0.0021395548,0.0015350678,0.0077882004],"category_scores_gemma":[0.0071189236,0.0006433388,0.0012670375,0.0012233253,0.0032337692,0.0062811603,0.0016554593,0.0025932896,0.0007199692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002461625,0.00001880383,0.00023725098,0.000042246975,0.00002217789,0.00010694565,0.00017961068,0.022893822,0.0006560137,0.97338754,0.00069081946,0.0017400655],"study_design_scores_gemma":[0.000012921538,0.00001567171,0.00015481134,0.000013195733,0.000015037642,0.00006003354,0.000046705638,0.17393978,0.00019590209,0.8247611,0.0007722013,0.000012649096],"about_ca_topic_score_codex":0.0031829404,"about_ca_topic_score_gemma":0.0027166295,"teacher_disagreement_score":0.0077882004,"about_ca_system_score_codex":0.0021959518,"about_ca_system_score_gemma":0.0008895218,"threshold_uncertainty_score":0.026054144},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6548597,0.003976074,0.12026487,0.008678211,0.00046733604,0.00006490598,0.00071898085,0.00019328143,0.21077672],"genre_scores_gemma":[0.98513955,0.0009787681,0.0062225866,0.00042450623,0.0005227445,0.000029487372,0.00020363156,0.000047766604,0.006431017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994935,0.00016633337,0.000026256868,0.00007848046,0.00013809052,0.00009734904],"domain_scores_gemma":[0.9978662,0.0009823665,0.00025614185,0.00021181956,0.00028365597,0.00039982717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001507315,0.00059270096,0.0008523648,0.001990722,0.0021328107,0.0032215042,0.0011968714,0.001157736,0.004634874],"category_scores_gemma":[0.003878855,0.00044071634,0.00064669526,0.00097325904,0.0057790517,0.006291309,0.002603869,0.0034113973,0.00031735445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008409544,0.000007835717,0.00007805254,0.000008610079,0.0000019733127,0.000022010587,0.000047689362,0.00039001903,0.000127416,0.99855024,0.00023849048,0.0005192352],"study_design_scores_gemma":[0.000005087658,0.000004165284,0.00014961897,0.0000052718383,0.0000013282572,0.000014774453,0.00001976686,0.0021110706,0.000036251153,0.9974057,0.00024270179,0.0000042872416],"about_ca_topic_score_codex":0.0016825732,"about_ca_topic_score_gemma":0.0014479726,"teacher_disagreement_score":0.004634874,"about_ca_system_score_codex":0.0015513343,"about_ca_system_score_gemma":0.0010065655,"threshold_uncertainty_score":0.015505254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023137376,0.0058685686,0.5837284,0.05785041,0.007968795,0.00010750688,0.00072613155,0.0012209023,0.31939194],"genre_scores_gemma":[0.51927036,0.0042275153,0.2287186,0.010787271,0.005584984,0.0003405022,0.00058775546,0.0013202674,0.22916275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902534,0.00037093056,0.000039042923,0.0002005135,0.00027322888,0.00009099333],"domain_scores_gemma":[0.9985696,0.0006577444,0.00006742208,0.0003664167,0.00022009178,0.00011875213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010077654,0.0011163906,0.0010480713,0.0011109568,0.002216163,0.0028113227,0.0014011827,0.0023779597,0.023489604],"category_scores_gemma":[0.007840926,0.00053206977,0.00088919466,0.0007249643,0.0044911555,0.007709529,0.003626553,0.00435125,0.003933178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024856756,0.000010658802,0.00005852912,0.000050567494,0.000009611479,0.0000636123,0.00011008833,0.002563517,0.0001657453,0.9721306,0.016778225,0.008033906],"study_design_scores_gemma":[0.000009486528,0.00001055696,0.000048604084,0.00002945848,0.0000060611496,0.000067392175,0.00005059156,0.012393948,0.00013994846,0.9555871,0.03164592,0.000010866136],"about_ca_topic_score_codex":0.0015016455,"about_ca_topic_score_gemma":0.0012798754,"teacher_disagreement_score":0.023489604,"about_ca_system_score_codex":0.0008267932,"about_ca_system_score_gemma":0.0007981004,"threshold_uncertainty_score":0.0785805},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3093276,0.009159077,0.6184725,0.006782968,0.00079705426,0.00024800515,0.0036368868,0.0016080261,0.049967844],"genre_scores_gemma":[0.8392875,0.003752575,0.140817,0.0012085835,0.0018500783,0.00058379443,0.0028293997,0.0013834375,0.008287626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99178654,0.0020340385,0.0005572165,0.002302241,0.0017694412,0.0015504726],"domain_scores_gemma":[0.86220396,0.11267165,0.0055647152,0.009802458,0.005150136,0.0046070935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008124912,0.0037466236,0.0036030072,0.00602125,0.0028672048,0.00952026,0.009410824,0.0035675382,0.011063429],"category_scores_gemma":[0.059341975,0.0022294002,0.0035298935,0.0066608116,0.0061381035,0.016193815,0.0049190014,0.009012065,0.00118608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028773225,0.0012629239,0.0145552335,0.0017900066,0.000577187,0.00043503114,0.0012792606,0.29533708,0.024436899,0.57132155,0.015044146,0.0710834],"study_design_scores_gemma":[0.00012053391,0.00018964833,0.003396359,0.00015398022,0.00022480097,0.00045643986,0.000268315,0.48820361,0.005983823,0.49763322,0.0032531493,0.0001161744],"about_ca_topic_score_codex":0.0021924723,"about_ca_topic_score_gemma":0.00367287,"teacher_disagreement_score":0.011063429,"about_ca_system_score_codex":0.0073233224,"about_ca_system_score_gemma":0.0022548824,"threshold_uncertainty_score":0.05313468},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2265366,0.0021538727,0.47070158,0.005419695,0.0016428751,0.00009241666,0.0007864584,0.00071112893,0.29195547],"genre_scores_gemma":[0.8879957,0.0010706215,0.009861716,0.00073265017,0.00087593135,0.00006536139,0.00026495662,0.00024426295,0.098888725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99966,0.000054454842,0.000011538005,0.000104138475,0.00010326738,0.00006645821],"domain_scores_gemma":[0.9992748,0.00018101119,0.0001749994,0.00008628065,0.00018327977,0.000099657365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036329246,0.00096656545,0.00066196267,0.0014980664,0.0012680636,0.001511571,0.00077348517,0.0011706499,0.024950251],"category_scores_gemma":[0.001462438,0.0003825571,0.0007149176,0.00063980574,0.0023626224,0.0027867467,0.0015091836,0.0020636183,0.0026875702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013058225,0.000034759767,0.00042917774,0.00011149624,0.00003254624,0.00016878772,0.00014717126,0.009305995,0.011112391,0.9481978,0.0038178416,0.026511481],"study_design_scores_gemma":[0.000019887568,0.00014764597,0.0018657714,0.00003820265,0.000023771134,0.00053824583,0.0002430323,0.038730767,0.005644745,0.93793327,0.014774078,0.00004053923],"about_ca_topic_score_codex":0.00095757586,"about_ca_topic_score_gemma":0.00068091176,"teacher_disagreement_score":0.024950251,"about_ca_system_score_codex":0.0004758119,"about_ca_system_score_gemma":0.0004648859,"threshold_uncertainty_score":0.08346683},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071773743,0.00014232699,0.98763484,0.0001528063,0.00016286416,0.0000716965,0.00007968462,0.00061622,0.003962131],"genre_scores_gemma":[0.12703829,0.00024607204,0.86486167,0.00016928904,0.00011405921,0.00029342275,0.00042740398,0.00028775842,0.006561958],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947244,0.000078073455,0.00002298889,0.00009282954,0.00024581095,0.00008794173],"domain_scores_gemma":[0.99947804,0.00018949616,0.000030081974,0.00008908822,0.00014494173,0.0000684751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050486624,0.00082650763,0.0013135299,0.00079954363,0.0006796968,0.0010433,0.0015443205,0.0011741621,0.010448764],"category_scores_gemma":[0.0024132356,0.0005397044,0.00092099037,0.0012181475,0.00063085614,0.0013262565,0.0028004462,0.0027363773,0.0021697485],"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.00025241342,0.00027696817,0.00033293143,0.00017348483,0.000040863873,0.000119352924,0.000097544,0.5286037,0.004914958,0.04663586,0.009398651,0.40915334],"study_design_scores_gemma":[0.000040562925,0.000048616635,0.000057440087,0.00001402558,0.0000060717066,0.000033727698,0.000012531032,0.9838935,0.00062748505,0.012387635,0.0028693425,0.000009136024],"about_ca_topic_score_codex":0.0038649386,"about_ca_topic_score_gemma":0.003625816,"teacher_disagreement_score":0.010448764,"about_ca_system_score_codex":0.0006690172,"about_ca_system_score_gemma":0.0017417704,"threshold_uncertainty_score":0.034954548},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.117940985,0.0006031652,0.7522534,0.0013573444,0.00048401434,0.0001860029,0.001715727,0.00093190745,0.12452749],"genre_scores_gemma":[0.80426484,0.0006906419,0.107681036,0.00020282307,0.00016760988,0.0002013491,0.0011753303,0.00031672098,0.08529957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993741,0.0001678638,0.000021363865,0.00012157085,0.00016013598,0.00015508274],"domain_scores_gemma":[0.99813735,0.0007998797,0.00016524801,0.00022997659,0.0002924961,0.00037497154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006468888,0.0006863042,0.00085858436,0.00071295915,0.0008475011,0.0020649552,0.0017222335,0.0010409569,0.026161032],"category_scores_gemma":[0.0043382277,0.00054855924,0.0004990665,0.0013299235,0.0010278862,0.0017263991,0.0010795066,0.002437863,0.0027144498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005396343,0.0001426266,0.0002785171,0.00013238717,0.000022445256,0.00006191232,0.000051022136,0.40427426,0.0032739358,0.55138904,0.010286328,0.029547902],"study_design_scores_gemma":[0.00015506204,0.00013062266,0.00024937905,0.00002144329,0.0000141645005,0.000053012453,0.000059067967,0.70484406,0.0027501765,0.2800201,0.011673974,0.000028984281],"about_ca_topic_score_codex":0.004306248,"about_ca_topic_score_gemma":0.0037642154,"teacher_disagreement_score":0.026161032,"about_ca_system_score_codex":0.0025161505,"about_ca_system_score_gemma":0.0018762373,"threshold_uncertainty_score":0.08751744},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7418433,0.0008728398,0.18641989,0.0019179042,0.00014643751,0.0002365092,0.0015703854,0.00083169574,0.066161074],"genre_scores_gemma":[0.9691635,0.00038502028,0.014717043,0.00031621437,0.00008762519,0.00015100576,0.0005911641,0.00015155904,0.014437028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912554,0.000254185,0.00003919981,0.00017269612,0.00016629245,0.00024210458],"domain_scores_gemma":[0.9911261,0.0057173655,0.0009368318,0.000816526,0.000558615,0.0008445115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007783474,0.0005385705,0.0013351713,0.0013289384,0.0014931984,0.0022441829,0.001735146,0.0010226916,0.009508086],"category_scores_gemma":[0.006935921,0.00068098254,0.0006743444,0.0015869536,0.0013409915,0.002566946,0.0023323148,0.0014218809,0.000748183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012757471,0.00020537525,0.005059345,0.00068359677,0.00014419599,0.00113522,0.0012388241,0.09898361,0.014145523,0.82560056,0.01644,0.035087943],"study_design_scores_gemma":[0.00023752778,0.00006962025,0.0018144218,0.00006253647,0.00005220854,0.00065013417,0.0004081571,0.24198051,0.0028126484,0.7472698,0.004608247,0.00003420731],"about_ca_topic_score_codex":0.0033271667,"about_ca_topic_score_gemma":0.0037331423,"teacher_disagreement_score":0.009508086,"about_ca_system_score_codex":0.001352047,"about_ca_system_score_gemma":0.00081902585,"threshold_uncertainty_score":0.03180766},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22261682,0.0005649836,0.7376029,0.0016082634,0.0002297699,0.001047436,0.0024387876,0.010179107,0.023711927],"genre_scores_gemma":[0.49425125,0.00021076055,0.488471,0.00036613012,0.00010988963,0.00050704216,0.0041305074,0.00097450597,0.01097896],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987134,0.00017487773,0.00008571898,0.0004134489,0.0003007572,0.000311874],"domain_scores_gemma":[0.99557036,0.0023839364,0.0002143836,0.0009916179,0.00044800597,0.00039176483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009254532,0.0014149365,0.0015028521,0.0011831084,0.0017925176,0.002398939,0.00397444,0.0013701159,0.011832937],"category_scores_gemma":[0.003562641,0.0007090059,0.0014359136,0.0019153384,0.001256317,0.0045241327,0.0046212813,0.0019123608,0.0020118868],"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.0025074629,0.0009442768,0.0045688837,0.0014359447,0.0002694016,0.0003263386,0.0012372104,0.11073314,0.049192607,0.0592744,0.035799526,0.7337108],"study_design_scores_gemma":[0.0008699685,0.00037169558,0.001496145,0.0000674395,0.00017645145,0.00028886044,0.000653241,0.8054613,0.020188162,0.16113669,0.009213695,0.000076252836],"about_ca_topic_score_codex":0.0066782157,"about_ca_topic_score_gemma":0.0130844675,"teacher_disagreement_score":0.011832937,"about_ca_system_score_codex":0.0025953972,"about_ca_system_score_gemma":0.0034187525,"threshold_uncertainty_score":0.039585054},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42131445,0.0031593894,0.3108678,0.0046707047,0.0018521936,0.00027715965,0.014969744,0.0053605842,0.23752812],"genre_scores_gemma":[0.8871031,0.000670158,0.06673259,0.0004353268,0.00027517477,0.00030461972,0.005110176,0.002301726,0.03706715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990847,0.00012717626,0.000039781484,0.000232549,0.00025003744,0.00026581902],"domain_scores_gemma":[0.99466634,0.0024886962,0.00041788042,0.0006452405,0.0012731733,0.0005087261],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008714496,0.001155997,0.0013111487,0.0027123142,0.001527509,0.0029446448,0.0013272985,0.0014975473,0.045533683],"category_scores_gemma":[0.010933156,0.00038388858,0.00085970835,0.0012160456,0.0014445666,0.0024558194,0.0012499904,0.0014370299,0.0088980645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026551778,0.0005006411,0.012422437,0.0032183346,0.0002767611,0.0012637522,0.0012698211,0.049656607,0.083672695,0.47357285,0.15993725,0.21155371],"study_design_scores_gemma":[0.00019704858,0.000386644,0.029619396,0.0006156356,0.00014281156,0.0021328547,0.0014595453,0.1550858,0.07422047,0.68226695,0.0534394,0.00043343348],"about_ca_topic_score_codex":0.001047013,"about_ca_topic_score_gemma":0.0013789461,"teacher_disagreement_score":0.045533683,"about_ca_system_score_codex":0.00091855845,"about_ca_system_score_gemma":0.000816547,"threshold_uncertainty_score":0.15232533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15009058,0.002699331,0.585812,0.12995934,0.0019701999,0.0003652954,0.0026670727,0.003157117,0.12327914],"genre_scores_gemma":[0.92522675,0.0013067063,0.048822403,0.008017691,0.0020914758,0.0006072169,0.0008132677,0.0008185511,0.012295944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98723674,0.0053675966,0.00037796167,0.0027668637,0.0028423385,0.001408331],"domain_scores_gemma":[0.87205017,0.100002654,0.0032130776,0.019381285,0.003354875,0.001997983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008154062,0.0011434926,0.0031012634,0.0015794698,0.0048412154,0.0056595462,0.0059974464,0.008398717,0.01666111],"category_scores_gemma":[0.0855145,0.0014475763,0.0022437293,0.0033319204,0.011334895,0.02426214,0.008999481,0.012003923,0.002045022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017863097,0.00006504924,0.00035563824,0.00013559818,0.00003017438,0.000083701656,0.00023666813,0.010118017,0.00041775743,0.96973306,0.012405463,0.0062402766],"study_design_scores_gemma":[0.000081996135,0.000011735523,0.000099628065,0.000017511895,0.000011882535,0.00005943024,0.000033610027,0.02612687,0.00027949698,0.9710966,0.0021652123,0.00001618494],"about_ca_topic_score_codex":0.002427786,"about_ca_topic_score_gemma":0.0018294854,"teacher_disagreement_score":0.01666111,"about_ca_system_score_codex":0.0034636636,"about_ca_system_score_gemma":0.0032766792,"threshold_uncertainty_score":0.05573696},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013884483,0.00055706664,0.13315132,0.004697806,0.0029790758,0.0004476127,0.18869801,0.18491238,0.48316827],"genre_scores_gemma":[0.017027572,0.0016752371,0.0810816,0.0027385978,0.0011855918,0.00068036525,0.2552497,0.16084857,0.47951266],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900395,0.00014172231,0.000074373726,0.00015168522,0.0005225487,0.00010562879],"domain_scores_gemma":[0.9974407,0.0007915883,0.00010712298,0.0006209711,0.0007885289,0.0002510537],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009853491,0.0019975852,0.0015524102,0.002857917,0.0012369974,0.0059932014,0.0035256776,0.0017123854,0.755619],"category_scores_gemma":[0.0055944514,0.0012343363,0.0015953773,0.0052508377,0.0008102865,0.005745644,0.0035551232,0.0032189863,0.5953328],"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.00007360742,0.000030466615,0.000112255584,0.00018203008,0.000008327068,0.00004005838,0.0000677092,0.00031863296,0.0008537003,0.012389778,0.95368725,0.032236163],"study_design_scores_gemma":[0.0000541779,0.000012340503,0.0004923296,0.00011414128,0.000007043057,0.000092742855,0.00005381671,0.0020216682,0.0024609098,0.016439456,0.97822034,0.000031090007],"about_ca_topic_score_codex":0.011460313,"about_ca_topic_score_gemma":0.015340479,"teacher_disagreement_score":0.755619,"about_ca_system_score_codex":0.0026776295,"about_ca_system_score_gemma":0.0015143848,"threshold_uncertainty_score":0.34857982},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069675426,0.021320624,0.0040841512,0.10323019,0.39468908,0.00017253133,0.0021107607,0.0006979288,0.47299793],"genre_scores_gemma":[0.0040829214,0.005979465,0.0010042797,0.020078275,0.053253822,0.00010877411,0.0011126683,0.0005377745,0.91384196],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99928385,0.00009804184,0.000039949107,0.00012655088,0.00036932426,0.000082411076],"domain_scores_gemma":[0.9978015,0.00033618676,0.00010267355,0.00020108027,0.0011629418,0.0003956389],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00088670885,0.0009984081,0.00086707383,0.0018765829,0.0017313855,0.0030357665,0.0010818065,0.0022676252,0.22701497],"category_scores_gemma":[0.0048994995,0.0002536669,0.0005667736,0.0011423603,0.00077180495,0.0027434495,0.0019059143,0.003575191,0.20219865],"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.000013247567,0.0000072259836,0.000023993187,0.000070661474,0.0000018902615,0.000016537806,0.000012683678,0.0000143572415,0.00011636583,0.0062041422,0.96809196,0.025426999],"study_design_scores_gemma":[0.000004385936,0.000009699937,0.000116998286,0.00008046775,0.0000026850144,0.00003618732,0.00001499862,0.000025329911,0.00012335498,0.003903439,0.99567896,0.000003502293],"about_ca_topic_score_codex":0.0018605775,"about_ca_topic_score_gemma":0.0033071546,"teacher_disagreement_score":0.77298504,"about_ca_system_score_codex":0.0018626517,"about_ca_system_score_gemma":0.0016680261,"threshold_uncertainty_score":0},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000539418,0.025269832,0.0034669258,0.1333966,0.48283014,0.00014158936,0.001813139,0.0006000599,0.35194224],"genre_scores_gemma":[0.0043979743,0.008686967,0.0011544675,0.037623163,0.091883786,0.00013278643,0.0012081126,0.00067949406,0.85423326],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991346,0.00012341993,0.00004843853,0.00015256905,0.0004426849,0.000098284436],"domain_scores_gemma":[0.9971903,0.00048337196,0.00014063319,0.00023717563,0.0014179723,0.00053058565],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001033752,0.0010056194,0.0008500622,0.0018067282,0.001687092,0.0034837986,0.0011187898,0.0026678513,0.20628636],"category_scores_gemma":[0.006741764,0.00025532025,0.0005813661,0.0011028737,0.0009154711,0.0028374768,0.0021028356,0.004286398,0.1869325],"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.000012457439,0.00000611196,0.00002114227,0.00007224642,0.0000018776591,0.000015995683,0.000011506391,0.000013107818,0.00009475579,0.005582023,0.9713637,0.022804998],"study_design_scores_gemma":[0.0000044883136,0.000008629796,0.000092797374,0.00009585344,0.000002485279,0.000037241756,0.000013633781,0.000021181559,0.00009996147,0.0039051978,0.99571496,0.0000034738514],"about_ca_topic_score_codex":0.0018115529,"about_ca_topic_score_gemma":0.0031198645,"teacher_disagreement_score":0.7937136,"about_ca_system_score_codex":0.0019983705,"about_ca_system_score_gemma":0.0020393934,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22754276,0.02336966,0.4742302,0.007138168,0.0028691648,0.00033533748,0.0020571453,0.00039021217,0.26206732],"genre_scores_gemma":[0.75033283,0.026139686,0.098657906,0.0024124053,0.0048322245,0.00051913963,0.0033378508,0.0009029071,0.11286501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986897,0.00033468008,0.00008135472,0.0002640273,0.00042138767,0.00020897397],"domain_scores_gemma":[0.9970636,0.0015053836,0.00039751834,0.00037918912,0.0003792101,0.0002752337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012239447,0.0015572447,0.0013755247,0.0037581692,0.001484673,0.0029992412,0.0020967377,0.0020125485,0.014848472],"category_scores_gemma":[0.006582677,0.0011687597,0.0018834854,0.0037652117,0.0037033977,0.0062790625,0.0049443133,0.004666551,0.0025675274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072677336,0.000045111155,0.000774184,0.00038768846,0.00004657746,0.0002164363,0.0005684205,0.007612439,0.0025419276,0.9520661,0.008742595,0.026925849],"study_design_scores_gemma":[0.000014708641,0.000043676624,0.0009099671,0.00011828981,0.000027360144,0.00026208375,0.00026892935,0.011569209,0.00059984473,0.9727937,0.013369153,0.000023085959],"about_ca_topic_score_codex":0.0020011694,"about_ca_topic_score_gemma":0.0015358821,"teacher_disagreement_score":0.014848472,"about_ca_system_score_codex":0.0015456856,"about_ca_system_score_gemma":0.0005393927,"threshold_uncertainty_score":0.04967308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72129047,0.00035746975,0.1786234,0.0015386366,0.00013149617,0.00015401606,0.0022307592,0.00035978307,0.09531405],"genre_scores_gemma":[0.96081704,0.00023128463,0.021301515,0.00021668391,0.00007579145,0.00014117287,0.0015750484,0.00006331297,0.015578236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998454,0.00044496224,0.000074295225,0.00035917127,0.00023783768,0.0004297449],"domain_scores_gemma":[0.98915267,0.0059642014,0.0012442732,0.0006991348,0.0008085876,0.0021312244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013867577,0.00055312994,0.0012448693,0.0009949844,0.00323768,0.004701727,0.001138494,0.0013265294,0.018812135],"category_scores_gemma":[0.00908757,0.0008026608,0.0011182368,0.0015241934,0.0013535313,0.0023655468,0.0019570598,0.001419733,0.0015170404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083041494,0.0002540018,0.008100506,0.00025542086,0.00019171672,0.0009265472,0.0008317889,0.010559576,0.0032302747,0.938604,0.013099949,0.023115858],"study_design_scores_gemma":[0.00044149003,0.00022947919,0.0062313513,0.00007197788,0.00010532385,0.0012995012,0.0008026361,0.07184283,0.0021707423,0.9022405,0.014484732,0.00007945312],"about_ca_topic_score_codex":0.002158992,"about_ca_topic_score_gemma":0.00361735,"teacher_disagreement_score":0.018812135,"about_ca_system_score_codex":0.0010813371,"about_ca_system_score_gemma":0.0008990154,"threshold_uncertainty_score":0.06293291},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046099172,0.004479968,0.00012747278,0.041357618,0.94748545,0.000028460661,0.00009196935,0.00006985239,0.0063130064],"genre_scores_gemma":[0.00073958846,0.0034169063,0.00013237866,0.021909934,0.9404536,0.000036370882,0.00009107758,0.00008156755,0.033138644],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99609536,0.0006654902,0.00035964206,0.00046599988,0.0019983843,0.0004151208],"domain_scores_gemma":[0.98397684,0.0035171,0.0013145613,0.00070554705,0.0075272922,0.002958601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039395834,0.0025931194,0.0023730542,0.00441447,0.0026403454,0.0070502097,0.0023835497,0.009328468,0.048566286],"category_scores_gemma":[0.024662353,0.00073701516,0.0020327314,0.0017087653,0.0019029776,0.0026596945,0.0020154708,0.01061359,0.026740724],"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.000012588895,0.000003987804,0.000008834574,0.000040285653,0.000004717042,0.000036951486,0.0000025938325,0.000008018572,0.000013139107,0.00013258934,0.9969162,0.0028201835],"study_design_scores_gemma":[0.00004687226,0.000010801213,0.00015203103,0.00022851421,0.000025154295,0.00013482466,0.000015927133,0.00007712836,0.0000722497,0.0009900872,0.99823725,0.000009071269],"about_ca_topic_score_codex":0.0019900033,"about_ca_topic_score_gemma":0.00460096,"teacher_disagreement_score":0.048566286,"about_ca_system_score_codex":0.0031295028,"about_ca_system_score_gemma":0.0035508703,"threshold_uncertainty_score":0},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04212148,0.000809421,0.922371,0.003107172,0.00027481603,0.00040209887,0.0015301484,0.002206084,0.027177894],"genre_scores_gemma":[0.30111915,0.0011370643,0.6676554,0.00094070076,0.00043463908,0.0011354189,0.0056472355,0.0021086496,0.01982183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99623126,0.0010979935,0.00020613684,0.0010714865,0.00077402825,0.0006190643],"domain_scores_gemma":[0.98847264,0.007394698,0.000550948,0.0024857197,0.0005267925,0.0005690749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030809504,0.001997725,0.0027407203,0.0014789468,0.0029063052,0.0068196617,0.007877691,0.0036751046,0.030362342],"category_scores_gemma":[0.016486026,0.0014914938,0.0032737446,0.0038369843,0.0023901057,0.01596748,0.006887449,0.007979664,0.004546299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010444092,0.0008815245,0.001193712,0.0007202325,0.00021874727,0.00013210761,0.0006625545,0.10209432,0.0033070622,0.61477023,0.050560743,0.22441435],"study_design_scores_gemma":[0.00028418566,0.000072850286,0.00027876266,0.000056792433,0.00007685965,0.00009939948,0.00021059877,0.22769986,0.0012406063,0.7619982,0.007946144,0.00003578163],"about_ca_topic_score_codex":0.003094066,"about_ca_topic_score_gemma":0.0052342587,"teacher_disagreement_score":0.030362342,"about_ca_system_score_codex":0.00409355,"about_ca_system_score_gemma":0.0038923281,"threshold_uncertainty_score":0.101572156},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29182717,0.0012460519,0.4018831,0.0033064457,0.0012661727,0.00025909994,0.0012566166,0.001347395,0.2976079],"genre_scores_gemma":[0.8523406,0.0013615432,0.080911025,0.0014956472,0.0011572145,0.00019754164,0.0010067194,0.000387674,0.061142057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939203,0.00011762054,0.000043161912,0.0002266443,0.00011700465,0.000103575294],"domain_scores_gemma":[0.9988391,0.00026623972,0.00015060458,0.0003600413,0.00018207867,0.00020197064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008105522,0.0005655327,0.00066292426,0.0012798035,0.0012685257,0.0016890102,0.0011815452,0.0010195227,0.011090005],"category_scores_gemma":[0.0027172952,0.00032498222,0.0015861387,0.0012745411,0.0013996296,0.0051060254,0.0028460475,0.003125324,0.0014481725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043333388,0.00004222937,0.0003015611,0.00007366219,0.000012793332,0.00017579891,0.000255944,0.0011853927,0.0020222196,0.9803879,0.0029976484,0.012501505],"study_design_scores_gemma":[0.00001225566,0.000019220699,0.00033807885,0.000020787644,0.000012838177,0.00029620796,0.00009139282,0.003976369,0.0007652006,0.9838949,0.010563122,0.0000096871145],"about_ca_topic_score_codex":0.00120584,"about_ca_topic_score_gemma":0.0009390435,"teacher_disagreement_score":0.011090005,"about_ca_system_score_codex":0.00079342735,"about_ca_system_score_gemma":0.00054025097,"threshold_uncertainty_score":0.03709978},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014744336,0.018607477,0.015881056,0.041820295,0.3457377,0.00038070415,0.0076913335,0.0011867655,0.5672203],"genre_scores_gemma":[0.008647025,0.007683532,0.0037803352,0.0063819024,0.049727622,0.00019095068,0.0045201275,0.00085558573,0.91821307],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993955,0.00009194348,0.000036087265,0.00010682132,0.00031974824,0.000049878327],"domain_scores_gemma":[0.9961702,0.0006043964,0.00012286437,0.00042239102,0.002195798,0.000484258],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011496394,0.0010660504,0.0007551422,0.0032933722,0.002231543,0.002582617,0.0011886186,0.000957184,0.28940555],"category_scores_gemma":[0.007972951,0.00029091205,0.0006919984,0.0023060828,0.00065899314,0.002617777,0.0016629938,0.0029999583,0.17436108],"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.000023722594,0.00002233078,0.00007561303,0.00009566709,0.0000029078215,0.00003061027,0.00003642583,0.00009152956,0.00015073571,0.011590234,0.9491855,0.038694724],"study_design_scores_gemma":[0.0000052482515,0.000013377325,0.0002992669,0.000107840926,0.0000034907387,0.00003935949,0.000045407207,0.000077208155,0.00018773583,0.01049132,0.98872316,0.0000065790546],"about_ca_topic_score_codex":0.0032622835,"about_ca_topic_score_gemma":0.0047181183,"teacher_disagreement_score":0.7105944,"about_ca_system_score_codex":0.0020283272,"about_ca_system_score_gemma":0.0015278712,"threshold_uncertainty_score":0},"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":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001434141,0.018749516,0.014482543,0.04105771,0.3588516,0.0003695051,0.0071453345,0.001134191,0.5567755],"genre_scores_gemma":[0.008050398,0.007510769,0.0034342203,0.006118556,0.049312938,0.000175112,0.0041898997,0.00079508923,0.9204131],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993994,0.00009017237,0.000035650515,0.000105602194,0.00031877033,0.0000503103],"domain_scores_gemma":[0.9962633,0.00056297507,0.00011745187,0.00040488833,0.0021514513,0.00049996725],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011409634,0.0010620579,0.00074584346,0.003338766,0.0022265923,0.0026484155,0.0011696852,0.00096405006,0.28663915],"category_scores_gemma":[0.0076627517,0.00028954682,0.00068356487,0.0023014718,0.00064282457,0.0025603618,0.0016585025,0.0029668193,0.1704353],"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.000023414968,0.00002226733,0.000072938754,0.00009252536,0.0000028475854,0.000029851335,0.00003414052,0.0000892106,0.00014648597,0.010697609,0.94970924,0.039079405],"study_design_scores_gemma":[0.000005258459,0.00001333999,0.00030014332,0.00010461511,0.0000034182547,0.00003820165,0.000043190623,0.00007579872,0.00018127037,0.009596361,0.989632,0.000006395197],"about_ca_topic_score_codex":0.0031768598,"about_ca_topic_score_gemma":0.0046899687,"teacher_disagreement_score":0.71336085,"about_ca_system_score_codex":0.0020137813,"about_ca_system_score_gemma":0.0015235388,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014744336,0.018607477,0.015881056,0.041820295,0.3457377,0.00038070415,0.0076913335,0.0011867655,0.5672203],"genre_scores_gemma":[0.008647025,0.007683532,0.0037803352,0.0063819024,0.049727622,0.00019095068,0.0045201275,0.00085558573,0.91821307],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993955,0.00009194348,0.000036087265,0.00010682132,0.00031974824,0.000049878327],"domain_scores_gemma":[0.9961702,0.0006043964,0.00012286437,0.00042239102,0.002195798,0.000484258],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011496394,0.0010660504,0.0007551422,0.0032933722,0.002231543,0.002582617,0.0011886186,0.000957184,0.28940555],"category_scores_gemma":[0.007972951,0.00029091205,0.0006919984,0.0023060828,0.00065899314,0.002617777,0.0016629938,0.0029999583,0.17436108],"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.000023722594,0.00002233078,0.00007561303,0.00009566709,0.0000029078215,0.00003061027,0.00003642583,0.00009152956,0.00015073571,0.011590234,0.9491855,0.038694724],"study_design_scores_gemma":[0.0000052482515,0.000013377325,0.0002992669,0.000107840926,0.0000034907387,0.00003935949,0.000045407207,0.000077208155,0.00018773583,0.01049132,0.98872316,0.0000065790546],"about_ca_topic_score_codex":0.0032622835,"about_ca_topic_score_gemma":0.0047181183,"teacher_disagreement_score":0.7105944,"about_ca_system_score_codex":0.0020283272,"about_ca_system_score_gemma":0.0015278712,"threshold_uncertainty_score":0},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014319634,0.018990038,0.0144287655,0.041843075,0.36575043,0.00037293916,0.007409496,0.0011202856,0.548653],"genre_scores_gemma":[0.008134417,0.0076385913,0.0034954662,0.006252096,0.05126997,0.00017976704,0.0043701767,0.0008038832,0.9178557],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993832,0.00009412073,0.000036783975,0.00010813721,0.0003258701,0.00005185977],"domain_scores_gemma":[0.99605966,0.0005961943,0.00012411301,0.0004263359,0.0022726576,0.0005211063],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011781029,0.0010573721,0.0007419555,0.0034255222,0.0022614475,0.0026543783,0.0011702981,0.00097258744,0.28740928],"category_scores_gemma":[0.007978124,0.00029372153,0.00068703253,0.0023734244,0.00065022317,0.0025791272,0.0016694227,0.0030097424,0.17061266],"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.000023519191,0.000021732745,0.00007493561,0.000092533664,0.0000028588452,0.000029501756,0.00003456688,0.000088918256,0.00014456759,0.010325796,0.9505438,0.038617242],"study_design_scores_gemma":[0.0000052292294,0.000013100112,0.0003051006,0.0001038401,0.0000033425379,0.000037186834,0.000043418306,0.00007339872,0.00017667873,0.009382152,0.98985016,0.0000063554166],"about_ca_topic_score_codex":0.0032794944,"about_ca_topic_score_gemma":0.004898058,"teacher_disagreement_score":0.7125907,"about_ca_system_score_codex":0.0020658919,"about_ca_system_score_gemma":0.0015516253,"threshold_uncertainty_score":0},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8865561,0.00033828494,0.023754997,0.0018958003,0.00011828588,0.00008841057,0.0005559344,0.00031948157,0.086372845],"genre_scores_gemma":[0.98501945,0.000111718895,0.004341496,0.0002711888,0.00004810449,0.000036783265,0.00035540306,0.000059447757,0.009756352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999708,0.000062203406,0.000008843757,0.000054545195,0.000051438125,0.00011496398],"domain_scores_gemma":[0.99886656,0.0005522159,0.00011681473,0.00008952798,0.00010694321,0.00026794345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032956907,0.0005978725,0.00059939874,0.0015917881,0.002465736,0.0020556864,0.00095394335,0.0012085071,0.009681868],"category_scores_gemma":[0.0018463333,0.00045389018,0.0005245486,0.0005826251,0.002154481,0.0018725218,0.001700228,0.0019816575,0.0006470171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031117283,0.00008212659,0.0010445239,0.000117646756,0.000019989831,0.0003145971,0.0006947778,0.005986858,0.00503783,0.9773801,0.004681229,0.00432908],"study_design_scores_gemma":[0.000070921174,0.000033778517,0.0008914434,0.00003341509,0.00001778937,0.00012782465,0.00051802245,0.016049694,0.0019242687,0.9781488,0.0021666784,0.000017404214],"about_ca_topic_score_codex":0.002259743,"about_ca_topic_score_gemma":0.0036432839,"teacher_disagreement_score":0.009681868,"about_ca_system_score_codex":0.001447746,"about_ca_system_score_gemma":0.0007073366,"threshold_uncertainty_score":0.032389104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14744774,0.0007803269,0.82790005,0.0007013371,0.00024693483,0.000072734605,0.000555348,0.0002845606,0.022010945],"genre_scores_gemma":[0.7958483,0.0014836171,0.16515674,0.00044471957,0.0006794081,0.00017850625,0.0011813275,0.00039648937,0.034630902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990727,0.00028635305,0.000039707396,0.00025512863,0.00020692204,0.00013931438],"domain_scores_gemma":[0.99739814,0.0010587494,0.00033899533,0.00047047943,0.00050220836,0.00023138392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008242127,0.0009097661,0.0007483128,0.0018257527,0.00076166616,0.0021682119,0.0008491004,0.0005990886,0.008939167],"category_scores_gemma":[0.004299686,0.00043135078,0.0009410303,0.0014201474,0.0013990366,0.0036050845,0.0010963242,0.0014180865,0.0010240703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008085937,0.00004846653,0.0003810654,0.000081233375,0.000022539887,0.00009035503,0.00026961346,0.008242764,0.0033396173,0.9603104,0.0027796428,0.024353486],"study_design_scores_gemma":[0.000008424316,0.000018565277,0.00022545188,0.0000125778615,0.000007696688,0.000085670115,0.00006708983,0.039739527,0.0007407957,0.9559983,0.0030828244,0.000012984009],"about_ca_topic_score_codex":0.0014680387,"about_ca_topic_score_gemma":0.0013212891,"teacher_disagreement_score":0.008939167,"about_ca_system_score_codex":0.0007312594,"about_ca_system_score_gemma":0.0005012068,"threshold_uncertainty_score":0.029904544},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062084603,0.0004247994,0.99030286,0.0003823563,0.00010236742,0.000040071034,0.00008387934,0.0004615131,0.0019936159],"genre_scores_gemma":[0.47817025,0.0010630487,0.50206876,0.0005305449,0.00044494757,0.000479926,0.00066781737,0.00066890894,0.015905846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982212,0.0009103666,0.000072910734,0.00038576694,0.00030833937,0.00010138962],"domain_scores_gemma":[0.9946398,0.0035541388,0.000308787,0.00086118095,0.00045381996,0.00018230618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002060544,0.0008596166,0.0021656519,0.0016096199,0.00094371,0.0021494166,0.0030780435,0.0023307265,0.0046344516],"category_scores_gemma":[0.012334427,0.001185557,0.0016476882,0.0019091326,0.001978631,0.004390633,0.0033032654,0.0031454724,0.0015179941],"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.00010255447,0.00004937215,0.0004906272,0.0001221729,0.000105851475,0.0000337581,0.00008871973,0.70216507,0.0007160218,0.24139145,0.0030536614,0.051680733],"study_design_scores_gemma":[0.0000066320827,0.000005155322,0.00005711793,0.000006703755,0.000005986458,0.000011627841,0.0000064932897,0.8397595,0.00017962733,0.1594174,0.00053581037,0.000007939168],"about_ca_topic_score_codex":0.0042985696,"about_ca_topic_score_gemma":0.00414572,"teacher_disagreement_score":0.0046344516,"about_ca_system_score_codex":0.0016964888,"about_ca_system_score_gemma":0.0010497496,"threshold_uncertainty_score":0.015503764},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5658023,0.00034958302,0.4230274,0.00019095241,0.000054277705,0.000057289766,0.0004134374,0.00024969838,0.0098551065],"genre_scores_gemma":[0.91546077,0.00039099454,0.07702949,0.00009402711,0.00007016135,0.000082555714,0.00077494886,0.00015129436,0.005945696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915874,0.000217519,0.000059446375,0.00026122975,0.00017754687,0.00012549885],"domain_scores_gemma":[0.9977175,0.00073510356,0.00046415202,0.00056154636,0.00028102015,0.00024070444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005321872,0.00060616556,0.00036480353,0.0012418743,0.00044525854,0.0010165161,0.00060100644,0.00042624038,0.0026910026],"category_scores_gemma":[0.0037005064,0.00042862687,0.00056887406,0.0008684215,0.0012648839,0.0032828879,0.0016506275,0.000835399,0.00036863724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041930674,0.00012685034,0.0047106217,0.000239025,0.00009936904,0.0006278236,0.0015181478,0.04768034,0.026928097,0.8155765,0.0029040503,0.099169865],"study_design_scores_gemma":[0.00003263963,0.00016585196,0.0028494135,0.00004834039,0.000047056412,0.00060903275,0.00055050023,0.13421656,0.008936644,0.8435308,0.008973498,0.000039727976],"about_ca_topic_score_codex":0.0006458425,"about_ca_topic_score_gemma":0.00061596156,"teacher_disagreement_score":0.0026910026,"about_ca_system_score_codex":0.0004994053,"about_ca_system_score_gemma":0.00019924181,"threshold_uncertainty_score":0.009002268},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8511768,0.0012807033,0.05291209,0.0013737538,0.00019170479,0.00008962079,0.00045728686,0.00017573308,0.09234225],"genre_scores_gemma":[0.9811195,0.0004906266,0.006850114,0.00020810684,0.00016345605,0.00010174063,0.0005261306,0.00007162964,0.010468571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993782,0.0001380002,0.000028062388,0.00012745745,0.00017121075,0.00015697701],"domain_scores_gemma":[0.996666,0.0015186147,0.00055270793,0.00026880222,0.00041936993,0.00057438726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074857887,0.00094465236,0.0014377553,0.0049289824,0.0038822428,0.004141114,0.0020641172,0.0016295173,0.005810763],"category_scores_gemma":[0.004037115,0.0010356811,0.001025802,0.0018265384,0.0034427242,0.0028753881,0.0022524677,0.0030462793,0.000569461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007406172,0.000031187854,0.00057024905,0.000040998042,0.0000306068,0.0001481091,0.00028625192,0.0021009904,0.0014224502,0.99188566,0.0012196066,0.0021898032],"study_design_scores_gemma":[0.000027865597,0.00001061019,0.00089496933,0.000022773405,0.00002241388,0.00011232686,0.0001785884,0.0082517825,0.0006410341,0.9885133,0.0013108734,0.000013454107],"about_ca_topic_score_codex":0.0018193332,"about_ca_topic_score_gemma":0.0019003863,"teacher_disagreement_score":0.005810763,"about_ca_system_score_codex":0.0017852776,"about_ca_system_score_gemma":0.0009142883,"threshold_uncertainty_score":0.019438982},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32627174,0.0010400602,0.13794649,0.004039699,0.00057974085,0.00014174964,0.0011350262,0.0011380909,0.5277074],"genre_scores_gemma":[0.9097772,0.0006211577,0.017364485,0.00093586807,0.00040616083,0.00009415173,0.0009953233,0.00041617826,0.06938945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999178,0.00016020337,0.000036809404,0.0002690188,0.00019842655,0.00015751402],"domain_scores_gemma":[0.9977247,0.0008461314,0.0002640493,0.0004778106,0.00037612274,0.00031123025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071302435,0.0009244089,0.0008109014,0.0025522923,0.003394071,0.002369094,0.0012856422,0.0011748939,0.019631771],"category_scores_gemma":[0.0027778482,0.00056245626,0.0009414842,0.0015606565,0.0024158775,0.0049045025,0.0019342067,0.0035264248,0.0018371037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022852264,0.00001402433,0.00010912118,0.000018160936,0.000004457597,0.00006483091,0.000119786644,0.00019257958,0.00068272883,0.994395,0.0013199787,0.0030565131],"study_design_scores_gemma":[0.000007313017,0.000009500496,0.00019765465,0.000007479589,0.000008010825,0.0001366557,0.000069666225,0.0008786855,0.0006567752,0.99239177,0.00562986,0.000006641473],"about_ca_topic_score_codex":0.00090754626,"about_ca_topic_score_gemma":0.0011162822,"teacher_disagreement_score":0.019631771,"about_ca_system_score_codex":0.0009125602,"about_ca_system_score_gemma":0.0004036287,"threshold_uncertainty_score":0.06567484},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67877364,0.0014935788,0.28043097,0.005010258,0.0002163642,0.00023663488,0.0006870547,0.0005109281,0.03264053],"genre_scores_gemma":[0.97785795,0.0005745978,0.014574263,0.00025738022,0.00011906811,0.00013936439,0.00013723357,0.000103599414,0.006236665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802786,0.00080076884,0.000100916055,0.00037947588,0.00031054288,0.00038046806],"domain_scores_gemma":[0.94339216,0.044845384,0.0045110425,0.0024065615,0.002323858,0.0025210136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047844206,0.000564499,0.0025186113,0.0024761858,0.0013520251,0.003921231,0.003124002,0.003103657,0.0073906905],"category_scores_gemma":[0.072064035,0.0013779334,0.0010405926,0.0015702097,0.003983946,0.008456647,0.0024651578,0.003538192,0.0006446314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026330675,0.000055034827,0.0019350887,0.0001099584,0.000047206766,0.00008167869,0.0004006371,0.035798773,0.0017467364,0.94963896,0.0023398548,0.007582829],"study_design_scores_gemma":[0.0000801514,0.00003673538,0.0010532022,0.00003383405,0.00002405425,0.00008408916,0.00010869126,0.18504092,0.00053143606,0.8123261,0.00063634897,0.000044477503],"about_ca_topic_score_codex":0.003619453,"about_ca_topic_score_gemma":0.0017910635,"teacher_disagreement_score":0.0073906905,"about_ca_system_score_codex":0.0026344778,"about_ca_system_score_gemma":0.0026229462,"threshold_uncertainty_score":0.025302708},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39158145,0.0015091496,0.352492,0.004230765,0.0004022891,0.0000973865,0.0011997357,0.0004558778,0.24803138],"genre_scores_gemma":[0.82399654,0.0017214215,0.053332448,0.0009942835,0.0005887452,0.00014048019,0.0014355705,0.0005163521,0.11727405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885464,0.0003200156,0.00007214225,0.00033093084,0.00024458717,0.0001776605],"domain_scores_gemma":[0.99440116,0.0030881525,0.00048011515,0.00078885246,0.0006982104,0.00054355786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001120886,0.0006722125,0.00096808246,0.0024027766,0.002458594,0.004591533,0.0014125643,0.0015555279,0.022856738],"category_scores_gemma":[0.008116459,0.0010727871,0.0008350974,0.003097271,0.0031770002,0.012837236,0.0037056466,0.0048008794,0.0021980456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045988734,0.000024320627,0.0001308435,0.000032873875,0.0000056006033,0.00007683426,0.00022293985,0.0005130414,0.00039628195,0.99254155,0.0009925093,0.0050171777],"study_design_scores_gemma":[0.000008886665,0.0000052268515,0.00010683434,0.000010396451,0.000006808257,0.00007966726,0.00011067287,0.0017785792,0.0002506723,0.9952181,0.0024193877,0.0000047697117],"about_ca_topic_score_codex":0.00095287367,"about_ca_topic_score_gemma":0.000970171,"teacher_disagreement_score":0.022856738,"about_ca_system_score_codex":0.0012437132,"about_ca_system_score_gemma":0.0005403432,"threshold_uncertainty_score":0.0764634},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047930054,0.00029713794,0.93210876,0.00068205124,0.0002648224,0.00016466326,0.0003662095,0.0008543836,0.017331867],"genre_scores_gemma":[0.6527413,0.00063108205,0.3186389,0.00044137606,0.00017522584,0.00034254594,0.0006737964,0.0003668196,0.025988847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990428,0.0003495868,0.00005516769,0.00016021119,0.00024507716,0.00014717488],"domain_scores_gemma":[0.9968341,0.0011922453,0.00021148061,0.0011180562,0.00040951298,0.00023461449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012241027,0.0004699693,0.00075534696,0.0009310153,0.0011556455,0.001892895,0.0015937915,0.0009855157,0.007050113],"category_scores_gemma":[0.005327885,0.0003658011,0.00065684214,0.001113872,0.0011434006,0.0031644488,0.002622204,0.0018177469,0.0010113987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035603726,0.0001208342,0.00031275034,0.0001630925,0.000034788733,0.000075003336,0.00033387454,0.14291443,0.008064096,0.7675741,0.008749441,0.07130148],"study_design_scores_gemma":[0.00007682238,0.000106562664,0.00014916813,0.000043060056,0.00003671657,0.00007885739,0.000137701,0.6126072,0.004113077,0.3718126,0.010793027,0.00004514721],"about_ca_topic_score_codex":0.0029180022,"about_ca_topic_score_gemma":0.005723141,"teacher_disagreement_score":0.007050113,"about_ca_system_score_codex":0.0022306703,"about_ca_system_score_gemma":0.0012661302,"threshold_uncertainty_score":0.023585021},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025538988,0.0005560302,0.96794575,0.0004176569,0.000107471635,0.00011336824,0.00014167585,0.00094253913,0.004236559],"genre_scores_gemma":[0.22255518,0.00030999552,0.7686149,0.00024582376,0.00011486693,0.00036857213,0.0006215922,0.00026098042,0.0069081783],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921477,0.00020855291,0.000032586533,0.00017084695,0.00025430298,0.00011882148],"domain_scores_gemma":[0.998161,0.0010971924,0.00012048687,0.0002523533,0.00022297578,0.00014587132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010745089,0.00075430685,0.001879039,0.0012027165,0.0006722346,0.0013869044,0.0029323227,0.0019287686,0.0076883314],"category_scores_gemma":[0.004668223,0.0005651383,0.00091810705,0.0019178075,0.0006383163,0.002595907,0.0020603656,0.0026973293,0.0014751835],"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.00088358804,0.000623999,0.001200323,0.00030334233,0.000106972344,0.00013437738,0.0001971952,0.44437793,0.0062360903,0.04879716,0.014631779,0.48250723],"study_design_scores_gemma":[0.000099821984,0.00008334276,0.00014099688,0.000014004906,0.00001922757,0.000046882986,0.000023565502,0.9864427,0.0006222925,0.0112158405,0.0012818356,0.000009546418],"about_ca_topic_score_codex":0.0033226176,"about_ca_topic_score_gemma":0.0043602847,"teacher_disagreement_score":0.0076883314,"about_ca_system_score_codex":0.0013080139,"about_ca_system_score_gemma":0.0014547728,"threshold_uncertainty_score":0.02572006},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49710765,0.0009659855,0.37134248,0.009382079,0.00019683366,0.00016073724,0.0005194345,0.00031257587,0.12001222],"genre_scores_gemma":[0.94903505,0.0006821917,0.027533868,0.0006343045,0.0001309608,0.00017671037,0.00025771768,0.000089322675,0.021459924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891925,0.0005237776,0.000033584725,0.00015251581,0.00014912536,0.0002218637],"domain_scores_gemma":[0.9948992,0.0035005019,0.00035690732,0.00026987682,0.00021904244,0.0007545482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012094151,0.00070833525,0.0011964405,0.0010132794,0.0016148961,0.004291351,0.0016881821,0.0023198954,0.0066328826],"category_scores_gemma":[0.0056588887,0.00051756715,0.00053094915,0.0013727209,0.0036331788,0.0070070964,0.002809727,0.0024637475,0.00060877006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007523012,0.000030626194,0.00015603659,0.000036086756,0.0000058845094,0.00003480648,0.000118739445,0.0063185575,0.0004737933,0.9864269,0.0018323875,0.0044909986],"study_design_scores_gemma":[0.00003791916,0.000014444219,0.000092265036,0.000011411965,0.0000054544075,0.000027884209,0.00010326338,0.03198614,0.00019389213,0.96606034,0.0014584959,0.000008543589],"about_ca_topic_score_codex":0.002618854,"about_ca_topic_score_gemma":0.0019029215,"teacher_disagreement_score":0.0066328826,"about_ca_system_score_codex":0.0023810486,"about_ca_system_score_gemma":0.0012330966,"threshold_uncertainty_score":0.02218926},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51155746,0.0007644666,0.4542066,0.0024594653,0.00018960488,0.00026910738,0.0057361796,0.0010310565,0.023786057],"genre_scores_gemma":[0.86856896,0.0003636151,0.11494702,0.0005977499,0.00026741327,0.00035823972,0.007898317,0.00033645803,0.006662137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983329,0.0004966156,0.00009646155,0.00054338307,0.00038646557,0.00014415942],"domain_scores_gemma":[0.99223524,0.0040973127,0.00059794163,0.0016965948,0.00082646724,0.00054645713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011574759,0.00069292524,0.0020601049,0.0019699333,0.0014840397,0.0029118985,0.002111564,0.0014132687,0.005654013],"category_scores_gemma":[0.008246948,0.0010173643,0.0010020823,0.0019396603,0.001385466,0.00368163,0.0017055325,0.0026707724,0.0007247197],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001409502,0.00045038084,0.009480559,0.0011641247,0.0005452335,0.0005616638,0.0012302663,0.020422826,0.017727047,0.8016517,0.02946825,0.11588849],"study_design_scores_gemma":[0.00016178886,0.000104587234,0.003687775,0.00006295689,0.00013601076,0.0004623082,0.0002129268,0.07921178,0.0043572406,0.90414804,0.0074270656,0.000027556262],"about_ca_topic_score_codex":0.0007428405,"about_ca_topic_score_gemma":0.0013045396,"teacher_disagreement_score":0.005654013,"about_ca_system_score_codex":0.00085646927,"about_ca_system_score_gemma":0.0011061071,"threshold_uncertainty_score":0.01891452},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19204779,0.0034027742,0.31015497,0.0074519273,0.0018035918,0.00009191859,0.000457232,0.0007491081,0.48384055],"genre_scores_gemma":[0.89584094,0.0014601881,0.026324809,0.0009931352,0.0011788341,0.00012549407,0.00027975102,0.000256013,0.07354083],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994041,0.00013245658,0.000032333457,0.00022500317,0.00011897463,0.00008719566],"domain_scores_gemma":[0.9992255,0.0003474027,0.00006387179,0.00014061399,0.00013749901,0.00008513968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050496345,0.00048269556,0.0006293347,0.0010965029,0.00175068,0.002566449,0.00062032003,0.0011039575,0.010933702],"category_scores_gemma":[0.0019068624,0.00040413364,0.00070924073,0.00096715416,0.0030485364,0.0058921636,0.0022042622,0.0024841216,0.0024831751],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012937809,0.0000055917935,0.000032512122,0.00001197506,0.0000016244547,0.00004189692,0.00013475053,0.00009148362,0.00050320366,0.99370015,0.0007110911,0.004752798],"study_design_scores_gemma":[0.000007052418,0.0000100182415,0.00006115347,0.0000047089757,0.0000023705172,0.000121622485,0.0000482401,0.00065027166,0.000520424,0.9904867,0.008081922,0.0000055392297],"about_ca_topic_score_codex":0.00030717236,"about_ca_topic_score_gemma":0.00013790464,"teacher_disagreement_score":0.010933702,"about_ca_system_score_codex":0.0006773969,"about_ca_system_score_gemma":0.00049576507,"threshold_uncertainty_score":0.036576867},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013393028,0.00063575077,0.9136911,0.0016742162,0.00017215543,0.000052244563,0.00028803706,0.00019443635,0.06989909],"genre_scores_gemma":[0.70875883,0.0021735204,0.13087022,0.0013089174,0.00079151115,0.000484839,0.0010149262,0.00038635204,0.15421088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861944,0.00058593904,0.000040128747,0.0003294543,0.00026986774,0.00015516956],"domain_scores_gemma":[0.9951931,0.002752659,0.00032008704,0.000762911,0.0007188455,0.0002524314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017874142,0.0010673479,0.0012568538,0.0009403658,0.0009564884,0.0024541775,0.0027326064,0.002360085,0.014795371],"category_scores_gemma":[0.012103697,0.0007423433,0.001241328,0.0010328182,0.002647306,0.004488802,0.002508122,0.0034235758,0.0034432802],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020419542,0.000015757074,0.00017502,0.000030641317,0.000019268797,0.00005174785,0.00006158898,0.02406911,0.00021772744,0.96658474,0.0027226277,0.0060313535],"study_design_scores_gemma":[0.000013254552,0.000012822102,0.00011651627,0.000013345801,0.000012050524,0.00007255277,0.000020822967,0.17670497,0.00018564053,0.81844544,0.004386702,0.000015870932],"about_ca_topic_score_codex":0.0027419236,"about_ca_topic_score_gemma":0.001945292,"teacher_disagreement_score":0.014795371,"about_ca_system_score_codex":0.0014887176,"about_ca_system_score_gemma":0.0018701045,"threshold_uncertainty_score":0.0494954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11686945,0.001464748,0.8589278,0.0017285816,0.00022828889,0.0004545092,0.00078793365,0.0005072237,0.019031579],"genre_scores_gemma":[0.9052508,0.00082465913,0.06592158,0.0002236081,0.00012448372,0.00035160413,0.00047533674,0.00015408322,0.026673742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983158,0.0007035441,0.00008206542,0.0003403347,0.0001734972,0.00038472883],"domain_scores_gemma":[0.9967014,0.002158198,0.00035287163,0.00014366028,0.00023140076,0.00041241103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003091393,0.0021155544,0.004700326,0.0015117712,0.00095403066,0.0031363799,0.004632369,0.0047358787,0.010324323],"category_scores_gemma":[0.0066860956,0.0017471031,0.0018267592,0.0018462325,0.0015365368,0.0028028523,0.0023314918,0.0026231408,0.0008597108],"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.00025006165,0.00009349808,0.0002133022,0.00015409422,0.00009117155,0.00017300974,0.00007583506,0.95515555,0.00084965146,0.032705277,0.0015614752,0.008677035],"study_design_scores_gemma":[0.000035034416,0.000087270666,0.00009780835,0.000012226025,0.000023973264,0.000020750396,0.000031570857,0.9871453,0.00011250556,0.011874403,0.0005417906,0.000017303955],"about_ca_topic_score_codex":0.013237414,"about_ca_topic_score_gemma":0.005724452,"teacher_disagreement_score":0.013237414,"about_ca_system_score_codex":0.002043212,"about_ca_system_score_gemma":0.001697438,"threshold_uncertainty_score":0.03453833},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05533687,0.00095372443,0.28598097,0.0022666545,0.0008025101,0.00020939419,0.019986987,0.013239871,0.6212231],"genre_scores_gemma":[0.512713,0.0016785921,0.087358855,0.0009923491,0.00037522666,0.00017575864,0.040288344,0.009894546,0.34652343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977654,0.000026809359,0.000008822873,0.00006586488,0.00006905997,0.000052926636],"domain_scores_gemma":[0.9991203,0.0002476955,0.000060681356,0.00019862335,0.0002318814,0.00014085566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027404155,0.0005179035,0.00037432785,0.0012521496,0.0010255763,0.002138078,0.00094820117,0.00043824108,0.088999376],"category_scores_gemma":[0.0021911613,0.00037734825,0.000398632,0.0016296089,0.0006978233,0.0022948594,0.001299732,0.0012211297,0.024317017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021662492,0.00004782585,0.000840765,0.00031968314,0.000015190105,0.00033202406,0.00039840382,0.0033356575,0.004615797,0.67949045,0.24656719,0.06382044],"study_design_scores_gemma":[0.00004810122,0.000026963715,0.0009939302,0.000085676285,0.000026239919,0.00040340083,0.00030349285,0.0077679576,0.009763065,0.5099706,0.47057614,0.000034494915],"about_ca_topic_score_codex":0.004473376,"about_ca_topic_score_gemma":0.005880684,"teacher_disagreement_score":0.088999376,"about_ca_system_score_codex":0.0012310217,"about_ca_system_score_gemma":0.0007821155,"threshold_uncertainty_score":0.2977326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8666021,0.00081030064,0.09333898,0.0011414969,0.00009745679,0.000073426454,0.0008711698,0.0002739668,0.03679118],"genre_scores_gemma":[0.9529123,0.00057370344,0.030043652,0.00031410746,0.0001347732,0.00009250371,0.0009379503,0.00009741431,0.0148937395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994473,0.00010347785,0.000032064807,0.0001651825,0.00015584462,0.00009617787],"domain_scores_gemma":[0.99628687,0.0020141557,0.0005288948,0.00022694362,0.00036266385,0.00058044674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047079503,0.00036163058,0.00065384206,0.0015987251,0.0014870132,0.001954355,0.0010991744,0.00075816194,0.0039524683],"category_scores_gemma":[0.0029344803,0.0005872656,0.00066903635,0.001684472,0.0010508867,0.002461468,0.00093160354,0.0017503285,0.00048314023],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024322106,0.00017821386,0.0029945446,0.00019413847,0.000051954026,0.0006595759,0.0010480605,0.00681001,0.008528683,0.9595443,0.0036052668,0.016141953],"study_design_scores_gemma":[0.00007056959,0.000040770436,0.0026304126,0.000022987697,0.000049165687,0.00082923274,0.00033750583,0.030289888,0.002459049,0.95873123,0.00451807,0.000020919922],"about_ca_topic_score_codex":0.0010735067,"about_ca_topic_score_gemma":0.0017572849,"teacher_disagreement_score":0.0039524683,"about_ca_system_score_codex":0.0008926182,"about_ca_system_score_gemma":0.00040918638,"threshold_uncertainty_score":0.013222337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19898625,0.03169816,0.5107878,0.06165336,0.010636497,0.00036443063,0.006094814,0.0022300088,0.17754877],"genre_scores_gemma":[0.7447968,0.017159546,0.18063305,0.007731248,0.016704831,0.0007181343,0.0029293383,0.0019884927,0.02733845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619234,0.0009937042,0.00024476112,0.0012548015,0.000878634,0.0004357783],"domain_scores_gemma":[0.9471391,0.044413995,0.0011302584,0.004263231,0.0015145178,0.0015389051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042299405,0.001702554,0.0030502237,0.0029681313,0.0021893815,0.0041506817,0.0050535714,0.0035541872,0.012144996],"category_scores_gemma":[0.03246711,0.0014500252,0.0029713789,0.004818251,0.0043534404,0.01633321,0.0047164685,0.009216321,0.0016956207],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001627994,0.00023237207,0.0027705024,0.0020019512,0.0002742056,0.00060439686,0.0006995093,0.029524177,0.022879545,0.80408347,0.05812051,0.077181436],"study_design_scores_gemma":[0.000101728176,0.00009671598,0.0009827443,0.00009032132,0.00010984229,0.0002523826,0.000111024674,0.02305819,0.00350774,0.95902973,0.012608155,0.00005138791],"about_ca_topic_score_codex":0.00149041,"about_ca_topic_score_gemma":0.0015611657,"teacher_disagreement_score":0.012144996,"about_ca_system_score_codex":0.00296386,"about_ca_system_score_gemma":0.0015123736,"threshold_uncertainty_score":0.04062903},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010882873,0.00047844878,0.23578909,0.0073549366,0.0017696976,0.00008816951,0.0052933902,0.0045524104,0.73379093],"genre_scores_gemma":[0.396506,0.0018024474,0.15375361,0.0059838383,0.0020867211,0.0004276817,0.010634928,0.01312855,0.41567618],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942774,0.0001538058,0.0000389129,0.0001576344,0.00015933791,0.000062574676],"domain_scores_gemma":[0.998264,0.0007509955,0.0001012525,0.00041526213,0.00034167932,0.00012687077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071396545,0.00034134387,0.0005012061,0.0010772444,0.0013263677,0.0032109458,0.0009483691,0.0009826673,0.13543288],"category_scores_gemma":[0.0029001117,0.00042604335,0.00078037195,0.0012449399,0.0018594797,0.00500467,0.0013952206,0.0024347317,0.03035011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003294385,0.000013836766,0.000096626274,0.0001059124,0.000003663627,0.00007357757,0.00026399645,0.00019549635,0.0013048598,0.911444,0.07425657,0.0122085465],"study_design_scores_gemma":[0.000035363842,0.000019852308,0.0006422806,0.00006250527,0.000007518411,0.00045507785,0.00014323505,0.0028896169,0.0035057466,0.63044566,0.36174956,0.000043595952],"about_ca_topic_score_codex":0.0017909808,"about_ca_topic_score_gemma":0.001749941,"teacher_disagreement_score":0.13543288,"about_ca_system_score_codex":0.0012971133,"about_ca_system_score_gemma":0.00054701685,"threshold_uncertainty_score":0.45306814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48910138,0.002805262,0.422266,0.0029173114,0.0006754704,0.00012202667,0.00089364016,0.00036960238,0.08084935],"genre_scores_gemma":[0.9255833,0.0006908007,0.062876366,0.00084669923,0.00016427434,0.00012126873,0.0008379581,0.00008122318,0.008798055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99522996,0.0013782213,0.00046707646,0.0010802823,0.0013448613,0.000499593],"domain_scores_gemma":[0.9894449,0.004300104,0.0013946688,0.0025118876,0.0014200585,0.0009283992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020901682,0.00055587135,0.0013381578,0.0010513108,0.002319152,0.00252362,0.0012632543,0.0018002952,0.006306997],"category_scores_gemma":[0.019236809,0.0006833441,0.000852775,0.0013653908,0.0045564035,0.0075909942,0.0050696577,0.0023201515,0.0013394954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052583957,0.000057083067,0.0061999345,0.00026215098,0.00007652332,0.00086869753,0.001059163,0.008461478,0.008276196,0.9250833,0.00615443,0.042975154],"study_design_scores_gemma":[0.00007174238,0.00020999704,0.002856228,0.00006840537,0.00003393854,0.00360018,0.0011565143,0.019784037,0.0044756066,0.9168898,0.050783552,0.00007013777],"about_ca_topic_score_codex":0.00081839977,"about_ca_topic_score_gemma":0.0008815264,"teacher_disagreement_score":0.006306997,"about_ca_system_score_codex":0.0006307813,"about_ca_system_score_gemma":0.00033052402,"threshold_uncertainty_score":0.021099031},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022150194,0.00054274837,0.9701413,0.00037067485,0.0001746532,0.0001453934,0.00028778697,0.0011945869,0.0049926727],"genre_scores_gemma":[0.3378974,0.0007961639,0.6481951,0.00046401762,0.00052422215,0.00039177836,0.0024221682,0.0013893836,0.007919807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98777676,0.0025226923,0.0010361868,0.0033794378,0.004157757,0.0011271563],"domain_scores_gemma":[0.97101015,0.014832379,0.0012729156,0.009141668,0.003129087,0.0006137774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004846189,0.0015743665,0.0020746319,0.0031928641,0.0016994261,0.0044153067,0.005601281,0.0017855944,0.007675613],"category_scores_gemma":[0.034997936,0.0012068661,0.002921724,0.0057897107,0.0038177224,0.012865812,0.0053833523,0.007074663,0.0021554756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001176229,0.00037974733,0.0013614255,0.00043955466,0.00015228562,0.00027857008,0.00088179996,0.071224496,0.008398934,0.6781884,0.0077248416,0.22979362],"study_design_scores_gemma":[0.00009617605,0.0001089434,0.00029799662,0.000043164342,0.00007820504,0.00018176992,0.00014015063,0.14902408,0.0055226497,0.8384763,0.0059865415,0.000043982243],"about_ca_topic_score_codex":0.0028392542,"about_ca_topic_score_gemma":0.0035422896,"teacher_disagreement_score":0.007675613,"about_ca_system_score_codex":0.00261167,"about_ca_system_score_gemma":0.0026239294,"threshold_uncertainty_score":0.025677502},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056418665,0.64572936,0.25616443,0.0059249066,0.0007079666,0.00009632621,0.00071172375,0.0002221307,0.034024466],"genre_scores_gemma":[0.3964066,0.51063806,0.07987632,0.0015897204,0.004509993,0.0001339482,0.0012540794,0.00015025026,0.0054410603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966742,0.000744022,0.00024461155,0.001310458,0.00085016096,0.00017659957],"domain_scores_gemma":[0.98482853,0.012416707,0.0006157138,0.0010074831,0.0008002571,0.00033128602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002802178,0.0010096186,0.0031187774,0.005337929,0.0014777249,0.0048192935,0.0024553451,0.0025196485,0.003772002],"category_scores_gemma":[0.010191458,0.0011182975,0.0014204294,0.013329386,0.0049138386,0.014232571,0.003332967,0.003029004,0.0008378992],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015535936,0.00031184187,0.009786429,0.0061336453,0.0002499107,0.0002719312,0.0012647943,0.015423755,0.0014690714,0.54752177,0.007351342,0.4100602],"study_design_scores_gemma":[0.000042972944,0.00023729459,0.005056791,0.00096978544,0.0002169855,0.0017626224,0.0014312101,0.02472911,0.0012022672,0.86897206,0.09527355,0.00010539961],"about_ca_topic_score_codex":0.0020395943,"about_ca_topic_score_gemma":0.0015257819,"teacher_disagreement_score":0.005337929,"about_ca_system_score_codex":0.0018500965,"about_ca_system_score_gemma":0.001361094,"threshold_uncertainty_score":0.014819503},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48008704,0.00029717057,0.50543004,0.0006893735,0.00012707018,0.00007134287,0.00018231006,0.0013561728,0.011759471],"genre_scores_gemma":[0.9368954,0.0000812467,0.057495918,0.00007521748,0.000011873337,0.000072569426,0.000062345294,0.00008031194,0.005225096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997234,0.000068543726,0.000016400978,0.00008638559,0.000052223702,0.000053048483],"domain_scores_gemma":[0.9986815,0.0008435773,0.000081621845,0.00016829338,0.00011139437,0.00011352364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033014358,0.00037188677,0.00073297886,0.0005550642,0.00086051686,0.0009767979,0.0011898477,0.0012474622,0.0043542567],"category_scores_gemma":[0.0020957044,0.00040293843,0.00063398527,0.00046040703,0.0012064248,0.0013377845,0.0015003134,0.0008695829,0.00034256766],"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.0005483016,0.00013591,0.0016280499,0.00017445699,0.00007393423,0.00045238767,0.0002454908,0.81143206,0.017320223,0.13045003,0.0011896826,0.03634951],"study_design_scores_gemma":[0.000034253186,0.0000631879,0.000119556506,0.000009906182,0.000012844921,0.000039239312,0.000020403364,0.9590362,0.001993901,0.038213387,0.00044410507,0.000013062313],"about_ca_topic_score_codex":0.0027413785,"about_ca_topic_score_gemma":0.0031080225,"teacher_disagreement_score":0.0043542567,"about_ca_system_score_codex":0.00061737245,"about_ca_system_score_gemma":0.0008006319,"threshold_uncertainty_score":0.014566481},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08898846,0.0010857661,0.88571614,0.00057781383,0.00012777405,0.00011622372,0.00045526464,0.00010164996,0.022830905],"genre_scores_gemma":[0.8323734,0.0026985204,0.15774149,0.00020118043,0.00033120115,0.00027529252,0.0009478431,0.00010117985,0.005329948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985089,0.00028782687,0.00007932446,0.00023770654,0.00058763317,0.00029858787],"domain_scores_gemma":[0.9959085,0.002555243,0.0005606153,0.00037027546,0.00036451852,0.00024087897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013530557,0.000923837,0.00080873223,0.001474256,0.00076575263,0.0033066578,0.0011407118,0.0007069821,0.009634271],"category_scores_gemma":[0.0075252643,0.0005380828,0.0015449403,0.0021149516,0.0027670774,0.0037771876,0.002343894,0.0030269686,0.0005816516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007731702,0.00005230229,0.0020963117,0.00015115779,0.00003362124,0.00019183983,0.00029063274,0.098576196,0.002993511,0.8593301,0.0018036324,0.034403246],"study_design_scores_gemma":[0.000024522265,0.000101509155,0.001502256,0.00011712861,0.00003553374,0.00018323299,0.00032161167,0.49997193,0.002438485,0.49015686,0.0051060584,0.000040828545],"about_ca_topic_score_codex":0.0027393862,"about_ca_topic_score_gemma":0.0015598232,"teacher_disagreement_score":0.009634271,"about_ca_system_score_codex":0.0019054462,"about_ca_system_score_gemma":0.0008543904,"threshold_uncertainty_score":0.0322299},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17691912,0.0006298776,0.7734595,0.0010884992,0.0002484894,0.0003417043,0.0008226191,0.00080391695,0.045686282],"genre_scores_gemma":[0.8245184,0.0013109422,0.13917477,0.0006719841,0.00027442691,0.00030801605,0.0018669431,0.00056175404,0.031312812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986524,0.00017270539,0.00006530653,0.00048126891,0.00026996233,0.00035833882],"domain_scores_gemma":[0.996912,0.0012122653,0.00047787966,0.00052172656,0.0005268958,0.0003491524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005318953,0.00088429154,0.00088049384,0.00233179,0.0019456466,0.0029531212,0.0015515743,0.0012395451,0.008642568],"category_scores_gemma":[0.005789074,0.0006470078,0.0007545541,0.002317847,0.0022875553,0.0067379903,0.0029958782,0.0021351248,0.001625087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014268125,0.00006538906,0.0019393752,0.00021159563,0.0000377217,0.0007988936,0.00075480825,0.037391637,0.0048940107,0.8826931,0.006751751,0.06431911],"study_design_scores_gemma":[0.00002008524,0.000038531878,0.0007450565,0.000058587473,0.000025981055,0.0006879569,0.0004646241,0.09884005,0.0029957977,0.874741,0.021344654,0.000037655587],"about_ca_topic_score_codex":0.0044130036,"about_ca_topic_score_gemma":0.0035926192,"teacher_disagreement_score":0.008642568,"about_ca_system_score_codex":0.0013990792,"about_ca_system_score_gemma":0.0007969539,"threshold_uncertainty_score":0.028912246},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20512092,0.00013907005,0.75482416,0.00038714695,0.0002391295,0.00010353068,0.00032229436,0.0014318163,0.037431896],"genre_scores_gemma":[0.576723,0.00033596135,0.40526545,0.0003169714,0.00010241758,0.0001068103,0.0010925302,0.0011250555,0.014931868],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997228,0.000084736675,0.0000101163,0.00007212243,0.000055759327,0.000054477485],"domain_scores_gemma":[0.9992176,0.00027234663,0.00005634869,0.00023953413,0.00011992049,0.00009420696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030782406,0.00061160343,0.00044068,0.0008491275,0.0009224416,0.00090424594,0.0006418065,0.00054634287,0.008088973],"category_scores_gemma":[0.0014537057,0.0003988521,0.00060760847,0.00079575647,0.00073514675,0.0016538478,0.001444284,0.0013219996,0.0016406548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017739012,0.00028993413,0.0013189927,0.00021877447,0.000035590463,0.0003515166,0.0006486124,0.031645156,0.036431395,0.80003905,0.007845677,0.12099791],"study_design_scores_gemma":[0.00002014839,0.00004422316,0.0004449331,0.000032885495,0.000023087074,0.00015623128,0.00035693412,0.11284849,0.013293083,0.858967,0.013795439,0.000017543463],"about_ca_topic_score_codex":0.0007392132,"about_ca_topic_score_gemma":0.002005782,"teacher_disagreement_score":0.008088973,"about_ca_system_score_codex":0.00040936584,"about_ca_system_score_gemma":0.0003443346,"threshold_uncertainty_score":0.02706033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04809141,0.0064945607,0.84196454,0.005135781,0.0019787673,0.00008755529,0.0002218727,0.00087111327,0.09515435],"genre_scores_gemma":[0.7848009,0.004383034,0.15847197,0.0021680216,0.0028348763,0.00036076122,0.0003673337,0.0013740148,0.04523909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980332,0.00076873595,0.00007248336,0.00033630477,0.00055227615,0.00023699293],"domain_scores_gemma":[0.99171513,0.0051186415,0.00039520726,0.0010865544,0.0012075041,0.00047698154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036535957,0.0018690572,0.0021133912,0.0043587633,0.0026830647,0.0034142355,0.002538992,0.0026823415,0.0118277185],"category_scores_gemma":[0.022794064,0.0005752967,0.0013768617,0.003365928,0.004500014,0.007034138,0.0059265695,0.0061097834,0.0026935248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009737894,0.00006183853,0.00058224506,0.00011578205,0.000037046913,0.00006152018,0.00018828084,0.029753027,0.0013202678,0.9211851,0.009187758,0.037409887],"study_design_scores_gemma":[0.000010141081,0.00003019551,0.00022810807,0.000045196917,0.000017826382,0.000037576698,0.000047523874,0.20015314,0.0008336771,0.7922011,0.0063612834,0.000034193195],"about_ca_topic_score_codex":0.0030749706,"about_ca_topic_score_gemma":0.004130038,"teacher_disagreement_score":0.0118277185,"about_ca_system_score_codex":0.0024533244,"about_ca_system_score_gemma":0.001429614,"threshold_uncertainty_score":0.03956765},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9427665,0.00031784427,0.032968517,0.00049894187,0.000036974685,0.000046569832,0.0004171558,0.00011221378,0.022835396],"genre_scores_gemma":[0.98634964,0.0003304643,0.005819643,0.0001269867,0.00005689172,0.0000507386,0.0005098032,0.000049636983,0.0067061945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99964356,0.00009238439,0.000015892983,0.00006599682,0.00008787354,0.00009432814],"domain_scores_gemma":[0.9967957,0.0019616869,0.00046601723,0.0002136875,0.00023371245,0.0003291347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029401292,0.0003142048,0.0005516851,0.0011490237,0.0011081273,0.0018253252,0.0006903704,0.00073912693,0.0043935124],"category_scores_gemma":[0.002954934,0.00058357045,0.0004985425,0.0014815129,0.0011696172,0.0013688639,0.000960821,0.0007274519,0.00036877484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001847734,0.00006394776,0.0039249784,0.00011284634,0.000043665594,0.0004941464,0.0014505106,0.012230907,0.008821315,0.9560867,0.0031089683,0.013477312],"study_design_scores_gemma":[0.000043515367,0.0000360136,0.0028610716,0.000021368101,0.000023901008,0.00023201725,0.0004225336,0.029335583,0.0014389259,0.96284443,0.0027274878,0.000013132454],"about_ca_topic_score_codex":0.0034955419,"about_ca_topic_score_gemma":0.004088497,"teacher_disagreement_score":0.0043935124,"about_ca_system_score_codex":0.00091721734,"about_ca_system_score_gemma":0.0005504364,"threshold_uncertainty_score":0.01469779},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31688842,0.00115256,0.5715141,0.0022941162,0.00045276602,0.00010392397,0.0002829263,0.00046786867,0.1068433],"genre_scores_gemma":[0.92184055,0.0007127242,0.035942275,0.00038083948,0.00040631476,0.00014735547,0.00025914476,0.00024958313,0.040061295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99801874,0.0007780471,0.00011379592,0.00027855035,0.00058496144,0.00022589468],"domain_scores_gemma":[0.9900259,0.005990947,0.0008909152,0.0018030104,0.00076937606,0.0005198553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002525219,0.00062090234,0.0012698283,0.0022040766,0.0019586158,0.0036200802,0.0012796938,0.0017189155,0.010905635],"category_scores_gemma":[0.013818622,0.0007794021,0.0008830442,0.0023396204,0.0030938527,0.0073516075,0.0025937771,0.0026998266,0.0011432568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018027487,0.00001144905,0.000083980965,0.000010042414,0.000004167162,0.000045052326,0.000072768795,0.002651314,0.000142268,0.994886,0.00029863472,0.0017762441],"study_design_scores_gemma":[0.000008765443,0.000008938923,0.00008283352,0.000007272008,0.0000054419916,0.0000481246,0.000026334668,0.016352432,0.0002466216,0.9822589,0.00094886846,0.0000055681603],"about_ca_topic_score_codex":0.00072005676,"about_ca_topic_score_gemma":0.0005595693,"teacher_disagreement_score":0.010905635,"about_ca_system_score_codex":0.0009428634,"about_ca_system_score_gemma":0.0006198029,"threshold_uncertainty_score":0.03648293},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049025763,0.0010550162,0.40293658,0.0037354697,0.0012278276,0.00026534343,0.0010239043,0.0018350609,0.5388951],"genre_scores_gemma":[0.65221554,0.0015854776,0.06785961,0.0023274184,0.0008850344,0.00046331485,0.002003941,0.0015287437,0.27113086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985983,0.0002788615,0.000073291936,0.00037118877,0.00041959475,0.0002586799],"domain_scores_gemma":[0.9964684,0.001472257,0.00012036977,0.0006085827,0.0010054667,0.00032493856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095302,0.0009959637,0.000957164,0.0019033862,0.0021117567,0.0022833277,0.0009991479,0.0013519942,0.046375677],"category_scores_gemma":[0.0071314764,0.0005020603,0.0010302186,0.0012711649,0.0024512585,0.0059070326,0.003990085,0.0032441267,0.01004983],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008303984,0.00002445389,0.00009364957,0.00007875449,0.000007546755,0.00008362292,0.00019191157,0.0006929705,0.0022758495,0.9763049,0.005485904,0.014677373],"study_design_scores_gemma":[0.00001647402,0.000029431709,0.00006771872,0.000024952249,0.000006706213,0.00016773657,0.00010250442,0.0051538628,0.0041053,0.9664397,0.02387424,0.00001128429],"about_ca_topic_score_codex":0.00089837576,"about_ca_topic_score_gemma":0.000562188,"teacher_disagreement_score":0.046375677,"about_ca_system_score_codex":0.0016673313,"about_ca_system_score_gemma":0.0014146159,"threshold_uncertainty_score":0.15514207},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7088851,0.0015292892,0.1377,0.0038970665,0.00052927795,0.00017967957,0.0014724965,0.0003738858,0.1454332],"genre_scores_gemma":[0.9311083,0.0014569433,0.027890563,0.00079231075,0.0005098124,0.00019180952,0.0016671226,0.00025223466,0.03613088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00015158232,0.000030119983,0.00019771648,0.00017507355,0.00016568803],"domain_scores_gemma":[0.9968274,0.001533347,0.00045279745,0.00026715713,0.0003025936,0.0006168025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008412933,0.0006871606,0.00093853706,0.002534694,0.0032813998,0.0037781529,0.0022281394,0.0015211101,0.017142707],"category_scores_gemma":[0.0038125755,0.0008981806,0.0012983902,0.002699571,0.003255238,0.0051844055,0.00232363,0.0035297242,0.00081150356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003392293,0.0000173345,0.00027880582,0.000039107847,0.0000068049785,0.00008419869,0.0001944421,0.0008710102,0.00030383954,0.9943329,0.0012305902,0.0026071265],"study_design_scores_gemma":[0.000024349876,0.0000160398,0.00055804756,0.000024933142,0.0000111611,0.00012656844,0.00020724098,0.0069736103,0.00018561361,0.98846114,0.0034013914,0.000009926813],"about_ca_topic_score_codex":0.003236806,"about_ca_topic_score_gemma":0.0036303839,"teacher_disagreement_score":0.017142707,"about_ca_system_score_codex":0.0025119893,"about_ca_system_score_gemma":0.00074729795,"threshold_uncertainty_score":0.057348073},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33281815,0.0006720809,0.6257355,0.0011509941,0.00021930475,0.0002677442,0.00047984876,0.00022932234,0.03842691],"genre_scores_gemma":[0.93383455,0.00042120545,0.053682115,0.00018255625,0.000113747,0.00022876161,0.00020397673,0.00008578323,0.011247238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978726,0.000598406,0.00008454557,0.00058437313,0.00043358584,0.0004264771],"domain_scores_gemma":[0.99138695,0.004585689,0.0012388572,0.0010320906,0.00047321952,0.0012830861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018259414,0.0014227194,0.0014332087,0.0008711943,0.0010754495,0.0019495172,0.0033173535,0.001550435,0.009307273],"category_scores_gemma":[0.012819222,0.0006011798,0.00079174235,0.00079867704,0.003349209,0.0066026263,0.0024498715,0.002356023,0.0006012695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005623305,0.00016263318,0.0009084162,0.0001913807,0.00007097441,0.00038461364,0.00029593325,0.18594575,0.0060816314,0.78991556,0.0025050058,0.012975754],"study_design_scores_gemma":[0.00012879922,0.00033234467,0.00059837446,0.000047534926,0.000039605417,0.00027162847,0.00022735301,0.47202206,0.0037347618,0.5164979,0.0060416106,0.00005804018],"about_ca_topic_score_codex":0.0021073772,"about_ca_topic_score_gemma":0.0018112462,"teacher_disagreement_score":0.009307273,"about_ca_system_score_codex":0.0019950706,"about_ca_system_score_gemma":0.0011308743,"threshold_uncertainty_score":0.031135917},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083533205,0.4970047,0.32634464,0.0069566634,0.0011978855,0.00008046919,0.00084966584,0.0005479301,0.08348489],"genre_scores_gemma":[0.49590343,0.3924276,0.091202095,0.0021657008,0.005265991,0.00010818847,0.001197338,0.0003106276,0.011419104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993406,0.00012128064,0.0000434443,0.0002175167,0.00022663586,0.000050488055],"domain_scores_gemma":[0.9977215,0.0014583747,0.00015025066,0.00019669536,0.00033910797,0.00013408046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007921529,0.0007281791,0.0011175185,0.004408709,0.00080130284,0.002924195,0.0013106526,0.0011504507,0.0030484246],"category_scores_gemma":[0.0033496674,0.00057289895,0.0006128983,0.0056303455,0.0017633699,0.0047549247,0.0015492811,0.001929258,0.0008575623],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006605827,0.00019743902,0.0022419933,0.0019291842,0.0000875367,0.0001435226,0.0005259066,0.008019926,0.002594781,0.65817696,0.010822466,0.31519428],"study_design_scores_gemma":[0.000014477044,0.00006719592,0.0016709999,0.0002917803,0.000037516085,0.00089081837,0.00042023338,0.02439054,0.0013143726,0.8957891,0.07505868,0.00005428397],"about_ca_topic_score_codex":0.0007423469,"about_ca_topic_score_gemma":0.00063884794,"teacher_disagreement_score":0.004408709,"about_ca_system_score_codex":0.0011292042,"about_ca_system_score_gemma":0.000652411,"threshold_uncertainty_score":0.010197997},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80885255,0.00030709815,0.08950666,0.0011260813,0.0002122728,0.00009170447,0.00045311992,0.0007437855,0.09870675],"genre_scores_gemma":[0.91922647,0.00030679212,0.03462119,0.0003789692,0.00011492378,0.00007360531,0.0005611816,0.00043800293,0.044278838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947506,0.00009934575,0.000020601856,0.00015753215,0.000110212975,0.0001372654],"domain_scores_gemma":[0.9978254,0.000960158,0.00029459377,0.00043959823,0.00019292848,0.00028732448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050775055,0.00038160392,0.00046579854,0.0010573032,0.0021500876,0.0016090538,0.0009979502,0.00072229415,0.010141224],"category_scores_gemma":[0.0021951539,0.00041679476,0.00065244926,0.0009388891,0.0012649152,0.0020603067,0.001155767,0.0013413114,0.00073624816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013086559,0.00011963327,0.001556814,0.00011266827,0.000025188452,0.0002509376,0.00068256876,0.0033655704,0.008000201,0.9475089,0.00746237,0.030784253],"study_design_scores_gemma":[0.000068693094,0.000055656426,0.0021117718,0.000039967497,0.000052626394,0.0005453069,0.00042263838,0.021359857,0.008268461,0.9469357,0.02011288,0.000026365607],"about_ca_topic_score_codex":0.0017159063,"about_ca_topic_score_gemma":0.003004417,"teacher_disagreement_score":0.010141224,"about_ca_system_score_codex":0.0012739227,"about_ca_system_score_gemma":0.0004540767,"threshold_uncertainty_score":0.03392577},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5031851,0.0030091573,0.46570122,0.0023868927,0.00035558172,0.00021545752,0.0005051773,0.00034323926,0.024298085],"genre_scores_gemma":[0.92115563,0.0008979006,0.07267256,0.00040017636,0.00021071667,0.000102940634,0.00016288421,0.00012397463,0.00427316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649674,0.0004939604,0.00013823168,0.00063999713,0.0006962863,0.0015348519],"domain_scores_gemma":[0.9943304,0.0029446804,0.0007308523,0.00084166485,0.0004508047,0.0007015512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022812758,0.0010748069,0.0019348199,0.0011259109,0.0016557699,0.0027743736,0.0029890311,0.0022245243,0.0034141499],"category_scores_gemma":[0.01216126,0.00062992756,0.00146556,0.0019752665,0.001887042,0.0052026385,0.0021440866,0.0021502308,0.0005127853],"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.0023495955,0.00079478126,0.008061782,0.0005482835,0.00014910132,0.0022872582,0.00053327554,0.6508726,0.019632602,0.24916121,0.007154963,0.058454536],"study_design_scores_gemma":[0.000085181484,0.00012608207,0.0015324197,0.00002409522,0.000027288881,0.0007150434,0.00015223361,0.9552776,0.0035402684,0.03619402,0.002285207,0.000040482795],"about_ca_topic_score_codex":0.009958232,"about_ca_topic_score_gemma":0.005673754,"teacher_disagreement_score":0.009958232,"about_ca_system_score_codex":0.0022295902,"about_ca_system_score_gemma":0.0018831751,"threshold_uncertainty_score":0.019800544},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004164305,0.0024291333,0.9825035,0.0024500797,0.000350506,0.000117238866,0.0005046896,0.00073198654,0.0067486195],"genre_scores_gemma":[0.37294286,0.0058428845,0.5871255,0.0046801637,0.003290251,0.0018156944,0.003687724,0.0015348798,0.01908004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9671483,0.014636881,0.0012476114,0.00417741,0.009543061,0.0032467642],"domain_scores_gemma":[0.7269172,0.24422534,0.0032839624,0.014913088,0.007878038,0.002782369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024857443,0.0065640258,0.0071750167,0.004081275,0.0022192462,0.0067156604,0.007992077,0.0056287386,0.01765345],"category_scores_gemma":[0.18904898,0.0028737686,0.0029840004,0.0053655454,0.006658812,0.012661736,0.016479671,0.0126352,0.0062018503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003122067,0.00056712044,0.0065016146,0.0023625772,0.0007316061,0.0012053245,0.00077283435,0.28699294,0.01531235,0.38699386,0.029913286,0.26552445],"study_design_scores_gemma":[0.00014283136,0.00025378139,0.001795128,0.0002585313,0.00019172352,0.00067017134,0.00014304728,0.7492938,0.0036845827,0.23787226,0.0055998545,0.00009419505],"about_ca_topic_score_codex":0.00248015,"about_ca_topic_score_gemma":0.002873644,"teacher_disagreement_score":0.024857443,"about_ca_system_score_codex":0.003123037,"about_ca_system_score_gemma":0.005291677,"threshold_uncertainty_score":0.13146031},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9345707,0.0008433991,0.04734182,0.0014432712,0.00008776513,0.000052254745,0.0003671908,0.00030175067,0.014991809],"genre_scores_gemma":[0.9921296,0.00024690485,0.005265847,0.00009850208,0.00005204937,0.000052544765,0.00016254194,0.000085651955,0.0019062597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993543,0.0002507548,0.000025352883,0.0001073587,0.00011636717,0.00014578103],"domain_scores_gemma":[0.99032426,0.006151751,0.0013868323,0.00042477273,0.0005294212,0.0011830679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00133582,0.0004926928,0.00082039286,0.0025253128,0.001323025,0.0036203314,0.0021195405,0.0012688785,0.0052042133],"category_scores_gemma":[0.012171134,0.0008851902,0.00058254035,0.0012740587,0.0032795568,0.0038764605,0.0014758412,0.0015627601,0.00037994303],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004012958,0.00010146967,0.0015005494,0.00010098611,0.000023669374,0.00013297205,0.00047346472,0.040042955,0.0046764286,0.945659,0.0029524881,0.0039347457],"study_design_scores_gemma":[0.00010857484,0.000094675284,0.0026214032,0.00007694969,0.00002833179,0.00020937053,0.00043657608,0.3719934,0.003452633,0.61922115,0.0016956741,0.000061359766],"about_ca_topic_score_codex":0.0015821597,"about_ca_topic_score_gemma":0.0014064909,"teacher_disagreement_score":0.0052042133,"about_ca_system_score_codex":0.0020516377,"about_ca_system_score_gemma":0.00082611083,"threshold_uncertainty_score":0.017409801},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012131765,0.019203205,0.6882651,0.010264443,0.0031269125,0.00022677021,0.0010141303,0.0011364205,0.26463118],"genre_scores_gemma":[0.41562247,0.026822716,0.48245084,0.008419461,0.010935706,0.0013480376,0.0016000055,0.0018189095,0.05098183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99216753,0.0021419863,0.00053034135,0.0022088666,0.0021731597,0.0007780488],"domain_scores_gemma":[0.96574646,0.028712723,0.0009037012,0.0019323964,0.0019593167,0.00074536295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005825961,0.0024091217,0.0023222575,0.004720627,0.0033211445,0.007497686,0.0040925103,0.0036246255,0.017252719],"category_scores_gemma":[0.025434716,0.0016326832,0.0033354498,0.0060386863,0.00988208,0.022700729,0.005134321,0.014326118,0.006334643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003624184,0.00003072504,0.00025368304,0.0001768389,0.000012344737,0.0000747826,0.00017760265,0.0019973402,0.0003514987,0.9748005,0.0075469506,0.014541447],"study_design_scores_gemma":[0.000010535605,0.000028664126,0.00015398409,0.000067790716,0.00001871716,0.00016292169,0.000029528343,0.0061336337,0.0003966041,0.96349406,0.029476834,0.000026687652],"about_ca_topic_score_codex":0.0016864946,"about_ca_topic_score_gemma":0.0010725285,"teacher_disagreement_score":0.017252719,"about_ca_system_score_codex":0.0053322483,"about_ca_system_score_gemma":0.0017971847,"threshold_uncertainty_score":0.05771607},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07729774,0.0003340369,0.89094186,0.00064259116,0.00026747104,0.00017155982,0.00076259207,0.0032797395,0.02630241],"genre_scores_gemma":[0.47811422,0.00024206839,0.49948215,0.00053326046,0.0001285612,0.00018299415,0.0013157421,0.00070990075,0.01929103],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99789435,0.0005087004,0.00020708994,0.00040366026,0.0007236764,0.0002626229],"domain_scores_gemma":[0.99812883,0.00047679897,0.00008089647,0.0009703152,0.00028096957,0.00006227073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019012,0.00060012523,0.0007463038,0.0008801722,0.0007204789,0.0015095788,0.0013009314,0.0013687825,0.013236404],"category_scores_gemma":[0.005429966,0.0003296957,0.00053078926,0.0022821103,0.00068063935,0.0027050455,0.0023119696,0.0010438483,0.0046202526],"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.0012886109,0.00019736052,0.0011771782,0.0005061846,0.00006658279,0.0004847414,0.00024164014,0.027912898,0.03923227,0.20476256,0.021719912,0.70241004],"study_design_scores_gemma":[0.00015315232,0.0002814132,0.00075183646,0.00009304256,0.00005515892,0.0010707735,0.00022126212,0.34194723,0.06948101,0.55891895,0.026967952,0.00005814597],"about_ca_topic_score_codex":0.0004904404,"about_ca_topic_score_gemma":0.00070207,"teacher_disagreement_score":0.013236404,"about_ca_system_score_codex":0.0005159333,"about_ca_system_score_gemma":0.00067744247,"threshold_uncertainty_score":0.04428017},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3991144,0.0030131661,0.49703264,0.032350164,0.00071242574,0.001340974,0.01035634,0.008874683,0.047205195],"genre_scores_gemma":[0.69352275,0.0015068817,0.26900163,0.0025746133,0.0010960666,0.0012545905,0.011878922,0.004035668,0.0151288975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99146444,0.0023577544,0.00048565766,0.0026628198,0.0013771218,0.0016521615],"domain_scores_gemma":[0.8968291,0.08436543,0.004388505,0.010381515,0.0020542005,0.001981275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064473725,0.003136168,0.0039124517,0.0024294043,0.0038549055,0.008715647,0.008539691,0.007039609,0.023839246],"category_scores_gemma":[0.053961996,0.0022576668,0.005275598,0.00622702,0.004260581,0.022423968,0.0038263137,0.011912429,0.0027746682],"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.0078917295,0.003578623,0.008142054,0.002995897,0.00063710334,0.0010043605,0.0015768941,0.47321653,0.021388164,0.2441169,0.08449445,0.1509574],"study_design_scores_gemma":[0.0009137736,0.00025909254,0.0020632963,0.00008396772,0.00031411613,0.00039208576,0.00045042112,0.52259415,0.0055708345,0.46378332,0.0034888347,0.0000861418],"about_ca_topic_score_codex":0.005933696,"about_ca_topic_score_gemma":0.008964879,"teacher_disagreement_score":0.023839246,"about_ca_system_score_codex":0.007836864,"about_ca_system_score_gemma":0.0071007875,"threshold_uncertainty_score":0.07975018},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45222932,0.008548232,0.1819397,0.014499199,0.003372385,0.000081173355,0.00062752113,0.00075612863,0.33794641],"genre_scores_gemma":[0.91638446,0.002496157,0.02284754,0.0012783577,0.0010678609,0.00005709566,0.00014308117,0.00033241743,0.055392977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991528,0.00017189288,0.000036467663,0.00023869652,0.0001917461,0.00020836484],"domain_scores_gemma":[0.9956904,0.00243282,0.00036689127,0.00046782807,0.00051052094,0.00053153204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014082273,0.0006407535,0.00074295833,0.0027294126,0.0017581525,0.0026663293,0.0019495377,0.0017088848,0.015182923],"category_scores_gemma":[0.011704191,0.00039237697,0.0005604081,0.0020947205,0.0038672355,0.00767768,0.0024110565,0.003643947,0.0016164936],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001789696,0.000030171153,0.0002767189,0.00006216359,0.000012218111,0.000119824836,0.00018210654,0.002041422,0.0016906239,0.97460407,0.0038642231,0.016937556],"study_design_scores_gemma":[0.000028727416,0.000026502164,0.00054509466,0.000024236308,0.000016047508,0.00024288913,0.00009380523,0.0069297445,0.0017558682,0.9816016,0.008707317,0.000028264702],"about_ca_topic_score_codex":0.001238786,"about_ca_topic_score_gemma":0.0009484812,"teacher_disagreement_score":0.015182923,"about_ca_system_score_codex":0.0013769121,"about_ca_system_score_gemma":0.00080353476,"threshold_uncertainty_score":0.05079192},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5457469,0.0008607344,0.3507479,0.003722103,0.00019575935,0.00046559554,0.0010464527,0.00027291194,0.096941605],"genre_scores_gemma":[0.9370043,0.0004525539,0.047876824,0.00037668544,0.00008901369,0.0002910566,0.0005235907,0.00010528472,0.01328067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968867,0.001105366,0.00016180787,0.0006355145,0.00039614228,0.00081450026],"domain_scores_gemma":[0.99202526,0.0040159146,0.001311938,0.0010374811,0.00038754806,0.0012218384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013049894,0.000979563,0.0011671393,0.00084584364,0.0016505364,0.002216761,0.0020489683,0.001637256,0.014580448],"category_scores_gemma":[0.010462183,0.0005136237,0.0010145381,0.0010297544,0.0033093952,0.0062283776,0.0029541715,0.0021331587,0.00071626686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018862505,0.00015213013,0.003159124,0.00026203383,0.000093448594,0.00041125147,0.00049592135,0.08002979,0.0019749599,0.8853741,0.004794896,0.023063764],"study_design_scores_gemma":[0.000087629705,0.00015408148,0.0014264913,0.00007027639,0.00004975953,0.00034785274,0.00066863466,0.14962512,0.0019624492,0.82942575,0.01612958,0.00005249297],"about_ca_topic_score_codex":0.004714602,"about_ca_topic_score_gemma":0.0053124847,"teacher_disagreement_score":0.014580448,"about_ca_system_score_codex":0.001535548,"about_ca_system_score_gemma":0.0013965247,"threshold_uncertainty_score":0.048776507},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6946257,0.0006280738,0.14074492,0.0030329914,0.0007084234,0.00020980496,0.0009289747,0.0012628296,0.1578583],"genre_scores_gemma":[0.93895847,0.00034372008,0.0116382195,0.0004075651,0.00035962212,0.00015739955,0.0010082667,0.00044323163,0.04668352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983943,0.00023023157,0.00007038581,0.00031363103,0.0005269365,0.00046456346],"domain_scores_gemma":[0.995761,0.0013885676,0.0004945708,0.00029208427,0.000277913,0.0017859291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012204354,0.0009583972,0.0015795955,0.0026329332,0.003997587,0.0058110077,0.00197765,0.0018899532,0.019330535],"category_scores_gemma":[0.0045198137,0.0009913202,0.0015380848,0.0018528523,0.0035422896,0.0050434256,0.006192165,0.0058089616,0.0019447607],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113005706,0.00010662597,0.00040942655,0.000057021196,0.0000128561205,0.0001353265,0.00037264705,0.0016440751,0.000683786,0.99100715,0.002601011,0.0028569484],"study_design_scores_gemma":[0.00010691958,0.000034277804,0.0005295142,0.000018995393,0.000020894056,0.00013890762,0.0002391132,0.008489277,0.00050669647,0.9859444,0.003939319,0.000031601754],"about_ca_topic_score_codex":0.0026778523,"about_ca_topic_score_gemma":0.0030115386,"teacher_disagreement_score":0.019330535,"about_ca_system_score_codex":0.0020179267,"about_ca_system_score_gemma":0.0009697584,"threshold_uncertainty_score":0.064667046},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30713233,0.00034835254,0.64829123,0.0011865248,0.00011406383,0.000339932,0.0005901669,0.00041326604,0.04158401],"genre_scores_gemma":[0.886701,0.00027967707,0.09948826,0.00022280413,0.000036955153,0.00014829802,0.0003896566,0.00010889696,0.0126244165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988819,0.0004401304,0.000041119158,0.0002664101,0.00013835523,0.00023219135],"domain_scores_gemma":[0.99792176,0.001199457,0.00026337177,0.00022813326,0.00008849666,0.00029876994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076392066,0.00068302016,0.00086255104,0.00057397294,0.0012424682,0.0024257496,0.001921334,0.0015244778,0.005791127],"category_scores_gemma":[0.0039749895,0.00048485142,0.00085307413,0.0008845435,0.0025008556,0.0043553645,0.0018921358,0.001556728,0.0005095692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043273618,0.0001851954,0.003223583,0.00019781069,0.00009852702,0.0009223072,0.00090053736,0.29764032,0.0041071316,0.6665135,0.00520588,0.020572456],"study_design_scores_gemma":[0.00010640355,0.00017283886,0.0006992081,0.000027657936,0.000041885763,0.00050027133,0.00061227486,0.6519722,0.0014548837,0.3319958,0.012369993,0.00004655352],"about_ca_topic_score_codex":0.0055614663,"about_ca_topic_score_gemma":0.005636547,"teacher_disagreement_score":0.005791127,"about_ca_system_score_codex":0.0014150402,"about_ca_system_score_gemma":0.0010566717,"threshold_uncertainty_score":0.019373238},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5855426,0.01989768,0.26854834,0.015732674,0.00073395134,0.00015199221,0.000980121,0.00064447033,0.10776811],"genre_scores_gemma":[0.92650276,0.004059098,0.054408967,0.00064982485,0.0005370919,0.00019268948,0.0003520098,0.00020099463,0.013096532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988876,0.00027983676,0.00004357694,0.0003101146,0.00021596965,0.00026288079],"domain_scores_gemma":[0.97931015,0.016250126,0.0011548559,0.0012228243,0.0006300674,0.001432043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033001928,0.0015823729,0.001737921,0.003485494,0.002392508,0.0022618016,0.0034112972,0.0019952527,0.0071255974],"category_scores_gemma":[0.022604745,0.0007670168,0.0016591318,0.0026565897,0.005211981,0.012663154,0.0036838115,0.0054472825,0.00095607707],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008911583,0.00015314411,0.003150365,0.00062386005,0.00014970043,0.00028176216,0.0008773698,0.04440733,0.0053168195,0.9034841,0.009104949,0.031559393],"study_design_scores_gemma":[0.0000703847,0.000115021634,0.0019306084,0.00014075954,0.00008115435,0.00030316072,0.0002800991,0.068421885,0.00323588,0.9186861,0.0066573955,0.00007762539],"about_ca_topic_score_codex":0.001734857,"about_ca_topic_score_gemma":0.0016002321,"teacher_disagreement_score":0.0071255974,"about_ca_system_score_codex":0.0032029569,"about_ca_system_score_gemma":0.0013242471,"threshold_uncertainty_score":0.023837447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026631504,0.00012106683,0.96968263,0.00012192249,0.000059825343,0.00009290796,0.00013034648,0.00066359236,0.002496201],"genre_scores_gemma":[0.4466147,0.00015048207,0.54843664,0.00007148188,0.000048862574,0.00020549509,0.00037862806,0.00017487284,0.0039188005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917454,0.00018355926,0.000044796605,0.00015868181,0.00024065856,0.00019786616],"domain_scores_gemma":[0.99865854,0.0006680788,0.00009814406,0.0002830486,0.00017629762,0.00011587534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014221782,0.00069928414,0.0015626654,0.00046423692,0.00091492134,0.0012367223,0.0026403277,0.0009932611,0.004143927],"category_scores_gemma":[0.0031246229,0.00061119115,0.0010847424,0.0009997883,0.0006757073,0.0015900158,0.0017370436,0.0016713667,0.00061947986],"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.00048306672,0.00018225871,0.0003571074,0.00015136374,0.00003571297,0.000076938406,0.000113425245,0.8634685,0.005143786,0.035647843,0.0028400538,0.091499954],"study_design_scores_gemma":[0.000028329823,0.000036691767,0.000037234557,0.0000037914208,0.000006163481,0.00001098555,0.000009457275,0.9889129,0.0005648393,0.009834278,0.000551211,0.0000041391972],"about_ca_topic_score_codex":0.0056073666,"about_ca_topic_score_gemma":0.0068038222,"teacher_disagreement_score":0.0056073666,"about_ca_system_score_codex":0.0013952911,"about_ca_system_score_gemma":0.0025757626,"threshold_uncertainty_score":0.013862789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24579518,0.00017741285,0.7131302,0.0010506958,0.00012929285,0.00028272544,0.00030661823,0.0002467723,0.03888111],"genre_scores_gemma":[0.94025636,0.00010452069,0.049349427,0.00019061237,0.000033395925,0.00017719866,0.00010652953,0.000035539135,0.009746475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857855,0.00058190286,0.00007879661,0.0003320348,0.00021664969,0.0002120488],"domain_scores_gemma":[0.99691606,0.0017041767,0.00033182488,0.00041572322,0.00015914923,0.0004731168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011948205,0.0007611237,0.0007002825,0.00024401493,0.00059155666,0.0012645045,0.001562885,0.0008056071,0.0060430607],"category_scores_gemma":[0.006659364,0.00030634878,0.00066178857,0.00023868073,0.002315969,0.0032636295,0.0022076734,0.0016963144,0.0006493608],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010870534,0.0002462725,0.00246642,0.00027214788,0.000100511425,0.0006991019,0.0009127587,0.23146914,0.014971914,0.7179339,0.0033482932,0.026492426],"study_design_scores_gemma":[0.0002200936,0.0004961016,0.0009186169,0.000032271313,0.00004166786,0.00043326704,0.00040998627,0.6046183,0.0025241885,0.3830463,0.007190637,0.000068565816],"about_ca_topic_score_codex":0.0022243953,"about_ca_topic_score_gemma":0.0016813547,"teacher_disagreement_score":0.0060430607,"about_ca_system_score_codex":0.00085226126,"about_ca_system_score_gemma":0.00076927536,"threshold_uncertainty_score":0.020215988},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072537765,0.0009541791,0.91855377,0.00092188135,0.00009366785,0.00016546948,0.0009749078,0.000689831,0.0051084687],"genre_scores_gemma":[0.5825463,0.0012590439,0.41155162,0.00047210322,0.00021635529,0.00037342648,0.0011164073,0.00017921522,0.0022856607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99721944,0.00073089986,0.00022293588,0.00091907446,0.0006431845,0.00026450213],"domain_scores_gemma":[0.98687035,0.008563604,0.0016213743,0.0018586933,0.0006722791,0.0004136804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015401389,0.0009953319,0.0010918733,0.0018074851,0.0010535467,0.0026077118,0.002641678,0.0013982487,0.0019087002],"category_scores_gemma":[0.009282069,0.00072781625,0.0009982854,0.002823938,0.0021180413,0.0083035035,0.0023608452,0.0019463226,0.00031400597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045088094,0.00021381935,0.0041113887,0.00074802834,0.00012894059,0.00034599678,0.00091512257,0.23999801,0.022137297,0.6348456,0.0065804026,0.08952454],"study_design_scores_gemma":[0.000055860884,0.00016433057,0.0014405434,0.0001006679,0.00007651949,0.0006621001,0.00025851806,0.39355046,0.013660315,0.5743034,0.015669465,0.000057830493],"about_ca_topic_score_codex":0.0009363684,"about_ca_topic_score_gemma":0.00096250826,"teacher_disagreement_score":0.002641678,"about_ca_system_score_codex":0.0018766491,"about_ca_system_score_gemma":0.0007437418,"threshold_uncertainty_score":0.013616145},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99282855,0.000054590382,0.0058562104,0.000055389966,0.000005730718,0.0000041745616,0.00006985447,0.00003881133,0.0010867062],"genre_scores_gemma":[0.9985877,0.000026102432,0.000825092,0.0000055183937,0.000006226897,0.000005876103,0.00009231523,0.000011159587,0.0004399882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972636,0.00006661886,0.000015713693,0.00005278637,0.00007229147,0.000066198336],"domain_scores_gemma":[0.997026,0.0012764547,0.0007373996,0.00025891582,0.0002576318,0.0004436156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055535126,0.0001852918,0.0003564821,0.0013925823,0.00047386423,0.0010945528,0.00057920004,0.0004162093,0.001745811],"category_scores_gemma":[0.004022379,0.000268239,0.00024231576,0.0005849216,0.00177032,0.001654269,0.0007701827,0.0004153595,0.00012450012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010753339,0.00022989612,0.046976607,0.00018800545,0.00007376462,0.0014400898,0.00086542853,0.4101132,0.048578493,0.47381845,0.0018147334,0.014825992],"study_design_scores_gemma":[0.000012201892,0.0000838242,0.013813653,0.00002175872,0.000009845809,0.00013711076,0.0001602087,0.9130221,0.0077089337,0.06451957,0.0004646705,0.000046037207],"about_ca_topic_score_codex":0.0013555625,"about_ca_topic_score_gemma":0.0011211551,"teacher_disagreement_score":0.001745811,"about_ca_system_score_codex":0.00066522794,"about_ca_system_score_gemma":0.00025492694,"threshold_uncertainty_score":0.005840361},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24151927,0.00081235595,0.6326922,0.002608136,0.00039343815,0.00023630605,0.0009719781,0.0007189076,0.12004738],"genre_scores_gemma":[0.8113373,0.00072048913,0.12845927,0.00038251202,0.00011834305,0.00020381961,0.0011516343,0.00038582474,0.057240695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99856997,0.00039514582,0.000055414705,0.00047620226,0.00022636479,0.00027678013],"domain_scores_gemma":[0.9978131,0.0007195089,0.00036808779,0.0005519869,0.00021054172,0.0003367156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008659959,0.0007861018,0.00087081955,0.00052822655,0.0019977088,0.0022291108,0.0015591246,0.0014357824,0.020592798],"category_scores_gemma":[0.0044127647,0.000490135,0.000655235,0.00074529706,0.0024293833,0.006747169,0.0039653145,0.0014775385,0.0027488715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041104478,0.00014208944,0.0026488993,0.000387894,0.00006679877,0.00060382514,0.0011180454,0.06822152,0.004912904,0.83368224,0.014607539,0.073197156],"study_design_scores_gemma":[0.000066207576,0.00032777584,0.0016296519,0.00016703371,0.00007839576,0.0008526583,0.0019067737,0.11341848,0.009005042,0.7318825,0.14060095,0.00006449458],"about_ca_topic_score_codex":0.0023848212,"about_ca_topic_score_gemma":0.0029634135,"teacher_disagreement_score":0.020592798,"about_ca_system_score_codex":0.0006048797,"about_ca_system_score_gemma":0.00069656916,"threshold_uncertainty_score":0.0688898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35463157,0.0006783482,0.576681,0.0018011528,0.00030646502,0.00018416798,0.00075530144,0.0010044625,0.06395747],"genre_scores_gemma":[0.91500646,0.00042485853,0.039958328,0.0002770148,0.00012483868,0.00011333958,0.00044237977,0.00025949877,0.043393344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948835,0.000099328885,0.000021116759,0.00014563341,0.00011019353,0.00013532994],"domain_scores_gemma":[0.99668545,0.0017133217,0.00051286153,0.00037112998,0.0002755789,0.0004416187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012577,0.00049373606,0.00097164465,0.0012765093,0.0013762914,0.0015291957,0.0016903798,0.0011432219,0.013681279],"category_scores_gemma":[0.005656201,0.00050616794,0.0006053451,0.0010984647,0.0013771226,0.0024109604,0.0018415459,0.0009629104,0.00080817833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027240376,0.000082439015,0.0009194913,0.00013698681,0.00004732594,0.00048407714,0.0003079979,0.2734925,0.002626143,0.68562925,0.009252852,0.026748504],"study_design_scores_gemma":[0.000028716313,0.000034258253,0.0003845697,0.000018922921,0.000016535729,0.0001234252,0.00013425137,0.7203924,0.0006912716,0.27464953,0.0035124088,0.000013749963],"about_ca_topic_score_codex":0.009383716,"about_ca_topic_score_gemma":0.009240793,"teacher_disagreement_score":0.013681279,"about_ca_system_score_codex":0.001406177,"about_ca_system_score_gemma":0.0010985207,"threshold_uncertainty_score":0.0457685},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17049149,0.020489337,0.698894,0.01964602,0.0014619215,0.00041966798,0.0039907773,0.002012421,0.08259437],"genre_scores_gemma":[0.8561839,0.020006234,0.084897846,0.003375431,0.0028990726,0.001180955,0.002666066,0.0017459594,0.027044581],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99576426,0.00090066966,0.00017851849,0.00076349376,0.0011574746,0.0012355624],"domain_scores_gemma":[0.8511752,0.12945852,0.004610464,0.0044344696,0.004787659,0.005533649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074946852,0.0042152135,0.0052214307,0.0064036422,0.003655122,0.008623208,0.007559598,0.003775085,0.017101284],"category_scores_gemma":[0.0609217,0.0021593804,0.002306819,0.008331865,0.006535821,0.017257506,0.0069454527,0.00921128,0.002229148],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026236777,0.00048534846,0.003302978,0.002149826,0.00037202152,0.00044494012,0.0019755738,0.2958765,0.0103601795,0.60547477,0.025419021,0.051515248],"study_design_scores_gemma":[0.00020453622,0.00018141621,0.001037692,0.0003053335,0.00030617442,0.0002501527,0.0003734973,0.3929992,0.0022671479,0.5969154,0.0050691273,0.000090266825],"about_ca_topic_score_codex":0.004934189,"about_ca_topic_score_gemma":0.006514344,"teacher_disagreement_score":0.017101284,"about_ca_system_score_codex":0.007900677,"about_ca_system_score_gemma":0.0036964335,"threshold_uncertainty_score":0.057323635},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009729531,0.63246554,0.086346164,0.028615596,0.018978668,0.00016425099,0.0013148985,0.00022331167,0.22216207],"genre_scores_gemma":[0.08996959,0.61999786,0.067667566,0.005472526,0.10916514,0.00050011795,0.0031053445,0.0004412528,0.10368055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986161,0.0004523222,0.00008539627,0.00034580825,0.00041347093,0.00008697615],"domain_scores_gemma":[0.9968749,0.002075767,0.00013055946,0.00013007874,0.00041578535,0.0003728203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002237078,0.0027787057,0.003467117,0.006265528,0.0017858971,0.0053323573,0.00199166,0.0020115145,0.019281099],"category_scores_gemma":[0.004824259,0.0010217903,0.002290038,0.01530772,0.0031164745,0.004352297,0.0029857573,0.0058249887,0.00403778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009944787,0.0001141335,0.00076280127,0.0027306832,0.00015538759,0.00026343402,0.0005371668,0.003259127,0.0008098073,0.76263887,0.12482079,0.10380837],"study_design_scores_gemma":[0.00004337521,0.00006617311,0.0018495746,0.0006666055,0.00007445068,0.000340213,0.00020862595,0.004127982,0.0003810897,0.71751106,0.2746895,0.000041291692],"about_ca_topic_score_codex":0.0024472903,"about_ca_topic_score_gemma":0.0026330599,"teacher_disagreement_score":0.019281099,"about_ca_system_score_codex":0.0037222356,"about_ca_system_score_gemma":0.002006031,"threshold_uncertainty_score":0.06450164},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3783046,0.0015291463,0.5702511,0.003843969,0.00026556427,0.0002541395,0.0012219748,0.0003399278,0.04398945],"genre_scores_gemma":[0.904971,0.0011102151,0.07704617,0.00058558,0.00039282296,0.00030534726,0.00093824876,0.00013322612,0.014517432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978157,0.00046751625,0.00013857326,0.00064828526,0.00057093834,0.00035891173],"domain_scores_gemma":[0.98857075,0.006753148,0.0015775927,0.0012989312,0.0007559121,0.0010436449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022548886,0.0011669318,0.0011827664,0.0011370038,0.0018063792,0.003821442,0.0036880248,0.00251065,0.010465095],"category_scores_gemma":[0.015472188,0.0006771106,0.0014187396,0.0016787971,0.0020985114,0.008465432,0.0025763481,0.0050438535,0.0007063103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014443239,0.00011412638,0.0013751317,0.0002217281,0.00006021596,0.00020007294,0.00028869088,0.020929039,0.0032050803,0.95062804,0.0028854513,0.019948129],"study_design_scores_gemma":[0.000048173188,0.00009205625,0.0005867246,0.000046878493,0.000030165884,0.00037006303,0.00014779762,0.124061145,0.0012776133,0.86866367,0.0046477923,0.000027772363],"about_ca_topic_score_codex":0.0010322483,"about_ca_topic_score_gemma":0.0012163376,"teacher_disagreement_score":0.010465095,"about_ca_system_score_codex":0.0018211441,"about_ca_system_score_gemma":0.0008915989,"threshold_uncertainty_score":0.035009205},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24374045,0.00015255257,0.71914583,0.0003849036,0.00015556406,0.0002966254,0.00057586323,0.0016082058,0.03393999],"genre_scores_gemma":[0.6198749,0.00016401998,0.37480825,0.00019219726,0.000024593226,0.00018264938,0.0008183967,0.00021042913,0.0037246153],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956435,0.00005820678,0.00003228952,0.00007808302,0.00017524837,0.00009176191],"domain_scores_gemma":[0.9993337,0.0002364697,0.00008636428,0.0001267555,0.00018621942,0.000030472922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002814238,0.00065451756,0.00046273717,0.00046997718,0.00034877678,0.0009206548,0.00076330395,0.00065175444,0.005267954],"category_scores_gemma":[0.0019099233,0.000277072,0.00047592417,0.00080793194,0.00041223853,0.0008515746,0.0008120961,0.0006107556,0.00074961863],"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.00079920323,0.00034101302,0.0040861666,0.00072591356,0.00018056689,0.0007656938,0.00031511564,0.16842471,0.20138957,0.26087996,0.008166287,0.35392585],"study_design_scores_gemma":[0.00025313694,0.0009185157,0.00073314126,0.00012307179,0.00011717504,0.00068913447,0.00037502087,0.5683447,0.27001256,0.1387642,0.019619467,0.000049856553],"about_ca_topic_score_codex":0.0010382392,"about_ca_topic_score_gemma":0.0023279164,"teacher_disagreement_score":0.005267954,"about_ca_system_score_codex":0.00046095753,"about_ca_system_score_gemma":0.0010074188,"threshold_uncertainty_score":0.017623067},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88358533,0.00064713403,0.040910967,0.002411433,0.00014959961,0.00004719326,0.0009538834,0.00029147623,0.07100301],"genre_scores_gemma":[0.9826596,0.00033891128,0.0066575976,0.00018932045,0.00014943095,0.00006008343,0.00054375024,0.00007662131,0.009324697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938273,0.00013137073,0.000025910405,0.00012277513,0.00016188616,0.00017530395],"domain_scores_gemma":[0.99646264,0.0018350739,0.000554949,0.0002706254,0.00027848943,0.00059827877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073812675,0.0005027918,0.0010591575,0.0037271865,0.0022840437,0.0036603159,0.0019352104,0.0011067168,0.01453267],"category_scores_gemma":[0.004629731,0.0005650745,0.0005761503,0.0018075343,0.0024748552,0.004499567,0.0023620068,0.002297151,0.0006835493],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011928346,0.000039125924,0.0015219204,0.000045840745,0.000017639908,0.00007043572,0.0004155068,0.003753605,0.0007601395,0.98564655,0.0027342483,0.0048758057],"study_design_scores_gemma":[0.000032516367,0.000021444632,0.0015441409,0.000026482503,0.000025081454,0.00016095398,0.00037578098,0.02389847,0.0007271058,0.9699305,0.0032381017,0.000019391022],"about_ca_topic_score_codex":0.0029671495,"about_ca_topic_score_gemma":0.0023905546,"teacher_disagreement_score":0.01453267,"about_ca_system_score_codex":0.0017262044,"about_ca_system_score_gemma":0.0006010159,"threshold_uncertainty_score":0.048616588},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018034885,0.00042155414,0.09275758,0.005194027,0.001152392,0.00013753913,0.049871888,0.018327277,0.83033425],"genre_scores_gemma":[0.049101103,0.002297011,0.09877276,0.0022913464,0.001093452,0.00040316567,0.09529335,0.031986374,0.7187614],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996847,0.00006169135,0.000026537196,0.00005453154,0.0001422841,0.000030282794],"domain_scores_gemma":[0.9990589,0.00026900545,0.00006444591,0.00017520704,0.00033135162,0.000101127305],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048093608,0.00068901834,0.0006977169,0.0015375555,0.0007798954,0.0043720794,0.0014903467,0.0007326217,0.48459798],"category_scores_gemma":[0.0019064794,0.0005274641,0.00068459526,0.0028637676,0.0005674252,0.0037752483,0.0011697202,0.0016267186,0.26888],"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.000044459608,0.000022404143,0.000104039056,0.00017185825,0.0000058730548,0.00003657608,0.00010018821,0.00032368736,0.0010793242,0.1183656,0.8415529,0.03819312],"study_design_scores_gemma":[0.000023981258,0.000010014662,0.00042095786,0.000046817455,0.0000042529327,0.00010211002,0.00007329186,0.0017125506,0.0019339848,0.06282048,0.93282914,0.000022343082],"about_ca_topic_score_codex":0.0052189273,"about_ca_topic_score_gemma":0.008211406,"teacher_disagreement_score":0.48459798,"about_ca_system_score_codex":0.0015841841,"about_ca_system_score_gemma":0.0008381123,"threshold_uncertainty_score":0.73515844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02560059,0.00017909368,0.9675664,0.00022691114,0.000060842845,0.00005682964,0.00017236514,0.0018346976,0.0043023904],"genre_scores_gemma":[0.2613728,0.0002107733,0.7321064,0.0001661565,0.000050071594,0.000187069,0.0008139908,0.00052451546,0.004568302],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989423,0.00015051875,0.00007125377,0.00026031997,0.00034477556,0.00023084748],"domain_scores_gemma":[0.99774396,0.0011330204,0.00012198467,0.0006565012,0.00025027076,0.00009424223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009750215,0.0008736344,0.000926414,0.0014179677,0.00087716396,0.0015276246,0.0021841635,0.0011181175,0.006591199],"category_scores_gemma":[0.005529039,0.0005472059,0.0011900092,0.0012553111,0.0014931167,0.0029722222,0.0025253836,0.0017415058,0.0015524043],"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.0008504725,0.00018204689,0.0019968138,0.00045465265,0.00008205277,0.00022527865,0.00051070045,0.23203848,0.031267174,0.3440887,0.014740257,0.3735633],"study_design_scores_gemma":[0.00011408708,0.000116752824,0.00029616643,0.000059509082,0.000041662308,0.00023258322,0.000080218255,0.67892593,0.013902318,0.2970939,0.009094642,0.000042137774],"about_ca_topic_score_codex":0.0020444316,"about_ca_topic_score_gemma":0.0022445172,"teacher_disagreement_score":0.006591199,"about_ca_system_score_codex":0.0016138124,"about_ca_system_score_gemma":0.001697564,"threshold_uncertainty_score":0.022049785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031417225,0.0024741471,0.96273285,0.00021262011,0.00024183188,0.00015396283,0.00037896118,0.00076701917,0.0016212777],"genre_scores_gemma":[0.2796878,0.0013836982,0.71456283,0.00029500306,0.0005274068,0.00036371537,0.0010416586,0.0005184182,0.0016194676],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99347806,0.0011614208,0.0007582875,0.001085657,0.00324727,0.00026926986],"domain_scores_gemma":[0.9866463,0.0065885773,0.0019004539,0.0013409961,0.0027694025,0.0007542342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063657747,0.0012784048,0.0024839859,0.012835537,0.0010493516,0.005623582,0.002423316,0.0026445831,0.0018723077],"category_scores_gemma":[0.02053394,0.00060598383,0.0017373157,0.00609361,0.0028136268,0.0051026596,0.0030970795,0.0016538139,0.0005979049],"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.0019645898,0.00041165648,0.016427075,0.0017812721,0.0013982898,0.00055878033,0.00076542905,0.04000103,0.18391427,0.058968082,0.0064143133,0.6873953],"study_design_scores_gemma":[0.0002516447,0.0027882901,0.050203335,0.00043413969,0.0018093279,0.0062015625,0.00082117046,0.71680254,0.11986346,0.073655844,0.02662029,0.00054846285],"about_ca_topic_score_codex":0.0013459617,"about_ca_topic_score_gemma":0.0013124552,"teacher_disagreement_score":0.012835537,"about_ca_system_score_codex":0.0020065669,"about_ca_system_score_gemma":0.0012926266,"threshold_uncertainty_score":0.033665836},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3941509,0.009810385,0.42869392,0.040292162,0.0013218748,0.00043654937,0.005971835,0.0010560602,0.11826632],"genre_scores_gemma":[0.9125282,0.005361402,0.056641504,0.0014093167,0.0019147923,0.00044508855,0.0035312185,0.00058394857,0.017584559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99621874,0.0012401907,0.00017769511,0.00061877473,0.0010565559,0.0006879902],"domain_scores_gemma":[0.93829554,0.055265047,0.0018691638,0.0018045517,0.0015209883,0.0012447458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029956475,0.0014307431,0.0031033973,0.0018512196,0.0021380212,0.006682588,0.0035741855,0.0031666472,0.016389236],"category_scores_gemma":[0.036043536,0.0010500432,0.0016525696,0.0036223482,0.0029399837,0.01549336,0.0036045602,0.006262868,0.0012160189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015878364,0.0004777727,0.00325317,0.0010212741,0.00024082322,0.00036476136,0.00076443155,0.3072306,0.0023611474,0.58600086,0.04231258,0.054384712],"study_design_scores_gemma":[0.00015316112,0.000046192403,0.00059565605,0.000048530514,0.000054061118,0.00010312448,0.00017780035,0.34163925,0.00037139934,0.65419716,0.0025815715,0.00003213409],"about_ca_topic_score_codex":0.006468339,"about_ca_topic_score_gemma":0.005085547,"teacher_disagreement_score":0.016389236,"about_ca_system_score_codex":0.0046921396,"about_ca_system_score_gemma":0.003536743,"threshold_uncertainty_score":0.054827392},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5789968,0.0016234253,0.21586667,0.0035942441,0.0003410607,0.00008840996,0.0005996863,0.0001480892,0.19874166],"genre_scores_gemma":[0.93373185,0.0010780194,0.027556976,0.0004000014,0.00027960772,0.00008455803,0.00044568538,0.00012353336,0.036299687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877626,0.0003342102,0.0000690347,0.00023315797,0.00031801546,0.00026934416],"domain_scores_gemma":[0.99410903,0.0034891812,0.00057368784,0.00048342126,0.0006811269,0.0006635092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010600701,0.00033670635,0.0009803781,0.002572321,0.002710344,0.003589686,0.0014120518,0.0014054372,0.0134899225],"category_scores_gemma":[0.0071090525,0.00064136076,0.0007751886,0.0022519105,0.0043983753,0.0055683223,0.004037142,0.002999364,0.00096558477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002877666,0.000009222095,0.0002570132,0.000019282075,0.000004126973,0.000052136184,0.00025762082,0.0007962388,0.00035697606,0.9941162,0.0004599967,0.003642394],"study_design_scores_gemma":[0.000012565185,0.0000053917406,0.00017481681,0.000011484107,0.0000033636297,0.000040570896,0.00014276544,0.0025804276,0.00020469853,0.9953452,0.0014736474,0.000005023604],"about_ca_topic_score_codex":0.0038685806,"about_ca_topic_score_gemma":0.0033522933,"teacher_disagreement_score":0.0134899225,"about_ca_system_score_codex":0.0015362597,"about_ca_system_score_gemma":0.00066199264,"threshold_uncertainty_score":0.045128345},"labels":[],"label_agreement":null}]}