{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":55,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":55,"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","author_layer_release":"2026-06-26"},"query_hash":"cd63b47cb467","filters":{"venue":"Electronic Notes in Discrete Mathematics"}},"results":[{"id":"W2188617452","doi":"10.1016/j.endm.2018.01.009","title":"New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Government of Alberta Ministry of Transportation","keywords":"Vehicle routing problem; Mathematics; Inequality; Routing (electronic design automation); Branch and cut; Mathematical optimization; Algorithm; Linear programming; Computer science","authors":[{"name":"Guido Perboli","is_ca":false},{"name":"Roberto Tadei","is_ca":false},{"name":"Edoardo Fadda","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03467735418661974,"gpt":0.2584753334988036,"spread":0.2237979793121839,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003424606,0.002075867,0.001346309,0.001776312,0.001214542,0.005077625,0.004593109,0.0023483,0.01293568],"category_scores_gemma":[0.01090936,0.0009835763,0.002358425,0.002950923,0.00159715,0.005851392,0.0029961,0.007912164,0.001491843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003559888,"about_ca_system_score_gemma":0.002655098,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005172683,"about_ca_topic_score_gemma":0.006795037,"domain_scores_codex":[0.9970754,0.001005925,0.0001769074,0.0003799567,0.0009001809,0.0004616976],"domain_scores_gemma":[0.9944586,0.003406257,0.0004773632,0.0003038579,0.001073761,0.0002801728],"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.0003047127,0.0002898558,0.0007864804,0.0008030818,0.0001396706,0.0007109454,0.0003391059,0.1274466,0.006537134,0.751478,0.03003609,0.08112831],"study_design_scores_gemma":[0.00008055777,0.00009601057,0.0006676,0.0001920368,0.00006676207,0.0002364788,0.000170382,0.5770679,0.00161207,0.3957507,0.02398833,0.00007115697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01699392,0.003647583,0.9003094,0.002924658,0.00147187,0.0003205245,0.001628564,0.0002002386,0.07250321],"genre_scores_gemma":[0.469082,0.007318129,0.445876,0.002788851,0.001835515,0.001086618,0.004200466,0.0006234585,0.06718897],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01293568,"threshold_uncertainty_score":0.0432741,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2792983298","doi":"10.1016/j.endm.2018.02.008","title":"Towards Optimal and Scalable Solution for Routing and Spectrum Allocation","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Scalability; Computer science; Column generation; Routing (electronic design automation); Provisioning; Frequency allocation; Context (archaeology); Path (computing); Shortest path problem; Slicing; Mathematical optimization; Spectrum (functional analysis); Process (computing); Distributed computing; Computer network; Mathematics; Theoretical computer science","authors":[{"name":"Julian Enoch","is_ca":true},{"name":"Brigitte Jaumard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00955144964890719,"gpt":0.2462729523968635,"spread":0.2367215027479563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008252516,0.001105922,0.0011217,0.0007749759,0.0006332724,0.001644869,0.001867497,0.001826341,0.006641988],"category_scores_gemma":[0.00311367,0.0006014491,0.0007362394,0.001072764,0.0006345118,0.00164235,0.002133884,0.001709126,0.001062173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001070249,"about_ca_system_score_gemma":0.002305991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00240533,"about_ca_topic_score_gemma":0.004439184,"domain_scores_codex":[0.9992811,0.0001677674,0.00003066182,0.0001334918,0.0002566315,0.000130438],"domain_scores_gemma":[0.9992974,0.0003072708,0.00005381199,0.000124877,0.0001633681,0.00005331003],"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.0001129114,0.0001765169,0.0002996583,0.0002096598,0.00006056114,0.0001040514,0.00009386425,0.7506986,0.00940644,0.08890361,0.01263993,0.1372941],"study_design_scores_gemma":[0.00001142548,0.00001241055,0.00004598354,0.000007416393,0.000005682778,0.00001954321,0.00002418709,0.9721414,0.0004258966,0.02615565,0.001146655,0.00000365137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008095092,0.0002700551,0.9854715,0.0004259659,0.0001075333,0.00006055306,0.0001003052,0.0003948349,0.005074025],"genre_scores_gemma":[0.2062883,0.0003869083,0.7863872,0.0002217401,0.0001573379,0.0002250341,0.0003068991,0.0001695319,0.005856947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006641988,"threshold_uncertainty_score":0.02221966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075234757","doi":"10.1016/j.endm.2013.05.097","title":"Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Spanning tree; Mathematics; Minimum spanning tree; Adjacency list; Quadratic equation; Combinatorics; Minimum degree spanning tree; Column generation; Tree (set theory); Mathematical optimization; Linear programming; Upper and lower bounds; Discrete mathematics","authors":[{"name":"Dilson Lucas Pereira","is_ca":false},{"name":"Michel Gendreau","is_ca":true},{"name":"Alexandre Salles da Cunha","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007557376348709966,"gpt":0.2212602827102928,"spread":0.2137029063615828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007433916,0.00413595,0.003656998,0.004214433,0.002390477,0.006994254,0.0076345,0.004599281,0.03151201],"category_scores_gemma":[0.04786192,0.001951369,0.002827899,0.007346998,0.003374093,0.01749213,0.008026556,0.01331552,0.003443621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004855638,"about_ca_system_score_gemma":0.002293412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003211359,"about_ca_topic_score_gemma":0.004954994,"domain_scores_codex":[0.9934351,0.002033443,0.0002075894,0.001010754,0.002205774,0.001107221],"domain_scores_gemma":[0.9447246,0.04542485,0.002131142,0.002548579,0.003051366,0.002119631],"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.001027069,0.001019463,0.001639016,0.001991238,0.0002399389,0.0004562183,0.0007297641,0.2371734,0.006350273,0.5986794,0.06091473,0.08977956],"study_design_scores_gemma":[0.000109904,0.000173405,0.0008181093,0.0002062147,0.0001146067,0.0002667188,0.000166296,0.4408956,0.001012686,0.5481122,0.008067832,0.0000564455],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06441904,0.01258841,0.7894874,0.01713243,0.001753681,0.0002922787,0.002425551,0.0009873245,0.1109139],"genre_scores_gemma":[0.6615189,0.01199625,0.2589586,0.00725174,0.006628854,0.0009777825,0.005288479,0.002075962,0.04530344],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03151201,"threshold_uncertainty_score":0.1054182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2175309622","doi":"10.1016/j.endm.2005.05.035","title":"Degree constrained subgraphs","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Weighting; Degree (music); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Artificial intelligence","authors":[{"name":"Louigi Addario‐Berry","is_ca":true},{"name":"Ketan Dalal","is_ca":true},{"name":"Bruce A. Reed","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01965432484113771,"gpt":0.2762746626281617,"spread":0.256620337787024,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000264381,0.0005619295,0.0006475211,0.001013871,0.001264298,0.001674906,0.001047535,0.0007836575,0.03034837],"category_scores_gemma":[0.002239072,0.0004548951,0.0006299867,0.001422069,0.0007270631,0.002577242,0.001529733,0.001919934,0.002820861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000687154,"about_ca_system_score_gemma":0.0004546618,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001049167,"about_ca_topic_score_gemma":0.001881812,"domain_scores_codex":[0.9996375,0.00007494703,0.00001393548,0.0001229968,0.00008250387,0.00006821213],"domain_scores_gemma":[0.9987007,0.0004785554,0.0001376048,0.0003382913,0.0001529596,0.000191784],"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.0001779682,0.00007935613,0.001216818,0.0002119734,0.00005303992,0.0003011176,0.0002686509,0.008811052,0.005203511,0.9172943,0.02585703,0.04052515],"study_design_scores_gemma":[0.00002996662,0.00001839141,0.001003307,0.00002586637,0.00003195118,0.0003580771,0.0001345015,0.01555837,0.002129253,0.957859,0.02284122,0.00001016107],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4107027,0.001196475,0.2838908,0.004790829,0.0003806656,0.0004105484,0.007111854,0.001060098,0.2904561],"genre_scores_gemma":[0.8439028,0.0009448166,0.04998803,0.0008826132,0.000221372,0.0002862312,0.007319521,0.0005356858,0.09591893],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03034837,"threshold_uncertainty_score":0.1015254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068463402","doi":"10.1016/j.endm.2009.07.020","title":"On the Gapped Consecutive-Ones Property","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Parameterized complexity; Conjecture; Combinatorics; Mathematics; Logical matrix; Graph; Function (biology); Binary number; Discrete mathematics; Physics","authors":[{"name":"Cédric Chauve","is_ca":true},{"name":"Ján Maňuch","is_ca":true},{"name":"Murray Patterson","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01140264538665462,"gpt":0.2497559303288888,"spread":0.2383532849422342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001630568,0.0008276216,0.001289908,0.001241167,0.001947332,0.002474841,0.001986723,0.00187172,0.01740372],"category_scores_gemma":[0.01331182,0.0005494653,0.001078663,0.002124161,0.003261947,0.009247719,0.003859803,0.004181461,0.002156475],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005435894,"about_ca_system_score_gemma":0.0006371788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004517951,"about_ca_topic_score_gemma":0.0003642454,"domain_scores_codex":[0.9989773,0.0002335165,0.00006072778,0.0003263546,0.0002024763,0.0001997062],"domain_scores_gemma":[0.9912846,0.006045735,0.0006057014,0.001141852,0.0004615318,0.000460474],"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.0001621623,0.00004039802,0.0004033101,0.00007755993,0.00001289034,0.0001459186,0.0001456881,0.003023726,0.001163438,0.974216,0.003942909,0.01666604],"study_design_scores_gemma":[0.00003520727,0.00002962565,0.0001147366,0.00001419455,0.000007760691,0.0001556447,0.00003086917,0.01100147,0.0004812321,0.9862446,0.001874187,0.00001048143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3100994,0.001531315,0.5495955,0.00496493,0.001045111,0.0001042064,0.0008544548,0.001015152,0.13079],"genre_scores_gemma":[0.9037433,0.001191886,0.06941131,0.001947098,0.0008381026,0.0002185562,0.001091461,0.0007992492,0.02075903],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01740372,"threshold_uncertainty_score":0.05822122,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2059267359","doi":"10.1016/j.endm.2009.07.067","title":"Maximum values of Szeged index and edge-Szeged index of graphs","year":2009,"lang":"hu","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Graph theory and applications","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"China Scholarship Council","keywords":"Mathematics; Combinatorics; Bipartite graph; Conjecture; Wiener index; Index (typography); Generalization; Discrete mathematics; Graph; Mathematical analysis","authors":[{"name":"Ehsan Chiniforooshan","is_ca":true},{"name":"Baoyindureng Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0136224119421131,"gpt":0.2814336909769344,"spread":0.2678112790348213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001967945,0.0009912598,0.001360479,0.006700483,0.001710026,0.004322666,0.002373331,0.001443899,0.005492868],"category_scores_gemma":[0.01075093,0.0006244221,0.0006720991,0.00464312,0.003336779,0.007171339,0.001786478,0.001834599,0.0005829259],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001915979,"about_ca_system_score_gemma":0.0007409726,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00039137,"about_ca_topic_score_gemma":0.0004453182,"domain_scores_codex":[0.9990978,0.0002017161,0.00006678593,0.0002095532,0.0002487256,0.0001754106],"domain_scores_gemma":[0.9931334,0.003952001,0.0008437849,0.0005055489,0.0005457983,0.001019513],"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.0003981627,0.00005308259,0.002054071,0.00018494,0.00004822506,0.00009899292,0.0004422569,0.007198947,0.003875991,0.971077,0.001953569,0.01261466],"study_design_scores_gemma":[0.00003194115,0.00002775466,0.001437565,0.00003829784,0.00003067678,0.0001360574,0.000124515,0.01570757,0.002070615,0.9789805,0.001379322,0.00003511135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8567027,0.002392494,0.09328794,0.001318938,0.0002032846,0.00005168704,0.00164359,0.0003516023,0.04404764],"genre_scores_gemma":[0.9806485,0.0009361388,0.01398762,0.00009266201,0.0002433386,0.0000780573,0.0006028252,0.00008581669,0.003325094],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006700483,"threshold_uncertainty_score":0.01837546,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056059863","doi":"10.1016/j.endm.2012.10.032","title":"MPI Parallelization of Variable Neighborhood Search","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Benchmark (surveying); Generality; Parallel computing; Asynchronous communication; Variable neighborhood search; Scheduling (production processes); Variable (mathematics); Automatic parallelization; Multiprocessing; Heuristic; Metaheuristic; Algorithm; Mathematical optimization; Programming language; Mathematics; Artificial intelligence","authors":[{"name":"Tatjana Davidović","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01610591746015497,"gpt":0.2769799389609048,"spread":0.2608740215007498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004555108,0.0008236168,0.000940179,0.0007844177,0.001339749,0.00121294,0.002561403,0.0006155109,0.02095325],"category_scores_gemma":[0.003220927,0.0003514036,0.0006109853,0.00169768,0.0005294636,0.001017078,0.001119961,0.001183511,0.003203589],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009392264,"about_ca_system_score_gemma":0.001414714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01026379,"about_ca_topic_score_gemma":0.01360597,"domain_scores_codex":[0.9993024,0.0001707482,0.00002760092,0.0001077806,0.000254764,0.0001366399],"domain_scores_gemma":[0.9989803,0.0003316923,0.0000342135,0.0003128986,0.000277221,0.00006364781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001483891,0.0003696134,0.002907782,0.000466577,0.0002038707,0.0003892597,0.0006155652,0.3609246,0.01352084,0.09705687,0.08565379,0.4364073],"study_design_scores_gemma":[0.0001629809,0.00004240382,0.0005062044,0.000009796226,0.00002568726,0.00003537196,0.00006746328,0.9603944,0.00724005,0.02155649,0.009940544,0.00001873654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.122358,0.0006765496,0.7415413,0.001128414,0.0006973037,0.0002110903,0.001587047,0.03718383,0.09461644],"genre_scores_gemma":[0.6348416,0.0002050089,0.3395172,0.0002064206,0.0001212369,0.0004894835,0.001960976,0.003497179,0.01916086],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02095325,"threshold_uncertainty_score":0.07009566,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2742569245","doi":"10.1016/j.endm.2017.06.067","title":"The codegree threshold of<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msubsup><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow><mml:mrow><mml:mo>−</mml:mo></mml:mrow></mml:msubsup></mml:math>","year":2017,"lang":"lv","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"H2020 European Research Council; Engineering and Physical Sciences Research Council; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Combinatorics; Tournament; Conjecture; Mathematics; Graph; Vertex (graph theory); Discrete mathematics","authors":[{"name":"Victor Falgas‐Ravry","is_ca":false},{"name":"Oleg Pikhurko","is_ca":false},{"name":"Emil R. Vaughan","is_ca":false},{"name":"Jan Volec","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02044680610329382,"gpt":0.2575681564522261,"spread":0.2371213503489323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001864064,0.003491616,0.001850946,0.00301806,0.0017485,0.006131917,0.005297825,0.003401395,0.6732566],"category_scores_gemma":[0.01379071,0.002549445,0.002815103,0.003327505,0.001623796,0.007293558,0.006211044,0.00538128,0.6132345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002786246,"about_ca_system_score_gemma":0.004183714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009748774,"about_ca_topic_score_gemma":0.009130455,"domain_scores_codex":[0.9975834,0.0003164848,0.0002121217,0.0004244257,0.00101509,0.000448393],"domain_scores_gemma":[0.9941947,0.001812624,0.0002293047,0.001420822,0.001902304,0.0004402282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001386304,0.0000599162,0.0003410793,0.0004735836,0.00002481288,0.00009539091,0.000121859,0.0003960646,0.0009152826,0.01163715,0.9518811,0.03391524],"study_design_scores_gemma":[0.0001184408,0.00002751325,0.0006257565,0.0002366346,0.00001548881,0.0002238189,0.00007838541,0.00280289,0.004138955,0.0138704,0.9777821,0.00007959499],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"software","genre_gemma":"empirical","genre_scores_codex":[0.001068548,0.0004242036,0.1201763,0.002214024,0.001845821,0.0004458966,0.1102193,0.5363069,0.227299],"genre_scores_gemma":[0.01532116,0.0009586596,0.07710084,0.002095706,0.0005718072,0.0011268,0.2000545,0.4325354,0.2702353],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6732566,"threshold_uncertainty_score":0.4660598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1576691799","doi":"10.1016/j.endm.2011.05.067","title":"Near-perfect graphs with polyhedral","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Polytope; Mathematics; Graph; Operator (biology); Class (philosophy); Discrete mathematics; Characterization (materials science); Computer science; Physics; Chemistry; Artificial intelligence","authors":[{"name":"Silvia Bianchi","is_ca":false},{"name":"M. Escalante","is_ca":false},{"name":"Graciela Nasini","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02042904335951136,"gpt":0.2706849358530934,"spread":0.250255892493582,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007678092,0.0007578178,0.00134733,0.001570727,0.002945021,0.003841889,0.001792205,0.001753638,0.01441044],"category_scores_gemma":[0.006593207,0.001247111,0.000933079,0.002152751,0.002425797,0.006756961,0.003529149,0.003125113,0.002236059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001231628,"about_ca_system_score_gemma":0.001205047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001428,"about_ca_topic_score_gemma":0.002243384,"domain_scores_codex":[0.9983669,0.0003546437,0.0001069234,0.0004050147,0.0005247619,0.0002417909],"domain_scores_gemma":[0.9959885,0.001320205,0.0006125474,0.0008494295,0.0004397508,0.0007894745],"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.0001178315,0.00005122277,0.0003454442,0.0001033921,0.00001747622,0.0001350593,0.000162164,0.004805761,0.001035425,0.9789366,0.003637558,0.0106522],"study_design_scores_gemma":[0.00002849429,0.00002744799,0.000226806,0.00002722598,0.00001314792,0.0001820395,0.0001258765,0.005175114,0.0005955304,0.9882236,0.005360743,0.00001392168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3453702,0.001242041,0.3980561,0.003750313,0.0009741275,0.000477277,0.00349016,0.001300876,0.2453389],"genre_scores_gemma":[0.8601462,0.001215427,0.08748603,0.001121004,0.0003207849,0.0003903495,0.002212977,0.0002757191,0.04683162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01441044,"threshold_uncertainty_score":0.0482077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079074189","doi":"10.1016/j.endm.2013.10.053","title":"Lovász-Schrijver SDP-operator and a superclass of near-perfect graphs","year":2013,"lang":"nl","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Polytope; Strong perfect graph theorem; Bipartite graph; Operator (biology); Characterization (materials science); Conjecture; Discrete mathematics; Chordal graph; 1-planar graph; Graph","authors":[{"name":"Silvia Bianchi","is_ca":false},{"name":"M. Escalante","is_ca":false},{"name":"Graciela Nasini","is_ca":false},{"name":"Levent Tunçel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01201657952695493,"gpt":0.2714424837093554,"spread":0.2594259041824004,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007353654,0.0004476387,0.0009288662,0.001919926,0.002344101,0.002741131,0.001126043,0.001311662,0.005920701],"category_scores_gemma":[0.001884778,0.0003449331,0.0008082665,0.0009872862,0.003255162,0.003252955,0.001876686,0.001975195,0.0004464643],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001349701,"about_ca_system_score_gemma":0.001144659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002348528,"about_ca_topic_score_gemma":0.002071654,"domain_scores_codex":[0.9994915,0.0001063523,0.00002788881,0.00008561316,0.00017217,0.0001165351],"domain_scores_gemma":[0.9992028,0.0002173897,0.0001099054,0.0001289145,0.0001188094,0.0002222772],"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.000008611635,0.000007728252,0.0000540934,0.00000798402,0.000002340292,0.00003740681,0.00004933868,0.0003009541,0.0002084561,0.9982346,0.00035248,0.0007360298],"study_design_scores_gemma":[0.000006650311,0.00000437381,0.00006428829,0.00000389773,0.000001781125,0.00004475996,0.00004168524,0.002313376,0.00007338585,0.9969415,0.0005000991,0.000004172949],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7312559,0.001136467,0.08088014,0.004639703,0.0007313084,0.00007560096,0.0004211454,0.0005450202,0.1803148],"genre_scores_gemma":[0.9811828,0.0002892157,0.007281246,0.0004079723,0.0003006169,0.00003535786,0.0001438365,0.00005429012,0.01030457],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005920701,"threshold_uncertainty_score":0.01980674,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2055646787","doi":"10.1016/j.endm.2009.02.012","title":"Adjusted Interval Digraphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Interval (graph theory); Combinatorics; Discrete mathematics","authors":[{"name":"Tomás Feder","is_ca":false},{"name":"Pavol Hell","is_ca":true},{"name":"Jing Huang","is_ca":true},{"name":"Arash Rafiey","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01857710668505297,"gpt":0.3012789117041017,"spread":0.2827018050190487,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002903471,0.0004624056,0.0005244221,0.00183531,0.001090962,0.00192068,0.001025216,0.0007461366,0.02021483],"category_scores_gemma":[0.002387763,0.0003853062,0.0005409656,0.001740369,0.000640353,0.002006352,0.001212475,0.002281051,0.002218644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008368471,"about_ca_system_score_gemma":0.0003025609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009097959,"about_ca_topic_score_gemma":0.0009976485,"domain_scores_codex":[0.9996206,0.00005663286,0.00002396848,0.0001170151,0.0001050709,0.00007669152],"domain_scores_gemma":[0.9987236,0.0003179705,0.000189321,0.0001808911,0.0002384723,0.0003498279],"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.00008105631,0.00003922731,0.0002997904,0.00004779751,0.00001433384,0.0001094757,0.0001304004,0.002040015,0.002046838,0.9724089,0.003227226,0.01955512],"study_design_scores_gemma":[0.00003118391,0.0000426303,0.0009280149,0.00001847622,0.00002225315,0.0002096413,0.000118136,0.01472413,0.001128306,0.9612131,0.02153876,0.00002526644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2786234,0.001001703,0.4397281,0.001205372,0.0006957926,0.0001869825,0.002167889,0.00116415,0.2752266],"genre_scores_gemma":[0.8525325,0.0007320211,0.07052076,0.0004866112,0.0002153974,0.0001757669,0.001880005,0.0002825525,0.07317439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02021483,"threshold_uncertainty_score":0.06762534,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1510678864","doi":"10.1016/j.endm.2007.07.091","title":"A fast algorithm to generate Beckett-Gray codes","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Gray code; Heuristics; Gray (unit); Algorithm; Computation; Binary number; Mathematics; Computer science; Combinatorics; Arithmetic; Mathematical optimization","authors":[{"name":"Joe Sawada","is_ca":true},{"name":"Dennis Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01181243525335988,"gpt":0.2756582649566635,"spread":0.2638458297033036,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373296,0.000870122,0.000511696,0.00154839,0.0008191083,0.001019359,0.000764869,0.0008944384,0.01317531],"category_scores_gemma":[0.0026743,0.0003771475,0.0005432558,0.001325594,0.0006055047,0.0009511939,0.002046407,0.001151314,0.004944677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005915871,"about_ca_system_score_gemma":0.001089924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008277186,"about_ca_topic_score_gemma":0.00161625,"domain_scores_codex":[0.9994709,0.00008617652,0.00003019063,0.00007478247,0.0002711899,0.00006684918],"domain_scores_gemma":[0.9993849,0.000193943,0.00003315573,0.0001515533,0.0001856102,0.00005089988],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004281226,0.0001340808,0.0006903993,0.0001834318,0.00004633178,0.0002225965,0.0002437443,0.02688902,0.03239977,0.2389877,0.01406555,0.6857093],"study_design_scores_gemma":[0.0003453776,0.0003544561,0.0007974908,0.0001234012,0.0000822123,0.0008026005,0.0001635397,0.4669562,0.1019493,0.3660643,0.06224002,0.000121163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0130303,0.0001758063,0.9740937,0.000214182,0.0002058099,0.0002011789,0.0001680866,0.001708988,0.01020187],"genre_scores_gemma":[0.1115673,0.0001619554,0.8750631,0.0001696088,0.00004511549,0.0003000501,0.000446231,0.000478391,0.01176818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01317531,"threshold_uncertainty_score":0.04407579,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040214474","doi":"10.1016/s1571-0653(05)80155-6","title":"Finding the chromatic number by means of critical graphs","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Chromatic scale; Combinatorics; Mathematics; Critical graph; Random graph; Graph coloring; Graph; Discrete mathematics; Induced subgraph; Benchmark (surveying); Graph power; Line graph; Vertex (graph theory)","authors":[{"name":"Francine Herrmann","is_ca":false},{"name":"Alain Hertz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04836182007686702,"gpt":0.384074163802534,"spread":0.335712343725667,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004322778,0.0009721215,0.0006626068,0.00411156,0.001139925,0.001310709,0.001258757,0.0009318414,0.00628436],"category_scores_gemma":[0.006037301,0.0006731042,0.0005015298,0.001907205,0.001491499,0.002426158,0.0008155222,0.00109337,0.0004213676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001361356,"about_ca_system_score_gemma":0.001074321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005494249,"about_ca_topic_score_gemma":0.006049976,"domain_scores_codex":[0.9997801,0.00004320981,0.000006216184,0.00008532622,0.00004119305,0.00004389299],"domain_scores_gemma":[0.9967874,0.002082699,0.0003650365,0.0001898292,0.0003331848,0.0002417943],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007970412,0.0002639361,0.01401382,0.0007918162,0.0001496444,0.0003543952,0.0004831003,0.4363415,0.0282851,0.3278626,0.01267278,0.1779843],"study_design_scores_gemma":[0.00006633243,0.00008915345,0.002474911,0.00006567478,0.0000574629,0.0001368847,0.0001663166,0.6510197,0.006440514,0.3358411,0.003598424,0.00004355094],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3787595,0.0007237257,0.6015636,0.0006178701,0.0001075862,0.0001862834,0.0007274384,0.0006309435,0.01668308],"genre_scores_gemma":[0.8162389,0.0005419162,0.1775594,0.0001237433,0.00008590365,0.0001397128,0.0009539563,0.0002236359,0.004132796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00628436,"threshold_uncertainty_score":0.02102327,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124993762","doi":"10.1016/j.endm.2005.05.085","title":"Discrete Tomography in Discrete Deconvolution: Deconvolution of Binary Images Using Ryser's Algorithm","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Digital Image Processing Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Deconvolution; Algorithm; Blind deconvolution; Thresholding; Binary number; Mathematics; Viterbi algorithm; Wiener filter; Wiener deconvolution; Polynomial; Equalization (audio); Artificial intelligence; Image (mathematics); Computer science; Decoding methods; Arithmetic","authors":[{"name":"Behzad Sharif","is_ca":true},{"name":"Behnam Sharif","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01234242822026842,"gpt":0.2838911526445195,"spread":0.2715487244242511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001635911,0.0006794877,0.000910262,0.0007462067,0.000353584,0.001538179,0.001069819,0.001326272,0.002479494],"category_scores_gemma":[0.003573652,0.000476796,0.0006471333,0.001021493,0.00150235,0.002638494,0.001653008,0.002180062,0.0009429618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000422158,"about_ca_system_score_gemma":0.0006713149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006595574,"about_ca_topic_score_gemma":0.0005267338,"domain_scores_codex":[0.9994243,0.0002543641,0.00002951315,0.00009136365,0.0001685236,0.00003198418],"domain_scores_gemma":[0.9990832,0.0005168837,0.00006429786,0.0001876619,0.0001146517,0.0000333159],"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.0003411813,0.00008560108,0.0003862159,0.0004371919,0.0000739289,0.0001716366,0.0003103359,0.1105521,0.0288407,0.6279809,0.002823587,0.2279968],"study_design_scores_gemma":[0.00003426853,0.00004127123,0.0001505194,0.00002235294,0.00002081217,0.0002137476,0.00003652726,0.8664201,0.01532164,0.1136008,0.004100906,0.00003710206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003070242,0.0001469403,0.9953217,0.00007896253,0.00002442716,0.0000136297,0.0000117741,0.0001059883,0.001226436],"genre_scores_gemma":[0.09649636,0.0007464645,0.8977994,0.00009122385,0.0000616896,0.00006575121,0.00005948266,0.0001315629,0.004547957],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002479494,"threshold_uncertainty_score":0.008651614,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116103579","doi":"10.1016/j.endm.2013.07.015","title":"Choosability of Graphs with Bounded Order: Ohbaʼs Conjecture and Beyond","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Conjecture; Bounded function; Order (exchange); Discrete mathematics","authors":[{"name":"Jonathan A. Noel","is_ca":true},{"name":"Bruce A. Reed","is_ca":true},{"name":"Douglas B. West","is_ca":false},{"name":"Hehui Wu","is_ca":true},{"name":"Xuding Zhu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007075373172213777,"gpt":0.2545845592946737,"spread":0.24750918612246,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381301,0.0006443338,0.001688197,0.001291986,0.001773617,0.003494984,0.002124691,0.002282337,0.009052372],"category_scores_gemma":[0.01071444,0.0007683464,0.001542957,0.001613607,0.005269656,0.009241396,0.002398242,0.004666338,0.0007100956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001512688,"about_ca_system_score_gemma":0.001036254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00341749,"about_ca_topic_score_gemma":0.002235586,"domain_scores_codex":[0.9989323,0.0002136236,0.00004087024,0.0003082861,0.0002541453,0.0002507842],"domain_scores_gemma":[0.9884078,0.008150837,0.0005573094,0.001677669,0.0004635316,0.0007428775],"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.0001444586,0.00005572102,0.0008455265,0.0001134562,0.00001516286,0.00008347526,0.0003444601,0.004500512,0.00103561,0.9839188,0.002800026,0.00614273],"study_design_scores_gemma":[0.00002883653,0.000008876141,0.0002651879,0.000008830548,0.000007163831,0.00002836429,0.0000599759,0.006187685,0.0002075543,0.992454,0.000735437,0.000008110339],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6435514,0.002812881,0.1761809,0.01639231,0.0005215434,0.00008402814,0.0009492328,0.0005835249,0.1589243],"genre_scores_gemma":[0.9767895,0.001053147,0.01017696,0.001153643,0.0004792997,0.00007317454,0.0004605482,0.0001285252,0.009685217],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009052372,"threshold_uncertainty_score":0.03028315,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2066530434","doi":"10.1016/j.endm.2007.07.020","title":"Graph coloring with no large monochromatic components","year":2007,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Monochromatic color; Mathematics; Combinatorics; Graph; Graph coloring; Discrete mathematics; Physics; Optics","authors":[{"name":"Nathan Linial","is_ca":true},{"name":"Jiřı́ Matoušek","is_ca":true},{"name":"Or Sheffet","is_ca":true},{"name":"Gábor Tardos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0156712582349543,"gpt":0.288582538929778,"spread":0.2729112806948237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006063895,0.001037201,0.001485394,0.0009521291,0.002380171,0.002478729,0.002090867,0.001358117,0.01517458],"category_scores_gemma":[0.004173,0.001093065,0.0007612594,0.001682122,0.001227247,0.003338487,0.001876685,0.002130643,0.002132944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001317477,"about_ca_system_score_gemma":0.001185444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001851978,"about_ca_topic_score_gemma":0.004040381,"domain_scores_codex":[0.998996,0.0002179483,0.00005151004,0.0003092061,0.000190776,0.0002345269],"domain_scores_gemma":[0.9946377,0.002145944,0.0004232148,0.001700849,0.0005157806,0.0005765693],"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.002085469,0.0004346397,0.002969215,0.001364268,0.000178301,0.001223889,0.0006622824,0.02730473,0.04770365,0.7464188,0.04625505,0.1233997],"study_design_scores_gemma":[0.0003580425,0.0001574526,0.001836444,0.00007109231,0.0001213604,0.001070365,0.0003083833,0.06649378,0.01632678,0.8944452,0.01874688,0.00006419569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4994961,0.001065496,0.346234,0.00323835,0.0008922253,0.0005828117,0.002690968,0.00269546,0.1431045],"genre_scores_gemma":[0.7745077,0.0005595643,0.1861827,0.000958221,0.0002138861,0.0003828311,0.001634491,0.0008080885,0.03475248],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01517458,"threshold_uncertainty_score":0.05076396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073844168","doi":"10.1016/j.endm.2013.05.114","title":"Benders Decomposition for a Location-Design Problem in Green Wireless Local Area Networks","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Benders' decomposition; Dimensioning; Mathematical optimization; Decomposition; Facility location problem; Nonlinear system; Integer (computer science); Mathematics; Wireless; Nonlinear programming; Wireless network; Integer programming; Computer science; Telecommunications; Engineering","authors":[{"name":"Bernard Gendron","is_ca":true},{"name":"Rosario G. Garroppo","is_ca":false},{"name":"Gianfranco Nencioni","is_ca":false},{"name":"Maria Grazia Scutellà","is_ca":false},{"name":"Luca Tavanti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01728879254525972,"gpt":0.2677603609751958,"spread":0.2504715684299361,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003110467,0.002513289,0.002560726,0.001667909,0.0009858378,0.002926161,0.002028525,0.003469858,0.01122807],"category_scores_gemma":[0.007627957,0.001496154,0.001870846,0.002144695,0.001618642,0.003226179,0.002531493,0.003301283,0.0009961283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002466436,"about_ca_system_score_gemma":0.001851733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004778106,"about_ca_topic_score_gemma":0.003696323,"domain_scores_codex":[0.9983439,0.0008249724,0.00006178555,0.0002901488,0.0002751092,0.0002039927],"domain_scores_gemma":[0.9968431,0.002216542,0.0002646728,0.0001403432,0.0002462255,0.0002891674],"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.0002119247,0.0001837494,0.0005969507,0.0003157831,0.00009084931,0.0001545201,0.0001786638,0.8599883,0.001327676,0.1024653,0.006566567,0.0279197],"study_design_scores_gemma":[0.00006101438,0.00007880787,0.0001641323,0.00005034683,0.00003876994,0.00004975553,0.0001047996,0.8931901,0.0003973039,0.1031569,0.002691048,0.00001708765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02950215,0.0005670763,0.9556616,0.001652291,0.0001329647,0.00023853,0.0006265632,0.0001473434,0.0114715],"genre_scores_gemma":[0.4332615,0.001893833,0.527231,0.0007364145,0.0003967677,0.00101637,0.001572016,0.0004065349,0.03348551],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01122807,"threshold_uncertainty_score":0.0375616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1985423710","doi":"10.1016/s1571-0653(05)80121-0","title":"On homomorphisms to edge-coloured cycles","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; Capilano University","funders":"","keywords":"Mathematics; Combinatorics; Homomorphism; Graph; Time complexity; Graph homomorphism; Monochromatic color; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph power; Line graph; Computer science; Artificial intelligence","authors":[{"name":"Richard C. Brewster","is_ca":true},{"name":"Pavol Hell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01376915242437346,"gpt":0.2931291158938572,"spread":0.2793599634694837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215813,0.001219475,0.001178706,0.00367186,0.002634591,0.003648647,0.002011003,0.001805909,0.01264999],"category_scores_gemma":[0.006974557,0.001034342,0.00170328,0.004149838,0.003657453,0.008477115,0.005338598,0.003881324,0.00108007],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002115951,"about_ca_system_score_gemma":0.000746514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002127486,"about_ca_topic_score_gemma":0.001478818,"domain_scores_codex":[0.9987624,0.0003498211,0.00006293481,0.0003167987,0.0002088386,0.0002991762],"domain_scores_gemma":[0.9954671,0.002622152,0.0003534251,0.0004107051,0.000426393,0.0007202564],"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.000056443,0.000038438,0.000177388,0.0000496357,0.00001055726,0.0001148442,0.0005573761,0.0007558712,0.0005834585,0.9888058,0.001109609,0.007740689],"study_design_scores_gemma":[0.00001625199,0.00001338649,0.00009721519,0.00001462772,0.000009966263,0.00007167201,0.0001063107,0.001750166,0.0002322922,0.9955155,0.002163129,0.000009381126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.507695,0.002768359,0.3124478,0.003551682,0.001554365,0.0003048516,0.0006351632,0.001110396,0.1699324],"genre_scores_gemma":[0.8958231,0.002898335,0.04234727,0.001266816,0.0009970936,0.0003090673,0.0006276494,0.0005462826,0.05518442],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01264999,"threshold_uncertainty_score":0.0423184,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2173146142","doi":"10.1016/j.endm.2005.05.036","title":"Planar graph bipartization in linear time","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Combinatorics; Planar graph; Graph; Vertex (graph theory); Planar straight-line graph; Transversal (combinatorics); Butterfly graph; Planar; Discrete mathematics; Line graph; Voltage graph; 1-planar graph; Mathematical analysis; Computer science","authors":[{"name":"Samuel Fiorini","is_ca":false},{"name":"Nadia Hardy","is_ca":true},{"name":"Bruce Reed","is_ca":true},{"name":"Adrian Vetta","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01261950324757866,"gpt":0.2892128175860272,"spread":0.2765933143384485,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009577149,0.001359473,0.002412538,0.001594711,0.002476437,0.005006304,0.002858476,0.001791167,0.03790774],"category_scores_gemma":[0.00643373,0.00105681,0.001780569,0.004324111,0.001829699,0.008724864,0.004132447,0.003865934,0.004817327],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003650649,"about_ca_system_score_gemma":0.002199302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005032492,"about_ca_topic_score_gemma":0.007351691,"domain_scores_codex":[0.9979926,0.0003606891,0.00009110018,0.0005062909,0.0005039012,0.0005452952],"domain_scores_gemma":[0.9956654,0.002279138,0.000388903,0.0008758283,0.0003625085,0.0004282664],"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.002125153,0.0007050853,0.001023799,0.001352373,0.0002321956,0.0002605492,0.0008956984,0.09176078,0.01516577,0.5950844,0.06933036,0.2220638],"study_design_scores_gemma":[0.0004143508,0.000158474,0.0005567517,0.00005981741,0.0001455974,0.000212932,0.0003699065,0.1773436,0.005266115,0.7992458,0.01617911,0.00004753341],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1972698,0.001571347,0.6286947,0.005542689,0.0005670676,0.0007967384,0.004559218,0.009035262,0.1519633],"genre_scores_gemma":[0.5678869,0.001281397,0.3386627,0.00150282,0.0003741266,0.0007233023,0.006251824,0.002585423,0.08073143],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03790774,"threshold_uncertainty_score":0.1268141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2010081197","doi":"10.1016/j.endm.2008.06.007","title":"Morphing Planar Graph Drawings with Bent Edges","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Planarity testing; Bent molecular geometry; Morphing; Combinatorics; Mathematics; Vertex (graph theory); Planar graph; Planar; Graph; Enhanced Data Rates for GSM Evolution; Time complexity; Discrete mathematics; Computer science; Computer graphics (images); Artificial intelligence","authors":[{"name":"Anna Lubiw","is_ca":true},{"name":"Mark Petrick","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01483900425209781,"gpt":0.2308240234223581,"spread":0.2159850191702603,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002656388,0.0008646383,0.0005626547,0.001024975,0.0004210748,0.0008994383,0.0008587484,0.0008575845,0.007811815],"category_scores_gemma":[0.001802231,0.000802475,0.0006595781,0.0008956571,0.0006367954,0.001304953,0.001871347,0.001366355,0.001076537],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003371337,"about_ca_system_score_gemma":0.0002357554,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001116978,"about_ca_topic_score_gemma":0.002279892,"domain_scores_codex":[0.9997148,0.00004481442,0.00001790447,0.00007755446,0.000115973,0.00002894364],"domain_scores_gemma":[0.9995059,0.00016007,0.0000591464,0.0001621334,0.00006874607,0.00004407639],"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.0001939752,0.0001278343,0.001282688,0.0003654317,0.00008216437,0.0007566605,0.0006799857,0.2676899,0.0622934,0.1305901,0.01007091,0.5258671],"study_design_scores_gemma":[0.0000741383,0.0002396811,0.0009303871,0.0001014699,0.00008940945,0.0009019792,0.000434077,0.7809477,0.03223114,0.1507232,0.03325309,0.00007369653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1166056,0.0001795723,0.8664936,0.0001929942,0.0001859909,0.0001504638,0.0002840808,0.001942975,0.0139647],"genre_scores_gemma":[0.45781,0.0003953888,0.5260818,0.00008174544,0.00003912745,0.0001134709,0.0004744421,0.0009257034,0.0140783],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007811815,"threshold_uncertainty_score":0.02613312,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2068974319","doi":"10.1016/j.endm.2012.10.030","title":"Generating good starting solutions for the p-median problem in the plane","year":2012,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Heuristics; Mathematics; Plane (geometry); Mathematical optimization; Variable (mathematics); Variable neighborhood search; Quality (philosophy); Local optimum; Algorithm; Metaheuristic; Geometry; Mathematical analysis","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Zvi Drezner","is_ca":false},{"name":"Nenad Mladenović","is_ca":false},{"name":"Saı̈d Salhi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03654636556691118,"gpt":0.2615720966039575,"spread":0.2250257310370463,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002205335,0.001116467,0.001640496,0.001671429,0.001074011,0.002193229,0.00152774,0.002890225,0.00790215],"category_scores_gemma":[0.01159215,0.0009554546,0.001430941,0.001611538,0.001324887,0.002256118,0.003144949,0.002241862,0.001048012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001125308,"about_ca_system_score_gemma":0.001223471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001713928,"about_ca_topic_score_gemma":0.00212424,"domain_scores_codex":[0.9992986,0.000346444,0.00003316061,0.0001189164,0.0001059507,0.00009706633],"domain_scores_gemma":[0.9954775,0.003495534,0.0002828507,0.0002321639,0.0002642623,0.0002475871],"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.0007579777,0.0002293908,0.001561091,0.0004239346,0.0001335823,0.0002338672,0.0005502002,0.6406062,0.002554409,0.2771481,0.0114464,0.06435469],"study_design_scores_gemma":[0.0001588602,0.0001278384,0.0001664755,0.00007904204,0.00002113551,0.00004800968,0.0001602352,0.7291911,0.0007444486,0.2674394,0.001845878,0.00001758698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.14152,0.0007131496,0.8401351,0.001173127,0.00009000705,0.0001514008,0.0005283401,0.0003392185,0.01534963],"genre_scores_gemma":[0.4326997,0.0007275736,0.5555569,0.0002596092,0.00007656396,0.0003972811,0.001285406,0.0003996791,0.008597226],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00790215,"threshold_uncertainty_score":0.02643532,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2172657760","doi":"10.1016/j.endm.2008.01.004","title":"Limited Packings in Graphs","year":2008,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University; Memorial University of Newfoundland","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics","authors":[{"name":"Robert Gallant","is_ca":true},{"name":"Georg Günther","is_ca":true},{"name":"Bert L. Hartnell","is_ca":true},{"name":"Douglas F. Rall","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02307429976996784,"gpt":0.2875907517908187,"spread":0.2645164520208509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006779216,0.0006273877,0.001276503,0.002716238,0.001947996,0.003288225,0.001244941,0.001654067,0.01220106],"category_scores_gemma":[0.005212851,0.001093292,0.0008713698,0.002748018,0.00261908,0.005365105,0.002839904,0.002889235,0.001323521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008382985,"about_ca_system_score_gemma":0.0002708454,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005504217,"about_ca_topic_score_gemma":0.0006751061,"domain_scores_codex":[0.9991953,0.0002568379,0.0000502036,0.0001436574,0.0002534611,0.0001005972],"domain_scores_gemma":[0.9963685,0.001969394,0.0004907479,0.0004461139,0.0001984333,0.0005266457],"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.0001148786,0.00005213048,0.0004790187,0.0001138669,0.00001819375,0.0001742994,0.0003705116,0.004824567,0.001124872,0.9769946,0.004128694,0.01160416],"study_design_scores_gemma":[0.00001397184,0.00001645612,0.000348518,0.00002068703,0.000007593643,0.0001663638,0.0001024964,0.009893429,0.0003169531,0.9873223,0.001784448,0.000006903081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6949624,0.002511071,0.1251253,0.003162765,0.0004557085,0.0001042958,0.00080998,0.0005975441,0.1722709],"genre_scores_gemma":[0.9431642,0.001212248,0.02390837,0.0005314245,0.0004674117,0.0001582898,0.0009468856,0.000206016,0.02940515],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01220106,"threshold_uncertainty_score":0.04081655,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970925480","doi":"10.1016/j.endm.2013.10.056","title":"Greedy Pancake Flipping","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Genome Rearrangement Algorithms","field":"Biochemistry, Genetics and Molecular Biology","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; McGill University","funders":"","keywords":"Mathematics; Combinatorics; Greedy algorithm; Algorithm","authors":[{"name":"Aaron Williams","is_ca":true},{"name":"Joe Sawada","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007820628795675699,"gpt":0.2360577317844176,"spread":0.2282371029887419,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007894897,0.001180044,0.001420199,0.0009957383,0.001531239,0.001490059,0.002048586,0.00248525,0.03602166],"category_scores_gemma":[0.005912019,0.0006098226,0.001042732,0.001752456,0.001272805,0.002789334,0.00392774,0.00261803,0.005292905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008291751,"about_ca_system_score_gemma":0.001098877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000833598,"about_ca_topic_score_gemma":0.001505842,"domain_scores_codex":[0.9991724,0.0001887486,0.0000416393,0.0002191415,0.0001988255,0.0001792356],"domain_scores_gemma":[0.9982486,0.0007183469,0.00008211398,0.0006032277,0.0001657843,0.0001820516],"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.001171999,0.0003095919,0.0007492992,0.0003983787,0.00009936306,0.000345665,0.0002357471,0.1532434,0.01023776,0.4113294,0.07200154,0.3498779],"study_design_scores_gemma":[0.0001979788,0.0001628563,0.0002634995,0.00005638656,0.0000373576,0.0002424029,0.0000795435,0.4370917,0.003507227,0.5441827,0.0141403,0.00003808315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1255751,0.0009037747,0.7434391,0.002741705,0.00108538,0.0006643594,0.001441091,0.002550765,0.1215987],"genre_scores_gemma":[0.5707283,0.0005865401,0.3558057,0.001200625,0.0003050685,0.0009676962,0.001837286,0.0009235742,0.06764517],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03602166,"threshold_uncertainty_score":0.1205045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2611522934","doi":"10.1016/j.endm.2018.02.001","title":"Energy-Efficient Service Function Chain Provisioning","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Chaining; Computer science; Network Functions Virtualization; Distributed computing; Provisioning; Software-defined networking; Virtual network; Computer network; Failover; Efficient energy use; Function (biology); Network virtualization; Virtualization; Cloud computing; Operating system","authors":[{"name":"Nicolas Huin","is_ca":false},{"name":"Andrea Tomassilli","is_ca":false},{"name":"Frédéric Giroire","is_ca":false},{"name":"Brigitte Jaumard","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009884399169723711,"gpt":0.2328702385029862,"spread":0.2229858393332625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613224,0.0007123995,0.0008107016,0.0006839982,0.001118768,0.001734171,0.001446616,0.0009999112,0.01085468],"category_scores_gemma":[0.003172749,0.0003669621,0.0004106735,0.001279773,0.0004375156,0.001923881,0.001752524,0.001070793,0.001264174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009587515,"about_ca_system_score_gemma":0.001349356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001128238,"about_ca_topic_score_gemma":0.002081551,"domain_scores_codex":[0.9993887,0.000119141,0.00002552849,0.0000913752,0.0001954225,0.0001799532],"domain_scores_gemma":[0.9989454,0.0003919703,0.00007259092,0.0002744812,0.00022626,0.00008931017],"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.0007943117,0.0003373084,0.00115725,0.0002511976,0.00004344829,0.0003138703,0.0001569222,0.602256,0.02469824,0.1073878,0.01102728,0.2515765],"study_design_scores_gemma":[0.00001387838,0.00003919271,0.0001925846,0.00001188601,0.000008954577,0.0000727513,0.00003848578,0.9641063,0.002769751,0.03105845,0.001680114,0.000007685963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1205968,0.0004786576,0.8550799,0.0009152589,0.0001990503,0.0002300518,0.0004287311,0.001191873,0.02087969],"genre_scores_gemma":[0.9131993,0.0002451958,0.07905057,0.00007553984,0.00005152932,0.00005910863,0.0003147804,0.000100938,0.006903004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01085468,"threshold_uncertainty_score":0.03631258,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2176863076","doi":"10.1016/j.endm.2005.05.016","title":"On bags and bugs","year":2005,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Chordal graph; Discrete mathematics; Indifference graph; Graph","authors":[{"name":"Pierre Hansen","is_ca":true},{"name":"Dragan Stevanović","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01168407347966107,"gpt":0.2914724522231081,"spread":0.279788378743447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352642,0.0009542752,0.001463068,0.002995847,0.003769799,0.005917714,0.001789061,0.003159054,0.02752482],"category_scores_gemma":[0.02153635,0.00107425,0.001406074,0.003284298,0.008707613,0.02262244,0.006848787,0.005230457,0.003181588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001913038,"about_ca_system_score_gemma":0.0008346559,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003084177,"about_ca_topic_score_gemma":0.002155182,"domain_scores_codex":[0.9968093,0.001243601,0.0001813598,0.0006610941,0.0007224147,0.0003822494],"domain_scores_gemma":[0.9894953,0.006620202,0.0004885907,0.00191496,0.0009615009,0.0005195155],"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.00002251814,0.000007646916,0.0002817222,0.00003772763,0.00000899557,0.00004107707,0.0005268737,0.0004330937,0.00007016159,0.9766376,0.0101018,0.01183068],"study_design_scores_gemma":[0.000004922672,0.000002788738,0.00004954957,0.00001817652,0.000005538711,0.00003737812,0.0001366715,0.0007839742,0.00003639617,0.9877274,0.01119171,0.000005504452],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0851855,0.0206937,0.4609543,0.094055,0.006399727,0.00009856185,0.001370527,0.002868711,0.328374],"genre_scores_gemma":[0.8191525,0.005403342,0.05565233,0.007748393,0.003244933,0.0001931322,0.001336063,0.002357508,0.1049117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02752482,"threshold_uncertainty_score":0.0920797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2886351742","doi":"10.1016/j.endm.2018.07.043","title":"A hybrid heuristic for the multi-activity tour scheduling problem","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Tabu search; Computer science; Scheduling (production processes); Mathematical optimization; Job shop scheduling; Heuristic; Incremental heuristic search; Beam search; Time horizon; Artificial intelligence; Search algorithm; Mathematics; Algorithm; Schedule","authors":[{"name":"Stefania Pan","is_ca":false},{"name":"Mahuna Akplogan","is_ca":false},{"name":"Nora Touati","is_ca":false},{"name":"Lucas Létocart","is_ca":false},{"name":"Roberto Wolfler Calvo","is_ca":false},{"name":"Louis-Martin Rousseau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1046580400747033,"gpt":0.3967873945184167,"spread":0.2921293544437134,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006854715,0.0006985961,0.0009847812,0.001139234,0.0005050431,0.001013511,0.001766715,0.001320459,0.006209776],"category_scores_gemma":[0.001216652,0.0005023034,0.0007554963,0.001196318,0.0004100867,0.0009099347,0.0009851243,0.0007248886,0.0005726074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008674684,"about_ca_system_score_gemma":0.001361776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004076378,"about_ca_topic_score_gemma":0.005730472,"domain_scores_codex":[0.9995691,0.0001357576,0.00001918069,0.00005906648,0.0001238249,0.00009300752],"domain_scores_gemma":[0.9993173,0.0004201931,0.00004294469,0.0000576554,0.00008671717,0.00007529937],"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.0003398495,0.0003103426,0.0006113139,0.0001894452,0.00009151464,0.0001412663,0.00007188856,0.8423797,0.004718323,0.01048603,0.002577375,0.1380831],"study_design_scores_gemma":[0.00007952908,0.0001137712,0.0001650016,0.00001028694,0.00002707384,0.00003262214,0.00002191083,0.9951096,0.0006119511,0.002462127,0.001354885,0.00001135624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1059809,0.0007204256,0.8760058,0.000336408,0.0002721313,0.0003316662,0.0002981942,0.001211543,0.01484299],"genre_scores_gemma":[0.5223924,0.0002885395,0.4689175,0.0001997413,0.00008467595,0.0004754683,0.0003762412,0.0001776447,0.007087742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006209776,"threshold_uncertainty_score":0.02077371,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145668739","doi":"10.1016/s1571-0653(05)80175-1","title":"Simpler Projective Plane Embedding","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Projective plane; Antipodal point; Real projective plane; Mathematics; Line at infinity; Blocking set; Embedding; Pencil (optics); Projective space; Fano plane; Projective test; Combinatorics; Planar; Planar graph; Discrete mathematics; Homography; Graph; Collineation; Pure mathematics; Geometry; Computer science; Artificial intelligence; Physics; Optics; Computer graphics (images)","authors":[{"name":"Wendy Myrvold","is_ca":true},{"name":"Jianping Roth","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01608502856219113,"gpt":0.3185427643036872,"spread":0.3024577357414961,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002499931,0.000922446,0.0007324315,0.001251575,0.001462212,0.002514099,0.0009639201,0.001072483,0.02759942],"category_scores_gemma":[0.0007924613,0.0005002064,0.0006329474,0.0009896561,0.00138246,0.004962796,0.002810907,0.003703,0.003893459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000718105,"about_ca_system_score_gemma":0.000255085,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007741565,"about_ca_topic_score_gemma":0.0008490009,"domain_scores_codex":[0.9994652,0.00008746601,0.00002218936,0.0001686931,0.0001428396,0.000113693],"domain_scores_gemma":[0.9996699,0.0000627381,0.00004381864,0.00008643536,0.00005467905,0.00008232718],"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.00005958329,0.00003901141,0.0001139956,0.00004505989,0.00001050372,0.0001068259,0.0001753762,0.0005307677,0.001823082,0.9841987,0.004430623,0.00846635],"study_design_scores_gemma":[0.00003341783,0.00004733523,0.000662544,0.00001329537,0.00003121932,0.0003792093,0.000202359,0.003995099,0.001632314,0.9675637,0.02541557,0.00002394908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.332543,0.00112694,0.1131562,0.004263888,0.001256457,0.0001176579,0.001053372,0.0008991232,0.5455834],"genre_scores_gemma":[0.85185,0.00077119,0.02226347,0.0008867832,0.0005540267,0.00007456955,0.00100666,0.0004221867,0.1221711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02759942,"threshold_uncertainty_score":0.09232926,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977677776","doi":"10.1016/s1571-0653(04)00379-8","title":"Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Treewidth; Minor (academic); Mathematics; Partial k-tree; Maximization; Combinatorics; 1-planar graph; Discrete mathematics; Planar graph; Bounded function; Graph minor; Minification; Robertson–Seymour theorem; Graph; Pathwidth; Chordal graph; Mathematical optimization; Line graph; Graph power; Mathematical analysis","authors":[{"name":"Mohammad Taghi Hajiaghayi","is_ca":true},{"name":"Naomi Nishimura","is_ca":true},{"name":"Prabhakar Ragde","is_ca":true},{"name":"Dimitrios M. Thilikos","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0255491360541157,"gpt":0.3063829586482106,"spread":0.280833822594095,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001754308,0.00139352,0.001563734,0.001302092,0.001680712,0.003730875,0.003718604,0.001955991,0.0109055],"category_scores_gemma":[0.009679833,0.0006526685,0.001474602,0.002468269,0.001257648,0.007788377,0.004838951,0.002358166,0.001940222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003532261,"about_ca_system_score_gemma":0.001920777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004366199,"about_ca_topic_score_gemma":0.008436184,"domain_scores_codex":[0.9984618,0.0002822032,0.00009679767,0.0002976419,0.0003992362,0.0004623828],"domain_scores_gemma":[0.993959,0.003099449,0.0003515411,0.001769286,0.0004527293,0.0003679793],"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.008126022,0.0006188346,0.003903269,0.001039303,0.0002597582,0.0003255507,0.002123096,0.2211862,0.02492155,0.3111182,0.03487116,0.391507],"study_design_scores_gemma":[0.0004279162,0.0002154655,0.0007595866,0.00008730252,0.0001237267,0.0002122,0.0003725872,0.5665984,0.00952268,0.4132604,0.008358397,0.00006144022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3170265,0.002115764,0.6510224,0.002181112,0.0003232933,0.0002911042,0.00169001,0.005852865,0.01949695],"genre_scores_gemma":[0.6843866,0.0006952183,0.300217,0.0004921585,0.0001423577,0.0002845433,0.002499838,0.0009972579,0.01028511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0109055,"threshold_uncertainty_score":0.03648257,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065185671","doi":"10.1016/j.endm.2013.05.133","title":"On the approximability of two capacitated vehicle routing problems","year":2013,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Orienteering; Regret; Vehicle routing problem; Mathematics; Euclidean geometry; Mathematical optimization; Chen; Combinatorics; Euclidean distance; Approximation algorithm; Discrete mathematics; Computer science; Routing (electronic design automation)","authors":[{"name":"Adrian Bock","is_ca":true},{"name":"Laura Sanità","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02151688624129685,"gpt":0.2811482681370374,"spread":0.2596313818957406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003520801,0.001487928,0.001740547,0.001550886,0.00088917,0.004012642,0.002988352,0.002890632,0.007118055],"category_scores_gemma":[0.02616631,0.0006953355,0.00190636,0.001644313,0.002655075,0.004525771,0.002710387,0.005164301,0.0002734275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003701616,"about_ca_system_score_gemma":0.001996296,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004778713,"about_ca_topic_score_gemma":0.002780887,"domain_scores_codex":[0.9977729,0.0008110972,0.0001078601,0.0004352677,0.0004647273,0.000408097],"domain_scores_gemma":[0.9734356,0.0231979,0.0008914292,0.0009201872,0.0008235139,0.0007312236],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001237493,0.000357431,0.002557919,0.0004225587,0.0001459824,0.0002246537,0.0005493594,0.6332958,0.001775921,0.3208421,0.002808403,0.0357824],"study_design_scores_gemma":[0.00006089838,0.00007459739,0.0003626571,0.00002917175,0.00003701809,0.00005399853,0.0001025504,0.8363314,0.0004653386,0.1618095,0.0006565216,0.00001630258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.4386121,0.001715049,0.5198922,0.004421884,0.0003289114,0.000149679,0.0004107929,0.0005533771,0.033916],"genre_scores_gemma":[0.9268219,0.0005245568,0.06472361,0.000212947,0.000150864,0.0001021337,0.0004735831,0.0001246666,0.006865717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007118055,"threshold_uncertainty_score":0.0268572,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996274033","doi":"10.1016/j.endm.2006.06.091","title":"Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms","year":2006,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Lethbridge","funders":"","keywords":"Jacobian matrix and determinant; Mathematics; Automatic differentiation; Matrix (chemical analysis); Algorithm; Sparse matrix; Combinatorics; Computation; Applied mathematics","authors":[{"name":"Mini Goyal","is_ca":true},{"name":"Shahadat Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04340591502335867,"gpt":0.3179354508031987,"spread":0.27452953577984,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001271152,0.00116253,0.001082098,0.001393072,0.0006686395,0.00170182,0.001645008,0.001170887,0.004725033],"category_scores_gemma":[0.006725601,0.0008516038,0.0006047806,0.001806524,0.001007076,0.002396933,0.00224184,0.002100331,0.002224048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003427689,"about_ca_system_score_gemma":0.0009980648,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00231362,"about_ca_topic_score_gemma":0.003600834,"domain_scores_codex":[0.9993616,0.0001903912,0.00003235753,0.0001239931,0.0002501821,0.00004152504],"domain_scores_gemma":[0.9977575,0.001084354,0.0001855599,0.000382977,0.000486872,0.0001028695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001459781,0.0001365073,0.0009624598,0.0004158651,0.00007741699,0.0001223408,0.0004105847,0.2235386,0.01459765,0.2537097,0.009384444,0.4964986],"study_design_scores_gemma":[0.00001879363,0.00003258171,0.0002053998,0.00002693129,0.00001306011,0.0001174889,0.00007421325,0.9125141,0.003328768,0.07802306,0.005618635,0.00002699074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001496687,0.0001075837,0.997366,0.00004608038,0.00001552867,0.00001037982,0.00002199887,0.00007545403,0.0008602883],"genre_scores_gemma":[0.06498206,0.0007308493,0.9295546,0.00008200551,0.00007806007,0.0001126137,0.0002587743,0.0001836177,0.004017449],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004725033,"threshold_uncertainty_score":0.01580685,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1982828667","doi":"10.1016/j.endm.2009.07.047","title":"Codings of rotations on two intervals are full","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"semigroups and automata theory","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Combinatorics; Combinatorics on words; Binary number; Partition (number theory); Sequence (biology); Unit circle; Discrete mathematics; Arithmetic; Geometry; Word (group theory)","authors":[{"name":"Alexandre Blondin Massé","is_ca":true},{"name":"Srečko Brlek","is_ca":true},{"name":"Sebastien Labbé","is_ca":true},{"name":"Laurent Vuillon","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01311977625771673,"gpt":0.2794030656433672,"spread":0.2662832893856505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000593468,0.0005850733,0.0006305162,0.001014238,0.001232094,0.002502646,0.0009355382,0.001147991,0.01692256],"category_scores_gemma":[0.005658676,0.0004912309,0.0007933283,0.0013728,0.001817924,0.004331979,0.002168057,0.002198737,0.002713777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006684736,"about_ca_system_score_gemma":0.0007218104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001050472,"about_ca_topic_score_gemma":0.0007638966,"domain_scores_codex":[0.9987501,0.0002559344,0.00008308189,0.0002385134,0.0003445337,0.0003277568],"domain_scores_gemma":[0.9965127,0.001382915,0.0002557588,0.001047268,0.0005244733,0.0002768949],"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.0001588934,0.00002230785,0.0001154138,0.00004847061,0.000006187369,0.0001383867,0.0003747962,0.001812273,0.002502579,0.9585239,0.003416488,0.03288035],"study_design_scores_gemma":[0.00003002829,0.00003409815,0.000195692,0.00002624943,0.00001012361,0.000132485,0.0001846464,0.008109458,0.00279909,0.9792441,0.009205139,0.00002902213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2564877,0.001022697,0.5360298,0.002580338,0.001483957,0.0002246376,0.001999117,0.002904399,0.1972674],"genre_scores_gemma":[0.913454,0.0004733466,0.04749016,0.0005058006,0.0002357463,0.0002184829,0.001021374,0.0006198349,0.03598123],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01692256,"threshold_uncertainty_score":0.0566116,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039616602","doi":"10.1016/j.endm.2010.05.094","title":"An Improved Interior-Point Cutting-Plane Method for Binary Quadratic Optimization","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Cutting-plane method; Iterated function; Mathematics; Interior point method; Quadratic equation; Binary number; Point (geometry); Relaxation (psychology); Quadratically constrained quadratic program; Mathematical optimization; Quadratic programming; Plane (geometry); Algorithm; Applied mathematics; Mathematical analysis; Integer programming; Geometry; Arithmetic","authors":[{"name":"Alexander Engau","is_ca":false},{"name":"Miguel F. Anjos","is_ca":true},{"name":"Anthony Vannelli","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02022941623167324,"gpt":0.3790834266210562,"spread":0.358854010389383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001162633,0.001152618,0.002042686,0.001027826,0.0005388352,0.0009379985,0.002223359,0.00162178,0.008897497],"category_scores_gemma":[0.002138363,0.0007128654,0.001154406,0.001195618,0.0006840944,0.0009300183,0.001592279,0.002654501,0.00194442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004494378,"about_ca_system_score_gemma":0.001065939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00248925,"about_ca_topic_score_gemma":0.002420146,"domain_scores_codex":[0.9993322,0.0001625018,0.00002557769,0.00007247277,0.0003652202,0.00004194218],"domain_scores_gemma":[0.9994469,0.0002453898,0.00002713553,0.0000597319,0.0001863757,0.00003447345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002808874,0.0003234555,0.0003876574,0.0003986258,0.00007894231,0.0001159894,0.0001358374,0.4920985,0.01250018,0.05143688,0.008333485,0.4339096],"study_design_scores_gemma":[0.0000342911,0.0000429723,0.00006285944,0.00001074014,0.000009091013,0.00002677469,0.000005326785,0.9926199,0.000604022,0.004209111,0.002366473,0.000008441718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0019823,0.00008755153,0.9954488,0.00004242935,0.00007598184,0.00003475449,0.00002182818,0.0001583288,0.002148051],"genre_scores_gemma":[0.03792731,0.0001289668,0.9582586,0.00007734013,0.00006001422,0.0001870205,0.0001139064,0.0001873592,0.003059578],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008897497,"threshold_uncertainty_score":0.02976507,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2177515002","doi":"10.1016/j.endm.2015.06.046","title":"Graph Cores via Universal Completability","year":2015,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Structural Analysis and Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Combinatorics; Discrete mathematics; Complement graph; Null graph; Graph; Voltage graph; Line graph; Automorphism; Mathematical proof; Edge-transitive graph","authors":[{"name":"Chris Godsil","is_ca":true},{"name":"David E. Roberson","is_ca":false},{"name":"Brendan Rooney","is_ca":true},{"name":"Robert Šámal","is_ca":false},{"name":"Antonios Varvitsiotis","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0133832762103464,"gpt":0.224876495418177,"spread":0.2114932192078306,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009054025,0.001024042,0.001347554,0.001734723,0.001721625,0.002706417,0.00173211,0.001305676,0.01872176],"category_scores_gemma":[0.006236281,0.001025326,0.001655255,0.001433935,0.003438676,0.006689603,0.004351779,0.004254296,0.001220481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001092685,"about_ca_system_score_gemma":0.0007244642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008194626,"about_ca_topic_score_gemma":0.001523665,"domain_scores_codex":[0.9987526,0.0002322528,0.00004620539,0.0004180323,0.0002969266,0.0002539833],"domain_scores_gemma":[0.9946091,0.003387222,0.00041454,0.0008047444,0.000403366,0.0003810413],"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.00006606668,0.00004282183,0.0002020875,0.00007914752,0.00001896778,0.0000766814,0.0001550933,0.003151878,0.0007378078,0.983704,0.003221509,0.008544005],"study_design_scores_gemma":[0.0000205829,0.00001847755,0.0001436195,0.00001354727,0.0000140107,0.00007868149,0.00003952752,0.01046487,0.0005366218,0.9876056,0.001056036,0.000008550611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3276719,0.0007707376,0.4670712,0.003331338,0.00045004,0.0002576008,0.001126348,0.002123052,0.1971978],"genre_scores_gemma":[0.9482136,0.0004150491,0.03070729,0.001000911,0.0003663251,0.0002693415,0.000723053,0.0005706601,0.01773376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01872176,"threshold_uncertainty_score":0.06263053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071287219","doi":"10.1016/j.endm.2009.07.035","title":"Coloring a set of touching strings","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Mathematics; Conjecture; Combinatorics; Monotone polygon; Plane (geometry); Planar graph; Bounded function; Discrete geometry; Integer (computer science); Line segment; Line (geometry); Point (geometry); Set (abstract data type); Discrete mathematics; Geometry; Graph; Mathematical analysis; Computer science","authors":[{"name":"Louis Esperet","is_ca":true},{"name":"Daniel Gonçalves","is_ca":true},{"name":"Arnaud Labourel","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01980883633670022,"gpt":0.3122065784120555,"spread":0.2923977420753552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003915159,0.001004416,0.00117868,0.00143853,0.002639001,0.003363518,0.002124076,0.002063138,0.02022101],"category_scores_gemma":[0.003134919,0.0008556177,0.001095367,0.00312619,0.00140402,0.002923226,0.002535095,0.001779611,0.00327574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008377359,"about_ca_system_score_gemma":0.0007237849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009504682,"about_ca_topic_score_gemma":0.001009173,"domain_scores_codex":[0.998913,0.000165033,0.00006898565,0.0003236527,0.0002690286,0.0002603248],"domain_scores_gemma":[0.996238,0.001379298,0.0002675244,0.001029546,0.0005592218,0.0005263698],"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.001412605,0.0006366278,0.005124311,0.0008334482,0.0002022369,0.00162353,0.001362673,0.0398709,0.0858389,0.7071102,0.01587076,0.1401139],"study_design_scores_gemma":[0.0002187241,0.0003759217,0.002559502,0.0001706038,0.0001102952,0.0008471776,0.0009967786,0.1304819,0.03709656,0.7966211,0.03039645,0.0001248999],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5050418,0.0003873986,0.4121229,0.0008525446,0.0007044422,0.000279248,0.00209026,0.002709429,0.07581189],"genre_scores_gemma":[0.718972,0.0004019886,0.2175736,0.0005153255,0.0001490206,0.0006422844,0.002537219,0.0008781303,0.05833051],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02022101,"threshold_uncertainty_score":0.06764609,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2174315020","doi":"10.1016/j.endm.2009.07.049","title":"On distance edge-colourings and matchings","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Combinatorics; Mathematics; Enhanced Data Rates for GSM Evolution; Discrete mathematics; Computer science; Telecommunications","authors":[{"name":"Ross J. Kang","is_ca":true},{"name":"Putra Manggala","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01040223764793902,"gpt":0.2762150895915916,"spread":0.2658128519436526,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00203884,0.001108848,0.001867034,0.004291349,0.002797376,0.004013027,0.002961547,0.003040174,0.0135073],"category_scores_gemma":[0.01383187,0.0009998498,0.001229642,0.007493273,0.005396553,0.01462794,0.005227254,0.004979826,0.001276967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002386117,"about_ca_system_score_gemma":0.0005751854,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001523706,"about_ca_topic_score_gemma":0.001274764,"domain_scores_codex":[0.9983891,0.0004398709,0.0001014705,0.0003974391,0.000434561,0.0002375511],"domain_scores_gemma":[0.9921394,0.005233335,0.0006981081,0.0007677032,0.0005085501,0.0006527892],"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.00003242547,0.00001939903,0.0001680339,0.00004304195,0.000005575794,0.00003041861,0.0002158201,0.00106139,0.0002370049,0.9899559,0.00111579,0.007115191],"study_design_scores_gemma":[0.00000613198,0.000005056272,0.00007525476,0.00001114432,0.000004625193,0.00003906754,0.0000476314,0.001662937,0.00007111787,0.9964039,0.001668093,0.00000495032],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4067413,0.01054794,0.3738582,0.01043383,0.0014972,0.0001417514,0.0009106175,0.0005950895,0.1952742],"genre_scores_gemma":[0.8784713,0.005988722,0.06079389,0.001716158,0.001424391,0.0001812934,0.0007776165,0.0003122317,0.05033437],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0135073,"threshold_uncertainty_score":0.04518646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963297472","doi":"10.1016/j.endm.2017.06.062","title":"Exponentially many nowhere-zero <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:math>-, <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si2.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msub></mml:math>-, and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si3.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi mathvariant=\"double-struck\">Z</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msub></mml:math>-flows","year":2017,"lang":"lv","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Javna Agencija za Raziskovalno Dejavnost RS; Grantová Agentura České Republiky; Ministerstvo Školství, Mládeže a Tělovýchovy; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Planar graph; Zero (linguistics); Graph; Exponential function; Combinatorics; Discrete mathematics; Calculus (dental); Mathematical analysis; Philosophy","authors":[{"name":"Zdenĕk Dvořák","is_ca":false},{"name":"Bojan Mohar","is_ca":true},{"name":"Robert Šámal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02398351293730569,"gpt":0.2639377345437798,"spread":0.2399542216064741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003132111,0.001662555,0.002348829,0.002378877,0.004209975,0.008443112,0.003391785,0.00330227,0.1179339],"category_scores_gemma":[0.02927569,0.001201955,0.002203822,0.002275272,0.003230334,0.01876113,0.005357997,0.006247988,0.05552763],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003783991,"about_ca_system_score_gemma":0.003354703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004678892,"about_ca_topic_score_gemma":0.004615544,"domain_scores_codex":[0.9960497,0.0007387156,0.0001636742,0.001137019,0.001255591,0.0006553914],"domain_scores_gemma":[0.985936,0.005173061,0.0008349784,0.002889299,0.003811518,0.001355159],"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.0004321206,0.0002046093,0.004546713,0.0008615095,0.0001146691,0.0004896199,0.0005420955,0.005839673,0.002909177,0.6711694,0.2071854,0.1057049],"study_design_scores_gemma":[0.00009505057,0.00009781859,0.002469459,0.0003957593,0.0001192032,0.001238673,0.0007991685,0.03229892,0.004625533,0.7782776,0.1794155,0.0001673907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.09139881,0.01095353,0.3164885,0.06782664,0.008258539,0.0003324825,0.01409984,0.009752551,0.480889],"genre_scores_gemma":[0.3943705,0.01059216,0.0716081,0.01333732,0.002780491,0.0008978466,0.01196456,0.004806759,0.4896423],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1179339,"threshold_uncertainty_score":0.3945283,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2175791395","doi":"10.1016/s1571-0653(04)00522-0","title":"Efficient computation of 2-medians in a tree network with positive/negative weights","year":2003,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Median; Combinatorics; Computation; Tree (set theory); Discrete mathematics; Algorithm","authors":[{"name":"Robert Benkoczi","is_ca":true},{"name":"Binay Bhattacharya","is_ca":true},{"name":"David Jose Fernandez Breton","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009566982721049827,"gpt":0.2237243739697998,"spread":0.21415739124875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009978014,0.0008332665,0.001231428,0.00154992,0.0009487781,0.002143578,0.001595392,0.00162081,0.006590692],"category_scores_gemma":[0.006761513,0.0008616737,0.0008782215,0.001630932,0.0007243745,0.003045836,0.001700527,0.001173874,0.0007054227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001528374,"about_ca_system_score_gemma":0.001161611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005959823,"about_ca_topic_score_gemma":0.01220746,"domain_scores_codex":[0.9995271,0.000108053,0.00003271806,0.0001332252,0.0001155391,0.00008329677],"domain_scores_gemma":[0.9974133,0.001812667,0.0001936579,0.0001926727,0.0002271359,0.0001605404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005465785,0.000110846,0.002475092,0.0002127753,0.00007430756,0.0001232649,0.0002258025,0.8372459,0.003767374,0.04580747,0.004689135,0.1047214],"study_design_scores_gemma":[0.00001669973,0.00001778604,0.0001590943,0.000007340565,0.000007201394,0.00001433543,0.00003398389,0.9722005,0.0007130333,0.02648902,0.0003357613,0.000005164841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170092,0.000241616,0.8221607,0.0005626979,0.00006442051,0.0001000696,0.0009098374,0.001530165,0.004338419],"genre_scores_gemma":[0.4507046,0.0001223828,0.5439899,0.00008374114,0.00004382242,0.0001046322,0.00111047,0.0002800119,0.003560424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006590692,"threshold_uncertainty_score":0.02204806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2075766499","doi":"10.1016/j.endm.2004.03.039","title":"Minimum-Cost Single-Source 2-Splittable Flow","year":2004,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Minimum-cost flow problem; Mathematical optimization; Mathematics; Flow (mathematics); Vertex (graph theory); Path (computing); Constraint (computer-aided design); Flow network; Enhanced Data Rates for GSM Evolution; Budget constraint; Graph; Computer science; Combinatorics; Economics; Microeconomics; Computer network; Geometry","authors":[{"name":"Stavros G. Kolliopoulos","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01972464748282074,"gpt":0.2491237440068524,"spread":0.2293990965240317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007734689,0.001518036,0.001641649,0.001381506,0.001243734,0.002057011,0.002593223,0.002299798,0.02267118],"category_scores_gemma":[0.003000749,0.0006790616,0.0009849233,0.001879989,0.0007467446,0.004430815,0.00216284,0.00159123,0.001514845],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001503148,"about_ca_system_score_gemma":0.001712431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00171112,"about_ca_topic_score_gemma":0.002904148,"domain_scores_codex":[0.9995494,0.00008307435,0.00002776501,0.0001178249,0.000101462,0.0001203045],"domain_scores_gemma":[0.9985594,0.0006470966,0.0001531645,0.0002486036,0.0001924509,0.0001991949],"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.003581682,0.000836015,0.002008009,0.002588389,0.0003633819,0.0008282941,0.0006594976,0.3160913,0.03516265,0.3376175,0.06581984,0.2344435],"study_design_scores_gemma":[0.000659848,0.0003316451,0.00150412,0.0001523432,0.0001960504,0.0004553129,0.0002503937,0.5329261,0.01184507,0.4410241,0.01057376,0.00008133206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3959176,0.001090074,0.5180427,0.003589085,0.0005486385,0.000787341,0.008231606,0.002355946,0.06943704],"genre_scores_gemma":[0.7537428,0.0007741058,0.2154909,0.000420753,0.0001757354,0.0004060264,0.004019746,0.0004421931,0.02452771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02267118,"threshold_uncertainty_score":0.07584268,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2790036744","doi":"10.1016/j.endm.2018.02.017","title":"New Constant Weight Codes and Packing Numbers","year":2018,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mathematics; Combinatorics; Constant (computer programming); Code (set theory); Binary code; Binary number; Discrete mathematics; Arithmetic; Computer science; Set (abstract data type)","authors":[{"name":"Iliya Bluskov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.005941041425367322,"gpt":0.2191869906412673,"spread":0.2132459492158999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009941008,0.001202479,0.0009027025,0.004214685,0.001997074,0.004034932,0.001980112,0.002837188,0.01034398],"category_scores_gemma":[0.01131805,0.0009428199,0.0006616559,0.00489461,0.003677543,0.005485296,0.003057693,0.004423948,0.001964704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001649133,"about_ca_system_score_gemma":0.0006934574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000636469,"about_ca_topic_score_gemma":0.0007389181,"domain_scores_codex":[0.9986364,0.0002935945,0.00006626915,0.0002697493,0.0005372588,0.0001966406],"domain_scores_gemma":[0.9945972,0.002970814,0.0006589681,0.0007577493,0.0005453849,0.0004698171],"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.00008401227,0.0000258436,0.0002042255,0.00005977343,0.000006350406,0.00007903543,0.0001546388,0.002458174,0.001357574,0.9763299,0.003268678,0.0159718],"study_design_scores_gemma":[0.00001860471,0.00001837127,0.0001985526,0.00002667549,0.000008773904,0.0001927439,0.00003949215,0.01052657,0.001094793,0.9827063,0.005141063,0.0000280785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.3876657,0.005613867,0.3750908,0.006473809,0.003291178,0.0001840488,0.0009593594,0.001203752,0.2195176],"genre_scores_gemma":[0.8395606,0.002683721,0.09002688,0.001537857,0.002272791,0.0003319721,0.0006651101,0.0006328773,0.06228826],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.01034398,"threshold_uncertainty_score":0.03460401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041242280","doi":"10.1016/j.endm.2010.05.151","title":"Scheduling flexible flowshops with unit-time operations and minimum time delays","year":2010,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Scheduling (production processes); Computer science; Mathematical optimization; Job shop scheduling; Heuristic; Unit (ring theory); Simple (philosophy); Execution time; Real-time computing; Mathematics; Parallel computing; Schedule","authors":[{"name":"Djamal Rebaïne","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006051890991454484,"gpt":0.221934916610815,"spread":0.2158830256193605,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280932,0.00134798,0.001426273,0.000907359,0.001129253,0.001528466,0.002103449,0.001359284,0.003959448],"category_scores_gemma":[0.003795375,0.0009987825,0.0009258606,0.001909999,0.001052597,0.001810356,0.001354292,0.001159919,0.0002513008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303173,"about_ca_system_score_gemma":0.001047498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003117691,"about_ca_topic_score_gemma":0.003506555,"domain_scores_codex":[0.9994321,0.0001333501,0.00003645908,0.0001221892,0.0001000391,0.0001757644],"domain_scores_gemma":[0.9982615,0.001063972,0.0002322982,0.0001582495,0.0001158392,0.0001681844],"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.0004714255,0.00005459635,0.0002354965,0.00009344053,0.0000497139,0.0001118244,0.00008143494,0.9601517,0.003640574,0.01633924,0.0006851993,0.01808534],"study_design_scores_gemma":[0.00005263472,0.0001036431,0.0001372548,0.000005948648,0.00001315862,0.00002315002,0.00003420858,0.9836615,0.001194181,0.01432382,0.0004383929,0.00001207541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.240145,0.0004429739,0.7532601,0.0003037468,0.0002466885,0.0001739532,0.0002225964,0.0002886684,0.004916095],"genre_scores_gemma":[0.9169267,0.0001986897,0.07976063,0.00004171759,0.00006533915,0.0001373621,0.0001335356,0.0001066884,0.002629291],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003959448,"threshold_uncertainty_score":0.01324564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1974199390","doi":"10.1016/s1571-0653(04)00119-2","title":"The Domination Number of Cubic Graphs with Girth at least Five","year":2002,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Mount Saint Vincent University","funders":"","keywords":"Combinatorics; Mathematics; Girth (graph theory); Domination analysis; Cubic graph; Graph; Discrete mathematics; Line graph; Vertex (graph theory); Voltage graph","authors":[{"name":"David Fisher","is_ca":false},{"name":"Kathryn Fraughnaugh","is_ca":false},{"name":"Suzanne M. Seager","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01122397941925606,"gpt":0.2711278830301002,"spread":0.2599039036108441,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006262598,0.0004147392,0.0005934748,0.002268229,0.001382809,0.002227334,0.001229618,0.0009475441,0.004210621],"category_scores_gemma":[0.00585342,0.0004228933,0.0002975931,0.001795283,0.001443055,0.001874161,0.001008103,0.001157034,0.0003265678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001543498,"about_ca_system_score_gemma":0.0008196133,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001789539,"about_ca_topic_score_gemma":0.002620173,"domain_scores_codex":[0.9994905,0.0001021768,0.00002449426,0.0001103779,0.0001251819,0.0001471953],"domain_scores_gemma":[0.9913107,0.005745744,0.001089436,0.0005113232,0.0004072781,0.0009356012],"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.003962405,0.0003292664,0.05423403,0.001078524,0.0002784555,0.0008960495,0.002703023,0.09547335,0.07430836,0.6294848,0.0288245,0.1084272],"study_design_scores_gemma":[0.0004132946,0.0003710142,0.05081814,0.0001963195,0.0002149805,0.002133941,0.001211695,0.225692,0.02366268,0.6748027,0.02026448,0.0002188843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.972001,0.0006055695,0.003906423,0.0007491532,0.00004398542,0.00001891111,0.0008198794,0.0001112201,0.02174376],"genre_scores_gemma":[0.995336,0.0003096262,0.001447537,0.00006131109,0.00006103369,0.00003135986,0.0004496921,0.00002595793,0.002277512],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004210621,"threshold_uncertainty_score":0.01408595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008282466","doi":"10.1016/j.endm.2009.07.107","title":"On the Plane-Width of Graphs","year":2009,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Combinatorics; Chromatic scale; Vertex (graph theory); Graph; Plane (geometry); Wheel graph; Geometric graph theory; Planar graph; Discrete mathematics; Graph power; Geometry; Line graph","authors":[{"name":"Marcin Kamiński","is_ca":false},{"name":"Paul Medvedev","is_ca":true},{"name":"Martin Milanič","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01123810626036128,"gpt":0.2477235719782012,"spread":0.2364854657178399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001732602,0.001254504,0.001312741,0.004034915,0.001088699,0.003530201,0.002912317,0.001900556,0.01152544],"category_scores_gemma":[0.01329249,0.001204146,0.0009190032,0.003511081,0.003583146,0.009206072,0.003464534,0.004343505,0.00114472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395122,"about_ca_system_score_gemma":0.0004352634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001839916,"about_ca_topic_score_gemma":0.00165381,"domain_scores_codex":[0.9990727,0.0002887884,0.00004996427,0.0002077588,0.0002126814,0.0001679853],"domain_scores_gemma":[0.9915358,0.005430727,0.0009189189,0.0007009418,0.000562477,0.0008511905],"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.0002661584,0.00005019374,0.001540562,0.0001721075,0.00003154757,0.00008986073,0.000531319,0.01843647,0.002239528,0.9379126,0.004742799,0.03398675],"study_design_scores_gemma":[0.00004173596,0.0000418375,0.0008125748,0.0000841381,0.00003194753,0.0001157986,0.0002753404,0.04117724,0.000717147,0.9518654,0.00481478,0.00002187977],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5371177,0.006873935,0.3661301,0.004768324,0.0004557599,0.0001101047,0.001432969,0.0005269295,0.08258413],"genre_scores_gemma":[0.8832171,0.005178385,0.08856727,0.0008186331,0.0008323498,0.0001736919,0.00104129,0.0006860547,0.01948532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01152544,"threshold_uncertainty_score":0.03855646,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991595634","doi":"10.1016/j.endm.2006.06.012","title":"The structure and unlabelled enumeration of toroidal graphs with no K3,3's","year":2006,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Enumeration; Mathematics; Toroid; Combinatorics; Planar; Planar graph; Chordal graph; Discrete mathematics; Graph; Computer science; Physics","authors":[{"name":"Andrei Gagarin","is_ca":true},{"name":"Gilbert Labelle","is_ca":true},{"name":"Pierre Leroux","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.004346590744890076,"gpt":0.2385302593103927,"spread":0.2341836685655027,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004235657,0.0004814671,0.000610487,0.001183235,0.003149939,0.003910714,0.001520035,0.001387784,0.008019205],"category_scores_gemma":[0.002269712,0.0005787974,0.0006410076,0.001434269,0.002168051,0.003039287,0.001336924,0.00191046,0.001634777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001123843,"about_ca_system_score_gemma":0.001018985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002120648,"about_ca_topic_score_gemma":0.003208447,"domain_scores_codex":[0.9994563,0.0001073663,0.00003327432,0.0001154912,0.0001067887,0.000180816],"domain_scores_gemma":[0.9982569,0.0005724707,0.0003239668,0.0002741874,0.0002716256,0.000300848],"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.0002078401,0.00004755024,0.000674265,0.00007661441,0.000007802836,0.0001956085,0.000628068,0.001871337,0.003843633,0.9788263,0.003316383,0.01030455],"study_design_scores_gemma":[0.00001848877,0.0000238523,0.0007647398,0.00003678506,0.00001377448,0.0001615554,0.000416983,0.005783779,0.00187104,0.9839662,0.006921614,0.0000211855],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8036143,0.000338005,0.07584479,0.001178546,0.0004140122,0.00008340596,0.001363185,0.0004781651,0.1166856],"genre_scores_gemma":[0.9272245,0.0003288716,0.03988862,0.0004737973,0.0001163553,0.0001180293,0.001998149,0.0003046692,0.02954701],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008019205,"threshold_uncertainty_score":0.02682692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2179188366","doi":"10.1016/s1571-0653(05)80141-6","title":"Well-located graphs: A collection of well-covered ones","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saint Mary's University","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Vertex (graph theory); Graph; Maximal independent set; Independent set; Discrete mathematics; Chordal graph; 1-planar graph","authors":[{"name":"Arthur S. Finbow","is_ca":true},{"name":"Bert L. Hartnell","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01186500088918949,"gpt":0.2746254796604122,"spread":0.2627604787712227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001071056,0.001268274,0.002068706,0.006086695,0.002784847,0.004047799,0.002543615,0.002185232,0.007801584],"category_scores_gemma":[0.008046494,0.001415255,0.00121055,0.006491021,0.002548663,0.007961713,0.00355402,0.002882897,0.001853459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001014212,"about_ca_system_score_gemma":0.0006318035,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008582661,"about_ca_topic_score_gemma":0.001198582,"domain_scores_codex":[0.9978137,0.0003275585,0.0001380181,0.0006601302,0.0007285022,0.0003320217],"domain_scores_gemma":[0.9923702,0.002938448,0.0008693992,0.001549829,0.001358693,0.0009134224],"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.0002029994,0.00008535967,0.002476579,0.0004711865,0.00009844196,0.001130284,0.001626991,0.004794602,0.00539979,0.9347093,0.009260387,0.03974408],"study_design_scores_gemma":[0.00003079644,0.0000563219,0.002224073,0.00009634416,0.000098602,0.00165608,0.0006048578,0.01506241,0.002275889,0.9564969,0.02135039,0.00004727332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.466442,0.006683141,0.447004,0.001464576,0.0003836984,0.0002359656,0.003130817,0.001405134,0.07325075],"genre_scores_gemma":[0.8518812,0.00485446,0.09593295,0.0005916825,0.000864171,0.0003709886,0.004734634,0.001148608,0.03962127],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007801584,"threshold_uncertainty_score":0.02609891,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019080419","doi":"10.1016/s1571-0653(04)00217-3","title":"Exact Enumeration of Rooted 3-connected Triangular Maps on the Projective Plane (Extended Abstract)","year":2001,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); Carleton University","funders":"","keywords":"Mathematics; Projective plane; Simple (philosophy); Real projective plane; Enumeration; Blocking set; Plane (geometry); Combinatorics; Parametric statistics; Connected component; Projective test; Projective space; Pure mathematics; Geometry; Complex projective space","authors":[{"name":"Zhicheng Gao","is_ca":true},{"name":"Jianyu Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02730068142452436,"gpt":0.3062026479866634,"spread":0.278901966562139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000134539,0.00038823,0.0004456377,0.001338014,0.00110086,0.002669704,0.0007719767,0.0007658358,0.01418812],"category_scores_gemma":[0.0008870485,0.0002653403,0.0003282336,0.001664016,0.0008562082,0.001954502,0.001171318,0.0009793582,0.001376971],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007445134,"about_ca_system_score_gemma":0.000341491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001317185,"about_ca_topic_score_gemma":0.002386222,"domain_scores_codex":[0.999743,0.0000342589,0.00001455135,0.00003711519,0.00009605442,0.00007493536],"domain_scores_gemma":[0.9995759,0.000141858,0.00006821443,0.00004563438,0.00009339613,0.00007502757],"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.0001131894,0.00006938954,0.0008660934,0.0001052796,0.00001202795,0.0003818102,0.0005849121,0.003942377,0.005774141,0.9580481,0.002772915,0.02732969],"study_design_scores_gemma":[0.00002648968,0.00004454552,0.001109465,0.00003544501,0.00001485676,0.000356278,0.0005315791,0.02306644,0.003963319,0.9639256,0.006904482,0.00002130569],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7756501,0.000349903,0.08282067,0.0004648275,0.0001692711,0.00006419507,0.0006994765,0.0003523153,0.1394292],"genre_scores_gemma":[0.9604117,0.0002784269,0.01958984,0.0001030341,0.00004938487,0.0000399876,0.0005553648,0.00007496459,0.01889735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01418812,"threshold_uncertainty_score":0.04746395,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W790696949","doi":"10.1016/j.endm.2015.06.021","title":"Weak regularity and finitely forcible graph limits","year":2015,"lang":"en","type":"preprint","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"European Research Council; Engineering and Physical Sciences Research Council; Grantová Agentura České Republiky; European Commission","keywords":"Combinatorics; Bounded function; Mathematics; Upper and lower bounds; Partition (number theory); Finitely-generated abelian group; Graph; Discrete mathematics; Mathematical analysis","authors":[{"name":"Jacob W. Cooper","is_ca":true},{"name":"Tomáš Kaiser","is_ca":false},{"name":"Daniel Král͏̌","is_ca":false},{"name":"Jonathan A. Noel","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04692811262755218,"gpt":0.3167237239850764,"spread":0.2697956113575242,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007352168,0.0004224517,0.0004952915,0.001289187,0.001114551,0.001944712,0.00110767,0.0007886487,0.002428786],"category_scores_gemma":[0.005386323,0.0003394874,0.0006387432,0.0005271055,0.004104753,0.004026434,0.002028736,0.001743048,0.0003019897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001165846,"about_ca_system_score_gemma":0.0002755956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004866458,"about_ca_topic_score_gemma":0.0005586008,"domain_scores_codex":[0.9992408,0.0002083442,0.00003037617,0.0002046175,0.0001863659,0.0001294685],"domain_scores_gemma":[0.9964142,0.001861498,0.0004401784,0.0005043509,0.0002838314,0.0004958881],"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.00007604911,0.00002266823,0.001137072,0.000046921,0.000008849333,0.0001094273,0.000291272,0.004681388,0.003338552,0.9854843,0.0005201822,0.004283431],"study_design_scores_gemma":[0.00001233153,0.00002921035,0.0005596229,0.00001538317,0.000006957878,0.0001536365,0.0001352702,0.01750102,0.002397182,0.9771678,0.002009975,0.00001155265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8687887,0.0007146047,0.09852301,0.0009161708,0.00006019713,0.00004024164,0.0001497794,0.0002532475,0.03055402],"genre_scores_gemma":[0.9830041,0.0001949636,0.01117469,0.0001176989,0.00005626761,0.00004562273,0.0001927501,0.00005482376,0.005159067],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002428786,"threshold_uncertainty_score":0.008458912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091504656","doi":"10.1016/s1571-0653(05)80126-x","title":"On i-minus-Edge-Removal-critical graphs","year":2000,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Combinatorics; Mathematics; Corollary; Discrete mathematics; Enhanced Data Rates for GSM Evolution; Graph; Indifference graph; Computer science","authors":[{"name":"E. J. Cockayne","is_ca":true},{"name":"Odile Favaron","is_ca":false},{"name":"Christina M. Mynhardt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0146321788659135,"gpt":0.3085244832909755,"spread":0.293892304425062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003924279,0.0008966817,0.0005973972,0.00238209,0.002411084,0.001768454,0.001181303,0.0009976351,0.007700018],"category_scores_gemma":[0.002227514,0.0004537167,0.0005939014,0.001190383,0.001958292,0.002280884,0.001492785,0.001745112,0.001010785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011077,"about_ca_system_score_gemma":0.0005375791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001205907,"about_ca_topic_score_gemma":0.001463058,"domain_scores_codex":[0.9996889,0.00005863436,0.00001400738,0.00007352707,0.00007114129,0.00009382675],"domain_scores_gemma":[0.9984326,0.0006181281,0.0002834326,0.0001300847,0.0001869125,0.0003489144],"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.0001585273,0.000054171,0.0007741672,0.0001584606,0.00001939883,0.0005938135,0.0004613508,0.003188974,0.005880613,0.971626,0.006539818,0.01054464],"study_design_scores_gemma":[0.00003441064,0.00002093031,0.000485005,0.00003367814,0.00001692217,0.0003335032,0.0002224331,0.005758167,0.002087708,0.986469,0.004524342,0.00001383363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6413188,0.001196946,0.1157163,0.002669625,0.0006077795,0.0001751617,0.0007150869,0.0005208126,0.2370795],"genre_scores_gemma":[0.9543382,0.0009531328,0.01470782,0.0007242206,0.0003101861,0.0001048951,0.0009138168,0.000186325,0.0277613],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007700018,"threshold_uncertainty_score":0.02575916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2174920527","doi":"10.1016/j.endm.2015.06.074","title":"Uniform Linear Embeddings of Spatial Random Graphs","year":2015,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Embedding; Combinatorics; Vertex (graph theory); Random graph; Discrete mathematics; Random regular graph; Space (punctuation); Link (geometry); Graph; Chordal graph; 1-planar graph; Computer science","authors":[{"name":"Huda Chuangpishit","is_ca":true},{"name":"Mahya Ghandehari","is_ca":false},{"name":"Jeannette Janssen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02620108249101816,"gpt":0.304088283036715,"spread":0.2778872005456968,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001193715,0.0009737817,0.0009191445,0.002393085,0.001086047,0.003251453,0.001975797,0.001331542,0.008389382],"category_scores_gemma":[0.01220828,0.0009482811,0.0007109112,0.001480534,0.002835686,0.006314783,0.00320546,0.002191989,0.001066102],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001611008,"about_ca_system_score_gemma":0.0005256462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001498126,"about_ca_topic_score_gemma":0.001374254,"domain_scores_codex":[0.9984857,0.0005847247,0.00006349799,0.0003161536,0.0003254281,0.000224523],"domain_scores_gemma":[0.9894418,0.006000975,0.001610767,0.0009575863,0.0009287974,0.001060139],"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.0000705763,0.00003423079,0.0004232935,0.00005753759,0.00001243507,0.00006958417,0.0002005318,0.00595304,0.0005815896,0.9870986,0.00129003,0.004208568],"study_design_scores_gemma":[0.00002544879,0.00002254595,0.0003979301,0.00002138993,0.00000978731,0.0001060572,0.0001327321,0.04172578,0.0004276677,0.9556674,0.001444536,0.00001863694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5824192,0.001510298,0.3549028,0.003308355,0.0002348703,0.0001245778,0.001266904,0.000894919,0.05533808],"genre_scores_gemma":[0.9527614,0.001013341,0.02046124,0.0005924447,0.0003346116,0.0001815402,0.0008966707,0.0002841399,0.02347463],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008389382,"threshold_uncertainty_score":0.02806526,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2766373705","doi":"10.1016/j.endm.2017.06.052","title":"Bijections for walks ending on an axis, using open arc diagrams","year":2017,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Advanced Combinatorial Mathematics","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Bijection, injection and surjection; Arc (geometry); Mathematics; Diagram; Combinatorics; Geometry; Statistics; Bijection","authors":[{"name":"Julien Courtiel","is_ca":false},{"name":"Éric Fusy","is_ca":false},{"name":"Mathias Lepoutre","is_ca":false},{"name":"Marni Misna","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1159477140908383,"gpt":0.4306093496288502,"spread":0.3146616355380119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001039871,0.0008255005,0.0005830948,0.003895326,0.002554433,0.004401774,0.001431095,0.001482132,0.008697806],"category_scores_gemma":[0.004994207,0.0006936802,0.001212442,0.002272,0.00172927,0.006648255,0.002993509,0.002801018,0.002150466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006585945,"about_ca_system_score_gemma":0.0004648155,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005126176,"about_ca_topic_score_gemma":0.0007161777,"domain_scores_codex":[0.9987626,0.0003051084,0.000107288,0.0002811622,0.0003500408,0.0001938178],"domain_scores_gemma":[0.9977392,0.001134193,0.0002046267,0.0002600935,0.000347255,0.0003146276],"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.00004567977,0.00005721997,0.0001232061,0.00006104735,0.000007946081,0.0001092434,0.000464821,0.0009801518,0.001524,0.9792122,0.001236788,0.01617766],"study_design_scores_gemma":[0.00001866793,0.00002797698,0.0001168615,0.00004109199,0.00001900407,0.0002019163,0.0002285189,0.005412909,0.001441989,0.9794009,0.01306408,0.00002602083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1866256,0.001374531,0.6789919,0.0006922962,0.001321692,0.0002128664,0.0004678855,0.001122585,0.1291907],"genre_scores_gemma":[0.7336094,0.002147356,0.202948,0.0005907894,0.0006264939,0.0005074437,0.0007807647,0.001412179,0.05737761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008697806,"threshold_uncertainty_score":0.02909708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999588824","doi":"10.1016/j.endm.2011.09.046","title":"Asymptotically settling Zarankiewiczʼs Conjecture in finite time, for each m","year":2011,"lang":"en","type":"article","venue":"Electronic Notes in Discrete Mathematics","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Conjecture; Mathematics; Combinatorics; Counterexample; Bipartite graph; Integer (computer science); Discrete mathematics; Graph","authors":[{"name":"Robin Christian","is_ca":true},{"name":"R. Bruce Richter","is_ca":true},{"name":"Gelasio Salazar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01887409142288788,"gpt":0.2531518820936597,"spread":0.2342777906707719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002592413,0.001125851,0.00223024,0.001014599,0.00357218,0.006395868,0.002904869,0.003748817,0.01663796],"category_scores_gemma":[0.03642796,0.000804425,0.001231378,0.001101465,0.003971485,0.008837768,0.004573046,0.003981843,0.001410682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002802131,"about_ca_system_score_gemma":0.003386755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003302868,"about_ca_topic_score_gemma":0.004321669,"domain_scores_codex":[0.9980698,0.0003904181,0.00009338267,0.0005817548,0.0003491048,0.0005155525],"domain_scores_gemma":[0.9796728,0.01541688,0.001178615,0.001839768,0.0008857752,0.001006116],"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.002376878,0.000253772,0.00468558,0.001023844,0.0001796536,0.0003972471,0.0008839996,0.07549109,0.008058444,0.8509312,0.02998933,0.02572901],"study_design_scores_gemma":[0.0001801457,0.000102632,0.0009614218,0.00005841485,0.0000502758,0.000134442,0.0003285622,0.1728997,0.00167482,0.8199668,0.003604548,0.00003820807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5718945,0.002627529,0.2722306,0.0279751,0.00139312,0.0002114037,0.002664275,0.003132547,0.1178709],"genre_scores_gemma":[0.9524094,0.0005467781,0.02930388,0.001340691,0.0004677999,0.0002070249,0.001329818,0.0003319923,0.01406259],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01663796,"threshold_uncertainty_score":0.05565947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}