{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":520,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":520,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"2f9ea72872c9","filters":{"venue":"Discrete Applied Mathematics"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009040591071365865,"gpt":0.2191411440438341,"spread":0.2101005529724683,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001086744,0.0001323104,0.0003044335,0.0001819302,0.0000735526,0.0000382903,0.0003832671,0.00005314098,0.000009761005],"category_scores_gemma":[0.0000432623,0.00007995146,0.00006803658,0.001161729,0.0002890164,0.00007196876,0.0001230813,0.0001227984,0.000006553396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005104479,"about_ca_system_score_gemma":0.00001206103,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003402992,"about_ca_topic_score_gemma":0.000004613852,"domain_scores_codex":[0.9987776,0.00004286912,0.0004394946,0.0002697421,0.0002785386,0.0001917239],"domain_scores_gemma":[0.9987454,0.0003722379,0.0001131401,0.0006914442,0.00002891906,0.00004889424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002221571,0.00007817009,0.00006933053,0.00006373533,0.00001011556,5.684969e-7,0.001999602,0.0001460566,0.0005937528,0.9920346,0.00003190645,0.004949997],"study_design_scores_gemma":[0.001123051,0.00002218766,0.0003179737,0.00003579391,0.00001371323,0.000003066993,0.0001396951,0.02115169,0.001139938,0.9759241,0.00001835725,0.000110447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9804764,0.0005442077,0.009080304,0.0004059855,0.00003258125,0.0005957548,0.000002002773,0.00009731455,0.008765465],"genre_scores_gemma":[0.9449857,0.0001161616,0.05475171,0.00008799192,7.393643e-7,0.00002946079,8.300761e-7,0.000006945546,0.00002040643],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04567141,"threshold_uncertainty_score":0.3260326,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04136196228381948,"gpt":0.2908560751222848,"spread":0.2494941128384653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001419591,0.0001886223,0.0003902846,0.0002071049,0.00009578081,0.0001231751,0.001229606,0.0000974069,0.0002968451],"category_scores_gemma":[0.0001930637,0.0001666207,0.0000640709,0.001017743,0.00009415048,0.0001614885,0.0005638502,0.000217009,0.000153591],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000294477,"about_ca_system_score_gemma":0.00004372761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001215455,"about_ca_topic_score_gemma":0.000004541424,"domain_scores_codex":[0.9977009,0.00008751827,0.0005259981,0.0003700017,0.000868696,0.0004469382],"domain_scores_gemma":[0.9978788,0.0004175797,0.0001548436,0.001124601,0.000278585,0.0001455773],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002770496,0.003537973,0.001054852,0.001650993,0.0003024093,0.00003424893,0.01882934,0.0006344219,0.005485534,0.8500903,0.01067614,0.107676],"study_design_scores_gemma":[0.0003189564,0.00005614808,0.0004235162,0.00002959191,0.000008434212,0.000004612092,0.0001286308,0.9851815,0.009655465,0.003766138,0.0001789676,0.0002480774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005521814,0.00006242563,0.9617215,0.00009188481,0.0000343581,0.0004487387,0.00003852905,0.0001803512,0.03686998],"genre_scores_gemma":[0.2225694,0.00009037697,0.7766513,0.00005410606,0.00002369868,0.00006045702,0.00001899492,0.00003526104,0.0004963793],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.984547,"threshold_uncertainty_score":0.6794596,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01243576526964326,"gpt":0.2328712612258647,"spread":0.2204354959562214,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005507969,0.0001483799,0.0002745459,0.00007525737,0.00004371601,0.00003232075,0.0001088314,0.00006510986,0.00002476661],"category_scores_gemma":[0.00003681291,0.0001205539,0.00002047579,0.0003429758,0.00004454686,0.00004993504,0.00001271373,0.00009893119,0.00001133566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001679951,"about_ca_system_score_gemma":0.00002414512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004749389,"about_ca_topic_score_gemma":0.00001212438,"domain_scores_codex":[0.999129,0.000003533283,0.0003284595,0.0001098855,0.0002008953,0.0002282152],"domain_scores_gemma":[0.9994345,0.0001309042,0.00009165298,0.0001760524,0.0001045117,0.00006241031],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001225775,0.0001554976,0.0006261894,0.001702144,0.0002646091,0.000006646688,0.003896515,0.9602208,0.01009374,0.00914966,0.00005456777,0.01370706],"study_design_scores_gemma":[0.0008190778,0.00002149839,0.0003048128,0.0001274279,0.00004151857,0.000003468848,0.000983908,0.9751574,0.02191588,0.0003411236,0.0000118165,0.0002720654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04961553,0.00022734,0.928381,0.000003964296,0.00002809034,0.0001908282,0.000007401092,0.0002372445,0.02130867],"genre_scores_gemma":[0.5726691,0.000004238421,0.4272251,0.000006556024,0.00001359122,0.000005706665,0.00001353365,0.00003361792,0.00002846935],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5230536,"threshold_uncertainty_score":0.4916045,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07715582862337386,"gpt":0.3074874641287935,"spread":0.2303316355054196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001920349,0.0002839226,0.0003331096,0.0001387714,0.0003831612,0.000171509,0.0002951373,0.0001012282,0.0004168666],"category_scores_gemma":[0.0002658351,0.0002645056,0.0001258529,0.0005389073,0.00005305928,0.0002788914,0.00007907738,0.0001086797,0.0003698262],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005220229,"about_ca_system_score_gemma":0.00001590679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005541768,"about_ca_topic_score_gemma":0.00002970803,"domain_scores_codex":[0.9983391,0.00002371252,0.0005674451,0.0003466547,0.0002266722,0.0004963728],"domain_scores_gemma":[0.9988708,0.0002052123,0.0002488908,0.0004866687,0.000162054,0.00002639922],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003995118,0.001081175,0.0001315913,0.002439865,0.000229256,0.000001319118,0.0005433851,0.1311051,0.003872091,0.8075756,0.0311923,0.02142891],"study_design_scores_gemma":[0.001034736,0.00001471376,0.00009072147,0.00003880414,0.0001514375,1.87886e-7,0.0002313883,0.9137912,0.0003943814,0.03869247,0.04515871,0.000401225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002744662,0.00002127308,0.984873,0.0006788744,0.0003156802,0.001860811,0.000004617526,0.0003279595,0.009173144],"genre_scores_gemma":[0.1400278,0.00001176124,0.8556522,0.001708006,0.0005312769,0.0009737769,0.000426364,0.00008230837,0.0005865202],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7826862,"threshold_uncertainty_score":0.9999807,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06192859394975599,"gpt":0.2857134996855245,"spread":0.2237849057357685,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007536593,0.0001918531,0.0002855537,0.0001794148,0.0001332819,0.00007517198,0.0008642633,0.00006897307,0.0001092352],"category_scores_gemma":[0.000123548,0.0001306636,0.00006601887,0.001015261,0.0002791944,0.000161042,0.0001903571,0.000272438,0.00004573382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003654881,"about_ca_system_score_gemma":0.00003202098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008848126,"about_ca_topic_score_gemma":0.00005254976,"domain_scores_codex":[0.9983678,0.00007167897,0.000429539,0.0003275162,0.0004080559,0.0003954188],"domain_scores_gemma":[0.9980745,0.0007260535,0.0001920722,0.000881231,0.00007068807,0.00005547852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001280762,0.0001305451,0.00003514142,0.00007365401,0.000011821,0.000002700089,0.00101263,0.001137554,0.002227927,0.9948533,0.00005413908,0.0004477336],"study_design_scores_gemma":[0.0002889911,0.00006499411,0.0001741756,0.00003384375,0.000003225878,0.000005019549,0.0001614704,0.03349373,0.002628517,0.9629403,0.00005751065,0.0001482352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2155292,0.00004201274,0.7654068,0.0004729044,0.00002976454,0.001112801,0.00000639825,0.00006936217,0.01733077],"genre_scores_gemma":[0.8919675,0.00001620413,0.1074314,0.0002151309,0.000006177801,0.0002114968,0.000006975518,0.0000176035,0.000127533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6764383,"threshold_uncertainty_score":0.5328306,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03774536950012889,"gpt":0.2634281414588022,"spread":0.2256827719586733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007144947,0.0001161166,0.0001996835,0.0000787756,0.00007227022,0.00002678427,0.0003638462,0.00006438437,0.0000246558],"category_scores_gemma":[0.0001042198,0.00009633029,0.00003699962,0.0006097024,0.00005153816,0.0001409908,0.000159219,0.00009349909,0.0002054371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008705138,"about_ca_system_score_gemma":0.00003353817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002424793,"about_ca_topic_score_gemma":0.000005002616,"domain_scores_codex":[0.9990017,0.00002135167,0.0003351376,0.0001429912,0.0002451709,0.0002536539],"domain_scores_gemma":[0.9987857,0.0002077316,0.0001755126,0.0006097276,0.0001195328,0.0001018049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002055567,0.0001336046,0.001254186,0.00004188931,0.00002213792,1.388317e-7,0.001639592,0.00005385434,0.002488914,0.9926009,0.001264808,0.0004979324],"study_design_scores_gemma":[0.002084816,0.000270639,0.06161675,0.0002619387,0.0001970613,0.0000280612,0.000726323,0.1110619,0.02422497,0.7949843,0.002511242,0.002032058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2582674,0.0006784663,0.6819796,0.0002020959,0.0007047052,0.0006092923,0.00002489724,0.0004306387,0.05710292],"genre_scores_gemma":[0.8335834,0.000005235548,0.1661889,0.00004060925,0.000004371062,0.000007796152,0.00001229022,0.00001133069,0.0001460929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.575316,"threshold_uncertainty_score":0.3928235,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.008347250750734546,"gpt":0.2142126271217022,"spread":0.2058653763709677,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004065869,0.000145959,0.0002004624,0.000146301,0.0002293745,0.00009992599,0.0003833493,0.0000476237,7.318373e-7],"category_scores_gemma":[0.00001820578,0.00009072653,0.00006469782,0.0006811886,0.0001628526,0.00007724256,0.0001975061,0.00008535998,0.000004098014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004385972,"about_ca_system_score_gemma":0.00001181664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000188791,"about_ca_topic_score_gemma":0.000004086372,"domain_scores_codex":[0.9988104,0.0000131402,0.0003789237,0.0002308565,0.0003290013,0.0002377329],"domain_scores_gemma":[0.9988213,0.0002925954,0.0002101083,0.0005715071,0.00005430104,0.00005023105],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001579415,0.00003525169,0.00006343639,0.00003226613,0.00001227161,4.649173e-7,0.0001389879,0.00006636246,0.004935469,0.9928786,0.0002095798,0.001625742],"study_design_scores_gemma":[0.0002842816,0.00003318073,0.0002894914,0.00002532455,0.00002354155,0.000004639927,0.0001796919,0.01681616,0.007935799,0.9741502,0.0001068233,0.000150814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6925774,0.003601594,0.2745395,0.0005425427,0.0002767977,0.0009538907,0.000008588398,0.0004828445,0.0270168],"genre_scores_gemma":[0.9306274,0.00005750842,0.06922115,0.00001886789,0.000002201849,0.00001522582,0.000002079149,0.00001031646,0.00004526764],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2380499,"threshold_uncertainty_score":0.3699721,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02828176812337445,"gpt":0.2673533262481674,"spread":0.239071558124793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003399084,0.0002458372,0.0002875061,0.00016257,0.0002226976,0.0001689801,0.0006218244,0.00006492148,0.00002104271],"category_scores_gemma":[0.00004276671,0.0001868423,0.0000404275,0.0005092092,0.0002028482,0.0002072515,0.0002748765,0.0002704051,0.00005250163],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002691612,"about_ca_system_score_gemma":0.000009241199,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.635042e-7,"about_ca_topic_score_gemma":0.000001862338,"domain_scores_codex":[0.9983611,0.00002635407,0.0002640777,0.0004613406,0.0004414801,0.0004456772],"domain_scores_gemma":[0.9984662,0.0004818561,0.0001530691,0.0006975153,0.00004822088,0.0001531279],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001885506,0.00006590782,0.00003972701,0.0001152501,0.00002383407,0.00001404438,0.002447281,0.00002696752,0.001396658,0.9890845,0.0001425338,0.006624424],"study_design_scores_gemma":[0.002269587,0.0007181376,0.0002107607,0.0002500798,0.0000320508,0.00007043511,0.001227858,0.05762142,0.01454101,0.9211392,0.0009181075,0.001001305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2841811,0.00009542771,0.6117011,0.0004913137,0.00005848849,0.001476066,0.00001418357,0.0005536824,0.1014286],"genre_scores_gemma":[0.7427121,0.0000288741,0.2565683,0.0001592804,0.00001473218,0.000132178,0.000002222734,0.00003585297,0.0003464363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.458531,"threshold_uncertainty_score":0.7619209,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02766122019691645,"gpt":0.2810312807924654,"spread":0.253370060595549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004148503,0.000167966,0.0002066762,0.00005959116,0.0001870482,0.0001440567,0.00058079,0.00007469211,0.00002078992],"category_scores_gemma":[0.00006010764,0.0001324099,0.0000660783,0.0001842372,0.00003160425,0.0001221484,0.0001597577,0.0001318075,0.00006442283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002540173,"about_ca_system_score_gemma":0.00004179353,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001365607,"about_ca_topic_score_gemma":6.010126e-7,"domain_scores_codex":[0.9987946,0.00001482261,0.0002021884,0.0003341395,0.0003284591,0.0003258111],"domain_scores_gemma":[0.9986517,0.0002961988,0.00006777184,0.0008318623,0.00004471605,0.0001077376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004450343,0.00008366148,9.684965e-7,0.00006145417,0.000009314784,0.000001028687,0.0004976132,0.0001146072,0.001013631,0.9949217,0.001731796,0.001559781],"study_design_scores_gemma":[0.00130898,0.0001784598,0.0000260395,0.00006890174,0.0000202618,0.000008302149,0.0004088776,0.2906895,0.03560638,0.6592716,0.01182306,0.0005895906],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002715544,0.00001119458,0.9731091,0.0001403098,0.00009606295,0.0004941036,0.00001912468,0.000123966,0.02329058],"genre_scores_gemma":[0.130215,0.000004965872,0.8690807,0.0002616863,0.00003454103,0.00008935147,0.00001877777,0.00002404326,0.000270968],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3356501,"threshold_uncertainty_score":0.5399518,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1263009194520116,"gpt":0.3558418059577799,"spread":0.2295408865057684,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00319964,0.000253393,0.0004337426,0.0001254076,0.0002097744,0.0004121029,0.001327036,0.0001396789,0.0005954356],"category_scores_gemma":[0.0009933676,0.0001869705,0.00007228618,0.0009632398,0.00009508234,0.0004209495,0.00029498,0.0001562306,0.0002967624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002269113,"about_ca_system_score_gemma":0.00006936775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002355485,"about_ca_topic_score_gemma":0.00000804141,"domain_scores_codex":[0.9967274,0.00008404874,0.001071194,0.0006543609,0.001068099,0.0003948656],"domain_scores_gemma":[0.9964665,0.0004516414,0.0006020947,0.002178629,0.0001630966,0.0001380156],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001611314,0.0001147074,0.0002538172,0.00002676931,0.00004454772,0.000003019561,0.00160919,0.7447596,0.00003644951,0.1912016,0.05598189,0.005952245],"study_design_scores_gemma":[0.000544378,0.0000398968,0.00002355292,0.00005275408,0.00007677349,0.00002050512,0.001381584,0.7346318,0.0001514561,0.1942725,0.06831574,0.0004891253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008176736,0.0001121724,0.887346,0.0001133727,0.0002865141,0.000545311,0.00003461882,0.00008817044,0.1106561],"genre_scores_gemma":[0.08582672,0.0003384269,0.9103577,0.000223993,0.0001984343,0.00005828382,0.0004298647,0.00007279578,0.002493821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1081623,"threshold_uncertainty_score":0.7624434,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0213364122456201,"gpt":0.2471069906702213,"spread":0.2257705784246012,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001089017,0.000460654,0.0003831213,0.0003187539,0.0005168143,0.0003772675,0.001874891,0.0003297248,0.00002193229],"category_scores_gemma":[0.0002100173,0.0004125711,0.0005436885,0.001456628,0.0003328076,0.0004768191,0.0009507511,0.0005660164,0.0002410278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009329219,"about_ca_system_score_gemma":0.0001037345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005343123,"about_ca_topic_score_gemma":0.00001441107,"domain_scores_codex":[0.9966261,0.00006061515,0.0008798395,0.000732115,0.0009977816,0.0007035654],"domain_scores_gemma":[0.9961833,0.0006153217,0.0008526545,0.00205588,0.00007562008,0.0002171641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009055808,0.0003376674,0.00003130514,0.0004776177,0.0001725528,0.00001852923,0.002895125,0.00002477115,0.0008363485,0.9930207,0.0001183519,0.001976536],"study_design_scores_gemma":[0.001047736,0.0006119347,0.0003350529,0.000768257,0.0002566289,0.0000670826,0.001056273,0.8224288,0.01935743,0.1515125,0.001698041,0.0008602974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9093395,0.0001337454,0.07937439,0.00004882711,0.0001284556,0.00139983,0.00009824116,0.0003316058,0.009145382],"genre_scores_gemma":[0.9376107,0.00005148014,0.05880859,0.0002859024,0.0001169879,0.002966752,0.0000615421,0.00009551411,0.000002539358],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8415082,"threshold_uncertainty_score":0.9998326,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.173262291549744,"gpt":0.3769068393962284,"spread":0.2036445478464845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00238575,0.0001646921,0.0003680015,0.0002268059,0.0006482891,0.0001404642,0.0006051722,0.00009284918,0.0001269793],"category_scores_gemma":[0.0009493764,0.0001268516,0.000143071,0.001001093,0.0001576123,0.000105108,0.0001164944,0.0001535032,0.0003937889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002507717,"about_ca_system_score_gemma":0.0001184848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008701495,"about_ca_topic_score_gemma":0.000001462221,"domain_scores_codex":[0.9976411,0.000019933,0.0005253265,0.0004051259,0.0009282799,0.0004802436],"domain_scores_gemma":[0.9966094,0.00211648,0.0001530093,0.0007259352,0.0002423121,0.0001528631],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000186585,0.00009304906,0.0001039335,0.00002778668,0.00003709651,0.000001548611,0.001743845,0.003117466,0.003218621,0.9874534,0.003940298,0.0002442817],"study_design_scores_gemma":[0.001143947,0.00007641261,0.0001845582,0.00003663242,0.00007994399,0.00003941479,0.004212244,0.04518653,0.01451847,0.9177732,0.01622245,0.0005262081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07014537,0.00004967924,0.8781286,0.0002967455,0.000181871,0.0005228042,0.0000343588,0.0001378709,0.05050265],"genre_scores_gemma":[0.4043876,0.000008348636,0.5923274,0.00005957505,0.0001031573,0.0001154221,0.000008253447,0.00002741995,0.002962887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3342422,"threshold_uncertainty_score":0.5172858,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0241343793073814,"gpt":0.2471114268951056,"spread":0.2229770475877242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008169932,0.0001913725,0.0002236704,0.0001549806,0.0001379594,0.0001038543,0.0006299773,0.00008674746,0.0000172551],"category_scores_gemma":[0.00002970857,0.0001586197,0.00008627707,0.00050116,0.0001299362,0.00009794553,0.000159968,0.0001396051,0.0001404818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001161238,"about_ca_system_score_gemma":0.00002983649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003244769,"about_ca_topic_score_gemma":0.000004446068,"domain_scores_codex":[0.9984644,0.000005917614,0.0004162467,0.0003237906,0.0003542163,0.0004354054],"domain_scores_gemma":[0.9987121,0.0001785478,0.0001442662,0.0007356959,0.00006008585,0.0001693667],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000002228802,0.00005086129,0.00001203732,0.00003131196,0.00001567744,0.000008721487,0.0007015106,0.000006867921,0.01031417,0.9823195,0.0002926216,0.006244473],"study_design_scores_gemma":[0.0006786647,0.00004359539,0.0001218821,0.000039871,0.00002107838,0.00003853304,0.0004175286,0.006020466,0.02154964,0.9699855,0.0006447687,0.0004385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02133064,0.00005957402,0.8734045,0.0001678492,0.0001401779,0.0002406553,0.000001989264,0.0004589438,0.1041956],"genre_scores_gemma":[0.591892,0.000003997419,0.407764,0.0002332923,0.000006363715,0.000008259903,0.000003122313,0.00001275289,0.00007624157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5705613,"threshold_uncertainty_score":0.6468325,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.03618088057861051,"gpt":0.3343979954373477,"spread":0.2982171148587372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006813986,0.000246118,0.0003246772,0.0001494773,0.0002489267,0.0004128653,0.001465636,0.00006793712,0.0001800786],"category_scores_gemma":[0.0000765583,0.0002089003,0.00005263067,0.0005102863,0.00006143314,0.0003624162,0.0005710637,0.0002143824,0.0006452433],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006974202,"about_ca_system_score_gemma":0.00006384421,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000534381,"about_ca_topic_score_gemma":0.00001862968,"domain_scores_codex":[0.9974986,0.00003062134,0.0005434904,0.0005633071,0.0009067857,0.0004572047],"domain_scores_gemma":[0.9979301,0.0001485367,0.0001452964,0.001388454,0.0001107453,0.0002768342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001024078,0.03185799,0.001208462,0.0009188799,0.0006595884,0.0001336869,0.09435702,0.03014091,0.001532132,0.5644032,0.009560479,0.2651253],"study_design_scores_gemma":[0.0009570917,0.0004543014,0.0001368467,0.00001022641,0.00002702352,0.000005921549,0.001023476,0.9891595,0.0005341466,0.004185752,0.003125763,0.0003799304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01301046,0.00001001645,0.9744422,0.0008484209,0.00006647698,0.001101124,0.000005423323,0.0002357707,0.01028004],"genre_scores_gemma":[0.229787,0.000009672231,0.7689384,0.000277033,0.000146147,0.0002011966,0.000008458524,0.00003820704,0.0005938893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9590186,"threshold_uncertainty_score":0.8518705,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03861793585691882,"gpt":0.2425722508806519,"spread":0.2039543150237331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003353844,0.000147402,0.0002236079,0.00002858724,0.0001697137,0.000008894651,0.0002275066,0.00007989373,0.00001310751],"category_scores_gemma":[0.00004735575,0.0001074999,0.00006119411,0.000376307,0.00009261219,0.0000449415,0.00004650629,0.0001573954,0.000009078078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004003715,"about_ca_system_score_gemma":0.00001877488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002084991,"about_ca_topic_score_gemma":0.000001031601,"domain_scores_codex":[0.999051,0.00003336548,0.0004059483,0.00009844862,0.0001939994,0.0002172679],"domain_scores_gemma":[0.9991372,0.0002142807,0.0001176545,0.0004416874,0.00004759381,0.00004157224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001873273,0.00001804707,0.00006518507,0.00009090966,0.00002986583,2.047985e-7,0.001625151,0.9848102,0.00244415,0.01049045,0.00029392,0.0001300477],"study_design_scores_gemma":[0.0002526265,0.000005700238,0.0003499422,0.00004622781,0.00003327103,0.000006933059,0.0001170735,0.9800089,0.009197952,0.009756662,0.00005566367,0.0001690221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02855857,0.00001608123,0.9614813,0.00001786316,0.00006104175,0.0005589579,0.000007820738,0.0002570096,0.009041371],"genre_scores_gemma":[0.4296998,0.000006803855,0.5701803,0.000007532063,0.0000190863,0.00002806543,0.000003747811,0.00003002365,0.00002459037],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4011413,"threshold_uncertainty_score":0.4383718,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005108295393556165,"gpt":0.2281670594860915,"spread":0.2230587640925354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001224163,0.000167629,0.0001507616,0.00002274742,0.00006614352,0.00002573061,0.0001591807,0.00007917015,0.00002439694],"category_scores_gemma":[0.00001601172,0.000150402,0.00005840221,0.00005948999,0.00004202969,0.000002356275,0.00005851937,0.00005733739,0.00006621376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001082153,"about_ca_system_score_gemma":0.000009087755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002261447,"about_ca_topic_score_gemma":0.000002347731,"domain_scores_codex":[0.9990702,0.000006272262,0.0002410754,0.0002600194,0.0001775651,0.0002448509],"domain_scores_gemma":[0.9994756,0.00001333459,0.0001368219,0.0003166501,0.00001925207,0.0000383379],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001448134,0.0001129143,0.00004903588,0.0000954446,0.00002600648,0.000001067331,0.00004978495,0.0001296401,0.9776293,0.008649105,0.01022475,0.003018453],"study_design_scores_gemma":[0.001147148,0.0002150593,0.00006226824,0.00004890349,0.00006255473,0.000005606801,0.00062736,0.0003557606,0.8534718,0.02349756,0.1197172,0.0007887046],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4867094,0.00138855,0.07131121,0.0002444674,0.0001654511,0.001151823,0.00008842185,0.000131789,0.4388089],"genre_scores_gemma":[0.9464521,0.0001969324,0.04951641,0.0002081985,0.0003431599,0.0001074794,0.000502605,0.00008242336,0.002590677],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4597427,"threshold_uncertainty_score":0.6133216,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1098868155869601,"gpt":0.385019381873026,"spread":0.275132566286066,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007286857,0.0001835951,0.0002923771,0.0001408057,0.0006205927,0.0002495441,0.0008976869,0.0000908585,0.00004605902],"category_scores_gemma":[0.0004174281,0.0001073773,0.0001494418,0.0005755151,0.0001524126,0.0001445121,0.00008451159,0.0001770477,0.0001484437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003319283,"about_ca_system_score_gemma":0.00005646197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008271144,"about_ca_topic_score_gemma":0.00001641603,"domain_scores_codex":[0.9975768,0.00001830674,0.0006624858,0.000397826,0.0008604507,0.000484105],"domain_scores_gemma":[0.9944824,0.003994441,0.0002883657,0.0008627155,0.0002303116,0.0001417759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005950692,0.0002622429,0.000008882084,0.00001846358,0.0001416941,0.00000261815,0.00723332,0.003644147,0.002063088,0.4911731,0.001217417,0.4941755],"study_design_scores_gemma":[0.0006618134,0.0001394234,0.0001300569,0.00002185906,0.0001509519,0.00001017947,0.02910974,0.4528417,0.005844639,0.5070353,0.003669277,0.000385096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003446878,0.00006911933,0.979894,0.0001554102,0.0001905141,0.0008304022,0.00002473322,0.0001160653,0.01527281],"genre_scores_gemma":[0.24563,0.00000264546,0.7532822,0.0001005908,0.0002419782,0.0001452662,0.000005030582,0.00002865824,0.000563691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4937904,"threshold_uncertainty_score":0.477316,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04505282759936129,"gpt":0.3107119446623994,"spread":0.2656591170630381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000879876,0.0001681731,0.0002478274,0.0001136816,0.0001672413,0.00006688259,0.0008473075,0.00005686322,0.00002539161],"category_scores_gemma":[0.0001449327,0.0001182998,0.0001409278,0.0005507297,0.0001686675,0.0001467637,0.0001501216,0.0001505914,0.00002041121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001352246,"about_ca_system_score_gemma":0.00003565219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000211627,"about_ca_topic_score_gemma":0.000002543697,"domain_scores_codex":[0.9986507,0.00004002163,0.0003767858,0.0002645415,0.0003251026,0.0003428848],"domain_scores_gemma":[0.9978303,0.001005428,0.0001974238,0.0007540032,0.0001441652,0.00006865386],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000637194,0.00007335778,0.000001662204,0.00008905968,0.00005109005,6.286842e-7,0.0008909409,0.00002246908,0.001220634,0.8859209,0.00008050601,0.1116423],"study_design_scores_gemma":[0.0004259329,0.00007549741,0.000006476182,0.00002101371,0.00002270428,0.000006354058,0.0009302694,0.05048544,0.02008929,0.9268503,0.0009297311,0.0001570017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002142456,0.00005038275,0.9930312,0.00004199125,0.00005616748,0.0008404681,0.00003377845,0.00006901244,0.003734567],"genre_scores_gemma":[0.1268005,0.00002802623,0.8725408,0.00008580471,0.00001909292,0.0003855764,0.00001737988,0.00003564742,0.00008711382],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1246581,"threshold_uncertainty_score":0.4824126,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00705399009592934,"gpt":0.202820232867502,"spread":0.1957662427715727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001096937,0.0001423498,0.0001796523,0.00004617134,0.00005477332,0.00003063506,0.00009728249,0.00004725851,0.00005909855],"category_scores_gemma":[0.000002182522,0.0001247268,0.0000446947,0.00007196996,0.00003792154,0.00003392096,0.000009382373,0.0001060432,0.0003913412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002742175,"about_ca_system_score_gemma":0.00000271347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.305464e-7,"about_ca_topic_score_gemma":8.63115e-7,"domain_scores_codex":[0.9993865,0.000005426346,0.000217451,0.00009399831,0.0001300191,0.0001666082],"domain_scores_gemma":[0.9996109,0.00007931625,0.0000315451,0.000219098,0.000008145667,0.00005096745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000006598769,0.00003343859,5.880394e-7,0.0001310464,0.00003221918,0.000001111959,0.0006352792,0.006736872,0.02318465,0.9667447,0.000816993,0.001676492],"study_design_scores_gemma":[0.00189619,0.0001094192,0.00003338526,0.00054001,0.000150663,0.00004668841,0.001947574,0.2036152,0.1920904,0.5882409,0.00976173,0.001567861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3576514,0.00008586352,0.0759709,0.00004636375,0.00013739,0.0004417856,0.00004135806,0.0007366775,0.5648883],"genre_scores_gemma":[0.9943208,0.000007261607,0.005440217,0.00005354635,0.00005355044,0.00003977735,0.00001746424,0.00003042607,0.00003702261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6366693,"threshold_uncertainty_score":0.5086213,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1374153424586914,"gpt":0.3559697696159796,"spread":0.2185544271572882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004496624,0.0001995318,0.0003538345,0.0001333682,0.0001561603,0.00002101119,0.000332178,0.0000873246,0.0001616905],"category_scores_gemma":[0.0009625753,0.000145852,0.00006340796,0.0004465153,0.0001298403,0.00008460433,0.00009932942,0.0002565381,0.00002510783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008851462,"about_ca_system_score_gemma":0.00004091631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005270149,"about_ca_topic_score_gemma":0.00002198698,"domain_scores_codex":[0.9981664,0.0000425934,0.000629204,0.0002523435,0.0006081505,0.000301252],"domain_scores_gemma":[0.9972613,0.00165908,0.0002708835,0.0006708602,0.00008200054,0.00005582211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002011211,0.0004564234,0.00008636881,0.0002601393,0.00003271992,0.000005404337,0.006065526,0.004042412,0.01753077,0.9699774,0.001082238,0.000440529],"study_design_scores_gemma":[0.002369722,0.0001771044,0.0002291446,0.0002661823,0.00004185066,0.00001717061,0.003846312,0.3397158,0.08376182,0.5684635,0.0002654078,0.0008459456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6783593,0.00001704129,0.2956317,0.0002478846,0.000048626,0.001967299,0.00002193202,0.0001017314,0.02360449],"genre_scores_gemma":[0.7851156,0.00004259573,0.2138976,0.00008962114,0.0000641353,0.000335923,0.00001554374,0.00007655851,0.0003623929],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4015138,"threshold_uncertainty_score":0.5947673,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02416877056378365,"gpt":0.2894888853845869,"spread":0.2653201148208033,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002441877,0.0002214752,0.0002282681,0.0003691059,0.0001626214,0.0001463802,0.0009498607,0.00007966034,0.00001702191],"category_scores_gemma":[0.0001078765,0.0001845203,0.00008407115,0.001017946,0.0001127748,0.0002549763,0.0002220148,0.00020925,0.0001823267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003808233,"about_ca_system_score_gemma":0.00001926173,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001249483,"about_ca_topic_score_gemma":0.000002025867,"domain_scores_codex":[0.9982558,0.00003288014,0.0003187881,0.0004108846,0.0005573786,0.0004243003],"domain_scores_gemma":[0.9982278,0.0004485258,0.0001322362,0.001013415,0.00006438152,0.0001136359],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002076271,0.0001255237,0.00002702141,0.00004057004,0.00001532436,0.00002319855,0.001024254,0.00008042981,0.006518813,0.9477693,0.0001246896,0.04423013],"study_design_scores_gemma":[0.0006158661,0.0001640334,0.0005224218,0.0000511532,0.00001207926,0.00002220349,0.0003713174,0.02547427,0.01144884,0.9596233,0.001218424,0.0004761372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04415759,0.0000143092,0.9121478,0.0001471902,0.00006640059,0.0004298578,0.000003414667,0.0003084668,0.04272494],"genre_scores_gemma":[0.6190067,0.0001045048,0.3799942,0.0002325281,0.00004612732,0.0001773412,0.00001048287,0.00004228625,0.0003858442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5748491,"threshold_uncertainty_score":0.7524518,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01968403011513852,"gpt":0.2687723857027823,"spread":0.2490883555876438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005996393,0.000176041,0.0002008609,0.00004041966,0.0001502964,0.00007834363,0.0002935613,0.000099827,0.00003738424],"category_scores_gemma":[0.00004671484,0.0001331332,0.00006022155,0.0002471214,0.00003979004,0.00004924091,0.00004942016,0.000183981,0.00003636561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006677627,"about_ca_system_score_gemma":0.00003688776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002240568,"about_ca_topic_score_gemma":6.104727e-7,"domain_scores_codex":[0.9990276,0.000007584381,0.0002904553,0.0001507011,0.0001814267,0.000342258],"domain_scores_gemma":[0.9990101,0.0004030047,0.00003813148,0.0004423522,0.0000439443,0.00006245692],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002924261,0.00001566454,0.000001356087,0.0001823188,0.00004111444,2.070718e-7,0.0006687192,0.5281119,0.002306528,0.4674951,0.00006292982,0.00111128],"study_design_scores_gemma":[0.00104207,0.00002424406,0.00001099669,0.00005165802,0.00008787603,0.000007658733,0.0009725495,0.7018995,0.02340153,0.2710199,0.001116427,0.0003656114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006037512,0.00005001035,0.9717149,0.0001513314,0.0001029619,0.000740184,0.00001790639,0.0003681083,0.02625083],"genre_scores_gemma":[0.1238171,0.00002250688,0.8755813,0.00008722643,0.0001041944,0.0002232971,0.00001430246,0.00009758905,0.00005246521],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1964752,"threshold_uncertainty_score":0.5429015,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009067863765680985,"gpt":0.240658269237084,"spread":0.231590405471403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001654098,0.0001292401,0.0001643365,0.00007607007,0.00006350125,0.00008833787,0.0004914586,0.00004806287,0.0000175225],"category_scores_gemma":[0.00001537984,0.0001195455,0.00003830328,0.0003611273,0.00003201136,0.000104137,0.00008795029,0.00009025232,0.0001737034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004057242,"about_ca_system_score_gemma":0.00003044419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003011682,"about_ca_topic_score_gemma":0.000009089452,"domain_scores_codex":[0.9990982,0.000008480037,0.0002503391,0.0002420366,0.0001600539,0.0002408716],"domain_scores_gemma":[0.9991218,0.00006192821,0.00006931623,0.000679775,0.00001155784,0.0000555678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[1.841865e-7,0.00005650393,0.000007046535,0.00002030645,0.000003473904,0.000001483499,0.0008736593,0.00002998366,0.003696705,0.9943283,0.00006750287,0.0009148502],"study_design_scores_gemma":[0.0005185032,0.00001505578,0.0002288974,0.000027739,0.00001149609,0.00001868185,0.0008609894,0.1332173,0.01228921,0.8431763,0.009123189,0.0005125806],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02164189,0.00007708557,0.8915778,0.0001589212,0.0000539647,0.0003127247,0.000002399215,0.0001905691,0.08598462],"genre_scores_gemma":[0.6862865,0.00001436336,0.3132701,0.00005976991,0.000004275063,0.0001035049,0.000004586191,0.00001294612,0.0002439394],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6646446,"threshold_uncertainty_score":0.4874924,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Discrete mathematics; Graph; Graph isomorphism; Line graph","retraction":null,"screen_n_in":null,"score":{"opus":0.04135075435661177,"gpt":0.2841048643191326,"spread":0.2427541099625208,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005353668,0.0001914014,0.0002509914,0.0003456493,0.0002328763,0.0001269833,0.000847257,0.00007323929,0.00006528434],"category_scores_gemma":[0.00005366772,0.0001814049,0.00009159929,0.001006527,0.00008130609,0.0003396843,0.000160527,0.0003656725,0.0001438154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004539502,"about_ca_system_score_gemma":0.000009522886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001047165,"about_ca_topic_score_gemma":0.000005658987,"domain_scores_codex":[0.9983257,0.00003771856,0.0003678436,0.0003665286,0.0003796447,0.0005225614],"domain_scores_gemma":[0.9988008,0.0003129653,0.00008524851,0.0006671441,0.00002413844,0.0001097351],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001488255,0.00007998509,0.00001429249,0.00006060227,0.000009259914,0.00001609834,0.007170449,0.0001269562,0.005127475,0.9838012,0.00006708132,0.003525067],"study_design_scores_gemma":[0.0004656943,0.00002602507,0.00004394865,0.00007352354,0.000006336509,0.00001249565,0.001326381,0.0931583,0.002490135,0.9019639,0.0001154707,0.0003178223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03325857,0.00008340773,0.9275686,0.0003184317,0.00005146334,0.0005029645,0.000007359583,0.0002205984,0.03798867],"genre_scores_gemma":[0.8483989,0.00003132109,0.1512546,0.00005994062,0.000013207,0.0001107498,0.000002794314,0.00002405403,0.0001044423],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8151403,"threshold_uncertainty_score":0.7397479,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01423618923611557,"gpt":0.232626912351096,"spread":0.2183907231149804,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009032254,0.000117423,0.0001082562,0.00005635973,0.0001340556,0.0001150813,0.0002703698,0.00004484815,0.0006577015],"category_scores_gemma":[0.00001235552,0.0001063885,0.00003468898,0.00022218,0.00004402862,0.0001376551,0.0000292397,0.00008689388,0.0007587862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003070031,"about_ca_system_score_gemma":0.00002856469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.485731e-7,"about_ca_topic_score_gemma":8.814382e-7,"domain_scores_codex":[0.9991722,0.000009267192,0.0002085039,0.0002072681,0.0002477416,0.0001550221],"domain_scores_gemma":[0.9993697,0.00006122335,0.00006146347,0.0004038282,0.00001322461,0.00009052608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001814402,0.00006638293,0.00001785432,0.00001432044,0.00001530456,0.000001398643,0.00121266,0.003254076,0.0005991049,0.9328787,0.001050582,0.06088778],"study_design_scores_gemma":[0.001247025,0.0001010684,0.001793256,0.000104738,0.00003717002,0.00002094319,0.0002927751,0.6392853,0.005722895,0.3352025,0.01528555,0.0009068433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005865746,0.000002017288,0.7709891,0.0006421804,0.00005761206,0.0002360803,0.000003975043,0.0002588549,0.2219444],"genre_scores_gemma":[0.4603258,0.00001211358,0.5371585,0.00101996,0.00003222503,0.00006329652,0.00001755456,0.00001704006,0.001353486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6360312,"threshold_uncertainty_score":0.9752914,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01772607808304285,"gpt":0.2947188118428381,"spread":0.2769927337597953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524246,0.0001804919,0.0002114457,0.0001267977,0.0002267414,0.0002012446,0.0004286046,0.00006758494,0.00001694511],"category_scores_gemma":[0.00008090297,0.0001598274,0.00004568562,0.000332331,0.0001448168,0.0002736313,0.0002286795,0.0002108905,0.00003312084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002496075,"about_ca_system_score_gemma":0.00003088748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001820665,"about_ca_topic_score_gemma":0.000004963044,"domain_scores_codex":[0.99856,0.0000464838,0.0002813094,0.0003723427,0.0003807998,0.0003591337],"domain_scores_gemma":[0.9989567,0.0001758708,0.000102027,0.0005648721,0.00004588712,0.0001546373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000256263,0.00003388749,0.00006900671,0.00006020055,0.00001502214,0.000004785712,0.001913809,0.00001544769,0.002320441,0.993592,0.00002849561,0.001944292],"study_design_scores_gemma":[0.0002518253,0.00003249443,0.00007756884,0.0000229449,0.000005829459,0.00001828266,0.0004179313,0.002014037,0.01196889,0.9846478,0.0003365768,0.0002058499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08998232,0.0001286132,0.8888231,0.0001003761,0.00005075096,0.0003833599,0.000001897809,0.0002029061,0.02032669],"genre_scores_gemma":[0.6434745,0.00003301052,0.356295,0.00007102224,0.000005882825,0.00007328133,0.000002159293,0.00001610549,0.00002897429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5534922,"threshold_uncertainty_score":0.6517572,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02201358486141114,"gpt":0.2857251221677339,"spread":0.2637115373063227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000154851,0.0001904321,0.0003108885,0.00004845034,0.0004930503,0.0002850178,0.0005629898,0.00003266279,0.0006870099],"category_scores_gemma":[0.00000430852,0.0001686765,0.000182239,0.00005873068,0.00008912799,0.00008289934,0.0002309243,0.0001435931,0.0001145547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008649356,"about_ca_system_score_gemma":0.000011217,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003072476,"about_ca_topic_score_gemma":0.000001416319,"domain_scores_codex":[0.9990473,0.000004260506,0.000261497,0.0002399226,0.0001890093,0.0002579706],"domain_scores_gemma":[0.9983938,0.00003443975,0.0003473338,0.001123249,0.00003093731,0.00007023903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004622884,0.00009931232,0.002666957,0.0000453569,0.0002696221,0.000001231953,0.001386463,0.00001143287,0.003679229,0.9694502,0.008903699,0.01348189],"study_design_scores_gemma":[0.0003826698,0.00001417533,0.0009179653,0.00008018902,0.0002133976,6.532417e-7,0.0007290462,0.005746,0.01212819,0.9720461,0.007206718,0.0005349056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1005999,0.00001945998,0.4266532,0.0002709466,0.00004499027,0.0004088978,0.00002847339,0.0002050489,0.4717691],"genre_scores_gemma":[0.9351211,0.000002498553,0.06394329,0.00004702597,0.000181926,0.00007190637,0.00001782925,0.00003136581,0.0005830891],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8345212,"threshold_uncertainty_score":0.7522277,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08831245293251806,"gpt":0.3294545387333359,"spread":0.2411420858008178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071909,0.000148062,0.0003260537,0.00006895716,0.0001220934,0.0001770262,0.0006201256,0.00004822581,0.00009899274],"category_scores_gemma":[0.0001093325,0.00007851823,0.00003239473,0.0002727864,0.0003958762,0.0001871941,0.0003386571,0.00007949083,0.00002132758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006297567,"about_ca_system_score_gemma":0.00002142461,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001497931,"about_ca_topic_score_gemma":0.00001380144,"domain_scores_codex":[0.9982574,0.00003245361,0.0005903136,0.0003122663,0.000651855,0.0001557275],"domain_scores_gemma":[0.9980468,0.0004006384,0.0003791162,0.001046109,0.00008868505,0.00003861227],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001888555,0.001817117,0.003765973,0.000688337,0.000583032,0.00005515949,0.05599845,0.02780992,0.0299948,0.4909265,0.2082825,0.1781897],"study_design_scores_gemma":[0.0006488365,0.00008500095,0.001593743,0.00007819474,0.0001011618,0.00005845187,0.002933084,0.8821985,0.001190939,0.1091289,0.001676864,0.0003063712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5870184,0.0001497043,0.3620969,0.0008442882,0.0000892106,0.0008248313,0.0004362645,0.00006399224,0.04847639],"genre_scores_gemma":[0.756875,0.0000181955,0.2421283,0.00003537559,0.00006929825,0.000009027904,0.0001843928,0.00002121938,0.0006592878],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8543885,"threshold_uncertainty_score":0.3201881,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.09358971132498799,"gpt":0.3031898687250434,"spread":0.2096001574000554,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003557556,0.0001302426,0.0001898591,0.00006986892,0.0001727176,0.0000543002,0.0009613517,0.00002972179,0.000100213],"category_scores_gemma":[0.00006184299,0.00009034327,0.0000611644,0.0003405512,0.000339583,0.00008943562,0.0002731648,0.0001821976,0.0001031372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002577003,"about_ca_system_score_gemma":0.00001011374,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.019513e-7,"about_ca_topic_score_gemma":4.715394e-7,"domain_scores_codex":[0.9987306,0.00003013094,0.0002760584,0.0002103501,0.0005026659,0.000250189],"domain_scores_gemma":[0.9982096,0.0009277225,0.0001486267,0.0006011159,0.00005735206,0.00005556623],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003001816,0.00007650763,0.00000247065,0.0000327752,0.00001570425,8.11342e-7,0.0008875059,0.0024845,0.000265606,0.9953597,0.0001955474,0.000675822],"study_design_scores_gemma":[0.000144893,0.00003103413,0.00003198936,0.00001729657,0.000002626076,0.000001789046,0.0001565099,0.2642678,0.001148616,0.7340795,0.00003476579,0.00008319946],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02010338,0.00001495242,0.9212214,0.0004474554,0.00003409481,0.0003772667,0.000009036296,0.00007722725,0.05771514],"genre_scores_gemma":[0.8502447,0.000001879516,0.1495678,0.0000653949,0.0000123542,0.00003453415,0.000001850258,0.00001100071,0.00006053157],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8301413,"threshold_uncertainty_score":0.3684092,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02652789412521884,"gpt":0.2368707709948384,"spread":0.2103428768696196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005254884,0.0001256797,0.0001264548,0.00002581768,0.0002222246,0.00001770031,0.0001459635,0.00007378498,0.00000824885],"category_scores_gemma":[0.00003356828,0.00008997196,0.00004264374,0.0001185518,0.00006323811,0.00004256068,0.00002271772,0.0001075168,0.00002684858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003493921,"about_ca_system_score_gemma":0.000004745287,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.301621e-7,"about_ca_topic_score_gemma":0.000002869733,"domain_scores_codex":[0.9993874,9.959431e-7,0.0001975534,0.000102179,0.0001132227,0.000198594],"domain_scores_gemma":[0.9993253,0.0003059408,0.00003199853,0.0002945439,0.00002018956,0.00002197406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002341259,0.00001467845,5.228914e-7,0.00004486366,0.00002292344,2.439136e-7,0.0002055438,0.2538229,0.001862291,0.738332,0.003380991,0.002310684],"study_design_scores_gemma":[0.0002135776,0.00002692743,0.000007478281,0.00001087045,0.00002183002,0.000002819808,0.00008923763,0.8104314,0.002531303,0.184093,0.002409189,0.0001623741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01069407,0.00004583737,0.9763532,0.00009872027,0.0000501625,0.0009874566,0.00001164978,0.0006039675,0.01115496],"genre_scores_gemma":[0.4385019,0.00006176113,0.560438,0.00003944512,0.00007697165,0.000698467,0.00002298995,0.00004573461,0.000114724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5566085,"threshold_uncertainty_score":0.366895,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03393014591615173,"gpt":0.3040478813041502,"spread":0.2701177353879985,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791433,0.0001728393,0.0002830634,0.0002347003,0.0001740474,0.00002488355,0.0007123043,0.00006112675,0.000003186432],"category_scores_gemma":[0.00007423281,0.0001443849,0.0001188361,0.0003981194,0.0001799326,0.00008281031,0.0001407391,0.0001034063,0.00001672385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003096976,"about_ca_system_score_gemma":0.00003521056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.550719e-7,"about_ca_topic_score_gemma":1.938333e-7,"domain_scores_codex":[0.9984629,0.00001636752,0.0003592496,0.0003255642,0.0005176545,0.0003182288],"domain_scores_gemma":[0.998412,0.0005333601,0.00020525,0.0006718936,0.00009885486,0.00007871566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000177111,0.000183433,0.000001339257,0.0001068486,0.00001717957,0.000001862705,0.001014567,0.001164006,0.006154637,0.9891786,0.00007556218,0.002084257],"study_design_scores_gemma":[0.0007651475,0.0001984875,0.00006039846,0.00003732065,0.000009110482,0.000007781189,0.0001824223,0.1708454,0.05350479,0.7740741,0.00009149715,0.0002235168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164491,0.00002785494,0.8793503,0.00007891422,0.00006675171,0.0008303711,0.00001488779,0.0001037702,0.003078046],"genre_scores_gemma":[0.6220733,0.00001186543,0.3775868,0.00003618497,0.00001694473,0.0001697198,0.000006648714,0.00002200545,0.00007660266],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5056242,"threshold_uncertainty_score":0.5887846,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01749099509523101,"gpt":0.2806687305222785,"spread":0.2631777354270475,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006990067,0.0001164491,0.000213695,0.00008918747,0.00003610662,0.00001919554,0.0003357019,0.0000502944,0.000007684092],"category_scores_gemma":[0.0000147647,0.00009513105,0.00002502896,0.0002789062,0.0001084975,0.00009529068,0.0003226211,0.0001152399,0.000005906382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002835332,"about_ca_system_score_gemma":0.0000106364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000338208,"about_ca_topic_score_gemma":0.00001022617,"domain_scores_codex":[0.9988765,0.000008018852,0.0003120686,0.0002191992,0.000313332,0.0002709027],"domain_scores_gemma":[0.9991143,0.0002480435,0.0000962192,0.0004467965,0.00002433911,0.00007035641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000167381,0.00005961696,0.000219577,0.00008191539,0.00000743924,0.0000081397,0.0008022255,0.00001215353,0.01142497,0.9740948,0.00001002601,0.01326237],"study_design_scores_gemma":[0.0008997367,0.0001001089,0.007013892,0.0001017711,0.000006264781,0.000005071731,0.00037743,0.007375328,0.0241648,0.9595771,0.0001265289,0.0002519318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3459406,0.0001614592,0.6445236,0.0001002134,0.00004180072,0.0004424488,0.000001724358,0.00004746515,0.008740696],"genre_scores_gemma":[0.8738048,0.00001332209,0.1260837,0.00003092453,0.000007962638,0.00001242024,9.460229e-7,0.00001007845,0.00003582635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5278642,"threshold_uncertainty_score":0.3879332,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03890792014784756,"gpt":0.2760937952615219,"spread":0.2371858751136744,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001587529,0.0002072781,0.0002356298,0.0000388025,0.0001954899,0.0003101599,0.002388377,0.00007486316,0.00007457419],"category_scores_gemma":[0.00001999792,0.0001598198,0.00003221767,0.0001069815,0.00005311574,0.0007749181,0.0006862063,0.0001136659,0.00001654944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001181167,"about_ca_system_score_gemma":0.00001445999,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000377128,"about_ca_topic_score_gemma":0.000004090859,"domain_scores_codex":[0.9985785,0.00000885096,0.0002872891,0.0005241717,0.0003135563,0.000287665],"domain_scores_gemma":[0.9971618,0.00008861918,0.0001392978,0.002451173,0.00003498107,0.0001241236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001499135,0.0004753124,0.00001894707,0.0003119907,0.00006096028,0.00002168631,0.00734432,0.0003191741,0.03175717,0.7330649,0.01784018,0.2087704],"study_design_scores_gemma":[0.0003086025,0.00005493961,0.0000297306,0.00003975571,0.00002023008,0.00001902912,0.0002803891,0.9445481,0.001919826,0.04952814,0.002932919,0.0003183784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003022889,0.0001130616,0.9944432,0.00006260783,0.0001384948,0.000377404,0.0004180833,0.0001726047,0.001251634],"genre_scores_gemma":[0.1525806,0.00001643868,0.8467531,0.000126894,0.0001843601,0.00003054046,0.0002149095,0.00002487384,0.00006822483],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9442289,"threshold_uncertainty_score":0.6517262,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02337872989377058,"gpt":0.2838929812591506,"spread":0.26051425136538,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004737072,0.000144178,0.0002323493,0.0001514595,0.0000780089,0.00003532603,0.0006841054,0.00004621054,0.00001993393],"category_scores_gemma":[0.0001186945,0.0001224322,0.00007165057,0.0005387003,0.0001055838,0.00009800998,0.0001171592,0.0001456881,0.00005079967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001802023,"about_ca_system_score_gemma":0.00002735278,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.307606e-7,"about_ca_topic_score_gemma":3.820825e-7,"domain_scores_codex":[0.9987206,0.00002488244,0.0002793568,0.0002569738,0.000408166,0.0003100593],"domain_scores_gemma":[0.998534,0.0003992072,0.0001288968,0.00080969,0.00004488662,0.00008334893],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000004677366,0.00006815993,0.000006777135,0.00006232186,0.00001330877,0.000001998998,0.0004606055,0.0001180814,0.006512653,0.9922292,0.00003548844,0.0004867927],"study_design_scores_gemma":[0.0002370626,0.00005716712,0.0000108699,0.00002465254,0.000003762979,0.000002832644,0.000161517,0.001242043,0.06939694,0.9285676,0.0001619229,0.0001335585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06165896,0.00002477755,0.8129457,0.00002680436,0.00006946599,0.0003680398,0.000002878655,0.0001125152,0.1247909],"genre_scores_gemma":[0.7817481,0.000007338932,0.2180532,0.00003338738,0.000003379209,0.0000412223,7.344672e-7,0.00001650128,0.00009613926],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7200891,"threshold_uncertainty_score":0.4992642,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Injective function; Neighbourhood (mathematics); Graph; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.008419413781472318,"gpt":0.2165844492443656,"spread":0.2081650354628932,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002046528,0.0001959555,0.0003449089,0.0000728111,0.0001164546,0.00009884341,0.0002809471,0.00007152923,0.00004792694],"category_scores_gemma":[0.000004847833,0.0001475458,0.00004802361,0.0002197491,0.0001110865,0.0002006855,0.00008183476,0.0001071879,0.00001902711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002170823,"about_ca_system_score_gemma":0.00001711938,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001923074,"about_ca_topic_score_gemma":0.00001082833,"domain_scores_codex":[0.9988309,0.00001869412,0.0003738815,0.0003032449,0.0002621845,0.0002111358],"domain_scores_gemma":[0.9992192,0.00009529107,0.0001455002,0.0004133235,0.00004803608,0.00007862593],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001560788,0.0003202229,0.00006122285,0.0006676352,0.0001952248,0.00002299767,0.02335862,0.003024787,0.01424643,0.8995898,0.001076057,0.05728093],"study_design_scores_gemma":[0.002228578,0.001245256,0.003203315,0.0007518921,0.0001008923,0.0004128462,0.002665415,0.9241231,0.002446017,0.0608044,0.0009533191,0.001064945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8139734,0.00007137642,0.1732953,0.0001387116,0.0001255949,0.0004061182,0.000006264755,0.0001535186,0.01182973],"genre_scores_gemma":[0.9586434,0.00001562774,0.04097153,0.0000378038,0.00003940626,0.00003612298,0.000006725533,0.00001702578,0.0002323912],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9210984,"threshold_uncertainty_score":0.6016741,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2618965418645576,"gpt":0.4012302183666167,"spread":0.1393336765020591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106825,0.0001568166,0.0003882893,0.0002072277,0.00006025055,0.00006953086,0.0008103783,0.0000724019,0.0002234991],"category_scores_gemma":[0.000937101,0.0001134932,0.00007987242,0.0007540802,0.0001013576,0.0001359162,0.00008479369,0.0001757694,0.0002014637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001982765,"about_ca_system_score_gemma":0.00004399355,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001901787,"about_ca_topic_score_gemma":0.00001710979,"domain_scores_codex":[0.9979479,0.0000399864,0.0008761114,0.0003332373,0.0005916561,0.000211087],"domain_scores_gemma":[0.9956968,0.002947498,0.0003743743,0.0007844261,0.0001181989,0.00007874268],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004211981,0.0003371826,0.00004843378,0.000005439187,0.000007262096,0.000001114505,0.004126237,0.0004339976,0.0330073,0.9481722,0.00006824819,0.01375048],"study_design_scores_gemma":[0.0003992243,0.00003652319,0.003660553,0.00004500825,0.000007616598,0.00000187794,0.006526465,0.003571328,0.0100304,0.9755356,0.00005696789,0.0001284697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.836365,0.00001118705,0.05984795,0.0001433959,0.00002381085,0.0004739028,0.00006833651,0.00003061134,0.1030358],"genre_scores_gemma":[0.9756754,0.000003439995,0.02402256,0.00004810036,0.00001072584,0.0000326922,0.000003783307,0.000007544666,0.0001957768],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1393104,"threshold_uncertainty_score":0.4628116,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01573717360601393,"gpt":0.2282554170461791,"spread":0.2125182434401652,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005140384,0.0001170448,0.0001628102,0.00006922925,0.0001278426,0.00004751798,0.0005746269,0.00003476724,0.00001112837],"category_scores_gemma":[0.0000599623,0.00007342955,0.00006487125,0.0002967274,0.00006730016,0.00006066935,0.0001451965,0.0001125998,0.00004444944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008672863,"about_ca_system_score_gemma":0.00001252415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001243892,"about_ca_topic_score_gemma":6.931946e-7,"domain_scores_codex":[0.9990272,0.00001137923,0.0003039688,0.0001773801,0.000292759,0.0001873464],"domain_scores_gemma":[0.9987198,0.0004441704,0.0001830045,0.0005755154,0.00003812863,0.00003934685],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00000132029,0.00004516506,0.000001441805,0.0000240147,0.00001013216,2.476599e-7,0.001238409,0.000374337,0.00752934,0.9883359,0.0002260682,0.00221364],"study_design_scores_gemma":[0.0002478142,0.00003631361,0.000009042307,0.00007310137,0.00001048246,0.000002390112,0.0002659962,0.06255598,0.05373892,0.8828055,0.0001114798,0.0001429795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6716329,0.00008658326,0.2313071,0.002171094,0.000146064,0.0006699752,0.000003188916,0.000302765,0.09368028],"genre_scores_gemma":[0.842609,0.000003535218,0.1570835,0.0002262543,0.000003808682,0.00002614076,4.270119e-7,0.0000086258,0.00003869892],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1709761,"threshold_uncertainty_score":0.299437,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03530198614291502,"gpt":0.2710003486580169,"spread":0.2356983625151019,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003312977,0.0001794109,0.000374353,0.00002590245,0.0002405703,0.000008964159,0.0003122636,0.00006973368,0.00001795634],"category_scores_gemma":[0.0002675691,0.0001213642,0.00008981569,0.000312718,0.0007405842,0.00003318939,0.00008586489,0.0001076684,0.000003197007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005214458,"about_ca_system_score_gemma":0.00002329124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001569695,"about_ca_topic_score_gemma":0.000006547431,"domain_scores_codex":[0.9987896,0.0000194373,0.0005663967,0.0001723793,0.0002500813,0.0002021132],"domain_scores_gemma":[0.996753,0.002016708,0.0004265443,0.0006479995,0.0000991953,0.00005660293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002213154,0.000116366,0.00005723255,0.0002911415,0.00005766887,4.970389e-7,0.00224346,7.666002e-7,0.005653867,0.9908715,0.0004219643,0.0002633451],"study_design_scores_gemma":[0.0003411294,0.00002543586,0.0002809832,0.0000468442,0.00007419045,0.000009691691,0.001570953,0.00009743974,0.008286616,0.9886718,0.0004503856,0.0001445165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9483125,0.0002271282,0.02163709,0.0001979198,0.00002834087,0.0008831387,0.00007086522,0.00006274277,0.02858026],"genre_scores_gemma":[0.9371871,0.0001593445,0.0622305,0.00001185714,0.000009232926,0.00009055663,0.000002532705,0.00002938455,0.0002794881],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04059341,"threshold_uncertainty_score":0.494909,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02418004149120526,"gpt":0.3078530698265606,"spread":0.2836730283353553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005544418,0.0001644118,0.0002449896,0.00006005392,0.0001288338,0.00008804361,0.001204466,0.00004385687,0.00004153457],"category_scores_gemma":[0.0001052371,0.0001018385,0.00007700973,0.0003781529,0.0001176033,0.0001991578,0.0001502854,0.0001793809,0.0001675095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001822177,"about_ca_system_score_gemma":0.00001994536,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.20999e-7,"about_ca_topic_score_gemma":1.409717e-7,"domain_scores_codex":[0.9985758,0.00003143073,0.0003222923,0.0002275023,0.000531539,0.0003114258],"domain_scores_gemma":[0.9978141,0.0008605729,0.0002076659,0.00102298,0.00003608334,0.00005857823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003446877,0.00006723157,0.000002138092,0.00005047153,0.00001370184,0.00000168862,0.00122349,0.00005303648,0.003516231,0.9930441,0.00006858462,0.001955873],"study_design_scores_gemma":[0.0001332024,0.00003867669,0.0000448137,0.00006956315,0.000006654338,0.000004432416,0.0001969825,0.009164165,0.01103709,0.9791564,0.00002351967,0.0001245048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2681305,0.00005164726,0.6410251,0.001781837,0.00006948644,0.0009163918,0.000004946911,0.0002569183,0.08776309],"genre_scores_gemma":[0.9242371,0.000007440986,0.07529633,0.0003323703,0.00002136572,0.00002312422,8.661289e-7,0.00001279867,0.00006861088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6561066,"threshold_uncertainty_score":0.4152853,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01509843615865686,"gpt":0.2453872020497447,"spread":0.2302887658910878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005574048,0.0001756695,0.0002867809,0.0001390804,0.0001301315,0.00004893629,0.0005638842,0.00005954004,0.000009815839],"category_scores_gemma":[0.00002091451,0.0001474031,0.0001109694,0.000688273,0.0001251063,0.0003698532,0.0001766557,0.000127908,0.00003237686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001297946,"about_ca_system_score_gemma":0.00003036014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003139949,"about_ca_topic_score_gemma":7.831931e-7,"domain_scores_codex":[0.9985754,0.00001951089,0.0003485222,0.0002327727,0.0003767074,0.0004470965],"domain_scores_gemma":[0.9990212,0.0001863297,0.0001986297,0.0003833336,0.00008279252,0.0001277115],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002976843,0.0001778518,0.0005052797,0.0001633089,0.00005103095,0.00000139434,0.02462116,0.000003709788,0.03297965,0.916783,0.000062761,0.02464786],"study_design_scores_gemma":[0.003824237,0.0003739447,0.01911755,0.001132492,0.0004073475,0.0001199987,0.02172783,0.1388848,0.511457,0.2904431,0.008764978,0.003746827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07072724,0.0002079533,0.9123615,0.00007471687,0.0001106982,0.0002693828,0.000007145562,0.0001174293,0.01612395],"genre_scores_gemma":[0.8525433,0.00001206955,0.1472763,0.0000896639,0.00004600388,0.000006547391,0.000003525674,0.000009706721,0.00001294582],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7818161,"threshold_uncertainty_score":0.6010922,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06967438577420261,"gpt":0.2304384209778218,"spread":0.1607640352036191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004992586,0.0002472083,0.0002993133,0.000108603,0.0001437995,0.00007834657,0.0002083979,0.00006342067,0.0002598453],"category_scores_gemma":[0.00006930398,0.0002020948,0.00005201579,0.000576112,0.0001805237,0.0001944077,0.00005568966,0.0001186719,0.0001416189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004793929,"about_ca_system_score_gemma":0.0000154294,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000983254,"about_ca_topic_score_gemma":0.0002124674,"domain_scores_codex":[0.9985399,0.00001024072,0.0004837495,0.000318107,0.0003670883,0.0002808637],"domain_scores_gemma":[0.9990394,0.00002899188,0.0002142065,0.0005226302,0.0001754052,0.00001937476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003546922,0.000605649,0.0001425418,0.001690402,0.00005113595,3.745867e-7,0.0002366283,0.3089434,0.0001291209,0.6864254,0.0007690638,0.0009707636],"study_design_scores_gemma":[0.00452039,0.000263132,0.002522185,0.0008083318,0.0005805126,0.000002430987,0.01108274,0.82741,0.001743763,0.1022911,0.04607245,0.002702974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07313436,0.00004268481,0.6944387,0.0004183443,0.000209737,0.002132408,0.00001421764,0.0002801059,0.2293294],"genre_scores_gemma":[0.9936194,0.000004195304,0.005698198,0.0002341728,0.00004600989,0.00008389867,0.0001252797,0.00002098637,0.0001678607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.920485,"threshold_uncertainty_score":0.8241185,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03249075521729931,"gpt":0.2356156697719298,"spread":0.2031249145546305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003803505,0.0002200506,0.0002327579,0.0000775123,0.0005988064,0.0002672415,0.001048411,0.00007135259,0.0001171153],"category_scores_gemma":[0.00005411865,0.0001607303,0.0001435713,0.0004334984,0.00009421452,0.0001718306,0.0002781072,0.0002011095,0.00007760745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002172608,"about_ca_system_score_gemma":0.00001372847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002083187,"about_ca_topic_score_gemma":0.00001540571,"domain_scores_codex":[0.9985418,0.00001358459,0.0004415024,0.0003445611,0.0002756238,0.0003829352],"domain_scores_gemma":[0.9976311,0.001092624,0.0002681217,0.0008719118,0.0000609216,0.00007532629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000153977,0.00009960788,0.000002022408,0.0001357894,0.0000637069,9.189293e-7,0.005906743,0.0001600979,0.0003972108,0.9640932,0.00153508,0.02760405],"study_design_scores_gemma":[0.0003663596,0.00003135755,0.00000843104,0.0000357588,0.0000325717,0.00001301223,0.0003336195,0.5764612,0.0007081677,0.4133924,0.008358352,0.0002587448],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008453712,0.0001247253,0.973694,0.0008868697,0.0001061706,0.0008399551,0.00002885107,0.0002500431,0.02322401],"genre_scores_gemma":[0.1196402,0.00002774968,0.8784306,0.0003623544,0.0001109117,0.0005051718,0.00001104572,0.00003708993,0.0008749413],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5763011,"threshold_uncertainty_score":0.6554391,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01130383720653694,"gpt":0.2372261305907799,"spread":0.225922293384243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001785021,0.0001586279,0.0001968429,0.0001044473,0.00008803423,0.0001215341,0.0008196404,0.00006136089,0.0000460975],"category_scores_gemma":[0.00000808153,0.0001528984,0.00005500977,0.0005721316,0.00003986013,0.0001899109,0.0002819633,0.0001394869,0.0003153439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004563305,"about_ca_system_score_gemma":0.00002906342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001000823,"about_ca_topic_score_gemma":0.000006274109,"domain_scores_codex":[0.9988275,0.000005526987,0.0002884737,0.0003221866,0.0002308415,0.0003254541],"domain_scores_gemma":[0.9990579,0.00005683676,0.0000880938,0.0006943176,0.00001642873,0.00008645375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004798718,0.0003225172,0.0001559635,0.00008289998,0.00001888308,0.00003297899,0.002814621,0.001040837,0.0109942,0.9769382,0.001107186,0.006486865],"study_design_scores_gemma":[0.001500273,0.00004580319,0.001490895,0.00007653825,0.00002882324,0.0001076414,0.001014767,0.900949,0.007662522,0.06549572,0.02062737,0.001000618],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164273,0.00002381135,0.827311,0.0003443616,0.00003562608,0.000352103,0.000002500117,0.0002322854,0.05527094],"genre_scores_gemma":[0.6456874,0.0000198436,0.3534941,0.00009531773,0.00002723999,0.0001197094,0.00001251024,0.00001917914,0.0005247017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9114425,"threshold_uncertainty_score":0.6235017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0261593742790523,"gpt":0.2626392306662744,"spread":0.2364798563872221,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009655498,0.000263066,0.0003179625,0.00004117799,0.0002384207,0.0001163805,0.000256414,0.00008185057,0.000009693384],"category_scores_gemma":[0.0001259515,0.0001774532,0.00005983283,0.0001751016,0.00007233861,0.00007114931,0.00005070011,0.0001616076,0.0000110768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003592161,"about_ca_system_score_gemma":0.00001498669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002915802,"about_ca_topic_score_gemma":0.000006467865,"domain_scores_codex":[0.9986988,0.00002450607,0.0004410709,0.0002047938,0.0002186409,0.0004121419],"domain_scores_gemma":[0.9983354,0.0009746961,0.0001329317,0.0004287099,0.00005643165,0.00007182912],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001208734,0.00002262736,0.00002326995,0.0004101554,0.00009351936,1.261824e-7,0.004019428,0.8886623,0.0008881684,0.103369,0.00004454635,0.002454793],"study_design_scores_gemma":[0.0007951228,0.00002795862,0.00001698697,0.00007635022,0.0001083004,0.000002426503,0.001149763,0.9931208,0.001746683,0.002461174,0.0002120318,0.0002823277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005981429,0.00002691551,0.9908783,0.00006958783,0.0000532196,0.0008823953,0.00001411615,0.0004987809,0.001595222],"genre_scores_gemma":[0.5127568,0.00000194009,0.4866368,0.00003664841,0.00007553615,0.0003285042,0.00001084242,0.00008267417,0.00007020049],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5067754,"threshold_uncertainty_score":0.7236333,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0261931885729084,"gpt":0.2752893651765035,"spread":0.2490961766035951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005557075,0.000206053,0.0003541364,0.00006569384,0.0001884815,0.00001929275,0.0007290948,0.00009526491,0.00004464396],"category_scores_gemma":[0.0001162524,0.0001098717,0.0002225743,0.0005257641,0.0003109165,0.00002426764,0.00006243277,0.0002177428,0.000008217869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001053866,"about_ca_system_score_gemma":0.000026408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001121967,"about_ca_topic_score_gemma":0.000003204896,"domain_scores_codex":[0.9986373,0.00004010996,0.0005417942,0.0001671955,0.0004026964,0.0002109714],"domain_scores_gemma":[0.9974834,0.0007600628,0.0005097599,0.001149919,0.00005698479,0.00003992322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001659819,0.0002789817,0.00001303645,0.0001015694,0.00003860539,1.101965e-7,0.001826855,0.000012046,0.008505768,0.9884322,0.0005259516,0.0002482219],"study_design_scores_gemma":[0.0002025343,0.00003796798,0.0002237317,0.00009906184,0.00007309022,0.000001631641,0.001455861,0.000114862,0.03292374,0.9646162,0.000129735,0.0001215585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8720897,0.00001804933,0.01269986,0.001354096,0.00004382579,0.001498801,0.0000580229,0.00007728286,0.1121604],"genre_scores_gemma":[0.9965162,0.000004097477,0.003037418,0.0001988204,0.00001927992,0.00006987727,0.00000222935,0.0000227577,0.0001293314],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1244265,"threshold_uncertainty_score":0.4480436,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02309181916392646,"gpt":0.3107893249487155,"spread":0.2876975057847891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005994749,0.000140356,0.0002053443,0.0001393107,0.0002830216,0.0003377357,0.001692288,0.00005397837,0.00001237018],"category_scores_gemma":[0.0001433084,0.0001210071,0.00004894134,0.0001289826,0.0001274659,0.0004465014,0.0004837821,0.0001573891,0.00008809675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003970134,"about_ca_system_score_gemma":0.00002091511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004390759,"about_ca_topic_score_gemma":0.00003387964,"domain_scores_codex":[0.9988264,0.00001838528,0.0002273237,0.0003000689,0.0003210664,0.0003067947],"domain_scores_gemma":[0.9981619,0.0001511467,0.0001688133,0.001425834,0.00002682191,0.00006553726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005172726,0.00004979504,0.00008804558,0.00003470149,0.000005472595,0.000008194838,0.001236342,0.00003182204,0.005276302,0.9809622,0.00002811269,0.01227381],"study_design_scores_gemma":[0.0007676897,0.00003975279,0.005085276,0.00005198002,0.000004579765,0.000006160631,0.0002551173,0.0499579,0.01006737,0.9332511,0.0002242737,0.0002887794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1535154,0.0000263744,0.7312426,0.0004464678,0.00008122484,0.0005957169,0.000002594585,0.0001417155,0.113948],"genre_scores_gemma":[0.8832905,0.000008167898,0.1163682,0.000017147,0.00002037441,0.00007108615,0.000001709187,0.00001428083,0.000208543],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7297751,"threshold_uncertainty_score":0.4934528,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01079405596510778,"gpt":0.255840339155419,"spread":0.2450462831903113,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00101214,0.0001439074,0.0001507739,0.0001505639,0.0001198098,0.0001139344,0.0004733616,0.00006951183,0.00001805052],"category_scores_gemma":[0.00004631939,0.0001293301,0.0000493078,0.0007220006,0.00002217632,0.0001103589,0.0001663227,0.0001091616,0.0001989571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005370399,"about_ca_system_score_gemma":0.00004989035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001503217,"about_ca_topic_score_gemma":0.000003430772,"domain_scores_codex":[0.9987233,0.00001045026,0.0003499727,0.0002734788,0.0003042688,0.0003384736],"domain_scores_gemma":[0.999122,0.0001655812,0.00009838551,0.0003952285,0.00005751978,0.0001612758],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000003549661,0.0000554438,0.000006067038,0.00003465381,0.00001448328,0.000003587642,0.004287652,0.004103489,0.012981,0.9659773,0.0003101499,0.0122227],"study_design_scores_gemma":[0.0004523637,0.00007995625,0.0004932437,0.00005059118,0.0000167505,0.0000533231,0.0003164154,0.09530148,0.0221052,0.8767279,0.003957738,0.0004450805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03840218,0.00002074326,0.9224054,0.0003388546,0.00008657383,0.0003785043,0.000001226121,0.0001974242,0.03816914],"genre_scores_gemma":[0.5684417,0.000001816113,0.4307845,0.0003310564,0.00003487334,0.00002479345,0.000007074443,0.00001253094,0.0003616009],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5300396,"threshold_uncertainty_score":0.5273929,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00967514078976895,"gpt":0.226119884697366,"spread":0.216444743907597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008428919,0.0001556021,0.0001701409,0.000065987,0.0000841348,0.00008135401,0.0001040792,0.00006591852,0.00002674437],"category_scores_gemma":[0.000008394705,0.000156489,0.00002385584,0.0002324621,0.00002467009,0.00003549751,0.00003125609,0.00008424386,0.0001179074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001717822,"about_ca_system_score_gemma":0.000008153268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000021174,"about_ca_topic_score_gemma":0.000005708831,"domain_scores_codex":[0.9992294,0.000002255664,0.0002657151,0.0001641494,0.0001286337,0.000209836],"domain_scores_gemma":[0.9995697,0.00004266729,0.0000303119,0.0002362263,0.00002869348,0.00009239763],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003103903,0.00004873229,0.00001896098,0.0002213044,0.00003388498,8.562523e-7,0.0004892895,0.837393,0.005275818,0.1509476,0.0002610798,0.005306298],"study_design_scores_gemma":[0.0005755246,0.00001415567,0.00007877741,0.00004642911,0.00006545296,0.000007554202,0.0007360036,0.9636957,0.008120629,0.02149137,0.004519663,0.0006487569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01103274,0.00009292226,0.9698119,0.00005974416,0.00003482424,0.0004166003,0.000009866557,0.0004729893,0.01806842],"genre_scores_gemma":[0.2266457,0.00001530846,0.7727078,0.00005482201,0.0001514671,0.0002429905,0.00003422773,0.00005508216,0.00009261013],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.215613,"threshold_uncertainty_score":0.6381435,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06445379228865139,"gpt":0.3174664405960601,"spread":0.2530126483074087,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003936383,0.0001696073,0.0002390477,0.0001281698,0.0004351034,0.00007351182,0.0003055276,0.0000646296,0.000002773937],"category_scores_gemma":[0.00004699187,0.0001514351,0.00005486441,0.0002625685,0.0003035007,0.0003184159,0.0001141887,0.0001110388,0.000008971243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002571223,"about_ca_system_score_gemma":0.00002063802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005539927,"about_ca_topic_score_gemma":0.00001217406,"domain_scores_codex":[0.9987981,0.00002614716,0.0003087728,0.000340124,0.0002383241,0.0002884988],"domain_scores_gemma":[0.9989347,0.0002705761,0.0001377803,0.0004755067,0.00007380953,0.0001075704],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001313327,0.00004817358,0.00001217523,0.0002175162,0.00001469328,0.00002054746,0.00301662,0.000008315727,0.001595701,0.9933739,0.0001314218,0.001547742],"study_design_scores_gemma":[0.0003341678,0.00006487803,0.00002831054,0.00001717089,0.000007933153,0.0003078619,0.0003474909,0.04114321,0.00479114,0.9526495,0.0001213871,0.0001869438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09367829,0.00004789314,0.9039667,0.0001352057,0.00002291844,0.0007675645,0.00001247126,0.0001801499,0.001188815],"genre_scores_gemma":[0.4537371,0.00003017102,0.5458986,0.00004860199,0.00001583719,0.000218716,0.00002196456,0.00001431758,0.00001478056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3600588,"threshold_uncertainty_score":0.6175346,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01467911643572559,"gpt":0.2393120154478885,"spread":0.2246328990121629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495981,0.000184653,0.0001873669,0.0001037688,0.0002312695,0.0001461876,0.0004313028,0.00006226618,0.0002957845],"category_scores_gemma":[0.000008006476,0.0001664633,0.00009028586,0.0004981169,0.00004227556,0.0002217389,0.0001003332,0.000123532,0.0003264355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001804045,"about_ca_system_score_gemma":0.00005725069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002244916,"about_ca_topic_score_gemma":0.000003795723,"domain_scores_codex":[0.9985355,0.000008151617,0.0003255177,0.0003560597,0.0005063253,0.000268468],"domain_scores_gemma":[0.9992542,0.0001168616,0.00007926967,0.000392858,0.00005054483,0.0001063196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008046292,0.0001579848,0.000008490512,0.00003876203,0.00004866591,0.00001123881,0.0005558637,0.01919946,0.001881945,0.7970002,0.001162977,0.1799263],"study_design_scores_gemma":[0.0004462536,0.00003577791,0.0004017101,0.00002569675,0.00001774943,0.00004651528,0.00001731543,0.5947886,0.001736391,0.3998515,0.002238771,0.0003936575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04330986,0.00005549789,0.9453918,0.0002209682,0.0001165963,0.0002120076,0.000005540386,0.0001910535,0.01049664],"genre_scores_gemma":[0.200882,0.000005511889,0.7981248,0.0004027491,0.0001755102,0.00004755781,0.00005268407,0.00001959941,0.0002895764],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5755892,"threshold_uncertainty_score":0.6788177,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}