{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004742167,0.0002310964,0.0002568953,0.00005732853,0.0001103683,0.00005755651,0.0003011953,0.00008391785,0.00005445261],"category_scores_gemma":[0.0001246798,0.0001733999,0.00007976206,0.0002476003,0.0001021341,0.00008247713,0.00001908194,0.000284607,0.0000206627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001528011,"about_ca_system_score_gemma":0.00007271699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008320535,"about_ca_topic_score_gemma":0.0005694572,"domain_scores_codex":[0.9985171,0.00001715135,0.0004502464,0.0001671721,0.0001640723,0.0006842685],"domain_scores_gemma":[0.9988935,0.0006162055,0.00006097343,0.0003317454,0.00004553168,0.00005204414],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006077987,0.00009507774,0.0008014219,0.001036009,0.0004308318,0.000005549822,0.02463622,0.01973053,0.009255997,0.9330962,0.001687864,0.009163562],"study_design_scores_gemma":[0.001340778,0.0002517356,0.00008660847,0.00021468,0.0001344958,0.00000854357,0.0005707031,0.6951576,0.02999051,0.269077,0.002557661,0.0006097113],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02929953,0.000729854,0.9659397,0.0001710415,0.0001730831,0.0006191068,0.00002212556,0.0003148002,0.002730761],"genre_scores_gemma":[0.9671277,0.0000492997,0.03207424,0.0000357613,0.0002766864,0.00005094748,0.00001724584,0.00007232599,0.0002958086],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9378282,"threshold_uncertainty_score":0.7071044,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001940013,0.0001307786,0.000163268,0.00005270454,0.0000630549,0.00003112587,0.00008024903,0.00009049869,0.000003561104],"category_scores_gemma":[0.000221354,0.0001264936,0.00001562962,0.0001283295,0.0001306942,0.0001183319,0.00005942599,0.0001464997,0.000001961399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001174063,"about_ca_system_score_gemma":0.00001210843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002498955,"about_ca_topic_score_gemma":0.0000448155,"domain_scores_codex":[0.9991372,0.000004494448,0.0001922553,0.0001540208,0.00006544052,0.0004466156],"domain_scores_gemma":[0.9996543,0.0001340581,0.00002929224,0.0001425118,0.00001517516,0.00002468843],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005794262,0.00007747737,0.000419212,0.0009804537,0.0001280611,0.000001838448,0.001988548,0.02028193,0.01769406,0.8044628,0.0001015198,0.1538061],"study_design_scores_gemma":[0.0002048138,0.000137674,0.00006426698,0.00006098062,0.00001186137,0.000006449626,0.00005393998,0.8404213,0.008891921,0.1499275,0.000073024,0.0001462727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.215007,0.0005730519,0.7834391,0.0002372412,0.00003048575,0.0002410752,0.000001567636,0.0002272899,0.0002432437],"genre_scores_gemma":[0.7550951,0.0001584151,0.2446267,0.000005525997,0.00005018334,0.00002801489,0.000002591283,0.00002330535,0.00001010355],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8201393,"threshold_uncertainty_score":0.5158257,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001528899,0.0002385819,0.0002228515,0.00005747984,0.00009794215,0.00009695294,0.0002130777,0.00006921849,0.0000390176],"category_scores_gemma":[0.0001008451,0.0001588577,0.00004557702,0.0001353458,0.00006452164,0.0001675061,0.00002316942,0.0002587985,0.00001260302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002231994,"about_ca_system_score_gemma":0.00003785324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001240982,"about_ca_topic_score_gemma":0.0001406043,"domain_scores_codex":[0.998771,0.00001100308,0.0002987673,0.0001764658,0.0001537751,0.0005890161],"domain_scores_gemma":[0.9989604,0.0005480939,0.00007508832,0.0003332461,0.00004313532,0.00004000129],"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.00002064752,0.00007313646,0.00006068144,0.0003402129,0.0001049777,0.000001281792,0.001040572,0.9756598,0.000333433,0.01535814,0.000255387,0.006751771],"study_design_scores_gemma":[0.0007450125,0.000302061,0.00009826141,0.0002126059,0.00007372168,0.000007130001,0.0003284202,0.9514019,0.00217325,0.04387654,0.000336711,0.000444401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01986941,0.000537555,0.9768585,0.0001736528,0.00007142661,0.001058014,0.000003885273,0.0001643433,0.00126319],"genre_scores_gemma":[0.9141214,0.00006564805,0.08500567,0.00001552896,0.00005246847,0.0004193099,0.0000142793,0.00007266874,0.0002330642],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8942519,"threshold_uncertainty_score":0.6478029,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004471433,0.0002122531,0.0002424331,0.0001873077,0.00005129619,0.0002989773,0.001208633,0.00007243346,0.00001579849],"category_scores_gemma":[0.0002846789,0.0001940772,0.00007623956,0.0005511764,0.000127365,0.0008975192,0.0002514766,0.0002693633,0.00004986075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001454408,"about_ca_system_score_gemma":0.0001671864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000410625,"about_ca_topic_score_gemma":0.00004927232,"domain_scores_codex":[0.9983083,0.00002456127,0.0003906459,0.0003385142,0.0002785222,0.0006594326],"domain_scores_gemma":[0.9988669,0.0002231999,0.0001276876,0.0006704609,0.00004858768,0.00006313998],"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.000002749146,0.000200437,0.0001053787,0.00007024292,0.00001808405,0.00001185181,0.0008508584,0.00002851545,0.001398127,0.7981377,0.00015608,0.19902],"study_design_scores_gemma":[0.000371968,0.0001257447,0.00004626869,0.0001491776,0.00000796747,0.00008580123,0.00001855773,0.1094556,0.04821079,0.8398911,0.001159723,0.00047734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008078012,0.0004615842,0.972645,0.00132298,0.00002458459,0.0002084141,0.000001450943,0.0006320454,0.01662587],"genre_scores_gemma":[0.6194386,0.00001849095,0.38026,0.0001295101,0.00001914829,0.00002126443,0.000001381914,0.00001475674,0.00009686079],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6113605,"threshold_uncertainty_score":0.7914238,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000354081,0.0001893056,0.0001597363,0.0000383496,0.00006867506,0.00003014324,0.0003031338,0.0000852638,0.000051057],"category_scores_gemma":[0.0003022982,0.0001048803,0.00007472235,0.000124291,0.00007331786,0.000002609224,0.00005052334,0.0001850806,0.0000392319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004212929,"about_ca_system_score_gemma":0.00007684647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003658915,"about_ca_topic_score_gemma":0.0000210248,"domain_scores_codex":[0.9988402,0.00006154357,0.0002200459,0.0002539689,0.0001706509,0.0004536421],"domain_scores_gemma":[0.9993196,0.00007466615,0.00007725046,0.0004670476,0.00002874027,0.0000327244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003355582,0.001333643,0.0005817594,0.0001446936,0.0003580528,0.00002243798,0.002116587,0.0005286176,0.7758693,0.1981078,0.004712037,0.01588957],"study_design_scores_gemma":[0.003321322,0.00515101,0.001691599,0.0003287967,0.0001139671,0.00009636401,0.0008006498,0.008174038,0.5700982,0.3878146,0.02059396,0.001815578],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9791175,0.0007781969,0.008137813,0.003870594,0.00004877774,0.0008882445,0.000007220558,0.00003133414,0.007120349],"genre_scores_gemma":[0.9974248,0.0001426723,0.0009590374,0.0004505856,0.00006207602,0.00003450054,0.00002042221,0.00002089671,0.0008849581],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2057711,"threshold_uncertainty_score":0.4276893,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001700158,0.0006639301,0.001473647,0.0005775193,0.0001560957,0.0000508314,0.0007814736,0.0004610046,0.0001241082],"category_scores_gemma":[0.0009096933,0.000635827,0.0003616473,0.001229966,0.0007010029,0.0001948201,0.000175245,0.0009044903,0.000008398875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001073152,"about_ca_system_score_gemma":0.000225872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002147847,"about_ca_topic_score_gemma":0.00007432753,"domain_scores_codex":[0.9955457,0.0002551683,0.001942977,0.0005861706,0.0006324957,0.001037443],"domain_scores_gemma":[0.9953274,0.001719163,0.001260103,0.001349199,0.0001879835,0.000156122],"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.0001388094,0.001462283,0.001843361,0.001695015,0.0002501378,0.000002614865,0.006110667,0.00007207365,0.006080598,0.9790674,0.00004555708,0.003231524],"study_design_scores_gemma":[0.001521733,0.0005595207,0.00180427,0.0009545948,0.0003050914,0.0000217628,0.001012147,0.005460144,0.01926647,0.9685145,0.00002633564,0.0005534439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9682819,0.00268854,0.02467372,0.0004460276,0.00006516881,0.001467985,0.0000780883,0.00007966772,0.002218957],"genre_scores_gemma":[0.9923853,0.0007038121,0.006541885,0.00003684461,0.00004103049,0.00004244551,0.00001684296,0.0000799044,0.0001519474],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02410344,"threshold_uncertainty_score":0.9996093,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009019467,0.0001410603,0.0002376514,0.0001142513,0.00002417352,0.00001348441,0.0001666623,0.00009476206,0.0001273775],"category_scores_gemma":[0.0002640376,0.0001423633,0.00003613869,0.0004945876,0.00002604401,0.0001723064,0.00003865318,0.0002212725,0.00001302651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001383672,"about_ca_system_score_gemma":0.00004083605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005353246,"about_ca_topic_score_gemma":0.000001948392,"domain_scores_codex":[0.9986812,0.0000660721,0.0003902516,0.00009397574,0.0001997391,0.0005687544],"domain_scores_gemma":[0.9992812,0.0002943104,0.00005422263,0.0002810406,0.00003635844,0.00005284784],"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.000004840912,0.000122821,0.006897697,0.000523985,0.00005806293,2.538875e-7,0.002382954,0.7920881,0.005257353,0.1906032,0.0000231087,0.002037621],"study_design_scores_gemma":[0.0003106295,0.00003046305,0.0003949987,0.00008369557,0.0000219526,0.0000051176,0.00008181886,0.9692826,0.01706877,0.01244424,0.00006452931,0.0002111902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05807973,0.0006539834,0.9370629,0.00001885497,0.00007233446,0.0001883424,0.000003010793,0.0001282967,0.003792548],"genre_scores_gemma":[0.8018292,0.00008499323,0.1979357,0.000006623739,0.0000445533,0.00001179916,0.000009972886,0.00004390175,0.00003322864],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7437495,"threshold_uncertainty_score":0.5805408,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005241715,0.001732558,0.0008526125,0.0007521252,0.00375229,0.002681725,0.006112374,0.003818986,0.3108026],"category_scores_gemma":[0.006664936,0.002804066,0.003331394,0.001353796,0.004332877,0.00188925,0.004509699,0.003940473,0.001404899],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005704892,"about_ca_system_score_gemma":0.002686753,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00100754,"about_ca_topic_score_gemma":0.002667526,"domain_scores_codex":[0.9838874,0.0007460262,0.003732071,0.002535465,0.004273519,0.004825457],"domain_scores_gemma":[0.9820335,0.005382974,0.004851809,0.006135985,0.0003338011,0.001261931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001467283,0.0004772236,0.00002396479,0.002866532,0.00307013,0.0008065266,0.005394393,0.001022689,0.001450753,0.8268029,0.154396,0.00222156],"study_design_scores_gemma":[0.003060237,0.002178337,0.00008759742,0.002967451,0.002995797,0.001645743,0.003149454,0.1088318,0.8591136,0.01008962,0.003088036,0.002792297],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4694226,0.003422719,0.001903691,0.0008324996,0.002821314,0.0001238133,0.000485392,0.0002876297,0.5207004],"genre_scores_gemma":[0.9827391,0.003930768,0.005415565,0.001052194,0.002502586,0.001396063,0.0006784422,0.0015112,0.0007740745],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8576629,"threshold_uncertainty_score":0.9995421,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064296,0.0002557133,0.0002934982,0.0001978185,0.0001291696,0.000106285,0.001384245,0.00006890397,0.00005640434],"category_scores_gemma":[0.0001296969,0.0001935542,0.00007990671,0.001058257,0.0002650743,0.0004940457,0.0002667966,0.0004923512,0.00005696527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001034926,"about_ca_system_score_gemma":0.0001927401,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002912465,"about_ca_topic_score_gemma":0.0001002561,"domain_scores_codex":[0.9976768,0.00009996189,0.0003081603,0.0004470499,0.0004167043,0.001051247],"domain_scores_gemma":[0.9983869,0.0002939704,0.0001093564,0.001053215,0.00004855727,0.0001080034],"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.00003475569,0.0001352555,0.001880689,0.00004316363,0.00003404623,0.00003601985,0.003259549,0.00005968023,0.0003446951,0.991127,0.000004373109,0.003040809],"study_design_scores_gemma":[0.0005612043,0.0006666633,0.0006834347,0.00007841389,0.00000874439,0.00008513323,0.00006586941,0.02831583,0.01014663,0.9589564,0.00004273657,0.0003889098],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3166748,0.0003087182,0.6782274,0.0001198944,0.00003763677,0.0003966018,0.000001301537,0.0002042199,0.004029455],"genre_scores_gemma":[0.8362359,0.00002172263,0.1635369,0.00004118216,0.000008847383,0.00004525491,0.000001081476,0.00003046521,0.00007864309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5195612,"threshold_uncertainty_score":0.7892913,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001488196,0.0006093738,0.0009773333,0.0003858328,0.0002164652,0.0004760705,0.001558055,0.00027328,0.0004311581],"category_scores_gemma":[0.0008436951,0.0005380407,0.0002228239,0.001556076,0.001076581,0.001060023,0.0008982749,0.001119758,0.000293138],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001955009,"about_ca_system_score_gemma":0.0005014905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001853492,"about_ca_topic_score_gemma":0.0001736981,"domain_scores_codex":[0.9949525,0.0004039796,0.001082579,0.0009137372,0.0008445708,0.001802623],"domain_scores_gemma":[0.9960911,0.001553895,0.0002699675,0.001552973,0.0002525421,0.0002794849],"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.00006896924,0.0007572745,0.007240372,0.001781874,0.0003155866,0.00002694566,0.009910725,0.000580748,0.02282015,0.9452093,0.000174926,0.01111308],"study_design_scores_gemma":[0.001868827,0.00143691,0.001555142,0.0009196403,0.00006581064,0.00009200981,0.0005126173,0.3161983,0.0195902,0.6563354,0.0002706609,0.001154484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9347181,0.005622597,0.05568738,0.0007306567,0.0001337658,0.001662536,0.00001848439,0.00008268929,0.001343824],"genre_scores_gemma":[0.9723322,0.0008821475,0.02603253,0.00006694326,0.00003399195,0.0001095743,0.000003990408,0.00008127269,0.0004573244],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3156176,"threshold_uncertainty_score":0.9997071,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006704743,0.0002251827,0.0002980384,0.000301372,0.00007325279,0.0001158823,0.001549799,0.00007672629,0.00002370256],"category_scores_gemma":[0.0003512294,0.0001971177,0.0001192358,0.001093275,0.00008206213,0.0004566948,0.0002060126,0.0005124811,0.00004996837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001457493,"about_ca_system_score_gemma":0.00008962976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003202748,"about_ca_topic_score_gemma":0.00002809882,"domain_scores_codex":[0.9977346,0.00009477762,0.0004102518,0.0004063754,0.0004059953,0.0009480051],"domain_scores_gemma":[0.9984169,0.00038697,0.0001067948,0.0009473289,0.00004800809,0.00009401124],"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.00001104348,0.0001379182,0.0000908421,0.00002389013,0.00001086594,0.00001698886,0.0009087167,0.0001325326,0.001259916,0.9724764,0.00002347854,0.02490747],"study_design_scores_gemma":[0.00038488,0.0003333146,0.0004163238,0.00006236167,0.000004105719,0.00002825646,0.00003989605,0.04804884,0.005365784,0.9448841,0.000169316,0.0002628282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06202518,0.0005839064,0.9329088,0.001225971,0.0000580367,0.000345457,0.000001344804,0.0002493185,0.002601955],"genre_scores_gemma":[0.9467075,0.00004478979,0.05289229,0.0001531319,0.00002387114,0.00001713328,0.000002341259,0.00001547674,0.0001434388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8846824,"threshold_uncertainty_score":0.8038228,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001103458,0.0002698406,0.0003267872,0.0002246319,0.0001271174,0.0001833685,0.001218159,0.00009154851,0.00002043373],"category_scores_gemma":[0.0001198145,0.0002250287,0.00007359749,0.0007294083,0.00004425202,0.000340429,0.0005620933,0.0003151452,0.00009323099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001878569,"about_ca_system_score_gemma":0.0001082596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005499421,"about_ca_topic_score_gemma":0.0001373791,"domain_scores_codex":[0.9975274,0.00003984029,0.0004932302,0.0004944437,0.0004385986,0.001006441],"domain_scores_gemma":[0.9984522,0.0002834596,0.000122361,0.0009107453,0.00005832403,0.0001728563],"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.00002095963,0.0005140295,0.0001971362,0.0001215857,0.00007261943,0.00009873551,0.006426586,0.001160722,0.007410943,0.250176,0.00112378,0.7326769],"study_design_scores_gemma":[0.0009128785,0.0004706321,0.0004912667,0.000287663,0.0000188298,0.0001007715,0.0001903535,0.8375095,0.04283382,0.1097888,0.006295146,0.001100338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01664731,0.0003282252,0.9815891,0.0003509913,0.000186056,0.0002977345,0.00001143539,0.0001463833,0.0004427816],"genre_scores_gemma":[0.1516299,0.00004195601,0.8476004,0.0002680306,0.000182231,0.00002592718,0.00001621499,0.00003178088,0.0002035074],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8363488,"threshold_uncertainty_score":0.9176404,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003277413,0.0001748918,0.0003899959,0.000110553,0.0001977684,0.0001213992,0.0008932535,0.00008820347,0.003049267],"category_scores_gemma":[0.006744141,0.0001082653,0.0001804463,0.001195865,0.0003863859,0.0001505179,0.00005389078,0.0003644162,0.000415897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005791998,"about_ca_system_score_gemma":0.000104958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000323194,"about_ca_topic_score_gemma":0.00005654363,"domain_scores_codex":[0.9969814,0.0002027878,0.0008942774,0.000300816,0.0009751466,0.0006455052],"domain_scores_gemma":[0.9921855,0.006743626,0.0001511955,0.0007772512,0.00007869318,0.00006370394],"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.00005168022,0.001600526,0.006965601,0.0002130445,0.0002201316,0.000007350528,0.01569243,0.004700354,0.002366012,0.9400623,0.00531057,0.02280998],"study_design_scores_gemma":[0.0002645508,0.0000551335,0.0002951651,0.0000918405,0.00005329661,0.00002660996,0.000487365,0.05032813,0.001839819,0.945773,0.0005862893,0.0001987775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9482296,0.0007121553,0.03633823,0.003027126,0.0001065014,0.0002824485,0.00002756006,0.00006101991,0.01121543],"genre_scores_gemma":[0.9921303,0.00003532314,0.006918164,0.00005674646,0.0000226857,0.00001907922,0.000002933209,0.00001871978,0.0007960119],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04562778,"threshold_uncertainty_score":0.9978621,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000957509,0.0004610044,0.0006486703,0.0007927152,0.00009902923,0.0002492355,0.001455539,0.0001777043,0.00001324167],"category_scores_gemma":[0.0002157034,0.0004505042,0.0002145373,0.001660259,0.0003171897,0.002613727,0.0006078718,0.0004917788,0.000008803993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005311829,"about_ca_system_score_gemma":0.0002937097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007088524,"about_ca_topic_score_gemma":0.0001071108,"domain_scores_codex":[0.9964362,0.0001145693,0.001137896,0.0007009811,0.0005226354,0.001087743],"domain_scores_gemma":[0.9980009,0.0002731581,0.0005027488,0.0009987493,0.000118358,0.0001061292],"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.0001692766,0.003656919,0.01393938,0.002964344,0.0005053576,0.00022858,0.0101423,0.007429169,0.08288106,0.3874995,0.0004576921,0.4901264],"study_design_scores_gemma":[0.0006589774,0.0002532315,0.0006595579,0.0007744887,0.00002973963,0.00007457846,0.00007852894,0.718864,0.05379086,0.2239976,0.00008710433,0.0007313382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05462144,0.0026105,0.9408397,0.0004200871,0.0000675383,0.0004711128,0.00001625252,0.0003010921,0.0006522482],"genre_scores_gemma":[0.5304701,0.0000877575,0.4692695,0.00003238097,0.00003681382,0.00003375871,0.000008395337,0.00003358212,0.0000276401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7114348,"threshold_uncertainty_score":0.9997947,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340256,0.0002142716,0.0003573807,0.000161274,0.00007177505,0.00009497662,0.0007085871,0.00007642625,0.00003780582],"category_scores_gemma":[0.0002853315,0.0001562045,0.00004280224,0.0008816878,0.0004293817,0.000426802,0.0002419368,0.0003895145,0.000005989411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000663907,"about_ca_system_score_gemma":0.0001540934,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000342149,"about_ca_topic_score_gemma":0.0001181164,"domain_scores_codex":[0.9981704,0.00009607436,0.0003530197,0.0003914307,0.0003636656,0.0006254105],"domain_scores_gemma":[0.9981438,0.0006644498,0.000147751,0.0008393699,0.0001186299,0.00008599771],"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.00001258258,0.0001101695,0.001954016,0.0001745738,0.00003603921,0.00000211419,0.001265781,0.00004818993,0.001228698,0.9910666,0.000007665109,0.00409359],"study_design_scores_gemma":[0.0004999015,0.0003421146,0.0006732734,0.00004290316,0.000005948626,0.00002616272,0.00008567607,0.01001355,0.005939335,0.9821553,0.00002033888,0.000195467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.696555,0.0005129533,0.3007114,0.0007187057,0.00001638716,0.0007348468,0.000003213894,0.0000663514,0.0006811378],"genre_scores_gemma":[0.8955649,0.00004515254,0.104238,0.0000389732,0.00000494799,0.00005872058,0.000001887029,0.00001744383,0.00003001497],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1990098,"threshold_uncertainty_score":0.6369835,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001820894,0.0002700167,0.0003521811,0.000348019,0.0001522897,0.000099335,0.00124934,0.00007324237,0.00001957443],"category_scores_gemma":[0.0002203389,0.0002206548,0.00007178933,0.001127261,0.0001147218,0.0004407214,0.0003377245,0.0005102195,0.00009123299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000239207,"about_ca_system_score_gemma":0.00008558115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007001456,"about_ca_topic_score_gemma":0.0001122397,"domain_scores_codex":[0.9969613,0.00007082454,0.0004755066,0.0004311006,0.0006048104,0.001456483],"domain_scores_gemma":[0.9978663,0.0008512316,0.0001669463,0.0009026737,0.000082315,0.0001304735],"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.00007630022,0.0004319353,0.002006781,0.0002542002,0.00008200894,0.000107768,0.001916668,0.000372293,0.005607753,0.9875229,0.000009649349,0.001611724],"study_design_scores_gemma":[0.002433761,0.0008765745,0.00216727,0.000493678,0.00001934501,0.0001181863,0.0002030249,0.1288958,0.01885138,0.8446696,0.000338256,0.0009331648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2728338,0.0001429499,0.7250887,0.00006178659,0.00004221627,0.0003708632,0.000001264569,0.0001321225,0.001326275],"genre_scores_gemma":[0.8702151,0.00002177745,0.1295397,0.00004210848,0.00002390148,0.00003150833,0.000003417854,0.00003315575,0.00008928896],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5973814,"threshold_uncertainty_score":0.8998039,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007259128,0.0002628801,0.0003540779,0.0001467601,0.00008707152,0.0001864458,0.0007911785,0.0001623029,0.00001342868],"category_scores_gemma":[0.00002453464,0.0002408637,0.00007102725,0.0006792595,0.0000619509,0.0004903635,0.0001225758,0.0003324631,0.00001094837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003125745,"about_ca_system_score_gemma":0.0001788636,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001526265,"about_ca_topic_score_gemma":0.000316494,"domain_scores_codex":[0.997783,0.0001070957,0.0005871879,0.0004300646,0.0002212828,0.0008713373],"domain_scores_gemma":[0.9983529,0.0007858757,0.0001976748,0.0004971174,0.00009007955,0.0000763799],"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.00003999625,0.0003658958,0.0002922154,0.0004243751,0.00004802562,0.000004628363,0.001930841,0.6300889,0.0001365095,0.262326,0.0003809424,0.1039617],"study_design_scores_gemma":[0.0005208413,0.0001684554,0.00007280012,0.0002509748,0.000004151124,0.000005728605,0.00003132517,0.7556869,0.0002339656,0.2427756,0.00001981784,0.0002293286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001893299,0.000149226,0.9889328,0.0008138364,0.00003359318,0.008002238,6.624611e-7,0.00008313899,0.00009117295],"genre_scores_gemma":[0.8590217,0.00001928011,0.1323697,0.0001198244,0.00005210716,0.008348127,0.00001148319,0.00003132581,0.00002642986],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8571284,"threshold_uncertainty_score":0.9822136,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552392,0.0002468994,0.0003035638,0.0002663517,0.0001160649,0.000119,0.001557378,0.00007852217,0.0002408627],"category_scores_gemma":[0.0003410904,0.0002187803,0.00008673295,0.0009977061,0.00008372924,0.000224894,0.0001832596,0.0004463014,0.0007334883],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002258503,"about_ca_system_score_gemma":0.0001026323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003603551,"about_ca_topic_score_gemma":0.00002721686,"domain_scores_codex":[0.9975301,0.0001063887,0.0003592542,0.000495348,0.0004886352,0.001020297],"domain_scores_gemma":[0.9978992,0.0007685572,0.00005741381,0.001092712,0.00003322602,0.0001488998],"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.00003254673,0.0001634975,0.00001441496,0.00001994377,0.00001433266,0.00002008064,0.0009819635,0.002758629,0.0005515832,0.960539,0.00006975918,0.03483418],"study_design_scores_gemma":[0.0003775289,0.0004342205,0.00009398394,0.000083411,0.000003141693,0.00001735456,0.00001681957,0.02077542,0.006456917,0.9709636,0.0004708938,0.0003067177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4569794,0.0002140104,0.5301382,0.001873264,0.00007630808,0.000861394,0.000005442686,0.0002878115,0.009564175],"genre_scores_gemma":[0.9448282,0.0000358154,0.05365771,0.0003354138,0.00003144616,0.00009819854,0.000001922272,0.00003613556,0.0009752367],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4878487,"threshold_uncertainty_score":0.9427753,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008697998,0.0001763732,0.0002413931,0.0004168847,0.0000506562,0.00005261185,0.0008729325,0.00007738972,0.00003628694],"category_scores_gemma":[0.0002878619,0.0001650962,0.00005442101,0.001269664,0.00006881198,0.0004831278,0.0001324075,0.0003824098,0.000204898],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001988636,"about_ca_system_score_gemma":0.00009527342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004809479,"about_ca_topic_score_gemma":0.0001207445,"domain_scores_codex":[0.9980156,0.0001036909,0.0004259666,0.0003453883,0.0003427005,0.0007666196],"domain_scores_gemma":[0.9987839,0.0004057692,0.00009523499,0.0006215448,0.0000309712,0.00006253823],"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.00002276691,0.0003210514,0.000774746,0.00006580696,0.00001991748,0.00001774588,0.002454947,0.0156283,0.004405749,0.963281,0.00005632831,0.01295161],"study_design_scores_gemma":[0.0003934714,0.0000812975,0.000095283,0.00005679179,0.000002001413,0.00000983354,0.00001293781,0.4329071,0.005038403,0.5608951,0.0002962204,0.0002115518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08289341,0.0004073743,0.9141352,0.001168525,0.00003194621,0.0003934051,0.000002135176,0.0001432735,0.0008247722],"genre_scores_gemma":[0.858732,0.00008893878,0.1406274,0.00009846296,0.00005270397,0.00004899523,0.000008557621,0.00003143818,0.0003115373],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7758386,"threshold_uncertainty_score":0.6732428,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498226,0.0001622941,0.0001847844,0.0001971064,0.0001637751,0.00006484544,0.0004318476,0.00004204573,0.000007902167],"category_scores_gemma":[0.00006070024,0.000134412,0.00004672459,0.0006384811,0.00005014962,0.0003310558,0.00006476947,0.0001983308,0.00001464888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008766134,"about_ca_system_score_gemma":0.0001578607,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001204024,"about_ca_topic_score_gemma":0.00003526258,"domain_scores_codex":[0.9986769,0.00002937735,0.0002573819,0.000284894,0.0003479991,0.0004034331],"domain_scores_gemma":[0.9992504,0.0002212049,0.0001036429,0.0003279559,0.00004455441,0.00005226705],"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.0000278003,0.0004198798,0.002205065,0.0001504568,0.0001140029,0.0001285716,0.01057634,0.04585697,0.003636086,0.9264212,0.0003573135,0.0101063],"study_design_scores_gemma":[0.0018152,0.0008926919,0.004342228,0.0003064975,0.00003505222,0.0009339722,0.0001288011,0.3778452,0.04284025,0.5683696,0.001232791,0.001257742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2524575,0.0002441791,0.7463034,0.0004541466,0.00004363238,0.0001364807,7.182817e-7,0.00007367382,0.0002863426],"genre_scores_gemma":[0.8958277,0.0000518103,0.1038439,0.00009960876,0.00005249896,0.00001907026,0.000008081533,0.00001171277,0.00008563906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6433703,"threshold_uncertainty_score":0.548116,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002824017,0.0001521589,0.0001392788,0.0001016883,0.0003330336,0.0001353787,0.000372981,0.00003821191,0.00007408361],"category_scores_gemma":[0.000407206,0.00009535534,0.00006130755,0.0004294451,0.00003857994,0.0004023629,0.0001147932,0.0002135985,0.00005052215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007705643,"about_ca_system_score_gemma":0.00002283449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003701985,"about_ca_topic_score_gemma":0.004684142,"domain_scores_codex":[0.9983217,0.00002207399,0.0004352446,0.0001453551,0.0002264623,0.0008491501],"domain_scores_gemma":[0.9992431,0.0003065637,0.0001046014,0.0003079113,0.00003003084,0.000007783566],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001343309,0.000412393,0.004188083,0.0008161191,0.00005862826,5.494679e-7,0.005897866,0.02388888,0.0002334837,0.9530602,0.001873075,0.009557324],"study_design_scores_gemma":[0.0007367174,0.00002455439,0.001360225,0.000106487,0.0001061024,0.000001419239,0.006734493,0.8771698,0.00004159031,0.08882995,0.024459,0.0004296503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4967731,0.00388578,0.3903963,0.08222871,0.001277578,0.009690798,0.00002448101,0.0003566673,0.01536661],"genre_scores_gemma":[0.9954647,0.00002390039,0.002529978,0.0009603919,0.0004898469,0.0003903554,0.00003489426,0.00001875664,0.0000872212],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8642302,"threshold_uncertainty_score":0.3888478,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007434876,0.0002167359,0.0003144696,0.0005303039,0.00008860363,0.00004507244,0.001244065,0.00008685427,0.00001620754],"category_scores_gemma":[0.0005193391,0.0001999923,0.00008581149,0.001904408,0.00017095,0.0004330385,0.0003054283,0.0006022013,0.00004128106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001960636,"about_ca_system_score_gemma":0.0001431756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001523175,"about_ca_topic_score_gemma":0.0001285314,"domain_scores_codex":[0.9975628,0.0001135618,0.0004469557,0.00042448,0.0004341234,0.001018083],"domain_scores_gemma":[0.9982378,0.0006920934,0.0001052004,0.0008465913,0.00004197528,0.00007636127],"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.00001266964,0.0001913847,0.004981273,0.00004841806,0.00001312788,0.00008367238,0.003371429,0.000352443,0.001128871,0.9874489,0.0000159097,0.002351847],"study_design_scores_gemma":[0.0005767841,0.0001310075,0.001713793,0.00007998279,0.000001650056,0.00008279048,0.00004177645,0.04267127,0.004400754,0.949913,0.00008804729,0.0002991009],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6037862,0.0005000606,0.3928737,0.0005182568,0.00004799515,0.0004250384,0.000001220395,0.0001689194,0.001678621],"genre_scores_gemma":[0.9597641,0.0002281728,0.0397692,0.00006018952,0.00001069837,0.00004674341,0.00000203791,0.00002505238,0.00009382441],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3559779,"threshold_uncertainty_score":0.8155451,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002192728,0.0001939742,0.000187894,0.00006302523,0.00004322073,0.00004339761,0.0002798398,0.0001113541,0.0002076631],"category_scores_gemma":[0.0001360946,0.0001798044,0.00007890524,0.0001395581,0.00005102666,0.000007300444,0.000134626,0.0001589874,0.000161733],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000536785,"about_ca_system_score_gemma":0.00005889542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000274135,"about_ca_topic_score_gemma":0.00007192483,"domain_scores_codex":[0.9986336,0.00003014088,0.0002873246,0.0002864797,0.000160429,0.0006020773],"domain_scores_gemma":[0.9993405,0.00002826572,0.00008535063,0.0004485276,0.00004096925,0.00005639935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001931632,0.0003876371,0.006113635,0.0003498167,0.0002989448,0.000007178313,0.0009987387,0.0004182238,0.9583641,0.007043008,0.001099531,0.02489987],"study_design_scores_gemma":[0.007742696,0.00300345,0.01676111,0.0006028488,0.0002418606,0.0002356398,0.002043393,0.04794812,0.6281511,0.2410503,0.04700255,0.005216934],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9709677,0.001180873,0.02432843,0.0003156956,0.00006996936,0.0005859737,0.00000329294,0.00003033955,0.002517738],"genre_scores_gemma":[0.9895584,0.0001827629,0.008985767,0.00008766664,0.0001381103,0.0001095035,0.00004394846,0.00004463604,0.0008492279],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.330213,"threshold_uncertainty_score":0.733221,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005605781,0.0002141436,0.0002238162,0.0001373214,0.0001664005,0.0001377536,0.0006978402,0.00009605142,0.0000311194],"category_scores_gemma":[0.0001046834,0.000183211,0.00005815525,0.00100693,0.00004496464,0.0001598718,0.0003133391,0.0002209406,0.00006655172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001504397,"about_ca_system_score_gemma":0.0001306345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004594478,"about_ca_topic_score_gemma":0.0001892896,"domain_scores_codex":[0.9981018,0.0000535802,0.0003631552,0.0004240849,0.0003383258,0.0007191124],"domain_scores_gemma":[0.9986882,0.0003038026,0.0001486019,0.000696896,0.00009532148,0.00006723779],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002342439,0.0002426102,0.0001618717,0.00008233068,0.00003785258,0.000005763696,0.002800881,0.006045735,0.0005289636,0.9283751,0.0002262091,0.06146921],"study_design_scores_gemma":[0.0002925078,0.0002500655,0.00008363033,0.0001198305,0.000008890829,0.00001233604,0.00002909401,0.8957012,0.001280934,0.1005508,0.00141915,0.0002515767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03228223,0.0003602036,0.9652067,0.0006083779,0.0002478459,0.0001583324,5.927777e-7,0.0002471409,0.0008885108],"genre_scores_gemma":[0.9662454,0.00001596255,0.03276618,0.0005935805,0.0002157332,0.00003694461,0.000004106987,0.00002676249,0.0000953022],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9339632,"threshold_uncertainty_score":0.7471128,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005789347,0.0001544267,0.0001811594,0.0001659469,0.00007060989,0.00007466564,0.0006452432,0.0000503975,0.00002037823],"category_scores_gemma":[0.0004059504,0.0001316343,0.00003657396,0.0003691156,0.0000898487,0.0002856325,0.0002291917,0.0003491206,0.0000662319],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001236369,"about_ca_system_score_gemma":0.00005162527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001509007,"about_ca_topic_score_gemma":0.000034949,"domain_scores_codex":[0.9984956,0.00005410148,0.0002279968,0.0003193686,0.0002933738,0.0006095521],"domain_scores_gemma":[0.9985475,0.0007163451,0.00005709676,0.0005883499,0.00002027853,0.00007045511],"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.000005568817,0.00005656974,0.00003735814,0.00001941226,0.00000650837,0.000003201732,0.0006217865,0.0003689263,0.0004065567,0.980243,0.00002074149,0.01821032],"study_design_scores_gemma":[0.0002606642,0.0001425731,0.00005517967,0.00005539275,0.000001904469,0.00001787695,0.00001625075,0.07171378,0.005625166,0.9215873,0.0003436348,0.000180239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2910576,0.0006688622,0.7015249,0.002859126,0.00003982623,0.0003506699,0.000001207243,0.0001538772,0.003344014],"genre_scores_gemma":[0.9348348,0.00008729495,0.0646001,0.000154133,0.00002679275,0.00002157678,5.566546e-7,0.00001657117,0.000258147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6437773,"threshold_uncertainty_score":0.5367891,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005308014,0.0002327653,0.0003875842,0.0001885279,0.0005488052,0.0003119665,0.001013323,0.00007163449,0.0001099417],"category_scores_gemma":[0.01489672,0.0001453325,0.0002025435,0.0006806417,0.0002858164,0.0001770606,0.0001572034,0.0003874722,0.0001914912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001303429,"about_ca_system_score_gemma":0.0002945053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005423887,"about_ca_topic_score_gemma":0.0003660504,"domain_scores_codex":[0.9971383,0.0001212309,0.0006621759,0.0005105704,0.0006721742,0.0008956105],"domain_scores_gemma":[0.9913447,0.007026703,0.000324536,0.0009388737,0.0002878807,0.00007729918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008720233,0.004734426,0.006790116,0.0005856683,0.001321056,0.00002723488,0.02509026,0.05509478,0.01232389,0.6666517,0.004307596,0.2222012],"study_design_scores_gemma":[0.0005540203,0.0001448976,0.0002115195,0.00005606969,0.00004960693,0.00001620852,0.0002008871,0.6889595,0.003436892,0.3048906,0.001261482,0.0002182676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1946422,0.0003772154,0.8027242,0.001173415,0.0001927824,0.0006112563,0.0000162831,0.00006799048,0.0001945797],"genre_scores_gemma":[0.8471258,0.00001203135,0.1519149,0.00006337061,0.0002095029,0.0001188073,0.000001785353,0.00002883541,0.0005249691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6524835,"threshold_uncertainty_score":0.9934012,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000669705,0.0002163353,0.0002706109,0.0001891423,0.000107154,0.0001092481,0.001092216,0.0000721281,0.0002549184],"category_scores_gemma":[0.0002076545,0.0001891237,0.00007050615,0.0007989111,0.00009061698,0.0004458028,0.0001715096,0.0004841807,0.000164071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002114775,"about_ca_system_score_gemma":0.0001329786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009573864,"about_ca_topic_score_gemma":0.00003478496,"domain_scores_codex":[0.9977307,0.0001040425,0.0003441527,0.0004361897,0.0003992592,0.0009856791],"domain_scores_gemma":[0.9984144,0.0006500158,0.00007228541,0.0007572665,0.00003295157,0.00007308131],"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.00004655103,0.0002450767,0.0002028507,0.0001056829,0.00006063501,0.00005143866,0.006356997,0.003844738,0.001075581,0.9103052,0.00006373626,0.07764151],"study_design_scores_gemma":[0.0004467455,0.0001898421,0.00006651384,0.00007067333,0.000004473623,0.00005531737,0.00008099389,0.1687256,0.004792258,0.8243521,0.0008722927,0.0003431311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2125733,0.0003963319,0.7740168,0.0005030458,0.00005129442,0.0008725244,0.000005969462,0.0003378153,0.01124294],"genre_scores_gemma":[0.9397323,0.00007932563,0.05924383,0.00006997525,0.00003959266,0.00007594722,0.000004329561,0.00003246962,0.0007222492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.727159,"threshold_uncertainty_score":0.7712239,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001305491,0.000430819,0.0005135624,0.0004890896,0.0002393318,0.0002376759,0.003856727,0.0001643803,0.00005261711],"category_scores_gemma":[0.002397335,0.0003583458,0.0002056922,0.001539997,0.0002187736,0.0008552513,0.0009102571,0.000501808,0.00002819243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002624838,"about_ca_system_score_gemma":0.0002404966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006953282,"about_ca_topic_score_gemma":0.0002189158,"domain_scores_codex":[0.9961733,0.000113424,0.0007322967,0.0007429824,0.0007187267,0.001519306],"domain_scores_gemma":[0.9954084,0.00135414,0.0002859261,0.002642359,0.0001604524,0.0001487737],"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.0001071098,0.0002267784,0.0002434914,0.0002622521,0.00005424452,0.00001133202,0.001036228,0.0001628041,0.0009530737,0.9818739,0.0002699095,0.01479891],"study_design_scores_gemma":[0.001614011,0.0003941984,0.00003900476,0.0001083791,0.00001589093,0.00005830261,0.000133325,0.09852235,0.006667094,0.8909359,0.001052503,0.0004590595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03136025,0.0004393611,0.9643711,0.001068996,0.00009532827,0.001298046,0.00001737676,0.0002641832,0.001085348],"genre_scores_gemma":[0.4182418,0.0002228813,0.5790252,0.0001142623,0.0001156456,0.0006747631,0.000029024,0.000109005,0.001467404],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3868815,"threshold_uncertainty_score":0.9998869,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001641637,0.0001747201,0.0002497526,0.00009665695,0.00009689821,0.00007898638,0.001276785,0.00004361198,0.00004437071],"category_scores_gemma":[0.001131449,0.0001132489,0.0000763459,0.0007928454,0.000229632,0.0002855293,0.0002599995,0.0005040545,0.00004510358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000135224,"about_ca_system_score_gemma":0.00008190373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005188217,"about_ca_topic_score_gemma":0.00002739192,"domain_scores_codex":[0.9978693,0.0002322315,0.0004553606,0.0003225304,0.0004224432,0.0006981333],"domain_scores_gemma":[0.9963723,0.002228395,0.0001846873,0.001068064,0.00009944857,0.00004705838],"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.000002860262,0.0001212095,0.000178963,0.00005674978,0.00001408349,4.045881e-7,0.001781095,0.001313325,0.007403216,0.9874629,0.000005531761,0.001659602],"study_design_scores_gemma":[0.0002010192,0.000101959,0.00006945982,0.00005791095,0.000001560953,0.0000017798,0.00006307955,0.2692403,0.01503592,0.7151288,0.000001685588,0.00009650505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6243078,0.00005418511,0.3730654,0.0007511979,0.00001785128,0.0008165954,0.000001063921,0.00006311529,0.0009228604],"genre_scores_gemma":[0.9829362,0.000004537199,0.01681917,0.000042952,0.000007548917,0.0001342316,7.566504e-7,0.00001697931,0.00003760857],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3586285,"threshold_uncertainty_score":0.4618157,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007776503,0.0002512382,0.0004354663,0.0003734904,0.00008261632,0.00004302978,0.0002232585,0.0001368296,0.00006434367],"category_scores_gemma":[0.0007076148,0.000236712,0.00007477115,0.0006259856,0.000180919,0.0002349769,0.0001055761,0.000299869,0.000004633987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002265878,"about_ca_system_score_gemma":0.0001079105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003673532,"about_ca_topic_score_gemma":0.0001781595,"domain_scores_codex":[0.9977801,0.00009158057,0.0007232841,0.0003483544,0.0005217366,0.0005349687],"domain_scores_gemma":[0.9979644,0.001186695,0.0003441197,0.0003466754,0.0001042799,0.00005379895],"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.0001256813,0.002800671,0.00268187,0.003925907,0.0001665648,0.00003447687,0.003289733,0.008607698,0.002990663,0.8738719,0.0001759961,0.1013289],"study_design_scores_gemma":[0.00074097,0.0001040394,0.0001561893,0.0001337872,0.00003505218,0.0000447388,0.0001977962,0.3778201,0.007255569,0.6130971,0.00010575,0.0003089105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03728868,0.0005965327,0.9590769,0.000154735,0.00003794875,0.0007015176,0.00002174807,0.00009967337,0.002022302],"genre_scores_gemma":[0.2621633,0.0001620531,0.736911,0.000005329373,0.00007931804,0.00008288827,0.00002856464,0.00006812979,0.0004993731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3692124,"threshold_uncertainty_score":0.9652834,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004496407,0.0001534894,0.0002739864,0.00014151,0.00004076988,0.00005473248,0.000747912,0.00004044954,0.00001987911],"category_scores_gemma":[0.0002195751,0.0001320322,0.00008582798,0.0003637093,0.00003817715,0.000187383,0.00007714575,0.0001967904,0.0000237391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008476325,"about_ca_system_score_gemma":0.00004361148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000398333,"about_ca_topic_score_gemma":0.00001475673,"domain_scores_codex":[0.9987289,0.00004497703,0.0003902439,0.0002316331,0.0002284608,0.0003757573],"domain_scores_gemma":[0.9987445,0.0003861898,0.0002389921,0.0005591199,0.00003411312,0.00003712003],"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.000006284936,0.0001767351,0.00003239506,0.00003268901,0.00001135272,0.000003859567,0.001571026,0.0002473,0.003912557,0.9849721,0.00005963787,0.008974058],"study_design_scores_gemma":[0.000480254,0.0004656305,0.0003934715,0.0003796476,0.000009078338,0.00001487727,0.0001054534,0.11859,0.02576015,0.8535087,0.00005825836,0.0002345767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3801776,0.0002295109,0.6155555,0.00169418,0.00006487701,0.0002636362,0.000005340984,0.000142727,0.001866607],"genre_scores_gemma":[0.9744403,0.00001836016,0.0252128,0.0002449451,0.00002064412,0.000008773864,0.000002166392,0.000009234668,0.00004278849],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5942627,"threshold_uncertainty_score":0.5384116,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002029767,0.0004181799,0.0006188452,0.0003388963,0.000181113,0.0001462976,0.0006649776,0.0002632091,0.0003418813],"category_scores_gemma":[0.00432292,0.0003874116,0.0001345821,0.0004992926,0.0001100185,0.0004732354,0.000128171,0.0008856342,0.00000926472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000232661,"about_ca_system_score_gemma":0.0002438766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001154725,"about_ca_topic_score_gemma":0.0002049457,"domain_scores_codex":[0.9968737,0.0001637205,0.0009768999,0.0005859053,0.0003760119,0.001023741],"domain_scores_gemma":[0.9958582,0.002293962,0.000419773,0.001011525,0.0002484245,0.0001681021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007180765,0.003221762,0.0001339418,0.004195048,0.0004720461,0.0000331581,0.01323327,0.2401834,0.2545584,0.4511894,0.0003780951,0.03168346],"study_design_scores_gemma":[0.0008931347,0.0004161515,0.000001370155,0.00006694519,0.00003655408,0.00002837127,0.0002676429,0.805956,0.009378995,0.1825414,0.00004830537,0.0003651031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009035639,0.00003550245,0.9882089,0.0003533663,0.0001429036,0.001777654,0.00002826524,0.000233876,0.0001839311],"genre_scores_gemma":[0.04802754,0.00002874483,0.9508631,0.00005397472,0.0001317321,0.0004055525,0.0001123258,0.0001695066,0.0002074923],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5657727,"threshold_uncertainty_score":0.9998578,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001609037,0.0001336093,0.0002113978,0.00007950772,0.00002245162,0.00002158551,0.000145141,0.00004917893,0.0000615501],"category_scores_gemma":[0.00006395206,0.0001140343,0.00005886157,0.0003160217,0.00004310046,0.00009498488,0.00002567381,0.0001482206,0.0000125554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001921953,"about_ca_system_score_gemma":0.00002086637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003152998,"about_ca_topic_score_gemma":0.0002042656,"domain_scores_codex":[0.999195,0.00001896296,0.0002289037,0.0001158214,0.000153501,0.0002877908],"domain_scores_gemma":[0.9995954,0.00007291677,0.00003399107,0.0002093404,0.00003287361,0.00005549117],"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.00002017256,0.00006459641,0.004729141,0.0001938182,0.0001685726,0.000005887006,0.002518329,0.9406304,0.001342845,0.04625786,0.0002311301,0.003837248],"study_design_scores_gemma":[0.0003082321,0.00003580305,0.0005149101,0.00001465615,0.00003055015,0.000005028006,0.0001281843,0.878298,0.001148149,0.1192148,0.0001037098,0.00019798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6081719,0.0004799213,0.3893405,0.00006870741,0.00008652126,0.0001618738,0.000004629628,0.0001824772,0.001503441],"genre_scores_gemma":[0.9923766,0.00003393049,0.007497764,0.000007714209,0.00002549061,0.000004069339,0.00002181041,0.00001827005,0.00001438491],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3842046,"threshold_uncertainty_score":0.4650183,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007869588,0.0001484373,0.0002727674,0.000213171,0.00005293026,0.00004993244,0.001046229,0.00004981561,0.000007348101],"category_scores_gemma":[0.0003932813,0.0001370571,0.00006924337,0.0007286947,0.00005201427,0.0003538,0.0001884484,0.000356069,0.000005884503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001320475,"about_ca_system_score_gemma":0.0000950258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004433512,"about_ca_topic_score_gemma":0.000009438948,"domain_scores_codex":[0.9982995,0.00005488376,0.0003855179,0.0002662504,0.0003512983,0.000642588],"domain_scores_gemma":[0.9986716,0.0004799583,0.0001439892,0.0006118618,0.00003998786,0.00005258539],"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.000009094925,0.0000502706,0.0001024098,0.00004832455,0.00001032309,0.000006724631,0.001834374,0.0008073603,0.007002227,0.9762599,0.000002739873,0.01386628],"study_design_scores_gemma":[0.0003190651,0.0002871891,0.0001488077,0.0001173564,0.000003318048,0.00001308039,0.00006696978,0.05026238,0.03938903,0.9091608,0.00005332409,0.0001786858],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2978353,0.000213761,0.7002559,0.0003529458,0.00002188045,0.0002240936,0.000001138299,0.00007664828,0.001018345],"genre_scores_gemma":[0.9285905,0.00003055149,0.07127874,0.00002737388,0.00001701598,0.000007978448,7.890734e-7,0.00000951923,0.00003752675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6307552,"threshold_uncertainty_score":0.5589024,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006001477,0.00033495,0.000455478,0.0001411855,0.000195252,0.00006155619,0.0003431492,0.0001373891,0.00004763464],"category_scores_gemma":[0.0008181497,0.0002671048,0.00009502616,0.0002130699,0.0001216366,0.0001137205,0.00008657601,0.0005444686,0.000005698021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001307815,"about_ca_system_score_gemma":0.00002979024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002713238,"about_ca_topic_score_gemma":0.00001694667,"domain_scores_codex":[0.9980992,0.00005441567,0.0004753659,0.0003693958,0.0003102154,0.0006914024],"domain_scores_gemma":[0.9980395,0.001129344,0.0001873572,0.0005387358,0.00002377936,0.00008130912],"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.00003782144,0.0001052428,0.00006424124,0.0001062084,0.00001836398,0.00000796138,0.002399388,0.0000106665,0.0001286309,0.9948586,0.000116088,0.002146784],"study_design_scores_gemma":[0.0004910477,0.0002636978,0.0003108804,0.000201549,0.00002592669,0.00002720257,0.00007441797,0.0008576817,0.0009152187,0.9962792,0.0002289189,0.0003242033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9768452,0.0004021579,0.01429641,0.0006576928,0.00008057967,0.0004421715,0.00000588939,0.0001405888,0.007129291],"genre_scores_gemma":[0.9876025,0.00008542921,0.01154176,0.0003299294,0.00005567642,0.0000152313,0.00000203551,0.00004155488,0.0003259145],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01075725,"threshold_uncertainty_score":0.9999781,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.01194793,0.005249557,0.002238098,0.002953823,0.007714397,0.009823594,0.0119586,0.01193964,0.6968805],"category_scores_gemma":[0.00849449,0.01024497,0.008901021,0.004690216,0.007508198,0.007498852,0.01169395,0.009449188,0.00509263],"about_ca_system_candidate":true,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001673148,"about_ca_system_score_gemma":0.00949461,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007309895,"about_ca_topic_score_gemma":0.01044379,"domain_scores_codex":[0.9564379,0.002423947,0.009669442,0.008252498,0.0109098,0.0123064],"domain_scores_gemma":[0.9607447,0.00787473,0.01234763,0.0126925,0.0009692356,0.005371229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00812528,0.00149451,0.00002295736,0.007263132,0.007506366,0.006773542,0.006227505,0.003060342,0.006779557,0.6102888,0.3396625,0.002795526],"study_design_scores_gemma":[0.01048419,0.005028694,0.0000889322,0.006304532,0.007763216,0.008606194,0.005157973,0.1696583,0.7691504,0.000784101,0.009343827,0.007629629],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.4232108,0.004456314,0.004647907,0.001518271,0.0080724,0.0002806913,0.002046247,0.001148861,0.5546185],"genre_scores_gemma":[0.9391739,0.008036628,0.02054315,0.00364383,0.007320089,0.007230956,0.00616023,0.005848662,0.002042569],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7623709,"threshold_uncertainty_score":0.9998574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325706,0.000169511,0.0002544508,0.000224503,0.00004665503,0.0000301651,0.0001276845,0.00003951279,0.00006705214],"category_scores_gemma":[0.0001628892,0.0001421751,0.00004235038,0.0009319112,0.00006387661,0.0001159331,0.00003502319,0.0001407515,0.00003842835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001102722,"about_ca_system_score_gemma":0.00004090644,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002533362,"about_ca_topic_score_gemma":0.004153449,"domain_scores_codex":[0.9986682,0.00002764058,0.0004245526,0.0002159246,0.0002590375,0.0004046224],"domain_scores_gemma":[0.9995214,0.00009407395,0.0001372414,0.0001694352,0.00006903618,0.000008767161],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006206282,0.000534742,0.005488537,0.0005450064,0.00005590022,0.000005559646,0.001479855,0.4372682,0.00003073,0.552617,0.00003496506,0.001877417],"study_design_scores_gemma":[0.001976781,0.00009857923,0.009681018,0.0006205432,0.00006969166,0.000001374227,0.001088108,0.8444345,0.0003077339,0.1409888,0.0002311955,0.0005016592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8848009,0.0001584157,0.09864385,0.0004116718,0.00009398154,0.0008557718,0.000001395448,0.00004371703,0.01499034],"genre_scores_gemma":[0.9963421,0.000007497651,0.003412054,0.0000883758,0.00003583704,0.00003209175,0.00001228799,0.00001684699,0.0000528819],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4116282,"threshold_uncertainty_score":0.5797731,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004922566,0.000292589,0.0003536223,0.0001973504,0.0001563964,0.0002341529,0.001384731,0.000104251,0.00003310325],"category_scores_gemma":[0.000210848,0.0002803222,0.0001391968,0.0009063028,0.0001139389,0.0004049271,0.0003758777,0.0004397969,0.0000897189],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003556627,"about_ca_system_score_gemma":0.0001789457,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003472869,"about_ca_topic_score_gemma":0.0001241124,"domain_scores_codex":[0.9975489,0.00004170811,0.0004831722,0.0004957111,0.0004142831,0.001016217],"domain_scores_gemma":[0.9983986,0.000323019,0.0001373723,0.0009925828,0.00004304925,0.0001053944],"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.00001148211,0.000980127,0.00006305134,0.0001769925,0.00006340277,0.00003926221,0.00589386,0.02055617,0.001997988,0.9082485,0.00008233629,0.06188687],"study_design_scores_gemma":[0.0009706678,0.0002254017,0.00002471761,0.0001861693,0.00001165421,0.00007522058,0.00007072266,0.2386233,0.01026218,0.7460412,0.00299586,0.0005129931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02108779,0.0004504562,0.9751391,0.0009604859,0.000153822,0.0003551221,0.000003430797,0.0002434047,0.001606369],"genre_scores_gemma":[0.6023961,0.00003860929,0.3969299,0.0002163294,0.00009356814,0.00005140201,0.000007583696,0.00003691118,0.0002296202],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5813083,"threshold_uncertainty_score":0.9999649,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002772939,0.0001781737,0.0002437313,0.00007238842,0.00005331453,0.00004480871,0.0001334988,0.00007610681,0.00009520551],"category_scores_gemma":[0.00004354593,0.0001597537,0.00003717624,0.0001846445,0.0001022435,0.00008499934,0.00002744543,0.0001825511,0.00003150221],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006740126,"about_ca_system_score_gemma":0.00003579606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001897757,"about_ca_topic_score_gemma":0.0002624739,"domain_scores_codex":[0.9989985,0.00002532914,0.0002705792,0.0001448882,0.0001138585,0.0004468377],"domain_scores_gemma":[0.9994716,0.0001797099,0.00003912476,0.0002286709,0.00001185381,0.00006906094],"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.00002361362,0.00002733464,0.002293254,0.0004563313,0.0001759022,0.00001132709,0.006719261,0.0001386471,0.008626729,0.9721053,0.0004784585,0.008943835],"study_design_scores_gemma":[0.0012678,0.0002292142,0.0001682015,0.0008375981,0.00007771217,0.0001558753,0.0009577872,0.05821368,0.04013427,0.8929579,0.004015057,0.0009849414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8583342,0.002465869,0.1156494,0.000072527,0.0003029031,0.0003421615,0.00000773686,0.0003380678,0.02248714],"genre_scores_gemma":[0.9965127,0.0001098848,0.003120295,0.00001290657,0.0001091374,0.000007616275,0.000002312165,0.00003606304,0.00008905123],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1381786,"threshold_uncertainty_score":0.6514565,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002497948,0.000219797,0.0002395285,0.0001346731,0.00009806066,0.0001078028,0.0001597188,0.0001210126,0.0001903717],"category_scores_gemma":[0.000124447,0.0001946101,0.00002725828,0.0003306857,0.00006560369,0.0001604795,0.00003209804,0.0004999666,0.00009095403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003635241,"about_ca_system_score_gemma":0.00007147734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004364384,"about_ca_topic_score_gemma":0.00006474848,"domain_scores_codex":[0.9989332,0.00001406697,0.0002779133,0.0001906705,0.0001521426,0.0004320386],"domain_scores_gemma":[0.9993873,0.0001634453,0.00002574737,0.0002943176,0.00004538773,0.00008377476],"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.00001001738,0.00006851373,0.0001096913,0.0001051566,0.00008746948,0.000005009403,0.001330683,0.9672455,0.02304954,0.006413552,0.00001099716,0.001563872],"study_design_scores_gemma":[0.0003628612,0.00005968947,0.0000112537,0.00006007702,0.00002709183,0.00003469245,0.00006000701,0.9909562,0.006766124,0.001354887,0.00003382403,0.0002732484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.795002,0.000223314,0.2026486,0.0001316684,0.00006449506,0.0002551805,0.000009177455,0.0003798423,0.001285707],"genre_scores_gemma":[0.5500898,0.00003310438,0.4493116,0.00002333741,0.00007084284,0.00003078145,0.00003345259,0.0000751065,0.0003320272],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.246663,"threshold_uncertainty_score":0.7935967,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006077822,0.0001716785,0.0002179901,0.00009883403,0.0001828124,0.00005834732,0.001005204,0.00004730743,0.0000476079],"category_scores_gemma":[0.0002138188,0.0001093894,0.00006947148,0.000854718,0.0002915874,0.0002669544,0.000247618,0.0002859029,0.0000502223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000158617,"about_ca_system_score_gemma":0.00003584929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000428965,"about_ca_topic_score_gemma":0.0001237703,"domain_scores_codex":[0.9981577,0.0001117088,0.0003301583,0.0002747096,0.0005083968,0.0006173328],"domain_scores_gemma":[0.9978254,0.001043345,0.0001997387,0.000795802,0.00008801432,0.0000476996],"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.00002458884,0.00009252124,0.000530096,0.00005055778,0.00003429237,0.000004717474,0.002058045,0.0002726678,0.0004684475,0.9897904,0.00003264446,0.006641023],"study_design_scores_gemma":[0.0007550966,0.0002344064,0.0001577955,0.000101472,0.00001029435,0.00007455184,0.0001344464,0.1394064,0.009218954,0.8494576,0.0001841436,0.0002648401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5537415,0.001083717,0.4374621,0.001066047,0.0000570802,0.0007913574,0.000004417471,0.0001009166,0.005692882],"genre_scores_gemma":[0.9828316,0.0002023993,0.01577458,0.00001355758,0.000008692584,0.00004637997,0.000001140825,0.00002015305,0.001101485],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4290901,"threshold_uncertainty_score":0.4460772,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003995363,0.000095239,0.0001234639,0.0001073813,0.0000482067,0.000033387,0.000469703,0.0000301546,0.00001385012],"category_scores_gemma":[0.0001819536,0.00006472163,0.00004897436,0.0004848969,0.0000216911,0.00008503316,0.00003267948,0.0001415003,0.000009916786],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003245012,"about_ca_system_score_gemma":0.00005990605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001580632,"about_ca_topic_score_gemma":0.000007053615,"domain_scores_codex":[0.9991102,0.00004050343,0.0002342672,0.0001461601,0.0002465186,0.000222322],"domain_scores_gemma":[0.9988855,0.0006238897,0.00009972216,0.0003459466,0.00002566044,0.00001925567],"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.000002853926,0.00006392516,0.00000884478,0.000006256935,0.000005117423,5.702929e-7,0.0003271177,0.002715728,0.0005529694,0.9912111,0.00005916675,0.005046402],"study_design_scores_gemma":[0.00012116,0.0002162672,0.0003656095,0.00002997291,0.000002674208,0.000005042512,0.000006702184,0.07427834,0.009724703,0.9151214,0.00004849056,0.00007968127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2409547,0.0001654438,0.7532551,0.002592844,0.00006192805,0.0002281076,0.000001492123,0.00004299113,0.002697437],"genre_scores_gemma":[0.9863641,0.00001576522,0.01331975,0.0002364511,0.00001438351,0.000005002006,0.000003146921,0.0000033043,0.0000380874],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7454095,"threshold_uncertainty_score":0.2639272,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003867027,0.0001432218,0.0001780748,0.0000787229,0.0001400762,0.00008632015,0.0005061164,0.00004569595,0.000004829815],"category_scores_gemma":[0.0001074703,0.0000877485,0.00002776078,0.000431171,0.0002006546,0.0002132473,0.000120777,0.0002349717,0.000001707969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004649582,"about_ca_system_score_gemma":0.00008090879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001596189,"about_ca_topic_score_gemma":0.0002686016,"domain_scores_codex":[0.9986924,0.0000749985,0.0002706314,0.0002208035,0.0003212364,0.0004199449],"domain_scores_gemma":[0.9986961,0.0005736939,0.0001361045,0.000486044,0.00008155422,0.00002651952],"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.00002979207,0.0000307535,0.0005317171,0.00004878257,0.00001824596,0.000001938096,0.0003403715,0.000407723,0.008373939,0.9879464,0.00001160515,0.002258717],"study_design_scores_gemma":[0.000506092,0.0002567176,0.0002680754,0.00003933836,0.000006161461,0.0000176735,0.00002729033,0.02941188,0.02646428,0.9427167,0.0001299185,0.0001558623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6896909,0.001288959,0.3074588,0.0004540038,0.00004114107,0.0005420452,0.000005787092,0.00005383515,0.0004644342],"genre_scores_gemma":[0.9687346,0.0000618019,0.03103894,0.000007778643,0.00001574373,0.00000963283,0.000002860726,0.00001309237,0.0001155278],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2790437,"threshold_uncertainty_score":0.357828,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006931892,0.00023295,0.0003806124,0.0003628707,0.000103407,0.00005377911,0.001023143,0.000102258,0.0003064112],"category_scores_gemma":[0.0001475006,0.0002153085,0.0001243486,0.002143481,0.0001643956,0.0003519306,0.0001236325,0.0003682009,0.00009927795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001595209,"about_ca_system_score_gemma":0.0001682211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000411484,"about_ca_topic_score_gemma":0.00008668644,"domain_scores_codex":[0.9976559,0.0001484378,0.0005602034,0.0004078887,0.0004761336,0.0007513844],"domain_scores_gemma":[0.9983462,0.000498331,0.0001600437,0.0008518472,0.00007422204,0.00006932059],"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.0002008641,0.0007540322,0.0006074909,0.0003389462,0.0001520976,0.00001953159,0.003317052,0.006103972,0.007474966,0.9669043,0.0001788317,0.0139479],"study_design_scores_gemma":[0.0007532846,0.0003453873,0.0001565499,0.0001201894,0.00001099907,0.00002894792,0.00005082929,0.1215919,0.03602236,0.8402762,0.0003454205,0.0002978567],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6188143,0.000829842,0.3665279,0.0004873884,0.00009105289,0.001013591,0.000004879295,0.0002694985,0.01196153],"genre_scores_gemma":[0.9781525,0.0003668886,0.02042505,0.00003158422,0.00001250683,0.00004864548,0.000004470872,0.00002939206,0.0009290202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3593381,"threshold_uncertainty_score":0.8780024,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00145046,0.000531439,0.0008821267,0.0002627338,0.0001471439,0.00005634286,0.0006541464,0.0002546813,0.0001964022],"category_scores_gemma":[0.006962165,0.0003870622,0.0002064558,0.0008546629,0.0001457283,0.0001954113,0.00009903892,0.0008358327,0.00003627561],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004449153,"about_ca_system_score_gemma":0.0002078913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002488197,"about_ca_topic_score_gemma":0.0001130456,"domain_scores_codex":[0.9963694,0.0002132218,0.001310167,0.0004588265,0.0007861514,0.0008622513],"domain_scores_gemma":[0.9920227,0.005598764,0.0009384125,0.001187367,0.0001796304,0.00007314205],"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.0002572033,0.001093782,0.00002879406,0.000364557,0.0001860565,0.00002474919,0.003165151,0.0001406107,0.005061738,0.9885995,0.0001615604,0.0009162655],"study_design_scores_gemma":[0.001509717,0.0004674833,0.00007787156,0.0004521109,0.00009279656,0.00003778239,0.0005880558,0.002828229,0.03426576,0.9590966,0.0001575119,0.0004261515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9546461,0.0001855175,0.03557668,0.000895647,0.0002550976,0.003327989,0.00004056249,0.0002796687,0.004792723],"genre_scores_gemma":[0.9901553,0.000060455,0.009031837,0.00003646229,0.0001182892,0.0001972533,0.00003072092,0.0001198788,0.0002498307],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.03550916,"threshold_uncertainty_score":0.9998581,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00244844,0.0009088928,0.00143396,0.0004793771,0.0002273496,0.0001834939,0.001033563,0.0009503671,0.00005912905],"category_scores_gemma":[0.002911218,0.0007851781,0.0003360013,0.000384724,0.0003929859,0.0001383853,0.001667254,0.002357966,0.000005662631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003120847,"about_ca_system_score_gemma":0.0003842252,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003367913,"about_ca_topic_score_gemma":0.0002252467,"domain_scores_codex":[0.9955368,0.000236516,0.001251309,0.0009518829,0.0007684642,0.001255031],"domain_scores_gemma":[0.9953821,0.001669014,0.0006998039,0.001833458,0.0001878518,0.0002277796],"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.00004945098,0.0001726287,0.0002705932,0.002070544,0.0002353097,0.00001513484,0.003619038,0.00009357521,0.00003615074,0.9913357,0.0008636087,0.001238302],"study_design_scores_gemma":[0.0006829788,0.0001425964,0.00007727562,0.0007258,0.0002261102,0.00005624785,0.000230244,0.002949626,0.0005526341,0.9929947,0.0004905273,0.0008712904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9337648,0.01022305,0.03094152,0.0006523825,0.0009851615,0.002808297,0.000187626,0.0005418576,0.01989536],"genre_scores_gemma":[0.9195652,0.0009895313,0.0778828,0.00007990088,0.0002786289,0.0001798358,0.00006767814,0.0002351628,0.0007212685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04694129,"threshold_uncertainty_score":0.9999436,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008122089,0.0002930831,0.000341792,0.0002796683,0.0001413721,0.0001389217,0.001502809,0.0001081933,0.0003808184],"category_scores_gemma":[0.000756812,0.0002568357,0.000143192,0.001024742,0.0002583809,0.0002784024,0.0001649094,0.0006917249,0.0004486212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001753343,"about_ca_system_score_gemma":0.000113987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003690362,"about_ca_topic_score_gemma":0.00001774012,"domain_scores_codex":[0.9969338,0.0001558289,0.0004481136,0.0005790756,0.000622527,0.001260611],"domain_scores_gemma":[0.9966391,0.001879528,0.00005084251,0.001239239,0.00004478159,0.0001465641],"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.00001934372,0.0001730545,0.0000112508,0.00003648529,0.00001185002,0.00004582394,0.0003867174,0.0002503543,0.000301325,0.9758074,0.00002912661,0.02292727],"study_design_scores_gemma":[0.0003442706,0.000284441,0.00002879474,0.00009210651,0.00000458325,0.00008592627,0.00001256313,0.03611907,0.002562199,0.9596899,0.000476978,0.0002991715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3356879,0.0008827506,0.6279186,0.00246596,0.0001672305,0.0008000831,0.000007717681,0.0004186603,0.03165112],"genre_scores_gemma":[0.9473239,0.00009289334,0.05156974,0.00018011,0.00003023513,0.00005305421,0.000002031831,0.00004114632,0.0007068719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.611636,"threshold_uncertainty_score":0.9999884,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00159369,0.0003383395,0.0007509411,0.0002572708,0.00008006513,0.00001950032,0.0005467663,0.0001925789,0.000074178],"category_scores_gemma":[0.002198841,0.0002644613,0.0002284984,0.0003897643,0.0002369588,0.000128464,0.0002125773,0.0004611904,0.000006024371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001307816,"about_ca_system_score_gemma":0.0001561185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005784262,"about_ca_topic_score_gemma":0.0001596454,"domain_scores_codex":[0.9974617,0.0001024299,0.0009102582,0.0002863271,0.0005536586,0.0006856067],"domain_scores_gemma":[0.9975196,0.001103952,0.0004186659,0.0006966635,0.0001350736,0.0001260548],"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.0001848766,0.0001723399,0.0005819798,0.000305889,0.0001045176,0.00000483838,0.006095312,0.0001474073,0.0002061182,0.9914044,0.00008084599,0.0007114487],"study_design_scores_gemma":[0.002357355,0.0002302683,0.00002282025,0.0001428522,0.00007625845,0.00002357009,0.0004160047,0.01068094,0.006484752,0.979116,0.0001412845,0.0003079396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8816075,0.0003345665,0.108973,0.0001083146,0.0002636373,0.0007385486,0.00002053193,0.0001291761,0.00782478],"genre_scores_gemma":[0.9600451,0.0000466402,0.03957833,0.00002434064,0.00007909344,0.00002342227,0.000008189016,0.00006559001,0.0001293057],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0784376,"threshold_uncertainty_score":0.9999807,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00170835,0.0005384321,0.0009650766,0.0002134476,0.001097992,0.0007077898,0.002279114,0.0002367158,0.00003957706],"category_scores_gemma":[0.007932247,0.0005017277,0.0002161826,0.0001946057,0.000170971,0.0008432094,0.0005914068,0.0005909441,0.00001150526],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00072278,"about_ca_system_score_gemma":0.0002112876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004342372,"about_ca_topic_score_gemma":0.0003692035,"domain_scores_codex":[0.9966447,0.0001061103,0.0009475715,0.0006479892,0.0004471097,0.001206459],"domain_scores_gemma":[0.9937556,0.002540813,0.0009821473,0.002435277,0.0001222245,0.0001639088],"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.00004667866,0.0006455863,0.00004992203,0.0003004033,0.00007121902,0.000004748365,0.0009516953,0.0001310294,0.0008694816,0.9954219,0.00002498251,0.001482366],"study_design_scores_gemma":[0.001428578,0.0005067665,0.00001443697,0.0005094029,0.000110003,0.00002143998,0.0003053859,0.03358709,0.006430713,0.9563199,0.0001731873,0.0005931235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3986644,0.00006384346,0.5900547,0.0003541045,0.0008773998,0.004408714,0.00005254476,0.0002715704,0.005252725],"genre_scores_gemma":[0.7663695,0.00002266418,0.2326473,0.00002852897,0.0002437082,0.0003319872,0.00001151909,0.0001849249,0.0001598872],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3677051,"threshold_uncertainty_score":0.9997435,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000703792,0.0001734499,0.0002446026,0.0002156846,0.00005531445,0.00006129525,0.0004922371,0.00009589661,0.00003111037],"category_scores_gemma":[0.0004198324,0.0001627037,0.00007168094,0.0005482803,0.00002761655,0.0002279778,0.00009432915,0.0002316674,0.00003569168],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001030449,"about_ca_system_score_gemma":0.0001778511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004457368,"about_ca_topic_score_gemma":0.00002936993,"domain_scores_codex":[0.9985225,0.00004772363,0.0004163728,0.0003251751,0.0001963267,0.0004918689],"domain_scores_gemma":[0.9986783,0.0008002631,0.0001048768,0.0003208,0.00005112652,0.00004464352],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004315944,0.0004264345,0.0003119798,0.000214696,0.00005413474,0.00001323121,0.009714058,0.0272376,0.001409258,0.9461946,0.00007102393,0.01430975],"study_design_scores_gemma":[0.0005279754,0.0001556284,0.0002080974,0.00005806851,0.000007119485,0.000009517691,0.000008518457,0.6998883,0.002456514,0.2962148,0.0002642494,0.0002011779],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03495317,0.0002288968,0.9630798,0.000362097,0.00007950501,0.0004238446,0.000003847918,0.0000635062,0.0008053262],"genre_scores_gemma":[0.7523588,0.00001095819,0.2471997,0.0001651902,0.00004808191,0.0000558386,0.00001974346,0.0000161305,0.0001255777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7174056,"threshold_uncertainty_score":0.6634864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}